scientific article; zbMATH DE number 1842497
From MaRDI portal
zbMath1002.94526MaRDI QIDQ4783731
Publication date: 8 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2139/21390275
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feistel networkOAEPoptimal asymmetric encryption paddingciphertext secureRabin functionsRSA trapdoor functions
Related Items
Toward RSA-OAEP Without Random Oracles, Multi-use and unidirectional identity-based proxy re-encryption schemes, Instantiability of RSA-OAEP under chosen-plaintext attack, Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption, Tag-KEM/DEM: A new framework for hybrid encryption, Signcryption from randomness recoverable public key encryption, Using LLL-Reduction for Solving RSA and Factorization Problems, The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance, Strengthening Security of RSA-OAEP, Efficient public key encryption with smallest ciphertext expansion from factoring, Smashing SQUASH-0, On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model, Security of Practical Cryptosystems Using Merkle-Damgård Hash Function in the Ideal Cipher Model
