Re: Simple unhackable crypto



I've written an 11 kb program dealing with cryptography (20 yrs ago)
that still amazes me today for it's power of security. It is truly
x^n^p.

Would you care to say what the ^ operator does? In various computer
languages this operator is bitwise XOR or exponentiation. Which
does your program use?

You also don't explain what x, n, and p have to do with using a
different computer.

.



Relevant Pages