Software Implementation of Arithmetic in
From MaRDI portal
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Software, source code, etc. for problems pertaining to number theory (11-04)
Recommendations
- Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
- scientific article; zbMATH DE number 1979307
- Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
- Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings
Cited in
(6)- Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings
- Factor-4 and 6 compression of cyclotomic subgroups of \(\mathbb F^*_{2^{4m}}\) and \(\mathbb F^*_{3^{6m}}\)
- Fast vector arithmetic over \(\mathbb{F}_3\)
- Multiple point compression on elliptic curves
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition
This page was built for publication: Software Implementation of Arithmetic in
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426082)