Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

43

LATINCRYPT
2010

favoriteEmaildiscussreport

109views Cryptology» more LATINCRYPT 2010»

New Software Speed Records for Cryptographic Pairings

13 years 9 months ago

New Software Speed Records for Cryptographic Pairings

Download eprint.iacr.org

Abstract. This paper presents new software speed records for the computation of cryptographic pairings. More speciﬁcally, we present details of an implementation which computes the optimal ate pairing on a 256bit Barreto-Naehrig curve in only 4,379,912 cycles on one core of an Intel Core 2 Quad Q9550 processor.

Michael Naehrig, Ruben Niederhagen, Peter Schwabe

Real-time Traffic

256bit Barreto-naehrig Curve | Cryptology | Intel Core 2 Quad | LATINCRYPT 2010 | Software Speed Records |

claim paper

Related Content

» Fast Software AES Encryption

» A New PseudoRandom Generator Based on Gollmann Cascades of BakerRegisterMachines

» PETTool a software suite for comprehensive processing and managing of PairedEnd diTag PET ...

» Faster Explicit Formulas for Computing Pairings over Ordinary Curves

» How to Maximize Software Performance of Symmetric Primitives on Pentium III and 4

» CollisionBased Power Analysis of Modular Exponentiation Using ChosenMessage Pairs

» Secure and Efficient AES Software Implementation for Smart Cards

» Solving a 676Bit Discrete Logarithm Problem in GF36n

» How to Maximize Software Performance of Symmetric Primitives on Pentium III and 4 Processo...

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	LATINCRYPT
Authors	Michael Naehrig, Ruben Niederhagen, Peter Schwabe

Comments (0)