First Page | Document Content | |
---|---|---|
Date: 2013-06-17 13:32:36ElGamal encryption Public-key cryptography Ciphertext indistinguishability Diffie–Hellman problem Decisional Diffie–Hellman assumption Optimal asymmetric encryption padding Cramer–Shoup cryptosystem Cryptography Computational hardness assumptions Finite fields | Formal Certification of Code-Based Cryptographic Proofs GILLES BARTHE and SANTIAGO ZANELLA BEGUELIN IMDEA Software, Madrid, Spain and BENJAMIN GREGOIREAdd to Reading ListSource URL: certicrypt.gforge.inria.frDownload Document from Source WebsiteFile Size: 530,13 KBShare Document on Facebook |
Encryption-Scheme Security in the Presence of Key-Dependent Messages J. Black ∗ P. RogawayDocID: 1rlwp - View Document | |
Certifying RSA Saqib A. Kakvi, Eike Kiltz, and Alexander May Faculty of Mathematics Horst G¨ ortz Institute for IT-Security Ruhr University Bochum, GermanyDocID: 1qO3E - View Document | |
Practical Cryptanalysis of iso/iecand emv Signatures⋆ Jean-S´ebastien Coron1 , David Naccache2 , Mehdi Tibouchi2 , and Ralf-Philipp Weinmann1 1 Universit´e du Luxembourg 6, rue Richard Coudenhove-Kalergi l-13DocID: 1qNBV - View Document | |
Randomized Partial Checking Revisited Shahram Khazaei, Douglas Wikstr¨om, February 13, 2012 AbstractDocID: 1qDIf - View Document | |
Microsoft PowerPoint - NPROM-zhang.pptxDocID: 1pGwl - View Document |