Discrete logarithms in finite fields and their cryptographic significance A. M. Odlyzko AT - Computational hardness assumptions - Document - PDFSEARCH.IO

First Page		Document Content
Date: 1998-04-13 22:10:57 Finite fields Logarithms Computational hardness assumptions Group theory XTR Discrete logarithm Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm records Abstract algebra Mathematics Cryptography		Discrete logarithms in finite fields and their cryptographic significance A. M. Odlyzko AT&T Bell Laboratories Add to Reading List Source URL: www.dtc.umn.edu Download Document from Source Website File Size: 212,95 KB Share Document on Facebook

	The Twin Diffie-Hellman Problem and Applications David Cash1 Eike Kiltz2 Victor Shoup3 DocID: 1mLxm - View Document
	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
	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
	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
	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