RNS arithmetic in 𝔽 pk and application to fast pairing computation
From MaRDI portal
Publication:3015225
DOI10.1515/JMC.2011.006zbMath1246.94027MaRDI QIDQ3015225
Publication date: 11 July 2011
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Arithmetic theory of polynomial rings over finite fields (11T55)
Related Items
Cites Work
- Efficient implementation of pairing-based cryptosystems
- A one round protocol for tripartite Diffie-Hellman
- Short signatures from the Weil pairing
- The Weil pairing, and its efficient calculation
- A taxonomy of pairing-friendly elliptic curves
- Ordinary Abelian varieties having small embedding degree
- Generating more MNT elliptic curves
- Elliptic curves suitable for pairing based cryptography
- The Eta Pairing Revisited
- Faster Pairing Computations on Curves with High-Degree Twists
- A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over $\mathbb{F}_p$
- The number field sieve for integers of low weight
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Reducing elliptic curve logarithms to logarithms in a finite field
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Optimal Pairings
- Pairing-Friendly Elliptic Curves of Prime Order