Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic

Authors:
Tetsutaro Kobayashi;Hikaru Morita;Kunio Kobayashi;Fumitaka Hoshino
Affiliations:
NTT Laboratories, Nippon Telegraph and Telephone Corporation, Yokosuka-shi, Kanagawa-ken, Japan;NTT Laboratories, Nippon Telegraph and Telephone Corporation, Yokosuka-shi, Kanagawa-ken, Japan;NTT Laboratories, Nippon Telegraph and Telephone Corporation, Yokosuka-shi, Kanagawa-ken, Japan;NTT Laboratories, Nippon Telegraph and Telephone Corporation, Yokosuka-shi, Kanagawa-ken, Japan
Venue:
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Year:
1999

Citing 7
Cited 15

Optimal normal bases in GF(pn)

Discrete Applied Mathematics
CM-Curves with Good Cryptographic Properties

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
An Improved Algorithm for Arithmetic on a Family of Elliptic Curves

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Fast Software Implementation for Arithmetic Operations in GF(2n)

ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map

PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography

Power Analysis Attacks and Algorithmic Approaches to Their Countermeasures for Koblitz Curve Cryptosystems

IEEE Transactions on Computers
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes

Designs, Codes and Cryptography
A Cyclic Window Algorithm for ECC Defined over Extension Fields

ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
An Improved Implementation of Elliptic Curves over GF(2) when Using Projective Point Arithmetic

SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form

SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Speeding up the Scalar Multiplication in the Jacobians of Hyperelliptic Curves Using Frobenius Map

INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Lenient/Strict Batch Verification in Several Groups

ISC '01 Proceedings of the 4th International Conference on Information Security
Power Analysis Attacks and Algorithmic Approaches to their Countermeasures for Koblitz Curve Cryptosystems

CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
An architecture for elliptic curve cryptograph computation

ACM SIGARCH Computer Architecture News - Special issue: Workshop on architectural support for security and anti-virus (WASSA)
Highly Regular Right-to-Left Algorithms for Scalar Multiplication

CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
An efficient security algorithm in mobile computing for resource constrained mobile devices.

Proceedings of the 4th ACM symposium on QoS and security for wireless and mobile networks
New Frobenius expansions for elliptic curves with efficient endomorphisms

ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
An analysis of affine coordinates for pairing computation

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
A DPA countermeasure by randomized frobenius decomposition

WISA'05 Proceedings of the 6th international conference on Information Security Applications
Speeding up ate pairing computation in affine coordinates

ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new elliptic curve scalar multiplication algorithm is proposed. The algorithm offers about twice the troughput of some conventional OEF-base algorithms because it combines the Frobenius map with the table reference method based on base-φ expansion. Furthermore, since this algorithm suits conventional computational units such as 16, 32 and 64 bits, its base field Fpm is expected to enhance elliptic curve operation efficiency more than Fq (q is a prime) or F2n.