Abhinav Aggarwal. Electronics and Computer Engineering Department ..... enough to think they can change the world, are the ones who do. Apple Inc. AMAC ->.
The number of isomorphism classes of hyperelliptic curves over finite fields ... refer to a change of variables of the above form as an admissible change of.
“Königsberg bridge problem” [1] (see also [13, 2]), its growth in recent years has been explosive covering a large number of disciplines ranging from math-.
for the families (3) and (4), i.e., the twisted Edwards and Montgomery curves. ...... Furthermore, the Montgomery curve EM,A,B is birationally equivalent to the.
Oct 13, 2005 - Here we view ITM as a section of TâM â TM, which is a subbundle of TâM â. TTM, with ... [7] C.T.J. Dodson and M.S. Radivoiovici. Tangent ...
as specified in the digital signature stan- dard whenever a secure hash algorithm is required for federal applications. The. SHA and MD-family hash functions are.
isomorphism represents a whole class of algorithmic problems; for example, GI is ...... puter Science, volume 3404 of Lecture Notes in Computer Science, pages ...
persons trying to change messages or to impersonate the sender of these mes- sages. There are ... one where Alice and Bob trust each other, called A-codes;.
Jul 9, 2009 - â Department of Mathematics, University of British Columbia, Email: [email protected]. ... Given a block cipher f with UP security εup, construct a VIL-MAC C ...... This is the âhardâ case, where our balls-and-bins terminology ..
Anh Thu Phan HoEmail author; Bao An Mai Hoang; Wadih Sawaya; Patrick Bas ... channel model for authentication systems based on codes that are corrupted ...
Aug 20, 2014 - Journal on Information Security, Hindawi, 2014, pp.10.1186/1687-417X-2014-9. . HAL Id: hal-01056699 https://hal.archives-ouvertes.fr/hal- ...
Search. Help us improve the way we communicate with researchers. ... authentication using graphical codes: reliable performance analysis and channel optimization ...... Not logged in Google [Search Crawler] (3000811494) 66.249.64.52.
Jul 9, 2009 - H is a secure message authentication code (MAC) with birthday security, .... dictability to pseudorandomness [11,14]; (2) CBC-MAC [4,15]; (3) ...
Feb 7, 2007 - quadratic surfaces in PG(3,q). We give an overview of some of the proper- ties of the codes, providing proofs where the results are new.
Basic procedure of Authentication Center based Architecture is associated ... session, the developer tries to implement virtual session by background authentication. ... popularly used in Android platform to pass the values to other application.
Jan 5, 2014 - In practical, digital signature is computationally secure assuming that .... follows: each sender and receiver has their own Cartesian authentication code, respectively. It is used to generate part ...... Submit your manuscripts at.
unmanned book rental system in libraries. However, this system is .... popularly used in Android platform to pass the values to other application. However the ...
Oct 17, 2005 - [email protected] http://www.di.ens.fr/~mabdalla. 2 Electrical ... Blind signatures allow a signer to digitally sign a document without being ...
Dec 3, 2016 - codes were done on cyclic codes and cyclotomy [2], the codes we construct here are provably abelian but perhaps not cyclic. Their coordinate ...
AbstractâSecret sharing has been a subject of study for over. 20 years, and has had a number of real-world applications. There are several approaches to the ...
every linear code can be used to construct secret sharing schemes. But determining the ... China (e-mail:[email protected]; [email protected]). Communicated by ...
the basic definition and properties about linear codes and other special linear ... c. there is a unique vector 0 in V, called the zero vector, such ..... code, Parity check code, Hamming code, cyclic code, dual code and illustrate ...... http://arxi
authentication scheme that amortizes a single signature operation over multiple ... Additional Key Words and Phrases: digital signatures, multicast, Information ...
e-mail: rei/[email protected]. Abstract ... In a multi-receiver authentication system the sender broadcasts a single authen- ticated message such that all the ...
theorem (Lemma 4.1 in [4]) gives a characterisation of a minimal authentication code .... By Konig's Theorem [8], the bipartite graph G is A;-edge-colourable.
BULL. AUSTRAL. MATH. SOC.
VOL. 69 (2004)
94A60, 0 5 B 0 5 , 05A15
[203-215]
ISOMORPHISM CLASSES OF AUTHENTICATION CODES RONGQUAN FENG, JIN HO KWAK AND E. KEITH LLOYD
In this paper, we give several kinds of characterisations of isomorphic authentication codes by examining a correspondence between optimal authentication codes and some combinatorial designs. The isomorphism classes of some kinds of authentication codes are also enumerated. 1. INTRODUCTION
Let • M defined by s i-» f(s, e) is injective. For an authentication code (S,£,M;f), we say that the sets 5, £ and M are the set of source states, the set of encoding rules, and the set of messages, respectively, and the map / is the encoding map. If m = f(s,e) for s € S, e £ £ and m € M, then we say that the source state s is encoded into the message m using the encoding rule e, and that for convenience, the message m is valid under the encoding rule e. The cardinals \S\, \£\, \M\ are called the size parameters of the code. An authentication code with the size parameters |
