Journal of the ACM (JACM)
An integrity check value algorithm for stream ciphers
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On families of hash functions via geometric codes and concatenation
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the 4th International Workshop on Fast Software Encryption
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Fast Universal Hashing with Small Keys and No Preprocessing: The PolyR Construction
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
UMAC: Fast and Secure Message Authentication
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
On Fast and Provably Secure Message Authentication Based on Universal Hashing
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Fast Message Authentication Using Efficient Polynomial Evaluation
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
On the evaluation of powers and related problems
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
New classes and applications of hash functions
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Software performance of universal hash functions
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Stronger security bounds for wegman-carter-shoup authenticators
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Variationally universal hashing
Information Processing Letters
A survey of recent developments in cryptographic algorithms for smart cards
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Salsa20 Family of Stream Ciphers
New Stream Cipher Designs
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Improved MACs from Differentially-Uniform Permutations
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Information Security and Cryptology
Nonce Generators and the Nonce Reset Problem
ISC '09 Proceedings of the 12th International Conference on Information Security
On protecting integrity and confidentiality of cryptographic file system for outsourced storage
Proceedings of the 2009 ACM workshop on Cloud computing security
Message authentication on 64-bit architectures
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
On efficient message authentication via block cipher design techniques
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Toward acceleration of RSA using 3D graphics hardware
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Channel-based unidirectional stream protocol (CUSP)
INFOCOM'10 Proceedings of the 29th conference on Information communications
How to thwart birthday attacks against MACs via small randomness
FSE'10 Proceedings of the 17th international conference on Fast software encryption
Cryptography for network security: failures, successes and challenges
MMM-ACNS'10 Proceedings of the 5th international conference on Mathematical methods, models and architectures for computer network security
Efficient authentication for mobile and pervasive computing
ICICS'10 Proceedings of the 12th international conference on Information and communications security
A trade-off between collision probability and key size in universal hashing using polynomials
Designs, Codes and Cryptography
The software performance of authenticated-encryption modes
FSE'11 Proceedings of the 18th international conference on Fast software encryption
E-MACs: towards more secure and more efficient constructions of secure channels
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
PolyE+CTR: a swiss-army-knife mode for block ciphers
ProvSec'11 Proceedings of the 5th international conference on Provable security
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
A variant of poly1305 MAC and its security proof
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Provably secure MACs from differentially-uniform permutations and AES-Based implementations
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Badger – a fast and provably secure MAC
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Stronger security bounds for wegman-carter-shoup authenticators
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Curve25519: new diffie-hellman speed records
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Type checking cryptography implementations
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
SILENTKNOCK: practical, provably undetectable authentication
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Improving the security of MACs via randomized message preprocessing
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
Γ-MAC[H, P]: a new universal MAC scheme
WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology
The security impact of a new cryptographic library
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Cycling attacks on GCM, GHASH and other polynomial MACs and hashes
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
On security of universal hash function based multiple authentication
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
McBits: fast constant-time code-based cryptography
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
A new multi-linear universal hash family
Designs, Codes and Cryptography
| Hi-index | 0.00 |
Poly1305-AES is a state-of-the-art message-authentication code suitable for a wide variety of applications. Poly1305-AES computes a 16-byte authenticator of a variable-length message, using a 16-byte AES key, a 16-byte additional key, and a 16-byte nonce. The security of Poly1305-AES is very close to the security of AES; the security gap is at most 14D⌈L/16⌉/2106 if messages have at most L bytes, the attacker sees at most 264 authenticated messages, and the attacker attempts D forgeries. Poly1305-AES can be computed at extremely high speed: for example, fewer than 3.1l+780 Athlon cycles for an ℓ-byte message. This speed is achieved without precomputation; consequently, 1000 keys can be handled simultaneously without cache misses. Special-purpose hardware can compute Poly1305-AES at even higher speed. Poly1305-AES is parallelizable, incremental, and not subject to any intellectual-property claims.