Hardware implementation of multiplication over quartic extension fields

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

Authors: Arthur Lavice, Alexandre Berzati, Jean-Baptiste Rigaud, 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

pairing-based cryptographypolynomial interpolationhardware implementationFPGANewton's formulaexact divisionsmultiplication over extension fields

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A taxonomy of pairing-friendly elliptic curves
• Monte Carlo Methods for Index Computation (mod p)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pairing-Friendly Elliptic Curves of Prime Order
• Optimal Pairings
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Updating key size estimations for pairings
• Title not available (Why is that?)
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• Title not available (Why is that?)
• New Hardware Architectures for Montgomery Modular Multiplication Algorithm
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
• Efficient multiplication in finite field extensions of degree 5
• An introduction to pairing-based cryptography

Cited In (2)

• Hardware implementation of finite-field division
• Direct hardware solution to quadratic equation Z2⊕Z⊕β=0 in Galois fields based on normal basis representation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079983)