A semantically secure public key cryptoscheme using bit-pair shadows
From MaRDI portal
Publication:344780
DOI10.1016/J.TCS.2016.04.017zbMATH Open1371.94656OpenAlexW2346671401MaRDI QIDQ344780FDOQ344780
Authors: Shenghui Su, Tao Xie, Shuwang Lü, Maozhi Xu 
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
Recommendations
anomalous subset sum problembit-pair shadowcompact sequencepublic key cryptoschemerandom paddingsemantical security
Cites Work
- Probabilistic encryption
- A method for obtaining digital signatures and public-key cryptosystems
- 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
- Title not available (Why is that?)
- Nonmalleable Cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved low-density subset sum algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- A public key cryptosystem based on three new provable problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving low density knapsacks
- Hiding information and signatures in trapdoor knapsacks
- Asymptotic granularity reduction and its application
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)
