490 search results - page 83 / 98 » A New Public-Key Cryptosystem |
118
Voted
TIT
2011
14 years 10 months ago
2011
Abstract—We propose a new method to speed up discrete logarithm (DL)-based cryptosystems by considering a new variant of the DL problem, where the exponents are formed as e1 + α...
220
Voted
CTRSA
2011
Springer
14 years 7 months ago
2011
Springer
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contribution...
122
Voted
INDOCRYPT
2005
Springer
15 years 9 months ago
2005
Springer
Prouff has introduced recently, at FSE 2005, the notion of transparency order of S-boxes. This new characteristic is related to the ability of an S-box, used in a cryptosystem in ...
114
Voted
CHES
2000
Springer
15 years 8 months ago
2000
Springer
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
116
Voted
SACRYPT
1999
Springer
15 years 8 months ago
1999
Springer
In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF 2m . We call these sequences elliptic curve...