490 search results - page 58 / 98 » A New Public-Key Cryptosystem |
135
click to vote
IACR
2011
14 years 3 months ago
2011
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
140
click to vote
ASIACRYPT
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
130
click to vote
IJNSEC
2006
15 years 3 months ago
2006
The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication which is ...
151
click to vote
IACR
2011
14 years 3 months ago
2011
We describe Charm, an extensible framework designed for rapid prototyping of cryptographic systems that utilize the latest advances in cryptography, such as identity and attribute...
134
click to vote
ASIACRYPT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We develop a new multi-party generalization of Naor-Nissim indirect indexing, making it possible for many participants to simulate a RAM machine with only poly-logarithmi...