Re: Simple unhackable crypto
 From: gordonb.04nhx@xxxxxxxxxxx (Gordon Burditt)
 Date: Sun, 17 Jul 2011 23:15:22 0500
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.
.
 References:
 Simple unhackable crypto
 From: xxein
 Simple unhackable crypto
 Prev by Date: Re: BDD Resistance: The Hidden Weighted Bit Function
 Next by Date: Re: Simple unhackable crypto
 Previous by thread: Re: Simple unhackable crypto
 Next by thread: Re: Simple unhackable crypto
 Index(es):
Relevant Pages
