103 search results - page 14 / 21 » Security of public key cryptosystems based on Chebyshev Poly... |
PKC
2007
Springer
14 years 2 months ago
2007
Springer
At PKC 2003 Paeng, Jung, and Ha proposed a lattice based public key cryptosystem(PJH). It is originated from GGH, and designed as a hybrid of GGH and NTRUEncrypt in order to reduce...
MUE
2007
IEEE
14 years 2 months ago
2007
IEEE
Conference keys are secret keys used by a group of users commonly and with which they can encipher (or decipher) messages such that communications are secure. Based on the Diffie ...
WCC
2005
Springer
14 years 2 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
ECCC
2000
13 years 8 months ago
2000
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
CRYPTO
2006
Springer
14 years 8 days 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,...