|
|
|
|
|
Barry Fagin
Previous work established the set of square-free integers n with at least one factorization ??=??¯??¯
n
=
p
¯
q
¯
for which ??¯
p
¯
and ??¯
q
¯
are valid RSA keys, whether they are prime or composite. These integers are exactly those with the property...
ver más
|
|
|
|
|
|
|
|
|
|
|
Barry Fagin
We explore the class of positive integers n that admit idempotent factorizations ??=??_??_
n
=
p
¯
q
¯
such that ??(??)|(??_-1)(??_-1)
?
(
n
)
|
(
p
¯
-
1
)
(
q
¯
-
1
)
, where ??
?
is the Carmichael lambda function. Idempotent factorizations with ??_
...
ver más
|
|
|
|
|
|
|
|
|
|
|
Barry Fagin
RSA key pairs are normally generated from two large primes p and q. We consider what happens if they are generated from two integers s and r, where r is prime, but unbeknownst to the user, s is not. Under most circumstances, the correctness of encryption...
ver más
|
|
|
|
|
|