Jump to content

  • Log In with Google      Sign In   
  • Create Account

#ActualBacterius

Posted 04 March 2013 - 01:20 AM

Check out the modular multiplicative inverse. This is the equivalent of division modulo some number. Implementing it using the EEA can be tricky, though there is a shortcut.

 

Also, as Frob says, you have the wrong decryption function. You're trying to get "x" back, not "a". Look through it again.

 

Also, for bonus points, implement a message decryption function without using "a" nor "b". wink.png


#3Bacterius

Posted 04 March 2013 - 01:20 AM

Check out the modular multiplicative inverse. This is the equivalent of division modulo some number. Implementing it using the EEA can be tricky, though there is a shortcut.

 

Also, as Frob says, you have the wrong decryption function. You're trying to get "x" back, not "a". Look through it again.

 

Also, for bonus points, implement the decryption function without using "a" nor "b". wink.png


#2Bacterius

Posted 04 March 2013 - 01:15 AM

Check out the modular multiplicative inverse. This is the equivalent of division modulo some number. Implementing it using the EEA can be tricky, though there is a shortcut.

 

Also, as Frob says, you have the wrong decryption function. You're trying to get "x" back, not "a". Look through it again.


#1Bacterius

Posted 04 March 2013 - 01:14 AM

Check out the modular multiplicative inverse. This is the equivalent of division modulo some number. Implementing it using the EEA can be tricky, though there is a shortcut.


PARTNERS