Processing math: 100%

Jim_Moriarty_'s blog

By Jim_Moriarty_, history, 5 years ago, In English

Can anyone explain the relation between modular inverse of p^k and p^(k-1) given M. Any help would be appreciated.

  • Vote: I like it
  • -6
  • Vote: I do not like it

»
5 years ago, # |
Rev. 3   Vote: I like it +6 Vote: I do not like it

if m is prime we have Fermat's little theorem :
(pk)m11modm
(pk)m2pkmodm
(pk1)m2pm2pkmodm
pk+1pm2pkmodm
pk+1p1pkmodm

if m is not prime see Euler's theorem
also, check modular-inverce cp algorithms

»
5 years ago, # |
  Vote: I like it +6 Vote: I do not like it

pk11p(k1)pk+1pk1p