Analysis of algorithms of generating key parameters for the XTR cryptosystems

Rok, strany: 2006, 189 - 198

In the paper [A. K. Lenstra and E. R. Verheul: The XTR public key system, Proceedings of CRYPTO '00, Lecture Notes in Comput. Sci, 1880, Springer-Verlag, Berlin, (2000), pp. 1–19] a new public key system XTR was introduced. In the same paper they proposed a practical method to select primes $p$ and $q$ such that $q mid(p²-p+1)$, $p equiv 2 pmod 3$ which are the key parameters for XTR. An analysis of running times of algorithms generating such primes relies upon some unproved conjectures. The aim of the present paper is to analyze algorithms proposed by A. K. Lenstra and E. R. Verheul under the assumption of hypotheses $H$ and $S$.

ISO 690:

Grześkowiak, M. 2006. Analysis of algorithms of generating key parameters for the XTR cryptosystems. In Tatra Mountains Mathematical Publications, vol. 33, no.1, pp. 189-198. 1210-3195.

APA:

Grześkowiak, M. (2006). Analysis of algorithms of generating key parameters for the XTR cryptosystems. Tatra Mountains Mathematical Publications, 33(1), 189-198. 1210-3195.