Publication:4425740
From MaRDI portal
zbMath1028.68003MaRDI QIDQ4425740
Publication date: 11 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2523/25230529.htm
multiplication; supersingular elliptic curves; hardware representation; characteristic three arithmetic; field addition
68W40: Analysis of algorithms
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
68M07: Mathematical problems of computer architecture
Related Items
Complexity of computation in finite fields, A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials, Efficient hardware implementation of finite fields with applications to cryptography, Formulas for cube roots in \(\mathbb F_{3^m}\), On multiplication in finite fields, On the arithmetic operations over finite fields of characteristic three with low complexity, On the distribution of irreducible trinomials over \(\mathbb F_3\), A simple point counting algorithm for Hessian elliptic curves in characteristic three, A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers, Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition