A public key cryptosystem based on sparse polynomials

MaRDI QIDQ4485865zbMATH OpenFDO

Authors David Grant, Krastan Krastev, D. Lieman, Igor E. Shparlinski

Publication date 20 June 2000

zbMATH Keywords

cryptosystemone-way functionssparse polynomials over finite fields

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1618046
• A Lattice Based Public Key Cryptosystem Using Polynomial Representations
• scientific article; zbMATH DE number 2009958
• scientific article; zbMATH DE number 1689606
• Coding and Cryptography
• New public-key cryptosystem based on the morphism of polynomials problem
• Public-key encryption based on Chebyshev polynomials
• Security of public-key cryptosystems based on Chebyshev polynomials
• A public key cryptosystem using a group of permutation polynomials
• scientific article; zbMATH DE number 4213911

Cited in

(5)

• Polly Two: a new algebraic polynomial-based public-key scheme
• scientific article; zbMATH DE number 1618046 (Why is no real title available?)
• Towards faster cryptosystem. II
• scientific article; zbMATH DE number 562257 (Why is no real title available?)
• A type of public cryptosystem using polynomials and pell sequences

This page was built for publication: A public key cryptosystem based on sparse polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4485865)