Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak† Avi Wigderson‡

First Page		Document Content
Date: 2011-10-10 23:51:30 Electronic commerce Computational hardness assumptions Hidden Field Equations Pseudorandom generator RSA XTR Learning with errors Clique problem One-way function Cryptography Finite fields Public-key cryptography		Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak† Avi Wigderson‡ Add to Reading List Source URL: www.boazbarak.org Download Document from Source Website File Size: 497,73 KB Share Document on Facebook

	On the design and cryptanalysis of a one-way hash Carl Ellison Victor Miller Eran Tromer Rebecca Wright In this paper we describe a novel one-way hash function that is compliant with the NIST hash function competition dr DocID: 1t9VA - View Document
	Samuel M. Young, Jr. PhD Max Planck Research Group Leader Research Group Molecular Mechanisms of Synaptic Function Max Planck Florida Institute for Neuroscience One Max Planck Way Jupiter, Florida USA 33458 DocID: 1s4hy - View Document
	Samuel M. Young, Jr. PhD Max Planck Research Group Leader Research Group Molecular Mechanisms of Synaptic Function Max Planck Florida Institute for Neuroscience One Max Planck Way Jupiter, Florida USA 33458 DocID: 1rx8q - View Document
	Hoti to Construct Random Functions ODED GOLDREICH, SHAFI AND SILVIO MICALI GOLDWASSER, DocID: 1r1z1 - View Document