Results 11 to 20 of about 2,661 (306)
Scalable set of reversible parity gates for integer factorization [PDF]
Communications Physics, 2023 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 +4 more sources
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 +2 more sources
Labeled Factorization of Integers [PDF]
The Electronic Journal of Combinatorics, 2009 The labeled factorizations of a positive integer $n$ are obtained as a completion of the set of ordered factorizations of $n$. This follows a new technique for generating ordered factorizations found by extending a method for unordered factorizations that relies on partitioning the multiset of prime factors of $n$.
Augustine O. Munagi
openalex +3 more sources
A Practical Analysis of the Fermat Factorization and Pollard Rho Method for Factoring Integers
Lontar Komputer, 2021 The development of public-key cryptography generation using the factoring method is very important in practical cryptography applications. In cryptographic applications, the urgency of factoring is very risky because factoring can crack public and ...
Aminudin Aminudin, Eko Budi Cahyono
doaj +3 more sources
Faster deterministic integer factorization [PDF]
Mathematics of Computation, 2013 The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(M_int(N^(1/4) log N)), where M_int(k) denotes the cost of multiplying k-bit integers. This result is due to Bostan--Gaudry--Schost, following the Pollard--Strassen approach.
Edgar Costa, David Harvey
openalex +4 more sources
Automatic Extraction and Compensation of P-Bit Device Variations in Large Array Utilizing Boltzmann Machine Training [PDF]
MicromachinesA 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]
PLoS ONEFor 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]
International Journal of Group Theory, 2023 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
Applied Sciences, 2023 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
Mathematics, 2023 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