Displaying 3 results from an estimated 3 matches for "totient".
Did you mean:
torrent
2015 May 27
3
Weak DH primes and openssh
...re primes, then p is a "safe prime" and q
is a "Sophie Germain prime".
Small subgroup attacks are not possible for safe primes as long as you
test your peer's public share and the generator to ensure that they are
in the range (exclusive) 1 < x < p-1.
This is because totient(p) = p-1 (because p is prime), and p-1 has only
two factors: 2 and q. So there exists one small subgroup, but it's of
order 2, and its generator is p-1 (the subgroup cycles between p-1 and
1). All other elements are generators of order either q or p-1. There
are no other subgroups, iiuc.
If...
2004 Dec 08
2
Modulus Problem
R users, I am having a problem with the modulus operator for large
numbers as follows,
a <- 2
n <- 561
## n is the first Carmichael number, so by Fermat's Little Theorem the
below should equal zero.
(a^(n-1) - 1) %% n
[1] 2.193172e+152
## Seems that R and Fermat disagree
## Also,
1000000000000000000 %% 11
[1] -32
This seems like a bug. Should I be avoiding integer math for large
2015 May 26
8
Weak DH primes and openssh
On Tue 2015-05-26 14:02:07 -0400, Hubert Kario wrote:
> On Tuesday 26 May 2015 13:43:13 Daniel Kahn Gillmor wrote:
>> On Tue 2015-05-26 12:57:05 -0400, Hubert Kario wrote:
>> > creating composites that will pass even 100000 rounds of Miller-Rabin is
>> > relatively simple....
>> > (assuming the values for M-R tests are picked randomly)
>>
>> Can you