Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences

DOI10.1016/J.AMC.2005.01.097MaRDI QIDQ2490987zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

integer factorizationLFSR higher (non) residuosityone-waynesspublic-key encryption schemesemantic security

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• On the k-th order LFSR sequence with public key cryptosystems
• Primitive transformation shift registers over finite fields
• Public-key cryptosystems based on cubic finite field extensions
• scientific article; zbMATH DE number 4148025
• The provable security public key cryptosystem based on 8-th order LFSR sequence

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A modification of the RSA public-key encryption procedure (Corresp.)
• A p + 1 Method of Factoring
• An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 1722681 (Why is no real title available?)
• scientific article; zbMATH DE number 176555 (Why is no real title available?)
• scientific article; zbMATH DE number 3460351 (Why is no real title available?)
• scientific article; zbMATH DE number 1504547 (Why is no real title available?)
• scientific article; zbMATH DE number 1504559 (Why is no real title available?)
• New directions in cryptography
• Public-key cryptosystems based on cubic finite field extensions
• Security analysis and improvement of a double-trapdoor encryption scheme

Cited in

(2)

• The provable security public key cryptosystem based on 8-th order LFSR sequence
• On the k-th order LFSR sequence with public key cryptosystems

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)