Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences
From MaRDI portal
Publication:2490987
DOI10.1016/j.amc.2005.01.097zbMath1090.94020MaRDI QIDQ2490987
Dan Chen, Zheng-Tao Jiang, Yang Zhan, Yu-Min Wang
Publication date: 18 May 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.01.097
integer factorization; semantic security; one-wayness; public-key encryption scheme; LFSR higher (non) residuosity
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
65C10: Random number generation in numerical analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Security analysis and improvement of a double-trapdoor encryption scheme
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- New directions in cryptography
- A modification of the RSA public-key encryption procedure (Corresp.)
- A p + 1 Method of Factoring
- A method for obtaining digital signatures and public-key cryptosystems
- Public-key cryptosystems based on cubic finite field extensions