Certifying RSA Saqib A. Kakvi, Eike Kiltz, and Alexander May Faculty of Mathematics Horst G¨ ortz Institute for IT-Security Ruhr University Bochum, Germany

First Page		Document Content
Date: 2014-11-18 10:03:56 Cryptography Permutations Combinatorics Trapdoor function NC RSA Optimal asymmetric encryption padding Permutation Parity of a permutation Factorial Integer factorization		Certifying RSA Saqib A. Kakvi, Eike Kiltz, and Alexander May Faculty of Mathematics Horst G¨ ortz Institute for IT-Security Ruhr University Bochum, Germany Add to Reading List Source URL: www.cits.rub.de Download Document from Source Website File Size: 167,90 KB Share Document on Facebook

	Certifying RSA Saqib A. Kakvi, Eike Kiltz, and Alexander May Faculty of Mathematics Horst G¨ ortz Institute for IT-Security Ruhr University Bochum, Germany DocID: 1qO3E - View Document
	The proceedings version of this paper appears in CCSThis is the full paper, an earlier version of which was circulated under the title “Garbling Schemes”. Foundations of Garbled Circuits Mihir Bellare1 1 DocID: 1pyIx - View Document
	Extending Nymble-like Systems Ryan Henry and Ian Goldberg Cheriton School of Computer Science University of Waterloo Waterloo, ON, Canada N2L 3G1 {rhenry,iang}@cs.uwaterloo.ca DocID: 1oWen - View Document
	A Provably Secure Elliptic Curve Scheme with Fast Encryption David Galindo1 , Sebasti` a Mart´ın1 , Tsuyoshi Takagi2 and Jorge L. Villar1 1 DocID: 1lP2X - View Document
	Easy Verifiable Primitives and Practical Public Key Cryptosystems David Galindo, Sebasti`a Mart´ın, Paz Morillo and Jorge L. Villar Dep. Matem` atica Aplicada IV. Universitat Polit`ecnica de Catalunya Campus Nord, c/Jo DocID: 1kMVe - View Document