Discrete logarithms in finite fields and their cryptographic significance A. M. Odlyzko AT - Hardness - 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

	On the Efficiency of Pollard’s Rho Method for Discrete Logarithms Shi Bai1 1 2 DocID: 1xUgq - View Document
	The Proof is in the Pudding Proofs of Work for Solving Discrete Logarithms Marcella Hastings1 , Nadia Heninger1 , and Eric Wustrow2 1 University of Pennsylvania DocID: 1xTnt - View Document
	Worksheet on Solving Problems Using Logarithms Math-123, Fall 2014 October 13, 2014 Questions DocID: 1vl2J - View Document
	COMPUTING DISCRETE LOGARITHMS IN F36·137 AND F36·163 USING MAGMA GORA ADJ, ALFRED MENEZES, THOMAZ OLIVEIRA, AND FRANCISCO RODR´IGUEZ-HENR´IQUEZ Abstract. We show that a Magma implementation of Joux’s new L[1/4] alg DocID: 1uYTQ - View Document
	2nd workshop of the ECFA “Physics and Detectors for a Linear Collider” study series Durham, 1–4 September 2004 Electroweak Sudakov logarithms The form factor in a massive U(1) model and in a U(1)×U(1) model with m DocID: 1uXNo - View Document