Scalable set of reversible parity gates for integer factorization [PDF]
Classical microprocessors operate on irreversible gates, that, when combined with AND, half-adder and full-adder operations, execute complex tasks such as multiplication of integers.
Martin Lanthaler +2 more
doaj +2 more sources
INTEGER FACTORIZATION IMPLEMENTATIONS [PDF]
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 +2 more sources
Automatic Extraction and Compensation of P-Bit Device Variations in Large Array Utilizing Boltzmann Machine Training [PDF]
A Probabilistic Bit (P-Bit) device serves as the core hardware for implementing Ising computation. However, the severe intrinsic variations of stochastic P-Bit devices hinder the large-scale expansion of the P-Bit array, significantly limiting the ...
Bolin Zhang +6 more
doaj +2 more sources
A novel approach to explore common prime divisor graphs and their degree based topological descriptor. [PDF]
For the construction of a common prime divisor graph, we consider an integer [Formula: see text] with its prime factorization, where [Formula: see text] are distinct primes and [Formula: see text] are fixed positive integers. Every divisor of the integer
Ali N A Koam +3 more
doaj +2 more sources
Remark on Laquer's theorem for circulant determinants [PDF]
Olga Taussky-Todd suggested the problem of determining the possible values of integer circulant determinants. To solve a special case of the problem, Laquer gave a factorization of circulant determinants. In this paper, we give a modest generalization of
Naoya Yamaguchi, Yuka Yamaguchi
doaj +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 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
Research on Quantum Annealing Integer Factorization Based on Different Columns
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
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

