XTR algorithm based encryption for Security in computer

Authors

  • Bushra Kamil Hilal Department of Computer information systems , College of Computer Science and information technology /University of Qadisiyah
  • Mohammad Q.Jawad Department of Biomedical InforMatics ,College of Biomedical Informatics University of IT And Communication
  • Ahmed W.Shehab Department of Biomedical InforMatics ,College of Biomedical Informatics University of IT And Communication

DOI:

https://doi.org/10.29304/jqcsm.2023.15.11294

Keywords:

Cryptography, XTR, Signature design, DSA, NR program, , Field finite, Polynomial cyclostome in nature, Conjugate component, Trace

Abstract

The idea of XTR was first presented by Lenstra et al. in Crypto 2000. The efficient and compact subgroup trace representation is referred to as XTR Discrete logarithm (DLP) is considered as the basis for the security of the XTR. cipher system. It is regarded as a good substitute for the RSA and elliptic curve cryptosystems. We shall go into great detail on the mathematics underlying XTR and its uses in cryptography in this book chapter. Keywords \s• Cryptography\s• XTR

Downloads

Download data is not yet available.

References

U. Varshney, “Recent Advances in Wireless Networking” IEEE Computer, vol. 33, pp. 100-103, June 2000.

L. Korba, “Security System for Wireless Local Area Networks” in Ninth IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, 1998, vol. 3, pp. 1550-1554.

S. F. Russell, “Wireless network security for users”, in proc. IEEE international conference on information technology: coding and computing, 2001, pp 172-177 April 2001 .

Donald Davies and Wyn Price: “Security for Computer Networks”, John Wiley, 1989.

Bruce Schneier: “Applied Cryptography”, second edition, John Wiley & Sons, 1996Cryptography book.

Douglas R. Stinson, “Cryptography, Theory and Practice”, CRC Press, 1995 .

SSL cryptography corner, http://www.ssh.com/tech/crypto/algorithms.cfm, last visited April 17, 2002. [Online] .

A. Lenstra, E. Verhuel “An overview of the XTR public key system”, in proc. Public key cryptography and computational number theory conference, 2001.

A. Lenstra, E. Verhuel “ The XTR public key system”, in proc. Cryptography- Crypto 2000 lecture notes in computer science, sping-verlag. 2000 pp. 97-101 .

E. Verhuel, “Evidence that XTR is more secure than supersingular elliptic curve cryptosystem”, Proc. of Eurocrypt 2001.

A. J. Menzes, “Comparing the security of ECC and RSA”, manuscript, 2000, available at www.cacr.math.uwaterloo.ca/~ajmeneze [Online] .

A. Odlyzko, “Discrete Logarithms”, The past and the future, Designs, Codes and Cryptography, 19 (2000), 129-145.

Lenstra, Verhuel XTR crypgographic system http://ecstr.com website, last visited April 17, 2002. [Online] .

Apple Tech Info Library, “Airport: Difference between DSSS and FHSS” [Online], Available at: http://til.info.apple.com/techinfo.nsf/artnum/n58530 .

Arjen K. Lenstra, 1989-2000, free lip.h, lip.c, long integer package, version 1.1. http://ecstr.com [Online].

Downloads

Published

2023-10-30

How to Cite

Kamil Hilal , B., Q.Jawad, M., & W.Shehab, A. (2023). XTR algorithm based encryption for Security in computer. Journal of Al-Qadisiyah for Computer Science and Mathematics, 15(1), Comp Page 117–208. https://doi.org/10.29304/jqcsm.2023.15.11294

Issue

Section

Computer Articles