Accelerating inverse of GF(2n) with precomputation

Authors:
Xu Lei;Lin Dongdai
Affiliations:
State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China;State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China
Venue:
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
Year:
2010

Citing 13
Cited 0

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases

Information and Computation
Parallel collision search with application to hash functions and discrete logarithms

CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Finite fields

Finite fields
Montgomery Multiplication in GF(2^k

Designs, Codes and Cryptography
The Montgomery Modular Inverse-Revisited

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

Designs, Codes and Cryptography
The Montgomery Inverse and Its Applications

IEEE Transactions on Computers
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
On the Performance of Signature Schemes Based on Elliptic Curves

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2)

CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Fast Key Exchange with Elliptic Curve Systems

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Field inversion and point halving revisited

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a method to accelerate the inverse of GF(2n) with some precomputation. Our method works for both almost inverse and Montgomery inverse of GF(2n), and is faster than previous methods. Furthermore, the precomputation is done only one time for a fixed finite field and can be done efficiently.