Results 11 to 20 of about 82,510 (316)
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
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
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
A NUMBER THEORETIC FUNCTION AND ITS MEAN VALUE PROPERTY [PDF]
, 1996 Let p be a prime, n be any positive integer, a(n,p) denotes the power of p in the factorization of n!
Liu, HONGYAN, ZHANG, WENPENG
core +1 more source
Transfinite Lyndon words [PDF]
, 2020 In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a relaxation of the ...
Boasson, Luc, Carton, Olivier
core +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
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