Results 271 to 280 of about 82,510 (316)
Some of the next articles are maybe not open access.
2018
Most cryptographic systems are based on an underlying difficult problem. The RSA cryptosystem and many other cryptosystems rely on the fact that factoring a large composite number into two prime numbers is a hard problem. The are many algorithms for factoring integers.
Kannan Balasubramanian +1 more
openaire +1 more source
Most cryptographic systems are based on an underlying difficult problem. The RSA cryptosystem and many other cryptosystems rely on the fact that factoring a large composite number into two prime numbers is a hard problem. The are many algorithms for factoring integers.
Kannan Balasubramanian +1 more
openaire +1 more source
Integer Factorization Using Hadoop
2011 IEEE Third International Conference on Cloud Computing Technology and Science, 2011Integer factorization is an interesting but a hard problem and stays at the core of many security mechanisms. Conventional approaches to factor big integer numbers often require powerful computers and a great effort in software development. In this paper, we present a different approach to this problem by running the quadratic sieve algorithm in the ...
Son T. Nguyen +3 more
openaire +1 more source
2014
The Diffie–Hellman key exchange method and the Elgamal public key cryptosystem studied in Sects. 2.3 and 2.4 rely on the fact that it is easy to compute powers \(a^{n}\bmod p\), but difficult to recover the exponent n if you know only the values of a and \(a^{n}\bmod p\).
Jeffrey Hoffstein +2 more
openaire +1 more source
The Diffie–Hellman key exchange method and the Elgamal public key cryptosystem studied in Sects. 2.3 and 2.4 rely on the fact that it is easy to compute powers \(a^{n}\bmod p\), but difficult to recover the exponent n if you know only the values of a and \(a^{n}\bmod p\).
Jeffrey Hoffstein +2 more
openaire +1 more source
Factorization of large integers
Journal of Soviet Mathematics, 1988See the review in Zbl 0602.10007.
openaire +2 more sources
Integer topological defects organize stresses driving tissue morphogenesis
Nature Materials, 2022Pau Guillamat +2 more
exaly
1993
We describe an experimental factoring method for numbers of form x3+k; at present we have used only k=2. The method is the cubic version of the idea given by Coppersmith, Odlyzko and Schroeppel (Algorithmica 1 (1986), 1–15), in their section ‘Gaussian integers’. We look for pairs of small coprime integers a and b such that: i. the integer a+bx is
openaire +1 more source
We describe an experimental factoring method for numbers of form x3+k; at present we have used only k=2. The method is the cubic version of the idea given by Coppersmith, Odlyzko and Schroeppel (Algorithmica 1 (1986), 1–15), in their section ‘Gaussian integers’. We look for pairs of small coprime integers a and b such that: i. the integer a+bx is
openaire +1 more source