Sciweavers

WAIFI
2010
Springer
158views Mathematics» more  WAIFI 2010»
13 years 9 months ago
On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings
Abstract. We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timing...
Sanjit Chatterjee, Darrel Hankerson, Alfred Meneze...
WAIFI
2010
Springer
160views Mathematics» more  WAIFI 2010»
14 years 3 months ago
Speeding Up Bipartite Modular Multiplication
Abstract. A large set of moduli, for which the speed of bipartite modular multiplication considerably increases, is proposed in this work. By considering state of the art attacks o...
Miroslav Knezevic, Frederik Vercauteren, Ingrid Ve...
WAIFI
2010
Springer
189views Mathematics» more  WAIFI 2010»
14 years 4 months ago
Delaying Mismatched Field Multiplications in Pairing Computations
Abstract. Miller’s algorithm for computing pairings involves performing multiplications between elements that belong to different finite fields. Namely, elements in the full e...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...
WAIFI
2010
Springer
194views Mathematics» more  WAIFI 2010»
14 years 4 months ago
Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
A cryptographic pairing evaluates as an element of a finite extension field, and the evaluation itself involves a considerable amount of extension field arithmetic. It is recogn...
Naomi Benger, Michael Scott
WAIFI
2010
Springer
192views Mathematics» more  WAIFI 2010»
14 years 4 months ago
Type-II Optimal Polynomial Bases
In the 1990s and early 2000s several papers investigated the relative merits of polynomial-basis and normal-basis computations for F2n . Even for particularly squaring-friendly app...
Daniel J. Bernstein, Tanja Lange