# Re: Is there a Mathematician Cryptographr in the House.

On Jul 18, 6:19 pm, Mok-Kong Shen <mok-kong.s...@xxxxxxxxxxx> wrote:
Huge typo omission here,

I should have stated that N is in the range (X +127) and 2(X+32).

Then X works out to 63 (=>  N =190) and the number of N's (as keys)
works out to 14000 - 63.

The strength of this cipher is then in the decryption equation being
one equation in three unknowns - two of the unknowns are the random
keys (Key and N) in the equation - being random makes them totally

Your formulation, also in the first post, is not clear for me. Anyway,
if you want to exploit indeterminancy to enhance security, then simply
xoring two pseudo-random strams R1 and R2 (assumed independent, both,
say, of 32 bit units) will do the job:

C = R1 ^ R2 ^ P

where P and C are the plaintext and ciphertext units. This is of course
equivalent to:

R = R1 ^ R2      C = R ^ P

So the xoring is properly to be considered to be internal to the
single PRNG that generates R. One could however profitably do something
more in the combination for achieving higer security, see my thread
"A simple scheme of combining PRNGs" of 01.06.2010.

M. K. Shen

Hi, There is much more to it than that - I am not sure really what you
mean because there is a suggestion of PRNGS in your methods which are
taboo to me - I don't use PRNGS ever.

The set of N's that can be paired with every possible pairing of Key
and Plaintext as moduli in the algorithm [(X +Key) + (X +Plaintext)]
(Mod N) = a residue (Mod N) >=0
are not found by any mathematical formula - they were found by
validating in a specially designed test program - the program is
that is available from my website (see link earlier) - the program can
be run just to satisfy a user's curiosity but once it is understood
the range of N's can be written down directly in future - a general
message length is decided first of all then the lower bound of N
becomes (X +127) and the upperbound is 2(X +32) where X is max
keylength +63. Why 63 - this is seen by experimenting - the general
idea is to understand how to write this down by direct inspection of
the scheme parameters - the theory behind it is related to the
Vigenere square being made mobile in the fourth quadrant of the XY
plane.

Test this as much as like. The set of N's as moduli are simply
consecutive positive integers in the given range above. Are these
transparent you may well ask - naw its a random set that is scrambled
and sliced. Secondary alphabets (as an alternative to the ASCII
printable subset) are quite feasible also - once you think the whole
thing through it is esay to see how the crypto strength is assured.

This is quite difficult and certainly not something you can think
through in a few seconds - the set of validated moduli could be said
to be a sequence of integers that have a rule in modular arithmetic
residue classes - cheers - adacrypt
.

## Relevant Pages

• Re: Is there a Mathematician Cryptographr in the House.
... taboo to me - I don't use PRNGS ever. ... formulation) like that there are for the analyst two unknowns, ... the issue of difficulty for the analyst. ... The square is normally docked at in the fourth quadrant of the ...
(sci.crypt)
• Re: Is there a Mathematician Cryptographr in the House.
... one equation in three unknowns - two of the unknowns are the random ... where P and C are the plaintext and ciphertext units. ... "A simple scheme of combining PRNGs" of 01.06.2010. ... secret data. ...
(sci.crypt)
• Re: Is there a Mathematician Cryptographr in the House.
... one equation in three unknowns - two of the unknowns are the random ... "A simple scheme of combining PRNGs" of 01.06.2010. ... secret data. ... When you send a message than that shared data the process ...
(sci.crypt)
• Re: Is there a Mathematician Cryptographr in the House.
... one equation in three unknowns - two of the unknowns are the random ... where P and C are the plaintext and ciphertext units. ... "A simple scheme of combining PRNGs" of 01.06.2010. ... You have some shared secret data. ...
(sci.crypt)