Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography

DOI10.1007/978-3-642-02620-1_29zbMath1284.94072OpenAlexW1757804052MaRDI QIDQ3634510

Christophe Negre, Nadia El Mrabet

Publication date: 25 June 2009

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02620-1_29

zbMATH Keywords

finite fieldsPairingAMNSdiscrete Fourrier transform

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A taxonomy of pairing-friendly elliptic curves
• Elliptic curves suitable for pairing based cryptography
• Modular Multiplication Without Trial Division
• Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Reducing elliptic curve logarithms to logarithms in a finite field
• Pairing-Friendly Elliptic Curves of Prime Order
• Optimised Versions of the Ate and Twisted Ate Pairings
• Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
• Cryptography and Coding

This page was built for publication: Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography