Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences
DOI10.1016/J.AMC.2005.01.097zbMATH Open1090.94020OpenAlexW2040935641MaRDI QIDQ2490987FDOQ2490987
Authors: Yang Zhan, Dan Chen, Yu-Min Wang, Zheng-Tao Jiang
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
Recommendations
integer factorizationsemantic securityone-waynesspublic-key encryption schemeLFSR higher (non) residuosity
Random number generation in numerical analysis (65C10) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- New directions in cryptography
- Title not available (Why is that?)
- Public-key cryptosystems based on cubic finite field extensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- Title not available (Why is that?)
- A p + 1 Method of Factoring
- A modification of the RSA public-key encryption procedure (Corresp.)
- Title not available (Why is that?)
- Security analysis and improvement of a double-trapdoor encryption scheme
Cited In (2)
This page was built for publication: Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490987)