Results 11 to 20 of about 2,924 (299)
INTEGER FACTORIZATION IMPLEMENTATIONS [PDF]
ICTACT Journal on Communication Technology, 2016 One difficult problem of mathematics that forms the basics of some public key cryptography systems like RSA, is finding factors of big numbers. To solve this problem, many factorization algorithms have been offered with different complexities.
Reza Alimoradi, Hamid Reza Arkian
doaj +1 more source
DAIMI Report Series, 1983 <p>This report gives a summary of methods for factoring large integers and presents particular factorizations obtained by these methods using the computer facilities at DAIMI.</p><p>We have used trial division, the continued fraction method, Pollard's methods, and various tests for primality to obtain new factorizations of Fibonacci ...
Naur, Thorkil
openaire +3 more sources
Comparative Analysis Of Integer Factorization Algorithms Using Cpu And Gpu
MANAS: Journal of Engineering, 2017 In this work we have evaluated the running time of four integer factorization algorithms, namely, trial division algorithm, Fermat algorithm, Pollard rho and Brent algorithms.
Rita Ismailova +2 more
doaj +1 more source
A generalization of the ABS algorithms and its application to some special real and integer matrix factorizations [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2022 In 1984, Abaffy, Broyden, and Spediacto (ABS) introduced a class of the so-called ABS algorithms to solve systems of real linear equations. Later, the scaled ABS, the extended ABS, the block ABS, and the integer ABS algorithms were introduced leading to ...
E. Golpar Raboky, N. Mahdavi-Amiri
doaj +1 more source
Integer factorization with a neuromorphic sieve [PDF]
2017 IEEE International Symposium on Circuits and Systems (ISCAS), 2017 The bound to factor large integers is dominated by the computational effort to discover numbers that are smooth, typically performed by sieving a polynomial sequence. On a von Neumann architecture, sieving has log-log amortized time complexity to check each value for smoothness.
John V. Monaco, Manuel M. Vindiola
openaire +2 more sources
Integer Factorization with Compositional Distributed Representations
, 2022 In this paper, we present an approach to integer factorization using distributed representations formed with Vector Symbolic Architectures. The approach formulates integer factorization in a manner such that it can be solved using neural networks and ...
Olshausen, Bruno A. +21 more
core +1 more source
Scheme of extending elliptic curve method to three phases
网络与信息安全学报, 2018 Elliptic curve method for integer factorization (ECM) is one of the most popular integer factorization algorithms,and it was firstly proposed by Lenstra in 1985.The original ECM contained just first phase.Since its invention,researches about the ...
Guiwen LUO
doaj +3 more sources
Designs, Codes and Cryptography, 2000 The purpose of this survey is to describe how modern factoring algorithms work.
openaire +2 more sources
On the factorization of integrers [PDF]
Proceedings of the American Mathematical Society, 1970 The order of magnitude of the average of the exponents in the canonical factorization of an integer is discussed. In particular, it is shown that this average has normal order one and a result which implies that the average order is one is also derived.
openaire +1 more source
Integer Factorization by Quantum Measurements
, 2023 Quantum algorithms are at the heart of the ongoing efforts to use quantum mechanics to solve computational problems unsolvable on ordinary classical computers.
Mussardo, Giuseppe, Trombettoni, Andrea
core +3 more sources