On Software Parallel Implementation of Cryptographic Pairings
From MaRDI portal
Recommendations
Cites work
- A fast new DES implementation in software
- Advances in Cryptology - ASIACRYPT 2003
- Algorithmic Number Theory
- Cryptography and Coding
- Efficient algorithms for pairing-based cryptosystems
- 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
- Elliptic curve arithmetic using SIMD
- Fast elliptic curve multiplications with SIMD operations
- Guide to elliptic curve cryptography.
- scientific article; zbMATH DE number 5532069 (Why is no real title available?)
- IDEA: A cipher for multimedia architectures?
- Implementing cryptographic pairings
- Implementing Cryptographic Pairings over Barreto-Naehrig Curves
- Implementing the Tate pairing
- 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
- Performance analysis and parallel implementation of dedicated hash functions
- 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
- Parallel algorithm and architecture for public-key cryptosystem
- 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)