Cryptographic Applications of Sparse Polynomials over Finite Rings

Authors:
William D. Banks;Daniel Lieman;Igor Shparlinski;Van Thuong To
Affiliations:
-;-;-;-
Venue:
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
Year:
2000

Citing 7
Cited 1

A course in computational algebraic number theory

A course in computational algebraic number theory
A survey of fast exponentiation methods

Journal of Algorithms
Modern computer algebra

Modern computer algebra
An Identification Scheme Based on Sparse Polynomials

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Cryptoanalysis of Two Sparse Polynomial Based Public Key Cryptosystems

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
NTRU: A Ring-Based Public Key Cryptosystem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Solving systems of polynomial congruences modulo a large prime

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Cryptoanalysis of Two Sparse Polynomial Based Public Key Cryptosystems

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems and identification schemes.