Discrete logarithms in GF(P) using the number field sieve
SIAM Journal on Discrete Mathematics
Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
Handbook of Applied Cryptography
Handbook of Applied Cryptography
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Unbelievable Security. Matching AES Security Using Public Key Systems
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Compression in Finite Fields and Torus-Based Cryptography
SIAM Journal on Computing
A More Compact Representation of XTR Cryptosystem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Practical cryptography in high dimensional tori
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
New LFSR-based cryptosystems and the trace discrete log problem (Trace-DLP)
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Public-key cryptosystems based on cubic finite field extensions
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In previous work we showed how to compress certain prime-order subgroups of the cyclotomic subgroups of orders 22m + 1 of the multiplicative groups of ${\mathbb{F}}_{2^{4m}}^*$ by a factor of 4. We also showed that single-exponentiation can be efficiently performed using compressed representations. In this paper we show that double-exponentiation can be efficiently performed using factor-4 compressed representation of elements. In addition to giving a considerable speed up to the previously known fastest single-exponentiation algorithm for general bases, double-exponentiation can be used to adapt our compression technique to ElGamal type signature schemes.