A semantically secure public key cryptoscheme using bit-pair shadows
From MaRDI portal
Publication:344780
DOI10.1016/j.tcs.2016.04.017zbMath1371.94656OpenAlexW2346671401MaRDI QIDQ344780
Shenghui Su, Tao Xie, Mao-Zhi Xu, Lü, Shuwang
Publication date: 24 November 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.017
anomalous subset sum problembit-pair shadowcompact sequencepublic key cryptoschemerandom paddingsemantical security
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A public key cryptosystem based on three new provable problems
- Asymptotic granularity reduction and its application
- Probabilistic encryption
- Improved low-density subset sum algorithms
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Cryptanalysis of short RSA secret exponents
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A method for obtaining digital signatures and public-key cryptosystems
- Nonmalleable Cryptography
- Solving Low Density Knapsacks
- Hiding information and signatures in trapdoor knapsacks