Simplified OAEP for the RSA and Rabin Functions
- 2 August 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 275-291
- https://doi.org/10.1007/3-540-44647-8_17
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Handbook of Applied CryptographyPublished by Taylor & Francis ,2018
- RSA-OAEP Is Secure under the RSA AssumptionLecture Notes in Computer Science, 2001
- OAEP ReconsideredLecture Notes in Computer Science, 2001
- A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0Lecture Notes in Computer Science, 2001
- Nonmalleable CryptographySIAM Journal on Computing, 2000
- Relations among notions of security for public-key encryption schemesPublished by Springer Nature ,1998
- Small Solutions to Polynomial Equations, and Low Exponent RSA VulnerabilitiesJournal of Cryptology, 1997
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related SchemesLecture Notes in Computer Science, 1996
- Optimal asymmetric encryptionLecture Notes in Computer Science, 1995
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993