Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

New combinatorial bounds for authentication codes and key predistribution schemes

From MaRDI portal
Publication:1273509
Jump to:navigation, search

DOI10.1023/A:1008229625895zbMath0924.94029OpenAlexW1532682245MaRDI QIDQ1273509

Hajime Saido, Kaoru Kurosawa, Koji Okada

Publication date: 14 November 1999

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008229625895


zbMATH Keywords

lower boundsauthentication codeskey predistribution schemecheating probability


Mathematics Subject Classification ID

Cryptography (94A60)


Related Items (1)

Authentication codes and bipartite graphs







This page was built for publication: New combinatorial bounds for authentication codes and key predistribution schemes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1273509&oldid=13374153"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 09:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki