-- Crack a simple secret key cryptosystem.

New Message Reply About this list Date view Thread view Subject view Author view

kctang8 (kctang8@ie.cuhk.edu.hk)
Mon, 12 Apr 1999 17:14:08

Dear all,

please crack the following system:

Now n denote a positive integer of around 310 digits.
a,b,c and e denote positive integers less than n.
e and n are relatively prime.

plaintext: [a,b,c] and n
encryption: choose a secret number e,
            cyphertext =
            [A,B,C] = [e*a mod n , e*b mod n , e*c mod n]
decryption: the partner know e, he compute inv = e^(-1) mod n
            get plaintext
            [a,b,c]= [A*inv mod n, B*inv mod n, C*inv mod n]

note: e will be changed for every three numbers [a, b, c].

Does gcd(A,B,C) work fine in this case?

Yours Sincerely, kctang8

New Message Reply About this list Date view Thread view Subject view Author view

 
All trademarks and copyrights are the property of their respective owners.

Other Directory Sites: SeekWonder | Directory Owners Forum

The following archive was created by hippie-mail 7.98617-22 on Thu May 27 1999 - 23:44:22