Results 21 to 30 of about 391,497 (318)
Black-box optimization for integer-variable problems using Ising machines and factorization machines [PDF]
Black-box optimization has potential in numerous applications such as hyperparameter optimization in machine learning and optimization in design of experiments.
Yuya Seki, R. Tamura, Shu Tanaka
semanticscholar +1 more source
P System Design for Integer Factorization
Membrane computing is a natural computing branch inspired by the structure of biological cells. The mathematical abstract model of a membrane computing system is called a P System, which is one of the main topics in membrane computing research for the ...
Hai Nan+4 more
doaj +1 more source
Acceleration of Wheel Factoring Techniques
The efficiency with which an integer may be factored into its prime factors determines several public key cryptosystems’ security in use today. Although there is a quantum-based technique with a polynomial time for integer factoring, on a traditional ...
Alaa M. Zaki+4 more
doaj +1 more source
A time-space tradeoff for Lehman's deterministic integer factorization method [PDF]
Fermat's well-known factorization algorithm is based on finding a representation of natural numbers $N$ as the difference of squares. In 1895, Lawrence generalized this idea and applied it to multiples $kN$ of the original number.
Markus Hittmeir
semanticscholar +1 more source
Mixing Models as Integer Factorization: A Key to Sample Preparation With Microfluidic Biochips
Microfluidic biochips have recently emerged with significant promise and versatility in automating a variety of biochemical protocols on a tiny chip. Sample preparation, which involves the mixing of fluids with a specified target ratio in the minuscule ...
Debraj Kundu+6 more
semanticscholar +1 more source
A generalization of the ABS algorithms and its application to some special real and integer matrix factorizations [PDF]
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
On oracle factoring of integers
We present an oracle factorisation algorithm which finds a nontrivial factor of almost all positive integers $n$ based on the knowledge of the number of points on certain elliptic curves in residue rings modulo $n$.
Dąbrowski, Andrzej+2 more
openaire +2 more sources
Scheme of extending elliptic curve method to three phases
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
Although, Integer Factorization is one of the hard problems to break RSA, many factoring techniques are still developed. Fermat’s Factorization Algorithm (FFA) which has very high performance when prime factors are close to each other is a type of ...
Kritsanapong Somsuk
semanticscholar +1 more source
New integer factorizations [PDF]
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 +3 more sources