A semantically secure public key cryptoscheme using bit-pair shadows
From MaRDI portal
Recommendations
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A multiple-iterated trapdoor for dense compact knapsacks.
- A new trapdoor in knapsacks
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A public key cryptosystem based on three new provable problems
- Asymptotic granularity reduction and its application
- Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS\#1
- Cryptanalysis of short RSA secret exponents
- Hiding information and signatures in trapdoor knapsacks
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 2123258 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- scientific article; zbMATH DE number 1418967 (Why is no real title available?)
- Improved low-density subset sum algorithms
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Nonmalleable Cryptography
- Number theory for computing. Foreword by Martin E. Hellman.
- OAEP reconsidered (extended abstract)
- Practice-oriented provable-security
- Probabilistic encryption
- Solving low density knapsacks
Cited in
(2)
This page was built for publication: A semantically secure public key cryptoscheme using bit-pair shadows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344780)