High-speed high-security signatures Daniel J. Bernstein1 , Niels Duif2 , Tanja Lange2 , Peter Schwabe3 , and Bo-Yin Yang4 1 Department of Computer Science University of Illinois at Chicago, Chicago, IL 60607–7045, USA

First Page		Document Content
Date: 2011-07-09 00:19:47 Cryptography Elliptic curve cryptography EdDSA Elliptic-curve cryptography Elliptic Curve Digital Signature Algorithm Curve25519 Elliptic-curve DiffieHellman Digital signature Digital Signature Algorithm Daniel J. Bernstein Hash function Public-key cryptography		High-speed high-security signatures Daniel J. Bernstein1 , Niels Duif2 , Tanja Lange2 , Peter Schwabe3 , and Bo-Yin Yang4 1 Department of Computer Science University of Illinois at Chicago, Chicago, IL 60607–7045, USA Add to Reading List Source URL: precision.moscito.org Download Document from Source Website File Size: 269,36 KB Share Document on Facebook

	Time-memory Trade-offs for Near-collisions Ga¨etan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to find nearcollisions for a hash function. If we consider o DocID: 1xTVd - View Document
	The Usage of Counter Revisited: Second-Preimage Attack on New Russian Standardized Hash Function Jian Guo1 , J´er´emy Jean1 , Ga¨etan Leurent2 , Thomas Peyrin1 , and Lei Wang1 1 DocID: 1xT7a - View Document
	The Skein Hash Function Family Version 1.3 — 1 Oct 2010 Niels Ferguson Stefan Lucks Bruce Schneier DocID: 1tn3m - View Document
	On the design and cryptanalysis of a one-way hash Carl Ellison Victor Miller Eran Tromer Rebecca Wright In this paper we describe a novel one-way hash function that is compliant with the NIST hash function competition dr DocID: 1t9VA - View Document
	Appears in Fast Software Encryption(FSE 2004), Lecture Notes in Computer Science, Vol. ????, Springer-Verlag. This is the full version. Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for P DocID: 1rEjw - View Document