Login
Forgot Password?

OR

Login with Google Login with Twitter Login with Facebook
  • Join
  • Profiles
  • Groups
  • SuicideGirls
  • Photos
  • Videos
  • Shop
Vital Stats

mongoofy

Bay View, Wiscompton

Member Since 2002

Followers 120 Following 138

  • Everything
  • Photos
  • Video
  • Blogs
  • Groups
  • From Others

Wednesday Apr 11, 2007

Apr 11, 2007
0
  • Facebook
  • Tweet
  • Email
Select primes p=11, q=3.
n = pq = 11.3 = 33
phi = (p-1)(q-1) = 10.2 = 20
Choose e=3
Check gcd(e, p-1) = gcd(3, 10) = 1 (i.e. 3 and 10 have no common factors except 1),
and check gcd(e, q-1) = gcd(3, 2) = 1
therefore gcd(e, phi) = gcd(e, (p-1)(q-1)) = gcd(3, 20) = 1
Compute d such that ed ? 1 (mod phi)
i.e. compute d = e^-1 mod phi = 3^-1 mod 20
i.e. find a value for d such that phi divides (ed-1)
i.e. find d such that 20 divides 3d-1.
Simple testing (d = 1, 2, ...) gives d = 7
Check: ed-1 = 3.7 - 1 = 20, which is divisible by phi.
Public key = (n, e) = (33, 3)
Private key = (n, d) = (33, 7).
This is actually the smallest possible value for the modulus n for which the RSA algorithm works.

Now say we want to encrypt the message m = 7,
c = m^e mod n = 7^3 mod 33 = 343 mod 33 = 13.
Hence the ciphertext c = 13.

To check decryption we compute
m' = c^d mod n = 13^7 mod 33 = 7.
Note that we don't have to calculate the full value of 13 to the power 7 here. We can make use of the fact that a = bc mod n = (b mod n).(c mod n) mod n so we can break down a potentially large number into its components and combine the results of easier, smaller calculations to calculate the final value.

One way of calculating m' is as follows:-
m' = 13^7 mod 33 = 13^(3+3+1) mod 33 = 13^3.13^3.13 mod 33
= (13^3 mod 33).(13^3 mod 33).(13 mod 33) mod 33
= (2197 mod 33).(2197 mod 33).(13 mod 33) mod 33
= 19.19.13 mod 33 = 4693 mod 33
= 7.

Now if we calculate the ciphertext c for all the possible values of m (0 to 32), we get

m 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16c 0 1 8 27 31 26 18 13 17 3 10 11 12 19 5 9 4m 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32c 29 24 28 14 21 22 23 30 16 20 15 7 2 6 25 32Note that all 33 values of m (0 to 32) map to a unique code c in the same range in a sort of random manner. In this case we have nine values of m that map to the same value of c - these are known as unconcealed messages. m = 0 and 1 will always do this for any N, no matter how large. But in practice, higher values shouldn't be a problem when we use large values for N.

If we wanted to use this system to keep secrets, we could let A=2, B=3, ..., Z=27. (We specifically avoid 0 and 1 here for the reason given above). Thus the plaintext message "HELLOWORLD" would be represented by the set of integers m1, m2, ...

{9,6,13,13,16,24,16,19,13,5}Using our table above, we obtain ciphertext integers c1, c2, ...

{3,18,19,19,4,30,4,28,19,26}Note that this example is no more secure than using a simple Caesar substitution cipher, but it serves to illustrate a simple example of the mechanics of RSA encryption.

Remember that calculating m^e mod n is easy, but calculating the inverse c^-e mod n is very difficult, well, for large n's anyway. However, if we can factor n into its prime factors p and q, the solution becomes easy again, even for large n's. Obviously, if we can get hold of the secret exponent d, the solution is easy, too.
VIEW 7 of 7 COMMENTS
avidity:
i miss you....where did you go??
Apr 14, 2007
nanci:
Thanks... Sorry its taken me so so long to get back my pc died (see new blog) Hope your well.
xxx
Apr 14, 2007

More Blogs

  • 03.27.07
    21

    Tuesday Mar 27, 2007

    Read More
  • 03.22.07
    8

    Friday Mar 23, 2007

    THE COCKSMITHS
  • 03.18.07
    8

    Sunday Mar 18, 2007

    THE WAR IS OVER!!! My project is done, death to it in all its glor…
  • 03.13.07
    14

    Wednesday Mar 14, 2007

    Nothing like some new graphics on your homepage to make ya wanna ROCK…
  • 03.12.07
    6

    Monday Mar 12, 2007

    BADGES!?
  • 03.11.07
    3

    Sunday Mar 11, 2007

    I'm here...
  • 03.07.07
    8

    Thursday Mar 08, 2007

    Thanks for the birthday well wishings all - rather uneventful bday in…
  • 03.06.07
    24

    Tuesday Mar 06, 2007

    [[blows horn]]
  • 03.05.07
    8

    Monday Mar 05, 2007

    Read More
  • 03.02.07
    17

    Friday Mar 02, 2007

    All thats keeping me sane right now... Got rid of the top friends …

We at SuicideGirls have been celebrating alternative pin-up girls for:

24
years
0
months
17
days
  • 5,509,826 fans
  • 41,393 fans
  • 10,327,617 followers
  • 4,610 SuicideGirls
  • 1,113,818 followers
  • 14,979,875 photos
  • 321,315 followers
  • 61,532,858 comments
  • Join
  • Profiles
  • Groups
  • Photos
  • Videos
  • Shop
  • Help
  • About
  • Press
  • LIVE

Legal/Tos | DMCA | Privacy Policy | 18 U.S.C. 2257 Record-Keeping Requirements Compliance Statement | Complaint / Content Removal Policy | Contact Us | Vendo Payment Support
©SuicideGirls 2001-2025

Press enter to search
Fast Hi-res

Click here to join & see it all...

Crop your photo