Results 281 to 290 of about 391,497 (318)
High-dimensional neuronal activity from low-dimensional latent dynamics: a solvable model
Schmutz V +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Integer Factorization: Why Two-Item Joint Replenishment Is Hard
Operational Research, 2022Joint replenishment problems constitute an important class of models in inventory management. They exhibit aspects of possible coordination among multiple products to save costs.
Andreas S. Schulz, C. Telha
semanticscholar +1 more source
Quantum Computing Algorithms for Integer Factorization: A Comparative Analysis
Modern Dynamics: Mathematical ProgressionsThe field of quantum computing has witnessed remarkable advancements in recent years, particularly in its potential applications to solve computationally hard problems such as integer factorization.
Dr. Nadia Ahmed
semanticscholar +1 more source
KỶ YẾU HỘI NGHỊ KHOA HỌC CÔNG NGHỆ QUỐC GIA LẦN THỨ XI NGHIÊN CỨU CƠ BẢN VÀ ỨNG DỤNG CÔNG NGHỆ THÔNG TIN, 2018
: This paper proposes a new digital signature scheme based on the hardness of solving simultaneously two problems: the integer factorization problem and the discrete logarithms problem in combined with the problem of finding roots on the ideal Z n .
L. H. Dung, T. Duc, Luu Xuan Van
semanticscholar +1 more source
: This paper proposes a new digital signature scheme based on the hardness of solving simultaneously two problems: the integer factorization problem and the discrete logarithms problem in combined with the problem of finding roots on the ideal Z n .
L. H. Dung, T. Duc, Luu Xuan Van
semanticscholar +1 more source
A Method of Integer Factorization
2021Suppose that we want to factor integer where \(N=pq\), p, q are two distinct odd primes. Then we can reduce the problem of integer factorization to computing the generators of the Mordell-Weil group of \(E_{Nr}:y^{2}=x^{3}-Nrx\), where r is a suitable integer with \((r,N)=1\). We consider the family of elliptic curves \(E_{Nr}\).
Xiao Li, Zhizhong Pan
openaire +2 more sources
Factorization of large integers
Journal of Soviet Mathematics, 1988See the review in Zbl 0602.10007.
openaire +3 more sources
Cryptanalysis of RSA: Integer Prime Factorization Using Genetic Algorithms
IEEE Congress on Evolutionary Computation, 2020In recent years, researchers have been exploring alternative methods to solving Integer Prime Factorization, the decomposition of an integer into its prime factors.
E. Rutkowski, S. Houghten
semanticscholar +1 more source
2000
The purpose of this survey is to describe how modern factoring algorithms work.
openaire +3 more sources
The purpose of this survey is to describe how modern factoring algorithms work.
openaire +3 more sources
Integer Factorization and RSA [PDF]
, 2014 The Diffie–Hellman key exchange method and the Elgamal public key cryptosystem studied in Sects. 2.3 and 2.4 rely on the fact that it is easy to compute powers \(a^{n}\bmod p\), but difficult to recover the exponent n if you know only the values of a and \(a^{n}\bmod p\).
Joseph H. Silverman +2 more
openaire +1 more source
On the oracle complexity of factoring integers [PDF]
Computational Complexity, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source