<--- Back to Details
First PageDocument Content
Cryptography / Cryptographic hash functions / Error detection and correction / SHA-1 / SHA-2 / MD5 / NIST hash function competition / SHA-3 / Elliptic curve only hash / Elliptic Curve Digital Signature Algorithm / Libgcrypt / FORK-256
Date: 2008-09-27 14:59:29
Cryptography
Cryptographic hash functions
Error detection and correction
SHA-1
SHA-2
MD5
NIST hash function competition
SHA-3
Elliptic curve only hash
Elliptic Curve Digital Signature Algorithm
Libgcrypt
FORK-256

Elliptic Curve Hash (and Sign) ECOH (and the 1-up problem for ECDSA) Daniel R. L. Brown Certicom Research ECC 2008, Utrecht, Sep

Add to Reading List

Source URL: www.hyperelliptic.org

Download Document from Source Website

File Size: 556,30 KB

Share Document on Facebook

Similar Documents

Elliptic Curve Hash (and Sign) ECOH (and the 1-up problem for ECDSA) Daniel R. L. Brown Certicom Research  ECC 2008, Utrecht, Sep

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

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-offs for Near-collisions Gaëtan Leurent UCL Crypto Group   Abstract. In this work we consider generic algorithms to find near-collisions for a hash

Time-memory Trade-offs for Near-collisions Gaëtan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to find 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:

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