Sciweavers

193 search results - page 23 / 39
» Fair Public-Key Cryptosystems
Sort
View
WWW
2004
ACM
14 years 8 months ago
Integrating elliptic curve cryptography into the web's security infrastructure
RSA is the most popular public-key cryptosystem on the Web today but long-term trends such as the proliferation of smaller, simpler devices and increasing security needs will make...
Vipul Gupta, Douglas Stebila, Sheueling Chang Shan...
IMA
2005
Springer
162views Cryptology» more  IMA 2005»
14 years 1 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
IPL
1998
177views more  IPL 1998»
13 years 7 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
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...
JaeCheol Ha, Sang-Jae Moon
CTRSA
2006
Springer
157views Cryptology» more  CTRSA 2006»
13 years 11 months 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
SIGCSE
2004
ACM
95views Education» more  SIGCSE 2004»
14 years 1 months ago
Cryptography and computer security for undergraduates
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...
Paul De Palma, Charles Frank, Suzanne E. Gladfelte...