Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice

First Page		Document Content
Date: 2015-08-21 16:58:21 Cryptography Transport Layer Security Secure communication Finite fields Cryptographic protocols Public-key cryptography Logjam DiffieHellman key exchange Index calculus algorithm XTR Elliptic curve DiffieHellman Key size		Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice Add to Reading List Source URL: aaspring.com Download Document from Source Website File Size: 1,32 MB Share Document on Facebook

	A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups Alexander May? and Ilya Ozerov?? Horst G¨ ortz Institute for IT-Security Ruhr-University Bochum, Germany DocID: 1qKpq - View Document
	On the Function Field Sieve and the Impact of Higher Splitting Probabilities Robert Granger Joint work with Faruk Gölo§lu, Gary McGuire and Jens Zumbrägel DocID: 1qJsF - View Document
	Revisiting discrete logarithms in medium/small characteristic Antoine Joux CryptoExperts Chaire de Cryptologie de la Fondation de l’UPMC — LIP6 DocID: 1qjra - View Document
	Master’s thesis in Mathematics The use of elliptic curves in cryptography by Gijsbert van Vliet DocID: 1pH9i - View Document
	Public Key Cryptography Using Discrete Logarithms in Finite Fields: Algorithms, Efficient Implementation and Attacks L. Maurits) DocID: 1obzi - View Document