185 search results - page 25 / 37 » A Lattice-Based Public-Key Cryptosystem |
IMA
2005
Springer
14 years 3 months ago
2005
Springer
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...
IPL
1998
13 years 9 months ago
1998
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
CTRSA
2006
Springer
14 years 1 months ago
2006
Springer
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 ...
SIGCSE
2004
ACM
14 years 3 months ago
2004
ACM
The panel discusses solutions to the problem of computer security education. Categories and Subject Descriptors C.2.0 [Computer-Communication Networks]: security and protection. E...
ISAAC
2003
Springer
14 years 3 months ago
2003
Springer
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...