Preimage selective trapdoor function: how to repair an easy problem
From MaRDI portal
Publication:1718474
DOI10.1155/2014/475678zbMath1407.94158OpenAlexW1964597925WikidataQ59067642 ScholiaQ59067642MaRDI QIDQ1718474
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/475678
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relation between the hardness of a problem and the number of its solutions
- Cryptanalysis of a knapsack-based probabilistic encryption scheme
- Improved low-density subset sum algorithms
- Low-density attack revisited
- A knapsack-based probabilistic encryption scheme
- Safer parameters for the Chor-Rivest cryptosystem
- Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
- A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
- New Definition of Density on Knapsack Cryptosystems
- Factorization of a 768-Bit RSA Modulus
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A knapsack-type public key cryptosystem based on arithmetic in finite fields
- An Improved Low-Density Subset Sum Algorithm
- A method for obtaining digital signatures and public-key cryptosystems
- Knapsack Public Key Cryptosystems and Diophantine Approximation
- Adapting Density Attacks to Low-Weight Knapsacks
- Enumerative source encoding
- Hiding information and signatures in trapdoor knapsacks
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- Cryptanalysis of the Chor-Rivest cryptosystem
This page was built for publication: Preimage selective trapdoor function: how to repair an easy problem
