Hardware implementation of multiplication over quartic extension fields
From MaRDI portal
Publication:2079983
Cites work
- scientific article; zbMATH DE number 5532069 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 1952905 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- A taxonomy of pairing-friendly elliptic curves
- An introduction to pairing-based cryptography
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Efficient multiplication in finite field extensions of degree 5
- Extended tower number field sieve: a new complexity for the medium prime case
- Monte Carlo Methods for Index Computation (mod p)
- New Hardware Architectures for Montgomery Modular Multiplication Algorithm
- Optimal Pairings
- Pairing-Friendly Elliptic Curves of Prime Order
- Scalable zero knowledge via cycles of elliptic curves
- Updating key size estimations for pairings
Cited in
(2)
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)