Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems

DOI10.1112/S1461157000000747zbMath1068.94012OpenAlexW2151737020WikidataQ111900110 ScholiaQ111900110MaRDI QIDQ4827601

Keith E. Harrison, Nigel P. Smart, Dan Page

Publication date: 18 November 2004

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.lms.ac.uk/jcm/5/lms2002-002/

Mathematics Subject Classification ID

General topics of discrete mathematics in relation to computer science (68R01) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (9)

On the distribution of irreducible trinomials over \(\mathbb F_3\) ⋮ A class of Gaussian normal bases and their dual bases ⋮ A comparison of MNT curves and supersingular curves ⋮ Formulas for cube roots in \(\mathbb F_{3^m}\) ⋮ A simple point counting algorithm for Hessian elliptic curves in characteristic three ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ A Provably Secure One-Pass Two-Party Key Establishment Protocol ⋮ Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition ⋮ On the arithmetic operations over finite fields of characteristic three with low complexity

Cites Work

• Modular Multiplication Without Trial Division
• Reducing elliptic curve logarithms to logarithms in a finite field

This page was built for publication: Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems