Re: Generators of cyclic group
From: Anton Stiglic (stiglic_at_cs.mcgill.ca)
Date: 10/29/03
- Next message: Gregory G Rose: "Re: Is it possible to devise a public-key cipher with no flaws?"
- Previous message: cesar bremer: "First Commercial Optical Processor"
- In reply to: Robin Lavall?e: "Generators of cyclic group"
- Next in thread: Mok-Kong Shen: "Re: Generators of cyclic group"
- Reply: Mok-Kong Shen: "Re: Generators of cyclic group"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Wed, 29 Oct 2003 10:32:33 -0800
I think you can use a counting argument. You have already
proved that quadratic residues mod p cannot be generators.
You also proved that -1 cannot be a generator. How many
elements are left? And how many generators are their mod p
where p = 2q+ 1 with q prime (Euler phi function will help
out here...).
--Anton
- Next message: Gregory G Rose: "Re: Is it possible to devise a public-key cipher with no flaws?"
- Previous message: cesar bremer: "First Commercial Optical Processor"
- In reply to: Robin Lavall?e: "Generators of cyclic group"
- Next in thread: Mok-Kong Shen: "Re: Generators of cyclic group"
- Reply: Mok-Kong Shen: "Re: Generators of cyclic group"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]