A public key cryptosystem based on three new provable problems
From MaRDI portal
Publication:418738
DOI10.1016/j.tcs.2011.12.011zbMath1243.68176OpenAlexW2071376024MaRDI QIDQ418738
Publication date: 30 May 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.011
public key cryptosystemdigital signatureprovable securitybit shadowcoprime sequencedouble congruence theoremlever functionpolynomial time Turing reductiontranscendental logarithm problem
Related Items (4)
A semantically secure public key cryptoscheme using bit-pair shadows ⋮ A provably secure non-iterative hash function resisting birthday attack ⋮ A New Non-Merkle-Damgård Structural Hash Function with Provable Security ⋮ A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic granularity reduction and its application
- Digital signature scheme based on a new hard problem
- Improved low-density subset sum algorithms
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- An application of algebraic geometry to encryption: tame transformation method
- Fast LLL-type lattice reduction
- Security Proofs for Signature Schemes
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Cryptanalysis of short RSA secret exponents
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Foundations of Cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Advanced Topics in Computional Number Theory
- Solving Low Density Knapsacks
- Floating-Point LLL Revisited
- Information Security and Cryptology - ICISC 2003
- Hiding information and signatures in trapdoor knapsacks
This page was built for publication: A public key cryptosystem based on three new provable problems