Results 31 to 40 of about 2,924 (299)
Factorization of big integer and the security of RSA
Three kinds of methods for integer factorization were proposed and the security of RSA was demarcated.RSA is a well-known cryptographic algorithm,using the analysis result of those methods.Through the work,readers could easily realize that if merely ...
Yan-bing REN
doaj +3 more sources
This article proposes a new method to inject backdoors in RSA (the public-key cryptosystem invented by Rivest, Shamir, and Adleman) and other cryptographic primitives based on the integer factorization problem for balanced semi-primes.
Marco Cesati
doaj +1 more source
Prime factors of consecutive integers [PDF]
This note contains a new algorithm for computing a function f ( k ) f(k)
Mark Bauer, Michael A. Bennett
openaire +1 more source
Integer factorization algorithms
The mathematical area of integer factorization has gone a long way since the early days of Pierre de Fermat, and with simpler algorithms developed in the last century such as the Trial division and Pollards rho algorithm to the more complex method of the
Nilsson, Joakim
core +1 more source
Conjugacy Systems Based on Nonabelian Factorization Problems and Their Applications in Cryptography
To resist known quantum algorithm attacks, several nonabelian algebraic structures mounted upon the stage of modern cryptography. Recently, Baba et al. proposed an important analogy from the integer factorization problem to the factorization problem over
Lize Gu, Shihui Zheng
doaj +1 more source
On the Tower Factorization of Integers
Under the fundamental theorem of arithmetic, any integer $n>1$ can be uniquely written as a product of prime powers $p^a$; factoring each exponent $a$ as a product of prime powers $q^b$, and so on, one will obtain what is called the tower factorization of $n$.
Jean-Marie De Koninck, William Verreault
openaire +2 more sources
Mersenne version of Brocard-Ramanujan equation
In this study, we deal with a special form of the Brocard-Ramanujan equation, which is one of the interesting and still open problems of Diophantine analysis.
Ayşe Nalli, Seyran İbrahimov
doaj +1 more source
Specialized integer factorization [PDF]
Vanstone and Zuccherato [3] propose a cryptographic system based on an elliptic curve modulo a composite number. We show that the composite numbers so constructed are easily factored, rendering the system insecure.
openaire +1 more source
Location‐Specific Hematoma Volume Predicts Early Neurological Deterioration in Supratentorial ICH
ABSTRACT Objective Early neurological deterioration (END) adversely affects outcomes in patients with intracerebral hemorrhage (ICH). This study aimed to determine the location‐specific hematoma volumes for END in supratentorial ICH patients. Methods We retrospectively analyzed supratentorial ICH patients presenting from two prospective cohorts.
Zuoqiao Li +10 more
wiley +1 more source
On certain arithmetical functions connected with the prime factorization of an integer [PDF]
If ...
József Sándor
doaj +1 more source

