Sciweavers

48 search results - page 10 / 10
» Computing bilinear pairings on elliptic curves with automorp...
Sort
View
CORR
2007
Springer
173views Education» more  CORR 2007»
13 years 5 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
ASIACRYPT
2003
Springer
13 years 9 months ago
Certificateless Public Key Cryptography
This paper introduces the concept of certificateless public key cryptography (CL-PKC). In contrast to traditional public key cryptographic systems, CL-PKC does not require the use...
Sattam S. Al-Riyami, Kenneth G. Paterson
CTRSA
2010
Springer
191views Cryptology» more  CTRSA 2010»
13 years 9 months ago
Making the Diffie-Hellman Protocol Identity-Based
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
Dario Fiore, Rosario Gennaro