Rivest, Shamir, Adleman - The RSA Algorithm Explained

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
8,907
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Jan 3, 2011

"It is perfectly sound and usable into the future."

Part of the Giants Among Us series in celebration of RSA Conference's 20th anniversary

Category:

Science & Technology

Tags:

License:

Standard YouTube License

  • likes, 0 dislikes

Link to this comment:

Share to:
see all

All Comments (14)

Sign In or Sign Up now to post a comment!
  • @Thomasikzelf No, no computer search for a prime number, there's a prime number list already made, the computer only search of 2 prime numbers (of that list) that computed between them selfs results in the length size defined.

    After the handshake everything gets faster cuz normally it's used AES or DES in this case the processing is quite faster

  • @tsunamyboy69 i think the length of the key is limited by the largest prime number found, and how faster the computers get how more prime numbers can be found, but also how faster the "handshake" can be done (and how faster the key can be bruteforced).

    so the handshake get's slower but the computers get faster so it stays in balance :)

  • @Thomasikzelf sometimes the time compensates the information cracked : )

    The huge problem is that you can't use more than 4096bits because how much more bit leng you key has more time you 'll need to wait for the shake hand, And the server will suffer a lot with every shake hand.

  • @tsunamyboy69 yeah but as phenethylaminedreams points out "The highest RSA that has been cracked is 768". it will take a long time to revert that!

  • @Thomasikzelf No you don't! You can revert the private key using the public key (remember that you always get the public key)

  • @tsunamyboy69 you need physical acces to the server to use that vulnerability (so why not get the private key directly from the server:P?)

  • @phenethylaminedreams oh i didn't know the right term : )

    Also thanks for the feedback i was searching for the better key length : )

  • @tsunamyboy69

    That isn't a crack. That article is horribly misleading. The highest RSA that has been cracked is 768

    1024 is deprecated, because it may be cracked sometime in the next 5 years, *MAYBE*, but if you use 4096 bit keys, it's possible that computing power will never be sufficient within even our lifetime to break it.

  • Shut these guys down now.

  • The 1024bit RSA was already cracked in a month. In short description: they get the private key reverting byte by byte of the public key.

    You can see a similar news here:

    engadget.com/2010/03/09/1024-b­­­it-rsa-encryption-cracked-by­-­c­arefully-starving-cpu-of-e­le­/

    So my concern is; is RSA still strong enough?

    The problem was because of any OpenSSL "vulnerability"?

    Could anyone answer me back please : (

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more