Generating random factored Gaussian integers, easily
نویسندگان
چکیده
We present a (random) polynomial-time algorithm to generate a randomGaussian integer with the uniform distribution among those with norm at most N , along with its prime factorization. The method generalizes to finding a random ideal in the ring of integers of a quadratic number field together with its prime ideal factorization. We also discuss the analogous problem for higher degree number fields.
منابع مشابه
Generating Random Factored Ideals in Number Fields
We present a randomized polynomial-time algorithm to generate a random integer according to the distribution of norms of ideals at most N in any given number field, along with the factorization of the integer. Using this algorithm, we can produce a random ideal in the ring of algebraic integers uniformly at random among ideals with norm up to N , in polynomial time. We also present a variant of...
متن کاملGaussian Integers
We will investigate the ring of ”Gaussian integers” Z[i] = {a + bi | a, b ∈ Z}. First we will show that this ring shares an important property with the ring of integers: every element can be factored into a product of finitely many ”primes”. This result is the key to all the remaining concepts in this paper, which includes the ring Z[i]/αZ[i], analogous statements of famous theorems in Z, and q...
متن کاملComplete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کاملThe Number Field Sieve Factoring Algorithm
The idea of the NFS is rooted in work by Coppersmith, Odlyzko, and Schroeppel [9], who used the Gaussian integers, Z[i], to compute discrete logarithms in GF (p) in subexponential time. They looked for coprime integers, a and b such that the integer a+bx is smooth for some fixed integer value of x and over some factor base, and such that a+ bi is smooth over some factor base of primes in Z[i]. ...
متن کاملG ENERATION OF TRULY RANDOM NUMBERS WITH KNOWN FACTORIZATION ( December 2006 )
The number field sieve of factoring 1024-bit RSA keys has many steps involved, one of them being the ‘relation collection’ step. This step consists of two parts, the first part is called Sieving and is used to generate smooth random numbers (numbers whose factors are less than a given boundary), and these smooth numbers are factored in the second part by special factoring methods like ECM, p-1 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 85 شماره
صفحات -
تاریخ انتشار 2016