Re: How do I do this problem without a calculator?




bell3774@xxxxxxxxx wrote:
I don't understand.

in response to what Chip Eastham wrote:

bell3774@xxxxxxxxx wrote:
6^19 mod 22

19 is prime, but Fermat's Little Theorem requires p+1 to work...

You might want Euler's generalization of Fermat's Little Thm.

It doesn't matter that 19 is prime. You need to consider the
modulus 22.

Fermat's Little Theorem says that if p is prime:

x^(p-1) = 1 mod p

for any x not divisible by p.

In your problem, calculating 6^19 mod 22 (presumably asking
to find the reduced nonnegative residue mod 22), the modulus
22 is not prime! And furthermore the base x = 6 that is being
raised to a power has a factor 2 in common with modulus 22.

One approach, not discussed by other notes in this thread so
far, would be to consider the computation modulo 2 and again
modulo 11. You can then piece together the answer modulo
22 from the separate answers for 2 and 11.

However I don't want you to get bogged down trying to follow
every different approach being suggested here. Pick one and
work it through!

Later you may have time to come back and verify that all
the suggested approaches lead to the same answer.


regards, chip

.



Relevant Pages

  • Re: How do I do this problem without a calculator?
    ... Chip Eastham wrote: ... You might want Euler's generalization of Fermat's Little Thm. ... modulus 22. ...
    (sci.math)
  • Re: Rabin vs. RSA/ElGamal
    ... roots for me modulo your modulus, ... But then, so is "raw RSA". ... permutation into a full-blown public-key encryption scheme. ... or cubing modulo N -- a building block, not something it makes sense to ...
    (sci.crypt)
  • Re: Is there any COBOL program for verify the SSN?
    ... Modulus 11 is NOT the same as Modulo 11. ... The Luhn algorithm or Luhn formula, also known as the "modulus 10" or "mod 10" algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers and Canadian Social Insurance Numbers. ...
    (comp.lang.cobol)
  • Re: RSA Private Key representation
    ... Use the secret exponent to factor the modulus. ... factor the modulus if we have the public key and the private key ... Modulo n, we have four square roots of one, 1, -1, and two ... if we can find a non-trivial square root of one modulo n, ...
    (sci.crypt)
  • Re: [QUIZ] Modular Arithmetic (#179)
    ... one less than the modulus. ... we must use the appropriate congruent value modulo 24. ... While most operations will be straightforward, modular division is a ... def coerce ...
    (comp.lang.ruby)