Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



Re: A Practical Infinite 1timepad Cypher Messaging System!
Posted:
Aug 19, 2014 8:39 PM


On Tuesday, August 19, 2014 3:42:53 AM UTC+10, Spac...@hotmail.com wrote: > ah, don't use baseinfinityu > > ;thanks >
In BASE 32 the algorithm is 1 cypher value per text character and simpler to follow...
SECRET CYPHER: 11111222223333344444 (20 digits long)
MESSAGE: 'SATURDAY'
1ST LETTER = 'S'
ENCRYPT 
FOR EACH LETTER REPEAT:
i = rand(100000000000000000000, 99999999999999999999)
UNTIL CC[ CYPHER+i ] = LETTER WRITE i NEXT LETTER
Now Champernowne16's Constant is
0.123456789ABCDEFGHIJKLMNOPQRSTUVW1011121314...
0.<cypher value><i>S
Given i, but you don't know the CYPHER VALUE it's practically impossible to guess the digit position to lookup the value 'S'
There are 2 minor inefficiencies. It takes on average 16 random attempts to match to any NUMERAL 'S' in the digit expansion range.
Every letter of text sent takes 2050 digits to transmit depending on the level of security wanted.
CC[I] should be a lot faster function than looking up digits of other irrational generation functions. Even looking up PI2_i the iTH digit of PI in binary uses a summation loop from 1..i
Have you heard MUD NEWS Today?
www.MUD.com/news



