Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: A Practical Infinite 1-time-pad Cypher Messaging System!
Replies: 2   Last Post: Aug 19, 2014 8:39 PM

 Messages: [ Previous | Next ]
 Graham Cooper Posts: 4,495 Registered: 5/20/10
A Practical Infinite 1-time-pad Cypher Messaging System!
Posted: Aug 18, 2014 8:39 AM

Using irrational numbers for cypher pads is not new
however calculation of the nTH digit of pi, sqrt(2) etc.

at the

123456789012345678901234567890TH digit

assuming 30 digit numbers are hard to guess with brute force...

is too intensive in calculations to be effective.

---------------------------------

What's needed is a FAST irrational non repeating pattern
of digits calculation algorithm, such as:

CHAMPERNOWNE'S CONSTANT

0.1234567891011121314....

At first it seems quite useless for a cypher as the digit
blocks repeat one after another with only the final digit
regularly changing.

e.g. at the MILLIONTH DIGIT POSITION

...5555556555555755555585555559555....

which is not much better than a repeating 7 digit string of digits.

-------------------------------

However all that's needed is a LOOKUP SYSTEM where
the digit position is hidden from intermediate communication nodes
so only the SENDER and RECEIVER know which digit position
of C.C. to lookup and see what the number>>letter is!

e.g.

SECRET CYPHER: 11111222223333344444 (20 digits long)

MESSAGE: H E L L O

LETTER = 'H' (8)
REPEAT:

i = rand(100000000000000000000, 99999999999999999999)

UNTIL CC[ CYPHER+i ]*10 + CC[CYPHER+i+1] = LETTER

WRITE CC[ CYPHER+i ]*10 + CC[CYPHER+i+1]

This is a RANDOM ACCESS CYPHER approach
where the N.S.A. has NO FURKEN CLUE

www.MUD.com/news

Date Subject Author
8/18/14 Graham Cooper
8/18/14 Brian Q. Hutchings
8/19/14 Graham Cooper