<--- Back to Details
First PageDocument Content
Diffie–Hellman problem / Elliptic curve / XTR / Discrete logarithm / Diffie–Hellman key exchange / Hessian form of an elliptic curve / Lenstra elliptic curve factorization / Abstract algebra / Cryptography / Finite fields
Date: 2005-09-04 13:03:42
Diffie–Hellman problem
Elliptic curve
XTR
Discrete logarithm
Diffie–Hellman key exchange
Hessian form of an elliptic curve
Lenstra elliptic curve factorization
Abstract algebra
Cryptography
Finite fields

Add to Reading List

Source URL: eprint.iacr.org

Download Document from Source Website

File Size: 306,87 KB

Share Document on Facebook

Similar Documents

The Twin Diffie-Hellman Problem and Applications David Cash1 Eike Kiltz2 Victor Shoup3

DocID: 1mLxm - View Document

Cryptography / Abstract algebra / Algebra / Computational hardness assumptions / Finite fields / DiffieHellman problem / Group theory / Elliptic curve cryptography / Provable security / Whitfield Diffie / DiffieHellman key exchange / Elliptic curve

Motivation - Exotic Security Assumptions in Cryptography Main Algorithm and Results Oracle-assisted Static DHP for binary curves On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

DocID: 1miS9 - View Document

Public-key cryptography / Computer security / DolevYao model / DiffieHellman key exchange / Cryptographic protocol / RSA / Exponentiation / DiffieHellman problem / Modular exponentiation

1 On the Symbolic Analysis of Low-Level Cryptographic Primitives: Modular Exponentiation and the Diffie-Hellman Protocol M ARZIA B USCEMI, University of Pisa

DocID: 1lnSV - View Document

Diffie–Hellman problem / Full Domain Hash / Rabin signature algorithm / Oracle machine / Optimal asymmetric encryption padding / Digital signature / Schnorr signature / Standard model / RSA / Cryptography / Public-key cryptography / Random oracle

THE RANDOM ORACLE MODEL: A TWENTY-YEAR RETROSPECTIVE NEAL KOBLITZ AND ALFRED J. MENEZES Abstract. It has been roughly two decades since the random oracle model for reductionist security arguments was introduced and one d

DocID: 1gs9P - View Document

Cryptographic protocols / Public-key cryptography / Diffie–Hellman problem / Diffie–Hellman key exchange / XTR / Discrete logarithm / ElGamal encryption / Subliminal channels / RSA / Cryptography / Computational hardness assumptions / Finite fields

Minding your p’s and q’s Ross Anderson1 , Serge Vaudenay2 1 Computer Laboratory, Pembroke Street, Cambridge, CB2 3QG, England Ecole Normal Sup´erieure — DMI, 45 rue d’Ulm, 75230 Paris, France

DocID: 19uqQ - View Document