111 search results - page 14 / 23 » New Public Key Cryptosystems Based on the Dependent-RSA Prob... |
87
Voted
CRYPTO
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
CRYPTO
2006
Springer
15 years 3 months ago
2006
Springer
In the last ten years, multivariate cryptography has emerged as a possible alternative to public key cryptosystems based on hard computational problems from number theory. Notably,...
CRYPTO
2009
Springer
15 years 6 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
112
click to vote
IJACT
2008
14 years 11 months ago
2008
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
90
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Problem statement: This paper examines Artificial Spiking Neural Network (ASNN) which inter-connects group of artificial neurons that uses a mathematical model with the aid of blo...