PKC
2000
Springer
13 years 8 months ago
2000
Springer
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 identif...
ACISP
2007
Springer
13 years 8 months ago
2007
Springer
In this note, we describe a correction to the cryptosystem proposed in [1, 2]. Although the correction is small and does not affect the performance of the protocols from [1, 2], it...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
McEliece cryptosystem is a public-key cryptosystem based on error-correcting codes. It constitutes one of the few alternatives to cryptosystems relying on number theory. We present...
ISCC
2003
IEEE
13 years 9 months ago
2003
IEEE
WTLS (Wireless Transport Layer Security) is an important standard protocol for secure wireless access to Internet services. WTLS employs public-key cryptosystems during the handsh...
ACNS
2004
Springer
13 years 10 months ago
2004
Springer
We study the data privacy of cryptosystems with All-or-Nothing transform (AONT). An AONT is an efficient computable transform with two properties: Given all the bits of its output...
PKC
2005
Springer
13 years 10 months ago
2005
Springer
Hidden field equation (HFE) multivariable cryptosystems were first suggested by Patarin. Kipnis and Shamir showed that to make the cryptosystem secure, a special parameter D of a...
KES
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In the paper we extend known results studying the application of CAs for stream ciphers. We illustrate the notion of weak keys in such a cryptosystem and describe the exp...
PKC
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We propose multi-bit versions of several single-bit cryptosystems based on lattice problems, the error-free version of the Ajtai-Dwork cryptosystem by Goldreich, Goldwass...