Sciweavers

103 search results - page 10 / 21
» Security of public key cryptosystems based on Chebyshev Poly...
Sort
View
CORR
2007
Springer
127views Education» more  CORR 2007»
13 years 8 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata
DCC
2000
IEEE
13 years 8 months ago
Discrete Logarithms: The Past and the Future
The first practical public key cryptosystem to be published, the Diffie-Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. T...
Andrew M. Odlyzko
CTRSA
2006
Springer
157views Cryptology» more  CTRSA 2006»
14 years 8 days ago
How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack
Abstract. In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast ...
Yitao Duan, John F. Canny
IMA
2005
Springer
162views Cryptology» more  IMA 2005»
14 years 2 months ago
Pairing-Based Cryptography at High Security Levels
In recent years cryptographic protocols based on the Weil and Tate pairings on elliptic curves have attracted much attention. A notable success in this area was the elegant solutio...
Neal Koblitz, Alfred Menezes
EUROCRYPT
2010
Springer
14 years 1 months ago
Algebraic Cryptanalysis of McEliece Variants with Compact Keys
In this paper we propose a new approach to investigate the security of the McEliece cryptosystem. We recall that this cryposystem relies on the use of error-correcting codes. Since...
Jean-Charles Faugère, Ayoub Otmani, Ludovic...