Re: Probabilistic polynomial time algorithm for solving the DLOG problem
 From: Pubkeybreaker <pubkeybreaker@xxxxxxx>
 Date: Fri, 27 May 2011 06:40:42 0700 (PDT)
On May 27, 2:59 am, Jeffrey Goldberg <nob...@xxxxxxxxxxxx> wrote:
On 110526 9:22 PM, Jeffrey Goldberg wrote:
On 110526 7:37 PM, Maaartin G wrote:
Using the hint that Pubkeybreaker gave that "Subgroups with size
5,7,8,9,10,11 are impossible" along with your example of even numbers
then a first guess is that [turned out to be wrong]
I'll play with this this evening. Thanks!
I got stuck on the proof. The actual pattern is instantly clear.
For a Group {0, 1, ..., m1} with a * b = a + b mod m, then for every n
such that n divides m there is a subgroup S_n containing all the
multiples of n mod m
Stop prattling and go READ.
The above statement is NOT TRUE. S_n has special meaning within
group theory. You would learn this if you bothered to do the
required
background reading.
You should also consider cases where m is prime, and where m is
odd.......
So in the case of m = 12 there are six subgroups including {0} and also
the not quite proper subgroup where n = 1, {0, 1, ..., 11}.
Do you know why all the subgroups must contain 0????
that only those sets will be subgroups. Maybe I'll have to look up
Legrange's work after all. But I was hoping that I could prove this all
on my own.
Prove what on your own??? You have not stated a formal conjecture.
You should have STARTED by taking my hint and looking up Lagrange's
Thm. Look up "Sylow" as well.
READ.
.
 FollowUps:
 Re: Probabilistic polynomial time algorithm for solving the DLOG problem
 From: Jeffrey Goldberg
 Re: Probabilistic polynomial time algorithm for solving the DLOG problem
 References:
 Re: Probabilistic polynomial time algorithm for solving the DLOG problem
 From: Maaartin G
 Re: Probabilistic polynomial time algorithm for solving the DLOG problem
 From: Jeffrey Goldberg
 Re: Probabilistic polynomial time algorithm for solving the DLOG problem
 From: Jeffrey Goldberg
 Re: Probabilistic polynomial time algorithm for solving the DLOG problem
 Prev by Date: Re: Commercial Quantum Computer for sale
 Next by Date: Re: Probabilistic polynomial time algorithm for solving the DLOG problem
 Previous by thread: Re: Probabilistic polynomial time algorithm for solving the DLOG problem
 Next by thread: Re: Probabilistic polynomial time algorithm for solving the DLOG problem
 Index(es):
Relevant Pages
