Sciweavers

ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
14 years 3 months ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert
ANTS
2004
Springer
95views Algorithms» more  ANTS 2004»
14 years 4 months ago
Using Primitive Subgroups to Do More with Fewer Bits
Abstract. This paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of...
Karl Rubin, Alice Silverberg