On Software Parallel Implementation of Cryptographic Pairings

DOI10.1007/978-3-642-04159-4_3zbMath1256.94051WikidataQ30051278 ScholiaQ30051278MaRDI QIDQ3644191

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

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

94A60: Cryptography

11G20: Curves over finite and local fields

94-04: Software, source code, etc. for problems pertaining to information and communication theory

Related Items

Pairing the volcano, 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, Fast Elliptic-Curve Cryptography on the Cell Broadband Engine

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Short signatures from the Weil pairing
• Efficient pairing computation on supersingular abelian varieties
• Modular Multiplication Without Trial Division
• Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
• The Eta Pairing Revisited
• A fast new DES implementation in software
• Optimizing a fast stream cipher for VLIW, SIMD, and superscalar processors
• Pairing-Friendly Elliptic Curves of Prime Order
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Information Security and Privacy
• Cryptography and Coding
• Algorithmic Number Theory
• Advances in Cryptology - ASIACRYPT 2003
• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.