<--- Back to Details
First PageDocument Content
Cryptography / Abstract algebra / Algebra / Finite fields / Elliptic curve cryptography / Computational hardness assumptions / Group theory / Public-key cryptography / Elliptic-curve cryptography / Elliptic curve / Key size / Discrete logarithm
Date: 2006-03-21 11:54:32
Cryptography
Abstract algebra
Algebra
Finite fields
Elliptic curve cryptography
Computational hardness assumptions
Group theory
Public-key cryptography
Elliptic-curve cryptography
Elliptic curve
Key size
Discrete logarithm

On the Security of Elliptic Curve Cryptosystems against Attacks with Special-Purpose Hardware Tim G¨ uneysu, Christof Paar, Jan Pelzl Horst G¨ortz Institute for IT Security, Ruhr University Bochum, Germany {gueneysu,cp

Add to Reading List

Source URL: www.hyperelliptic.org

Download Document from Source Website

File Size: 227,31 KB

Share Document on Facebook

Similar Documents

Computing discrete logarithms in fields of small characteristic Francisco Rodr´ıguez-Henr´ıquez CINVESTAV-IPN  Joint work with:

Computing discrete logarithms in fields of small characteristic Francisco Rodr´ıguez-Henr´ıquez CINVESTAV-IPN Joint work with:

DocID: 1r2Hf - View Document

Revisiting discrete logarithms in medium/small characteristic Antoine Joux CryptoExperts Chaire de Cryptologie de la Fondation de l’UPMC — LIP6

Revisiting discrete logarithms in medium/small characteristic Antoine Joux CryptoExperts Chaire de Cryptologie de la Fondation de l’UPMC — LIP6

DocID: 1qjra - View Document

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1

DocID: 1q2Qr - View Document

Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint ∗ Alexander May, Maike Ritzenhofen Horst Görtz Institute for IT-security Faculty of Mathematics Ruhr-University of Bochum, 44780 Bochum, Ger

Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint ∗ Alexander May, Maike Ritzenhofen Horst Görtz Institute for IT-security Faculty of Mathematics Ruhr-University of Bochum, 44780 Bochum, Ger

DocID: 1pMu4 - View Document

Security of the J-PAKE Password-Authenticated Key Exchange Protocol Michel Abdalla Fabrice Benhamouda

Security of the J-PAKE Password-Authenticated Key Exchange Protocol Michel Abdalla Fabrice Benhamouda

DocID: 1mJoe - View Document