Welcome to DU! The truly grassroots left-of-center political community where regular people, not algorithms, drive the discussions and set the standards. Join the community: Create a free account Support DU (and get rid of ads!): Become a Star Member Latest Breaking News Editorials & Other Articles General Discussion The DU Lounge All Forums Issue Forums Culture Forums Alliance Forums Region Forums Support Forums Help & Search

Website, DB, & Software Developers

Recursion

(56,582 posts)

1. If I'm understanding your description, that's called a "one time pad"

Reply to IDemo (Original post)

Fri Jul 5, 2013, 11:15 AM

Jul 2013

It is theoretically indecipherable, as long as you only use the random data once. If you reuse the pad, you can perform statistical analysis.

The other downside is distributing the pad to begin with to both parties -- if you have a trustworthy channel to do that, why do you need encryption in the first place?

Edit history

Please sign in to view edit histories.

Recommendations

0 members have recommended this reply (displayed in chronological order):

7 replies

= new reply since forum marked as read

Highlight:

A question on an encryption method [View all] IDemo Jul 2013 OP

If I'm understanding your description, that's called a "one time pad" Recursion Jul 2013 #1

Upon a quick Wiki check, yes IDemo Jul 2013 #2

Kerchoff's postulate Recursion Jul 2013 #3

Isn't this how software like PGP works? ManiacJoe Jul 2013 #4

No; one time pad is symmetric key, PGP is asymmetric key Recursion Jul 2013 #5

Gotcha. Thanks for the correction. ManiacJoe Jul 2013 #6

What you describe is a one-time pad... ljm2002 Nov 2013 #7