Abstract
The XTR is a very effective public key cryptosystem based on 3rd order LFSR sequence. But it has parameter corresponding problem and it neglects the Provable Security property and the blind signature scheme. For overcoming these problems in this paper, the XTR is extended with 4-th order LFSR sequence to from a new public key cryptosystem called XTR + . An algorithm for computing the trace elements is proposed, which only depends on a 2×2 recursive matrix instead of 4×4 so that the running time of the algorithm is much shorter than the algorithm for XTR which depends on a 3×3 recursive matrix.Over XTR + the provable IND-CCA2 secure encryption/decryption protocol, the provable secure digital signature, the provable secure blind signature protocol and zero-knowledge proof protocol are established. Compared with the traditional methods such as ECC, XTR + is more simple in cipherkey and parameter selections and has more randomcity and faster algorithms. Under the same security requirements, the XTR + can greatly reduce the overheads in parameter storage and communication and be suitable for bigger plaintext and ciphertext spaces.
This work is partially supported by Guangdong Industrial Technologies Priorities Programme under grant #2006B15401009.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lenstra, A.K., Verheul, E.R.: The XTR public system. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 1–19. Springer, Heidelberg (2000)
Lenstra, A.K., Verheul, E.R.: Key improvements to XTR. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 220–233. Springer, Heidelberg (2000)
Avanzi, R.M.: The Complexity of Certain Multi-Exponentiation Techniques in Cryptography. J. Cryptology 18, 357–373 (2005)
Chen, X., Wang, Y.: Asurvey of public key cryptography. Journal of China institute of communications 25(8), 109–118 (2004)(in Chinese)
Verheul, E.R.: Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. J. Cryptology 17(4), 277–296 (2004)
Martijn, S., Lenstra, A.K.: Speeding Up XTR. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, Springer, Heidelberg (2001)
Peeters, E., Neve, M., Ciet, M.: XTR implementation on reconfigurable hardware. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 386–399. Springer, Heidelberg (2004)
Rackoff, C., Simon, D.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 443–444. Springer, Heidelberg (1992)
ISO/IEC 18033-2:2006. Information Technology - Security Techniques - Encryption Algorithms - Part 2: Asymmetrc Ciphers (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Z., Zhang, Z. (2007). XTR + : A Provable Security Public Key Cryptosystem. In: Wang, Y., Cheung, Ym., Liu, H. (eds) Computational Intelligence and Security. CIS 2006. Lecture Notes in Computer Science(), vol 4456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74377-4_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-74377-4_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74376-7
Online ISBN: 978-3-540-74377-4
eBook Packages: Computer ScienceComputer Science (R0)