ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
On the Generalised Hidden Number Problem and Bit Security of XTR
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
More Efficient Password-Authenticated Key Exchange
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Hidden Number Problem with the Trace and Bit Security of XTR and LUC
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Fast Generation of Cubic Irreducible Polynomials for XTR
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Comments on a Signature Scheme Based on the Third Order LFSR Proposed at ACISP2001
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Fast Irreducibility and Subgroup Membership Testing in XTR
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
A Practical Approach Defeating Blackmailing
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
XTR +: A Provable Security Public Key Cryptosystem
Computational Intelligence and Security
On the Computational Efficiency of XTR+
Information Security and Cryptology
A Forward-Secrecy WTLS Handshake Protocol Based on XTR
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Fast irreducibility testing for XTR using a gaussian normal basis of low complexity
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Security of polynomial transformations of the Diffie-Hellman key
Finite Fields and Their Applications
| Hi-index | 0.00 |
This paper describes improved methods for XTR key representation and parameter generation (cf. [4]). If the field characteristic is properly chosen, the size of the XTR public key for signature applications can be reduced by a factor of three at the cost of a small one time computation for the recipient of the key. Furthermore, the parameter set-up for an XTR system can be simplified because the trace of a proper subgroup generator can, with very high probability, be computed directly, thus avoiding the probabilistic approach from [4]. These non-trivial extensions further enhance the practical potential of XTR.