scientific article; zbMATH DE number 1461535

zbMATH Open1018.94016MaRDI QIDQ4485865FDOQ4485865

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

Publication date: 20 June 2000

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

one-way functionscryptosystemsparse polynomials over finite fields

Mathematics Subject Classification ID

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

Cited In (4)

• Polly Two: a new algebraic polynomial-based public-key scheme
• Title not available (Why is that?)
• A type of public cryptosystem using polynomials and pell sequences
• Towards faster cryptosystem. II

This page was built for publication:

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