Search
Now showing items 1-6 of 6
On the dimension of the Jacquet module of a certain induced representation
(2001)
The Fourier coefficients of certain metaplectic Eisenstein series contain L-series of arithmetic interest. This fact has been repeatedly exploited by various authors in order to obtain analytic information about these ...
A Variant of NTRU with Non-Invertible Polynomials
(2002)
We introduce a generalization of the NTRU cryptosystem and describe its advantages and disadvantages as compared with the original NTRU protocol. This extension helps to avoid the potential problem of finding “enough” ...
An extremely small and efficient identification scheme
(2000)
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications.
Nonlinear complexity of the Naor-Reingold pseudo-random function
(2000)
We obtain an exponential lower bound on the non-linear complexity of the new pseudo-random function, introduced recently by M. Naor and O. Reingold. This bound is an extension of the lower bound on the linear complexity ...
Cryptographic applications of sparse polynomials over finite rings
(2001)
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.
An identification scheme based on sparse polynomials
(2000)
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identification schemes.