Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-23T02:24:10.687Z Has data issue: false hasContentIssue false
  • English
  • Français

Isomorphism classes of authentication codes

Published online by Cambridge University Press:  17 April 2009

Rongquan Feng ,
Jin Ho Kwak  and
E. Keith Lloyd
Rongquan Feng
Affiliation:
LMAM, School of mathematical Science, Peking University, Beijing 100871, People's Republic China, and State Key Laboratory of Information Security, Graduate School of USTC, Beijing 100039People's Republic of China e-mail: [email protected]
Jin Ho Kwak
Affiliation:
Department of Mathematics, Pohang University of Science and Technology, Pohang 790-784, Korea e-mail: [email protected]
E. Keith Lloyd
Affiliation:
Faculty of Mathematical Studies, University of Southampton, Southampton SO17 1BJ, United Kingdom e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 69 , Issue 2 , April 2004 , pp. 203 - 215
Copyright
Copyright © Australian Mathematical Society 2004

References

[1]Beth, T., Jungnickel, D. and Lenz, H., Design theory (Cambridge University Press, Cambridge, 1933).Google Scholar
[2]Feng, R. and Kwak, J.H., ‘Minimal authentication codes with perfect secrecy’, (Preprint).Google Scholar
[3]Feng, R. and Wan, Z., ‘A construction of cartesian authentication codes from vector space and dual authentication codes’ Northeast. Math. J. 13 (1997), 63–72.Google Scholar
[4]Godlewski, P. and Mitchell, C., ‘Key-minimal cryptosystems for unconditional secrecy’, J. Cryptology 3 (1990), 1–25.CrossRefGoogle Scholar
[5]Hall, M. Jr., Combinatorial theory, (2nd Edition) (John Wiley and Sons Inc., New York, 1986).Google Scholar
[6]Hanani, H., ‘On transversal designs’, in Theory of deisgns, finite geometry and coding theory, Math. centre Tracts 55 1974, pp. 42–52.Google Scholar
[7]Jimbo, M. and Fuji-Hara, R., ‘Optimal authentication systems and combinatorial designs’, IEEE Trans. Inform. Theory 36 (1990), 54–62.CrossRefGoogle Scholar
[8]König, D., ‘Über Graphen und ihre Anwendung anf Determinantentheorie und Mengenlehre’, Math. Ann. 77 (1916), 453–465.CrossRefGoogle Scholar
[9]Massey, J.L., ‘Cryptography – a selective survey’, in Digital Communications (North-Holland, Amstredam, 1986), pp. 3–21.Google Scholar
[10]Rees, R.S. and Stinson, D.R., ‘Combinatorial characterization of authentication codes II’, Des. Codes Cryptogr. 7 (1996), 239–259.CrossRefGoogle Scholar
[11]Shannon, C.E., ‘Communication theory of secrecy systems’, Bell System Technical Journal 28 (1949), 656–715.CrossRefGoogle Scholar
[12]Simmons, G.L., ‘Message authentication: a game on hypergraphs’, Congr. Numer. 45 (1984), 161–192.Google Scholar
[13]Simmons, G.L., ‘Authentication theroy/coding theory’, in Advances in Cryptology-Crypto'84, (Blakley, G.R. and Chaum, D., Editors), Lecture Notes in Computer Science 196 (Springer-Verlag, Berlin, 1985). pp. 411–431.Google Scholar
[14]Stinson, D.R., ‘Some constructions and bounds for authentication codes’, J. Cryptology 1 (1988), 37–51.Google Scholar
[15]Stinson, D.R., ‘The combinatorics of authentication and secrecy codes’, J. Cryptology 2 (1990), 23–49.CrossRefGoogle Scholar
[16]Stinson, D.R., ‘Combinatorial characterizations of authentication codes’, Des. Codes. Cryptogr. 2 (1992), 175–187.CrossRefGoogle Scholar