Efficient Identity Based Signature Schemes Based on Pairings
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Supersingular Curves in Cryptography
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three
IEEE Transactions on Computers
Formulas for cube roots in F3m
Discrete Applied Mathematics
Versatile hardware architectures for GF(pm) arithmetic in public key cryptography
Integration, the VLSI Journal - Special issue: Embedded cryptographic hardware
Software Implementation of Arithmetic in
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
A versatile Montgomery multiplier architecture with characteristic three support
Computers and Electrical Engineering
New left-to-right minimal weight signed-digit radix-r representation
Computers and Electrical Engineering
Reduction Optimal Trinomials for Efficient Software Implementation of the ηT Pairing
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On multiplication in finite fields
Journal of Complexity
Secure signed radix-r recoding methods for constrained-embedded devices
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Efficient computations of the Tate pairing for the large MOV degrees
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Hardware performance characterization of block cipher structures
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Reduction optimal trinomials for efficient software implementation of the ηT pairing
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
A new bit-serial multiplier over GF(pm) using irreducible trinomials
Computers & Mathematics with Applications
Scalar multiplication on elliptic curves defined over fields of small odd characteristic
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Hardware acceleration of the tate pairing in characteristic three
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Efficient hardware for the tate pairing calculation in characteristic three
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Key length estimation of pairing-based cryptosystems using ηT pairing
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
On the distribution of irreducible trinomials over F3
Finite Fields and Their Applications
Instruction set extensions for pairing-based cryptography
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
SPA countermeasure based on unsigned left-to-right recodings
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
Parallel GF(3m) multiplier for trinomials
Information Processing Letters
On the arithmetic operations over finite fields of characteristic three with low complexity
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
In this paper we examine a number of ways of implementing characteristic three arithmetic in hardware. While this type of arithmetic is not traditionally used in cryptographic systems, recent advances in Tate and Weil pairing based cryptosystems show that it is potentially valuable. We examine a hardware oriented representation of the field elements, comparing the resulting algorithms for field addition and multiplication operations, and show that characteristic three arithmetic need not significantly under-perform comparable characteristic two alternatives.