Computational frameworks for the fast Fourier transform
Computational frameworks for the fast Fourier transform
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Modern computer algebra
Fast Algorithms for Digital Signal Processing
Fast Algorithms for Digital Signal Processing
Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Five, Six, and Seven-Term Karatsuba-Like Formulae
IEEE Transactions on Computers
IEEE Transactions on Computers
Algebraic Complexity Theory
Efficient hardware for the tate pairing calculation in characteristic three
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Efficient FPGA-based karatsuba multipliers for polynomials over F2
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Secure Hash Standard - SHS: Federal Information Processing Standards Publication 180-4
Secure Hash Standard - SHS: Federal Information Processing Standards Publication 180-4
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
FPGA and ASIC implementations of the ηT pairing in characteristic three
Computers and Electrical Engineering
Efficient multiplication in F3lm, m ≥ 1 and 5 ≤ l ≤ 18
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Efficient bit-parallel multipliers over finite fields GF(2m)
Computers and Electrical Engineering
On the efficiency and security of pairing-based protocols in the type 1 and type 4 settings
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Key length estimation of pairing-based cryptosystems using ηT pairing
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
| Hi-index | 0.00 |
Efficient computation of the Tate pairing is an important part of pairing-based cryptography. Recently with the introduction of the Duursma-Lee method special attention has been given to the fields of characteristic 3. Especially multiplication in F36m, where m is prime, is an important operation in the above method. In this paper we propose a new method to reduce the number of F3m-multiplications for multiplication in F36m from 18 in recent implementations to 15. The method is based on the fast Fourier transform and its explicit formulas are given. The execution times of our software implementations for F36m show the efficiency of our results.