A survey of fast exponentiation methods
Journal of Algorithms
Elliptic curves in cryptography
Elliptic curves in cryptography
The Montgomery Modular Inverse-Revisited
IEEE Transactions on Computers - Special issue on computer arithmetic
Handbook of Applied Cryptography
Handbook of Applied Cryptography
The Montgomery Inverse and Its Applications
IEEE Transactions on Computers
Software Implementation of the NIST Elliptic Curves Over Prime Fields
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Use of Elliptic Curves in Cryptography
CRYPTO '85 Advances in Cryptology
More Flexible Exponentiation with Precomputation
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Elliptic Curve Cryptosystems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
New Algorithm for Classical Modular Inverse
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Fast elliptic curve arithmetic and improved weil pairing evaluation
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Some constructions of systematic authentication codes using galois rings
Designs, Codes and Cryptography
Optimal authentication codes from difference balanced functions
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
| Hi-index | 0.00 |
In this paper, we describe authentication codes via (generalized) Gray images of suitable codes over Galois rings. Exponential sums over these rings help determine--or bound--the parameters of such codes.