Sciweavers

4212 search results - page 10 / 843
» On Compressible Pairings and Their Computation
Sort
View
PAIRING
2010
Springer
153views Cryptology» more  PAIRING 2010»
13 years 5 months ago
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...
Nicolas Estibals
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
13 years 10 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
ICISC
2004
120views Cryptology» more  ICISC 2004»
13 years 8 months ago
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
Sanjit Chatterjee, Palash Sarkar, Rana Barua
JCB
2000
129views more  JCB 2000»
13 years 7 months ago
Prediction of RNA Base Pairing Probabilities on Massively Parallel Computers
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
Martin Fekete, Ivo L. Hofacker, Peter F. Stadler