Re: Mathematicizing the One-Time Pad Cipher.

On Thu, 1 Dec 2011 03:13:23 -0800 (PST), adacrypt
<austin.obyrne@xxxxxxxxxxx> wrote:

On Dec 1, 7:18 am, Mark Murray <w.h.o...@xxxxxxxxxxx> wrote:
On 01/12/2011 02:32, adacrypt wrote:
:

with the domain of the OTP i.e. the set of positive integers numbering
1 to 26 inclusively as being the code points of the English language
of the day circa 1920 (i.e. before ASCII)

Can it do a hypothetical alphabet that consists of the "letters" 0 to
255 inclusive?
:
Positive Integers. - adacrypt

So 1 .. 256, then (same as 0 .. 255, except you add 1 as part of the
encryption process and subtract it as part of decryption)?

M
--
Mark "No Nickname" Murray
Notable nebbish, extreme generalist.

To explain a bit better.

Any set of positive integers 1 to m is ok in this algorithm.

Any set of positive integers n to m is ok.

A set 0 to m is not ok.

You seem to be preoccupied with the full ASCII set (2^8) of 256 i.e.
0 to m is 0 to to 255 incl.

We are only interested in communication of information in this cipher
=> the ASCII subset 32 to 126 incl.

I suggest readers should concentrate on this subset as being just one
of many other sets of positive integers and perfect a general
understanding of the algorithm as applied to this for the time being
and then consider Unicode some time in the future. - adacrypt
You really don't get it, do you.

Encryption

Step 1: Read in plaintext as byte data (range 0 .. 255).
Step 2: Add 1 to every byte in the plaintext (range 1 .. 256). It is
now integer data.
Step 3: Encrypt integer data using adacrypt's method.

Decryption

Step 1: Decrypt integer plaintext using adacrypt's method. (range 1 ..
256)
Step 2: Subtract 1 from every integer in the decrypted plaintext and
convert to bytes (range 0 .. 255)
Step 3: Output plaintext as byte data.

You claim to be a computer programmer, and you cannot understand a
simple transformation of your data? You are not showing yourself in a
good light here.

rossum

.

Relevant Pages

  • Re: Mathematicizing the One-Time Pad Cipher.
    ... encryption process and subtract it as part of decryption)? ... Mark "No Nickname" Murray ... Notable nebbish, extreme generalist. ... > Any set of positive integers 1 to m is ok in this algorithm. ...
    (sci.crypt)
  • Re: Mathematicizing the One-Time Pad Cipher.
    ... Any set of positive integers 1 to m is ok in this algorithm. ... You seem to be preoccupied with the full ASCII set of 256 i.e. ... to m is 0 to to 255 incl. ... => the ASCII subset 32 to 126 incl. ...
    (sci.crypt)
  • a<b<c<a+b
    ... I need N, the set of natural numbers, positive integers, that is, and ... a way to write a,b,c,n in N. What's an accepted notation in ASCII for "in N" ... I fight terrorism by: Using less gasoline. ...
    (sci.math)