On Software Parallel Implementation of Cryptographic Pairings

DOI10.1007/978-3-642-04159-4_3MaRDI QIDQ3644191zbMATH OpenOpenAlexWikidataFDO

Authors Philipp Grabher, Johann Großschädl, Dan Page

Publication date 3 November 2009

Published in Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04159-4_3

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Software, source code, etc. for problems pertaining to information and communication theory (94-04) Cryptography (94A60)

Recommendations

• High-speed parallel software implementation of the \(\eta_{T}\) pairing
• Parallelizing the Weil and Tate pairings
• New Software Speed Records for Cryptographic Pairings
• Implementing cryptographic pairings
• Parallelizing pairings on Hessian elliptic curves

Cites work

• A fast new DES implementation in software
• Advances in Cryptology - ASIACRYPT 2003
• Algorithmic Number Theory
• Cryptography and Coding
• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
• Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
• Efficient pairing computation on supersingular abelian varieties
• scientific article; zbMATH DE number 5532069 (Why is no real title available?)
• scientific article; zbMATH DE number 1304123 (Why is no real title available?)
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 1980962 (Why is no real title available?)
• scientific article; zbMATH DE number 2044535 (Why is no real title available?)
• scientific article; zbMATH DE number 2086705 (Why is no real title available?)
• scientific article; zbMATH DE number 2086895 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• Implementing cryptographic pairings
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Information Security and Privacy
• Modular Multiplication Without Trial Division
• Optimizing a fast stream cipher for VLIW, SIMD, and superscalar processors
• Pairing-Friendly Elliptic Curves of Prime Order
• Short signatures from the Weil pairing
• The Eta Pairing Revisited

Cited in

(8)

• Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA
• An analysis of affine coordinates for pairing computation
• Parallelizing the Weil and Tate pairings
• New Software Speed Records for Cryptographic Pairings
• Fast Elliptic-Curve Cryptography on the Cell Broadband Engine
• scientific article; zbMATH DE number 1983211 (Why is no real title available?)
• Pairing the volcano
• High-throughput elliptic curve cryptography using AVX2 vector instructions

This page was built for publication: On Software Parallel Implementation of Cryptographic Pairings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644191)