140 search results - page 19 / 28 » Public Key Cryptosystems Based on Chaotic-Chebyshev Polynomi... |
MUE
2007
IEEE
15 years 4 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 ...
PKC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We define and discuss symmetric subgroup membership problems and their properties, including a relation to the Decision DiffieHellman problem. We modify the Cramer-Shoup...
SETA
2004
Springer
15 years 3 months ago
2004
Springer
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
ICMCS
2010
IEEE
14 years 11 months ago
2010
IEEE
According to a popular pattern recognition method, this paper proposes two methods to generate a secret from individual's biometric information, such as fingerprint feature p...