Coprime solutions to ax≡b (mod n)
It is well known that a congruence ax≡b (mod n) has a solution if and only if , and, if the condition is satisfied, the number of incongruent solutions equals . In 2010, Alomair, Clark and Poovendran proved that the congruence ax≡b (mod n) has a solution coprime to n if and only if , as an auxiliary...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2013-10-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc-2013-5003 |