Forum

Forum Profile

cfreuden

Statistics

4

Posts

0

Topics

Recent posts (View all)
Re: Challenge

 On Jan. 18, 2016, 2:29 p.m.

ok finally got it - Modular exponentiation is key here, should have just read the docu on the python pow() function… ;-)

Re: Fermat works well, but...

 On Jan. 15, 2016, 7:14 p.m.

It's a while since I solved this challenge so I'm not quite sure, but I think this is your problem:
To get the plaintext it is not ct^d but ct^d mod N

Fermat works well, but...

 On Jan. 15, 2016, 3:05 p.m.

I had no problems finding the factors for N but I am stuck anyway.

N is 300+ digit figure, my solutions for p and q are 150+ digit figures - so far so good.…

Re: Challenge "Factorization Cipher — Part 1"

 On Jan. 11, 2016, 6:45 p.m.

Look at the 7 examples.
They are the prime source of information.
Look at the differences and similarities of the plaintexts and try to see how the co…


Currently 22 guests and 0 members are online.
Powered by the CrypTool project
Contact | Privacy | Imprint
© 2009-2024 MysteryTwister team