Efficient implementation of bilinear pairings on ARM processors
From MaRDI portal
Recommendations
Cites work
- Constructing tower extensions of finite fields for implementation of pairing-based cryptography
- Faster explicit formulas for computing pairings over ordinary curves
- Faster hashing to \({\mathbb G}_2\)
- New Software Speed Records for Cryptographic Pairings
- On the efficient implementation of pairing-based protocols
- Optimal Pairings
- Pairing-based cryptography -- Pairing 2010. 4th international conference, Yamanaka Hot Spring, Japan, December 13--15, 2010. Proceedings
- Pairing-Friendly Elliptic Curves of Prime Order
- The Weil pairing, and its efficient calculation
Cited in
(9)- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Choosing and generating parameters for pairing implementation on BN curves
- Updating key size estimations for pairings
- Implementing cryptographic pairings on accumulator based smart card architectures
- Affine pairings on ARM
- Efficient pairings and ECC for embedded systems
- Compact structure-preserving signatures with almost tight security
- Pairings in rank-1 constraint systems
- A survey of fault attacks in pairing based cryptography
This page was built for publication: Efficient implementation of bilinear pairings on ARM processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455495)