Hardware implementation of multiplication over quartic extension fields

DOI10.1007/978-981-16-6890-6_43OpenAlexW4226184098MaRDI QIDQ2079983

Alexandre Berzati, Jean-Baptiste Rigaud, Arthur Lavice, Nadia El Mrabet

Publication date: 7 October 2022

Full work available at URL: https://doi.org/10.1007/978-981-16-6890-6_43

zbMATH Keywords

FPGApolynomial interpolationpairing-based cryptographyhardware implementationNewton's formulaexact divisionsmultiplication over extension fields

Mathematics Subject Classification ID

Cryptography (94A60) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Updating key size estimations for pairings
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
• A taxonomy of pairing-friendly elliptic curves
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Efficient Multiplication in Finite Field Extensions of Degree 5
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Monte Carlo Methods for Index Computation (mod p)
• Optimal Pairings
• New Hardware Architectures for Montgomery Modular Multiplication Algorithm
• Pairing-Friendly Elliptic Curves of Prime Order

This page was built for publication: Hardware implementation of multiplication over quartic extension fields