The Proof is in the Pudding Proofs of Work for Solving Discrete Logarithms Marcella Hastings1 , Nadia Heninger1 , and Eric Wustrow2 1 University of Pennsylvania

First Page		Document Content
Date: 2018-10-05 10:39:17 Abstract algebra Algebra Cryptography Group theory Finite fields Logarithms Elliptic curve cryptography Public-key cryptography Index calculus algorithm Elliptic-curve cryptography Discrete logarithm Random walk		The Proof is in the Pudding Proofs of Work for Solving Discrete Logarithms Marcella Hastings1 , Nadia Heninger1 , and Eric Wustrow2 1 University of Pennsylvania Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 265,05 KB Share Document on Facebook

	-Invertible Cycles for Multivariate Quadratic (MQ) Public Key Cryptography Jintai Ding1, , Christopher Wolf2 , and Bo-Yin Yang3, 1 University of Cincinnati and Technische Universität Darmstadt DocID: 1xVV9 - View Document
	Public-Key Cryptography from New Multivariate Quadratic Assumptions Yun-Ju Huang1,3 , Feng-Hao Liu2 , and Bo-Yin Yang3 1 3 DocID: 1xVNp - View Document
	Multivariate Public Key Cryptography Jintai Ding 1 2 DocID: 1xVdX - View Document
	This is the full version of a paper which appears in Public-Key Cryptography PKC20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, DocID: 1xTwC - View Document
	Why Johnny the Developer Can’t Work with Public Key Certificates? An Experimental Study of OpenSSL Usability Martin Ukrop[0000−0001−8110−8926] and Vashek Matyas Centre for Research on Cryptography and Security Fa DocID: 1vi5X - View Document