Hardware for Collision Search on Elliptic Curve over GF(2m) Philippe Bulens∗, Guerric Meurice de Dormale† and Jean-Jacques Quisquater UCL Crypto Group Universit´e Catholique de Louvain

First Page		Document Content
Date: 2006-05-04 18:26:31 Cryptography Abstract algebra Algebra Finite fields Elliptic curve cryptography Public-key cryptography Group theory Elliptic-curve cryptography Elliptic curve XTR Elliptic curve only hash Supersingular isogeny key exchange		Hardware for Collision Search on Elliptic Curve over GF(2m) Philippe Bulens∗, Guerric Meurice de Dormale† and Jean-Jacques Quisquater UCL Crypto Group Universit´e Catholique de Louvain Add to Reading List Source URL: www.hyperelliptic.org Download Document from Source Website File Size: 348,73 KB Share Document on Facebook

	Elliptic Curve Hash (and Sign) ECOH (and the 1-up problem for ECDSA) Daniel R. L. Brown Certicom Research ECC 2008, Utrecht, Sep DocID: 1lo8W - View Document
	Introduction Construction of hash functions Elliptic Curve L-Function Elliptic Curve Only Hash (ECOH) Hashing with Elliptic Curve L-Functions Conclusion DocID: 1l2py - View Document
	PDF Document DocID: 14sXr - View Document
	Time-memory Trade-oﬀs for Near-collisions Gaëtan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to ﬁnd near-collisions for a hash DocID: 12HMr - View Document
	An abridged version of this paper appears in Advances in Cryptology { Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed., Springer-Verlag, 1997. A New Paradigm for Collision-free Hashing: DocID: 12CJD - View Document