140 search results - page 3 / 28 » Public Key Cryptosystems Based on Chaotic-Chebyshev Polynomi... |
IMA
1999
Springer
13 years 9 months ago
1999
Springer
We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product. Using these trapdoors we set up a lattice-based cryptosystem which ...
PKC
2000
Springer
13 years 9 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...
IJNSEC
2006
13 years 5 months ago
2006
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent a...
ACNS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Several researchers have proposed the use of threshold cryptographic model to enable secure communication in ad hoc networks without the need of a trusted center. In this...
PKC
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show co...