<--- Back to Details
First PageDocument Content
Finite fields / Cryptographic protocols / Computational hardness assumptions / Logarithms / XTR / Diffie–Hellman key exchange / Diffie–Hellman problem / Elliptic curve / Discrete logarithm / Cryptography / Abstract algebra / Mathematics
Date: 2006-02-09 10:35:13
Finite fields
Cryptographic protocols
Computational hardness assumptions
Logarithms
XTR
Diffie–Hellman key exchange
Diffie–Hellman problem
Elliptic curve
Discrete logarithm
Cryptography
Abstract algebra
Mathematics

Add to Reading List

Source URL: cr.yp.to

Download Document from Source Website

Share Document on Facebook

Similar Documents

On the discrete logarithm problem for plane curves Claus Diem October 26, 2012 Abstract

DocID: 1vhrJ - View Document

Errata After now a year has passed since I submitted my Habilitation thesis “On arithmetic and the discrete logarithm problem in class groups of curves”, I realized some mistakes and inaccuracies. Two of the mistake

DocID: 1v8oL - View Document

On the discrete logarithm problem in elliptic curves Claus Diem August 9, 2010 Dedicated to Gerhard Frey

DocID: 1v15F - View Document

Systems of polynomial equations associated to elliptic curve discrete logarithm problems Claus Diem Institute for Experimental Mathematics, University of Duisburg-Essen October 27, 2004

DocID: 1uWKu - View Document

The elliptic curve discrete logarithm problem and equivalent hard problems for elliptic divisibility sequences Kristin E. Lauter1 and Katherine E. Stange2,? 1

DocID: 1uE9P - View Document