Results 21 to 30 of about 2,661 (306)
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
Research on Quantum Annealing Integer Factorization Based on Different Columns
Frontiers in Physics, 2022 The majority of scholars believe that Shor’s algorithm is a unique and powerful quantum algorithm for RSA cryptanalysis, so current postquantum cryptography research has largely considered only the potential threats of Shor’s algorithm.
Baonan Wang, Xiaoting Yang, Dan Zhang
doaj +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
The Integer Factorization Algorithm With Pisano Period
IEEE Access, 2019 Large integer factorization is one of the basic issues in number theory and is the subject of this paper. Our research shows that the Pisano period of the product of two prime numbers (or an integer multiple of it) can be derived from the two prime ...
Liangshun Wu, H. J. Cai, Zexi Gong
doaj +1 more source
New integer factorizations [PDF]
Mathematics of Computation, 1983 New factorizations of Fibonacci numbers, Lucas numbers, and numbers of the form 2 n ± 1 {2^n} \pm 1 are presented together with the strategy (a combination of known factorization methods) used to obtain them.
openaire +2 more sources
Factoring Large Integers [PDF]
Mathematics of Computation, 1974 A modification of Fermat’s difference of squares method is used for factoring large integers. This modification permits factoring n in O ( n 1 / 3 ) O({n^{1/3}}) elementary operations,
openaire +1 more source
Lattice Points on the Fermat Factorization Method
Journal of Mathematics, 2022 In this paper, we study algebraic properties of lattice points of the arc on the conics x2−dy2=N especially for d=1, which is the Fermat factorization equation that is the main idea of many important factorization methods like the quadratic field sieve ...
Regis Freguin Babindamana +2 more
doaj +1 more source
Integer Factorization – Cryptology Meets Number Theory
Scientific Journal of Gdynia Maritime University, 2019 Integer factorization is one of the oldest mathematical problems. Initially, the interest in factorization was motivated by curiosity about behaviour of prime numbers, which are the basic building blocks of all other integers.
Josef Pieprzyk
doaj +1 more source
Binary Codes Based on Non-Negative Matrix Factorization for Clustering and Retrieval
IEEE Access, 2020 Traditional non-negative matrix factorization methods cannot learn the subspace from the high-dimensional data space composed of binary codes. One hopes to discover a compact parts-based representation composed of binary codes, which can uncover the ...
Jiang Xiong +3 more
doaj +1 more source