Newbie question(s)...
From: Jonathan Baker (jonathanrbaker_at_yahoo.com)
Date: 09/16/03
- Next message: Panu Hämäläinen: "Re: Ciphers versus S/W &H/W"
- Previous message: Mike Curry: "Re: Meganet's "unbreakable" cryptography? I'm skeptical."
- Next in thread: Mok-Kong Shen: "Re: Newbie question(s)..."
- Reply: Mok-Kong Shen: "Re: Newbie question(s)..."
- Reply: Gregory G Rose: "Re: Newbie question(s)..."
- Reply: M.S. Bob: "Re: Newbie question(s)..."
- Reply: Bob Silverman: "Re: Newbie question(s)..."
- Reply: Douglas A. Gwyn: "Re: Newbie question(s)..."
- Reply: Ernst Lippe: "Re: Newbie question(s)..."
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 16 Sep 2003 07:13:58 -0700
Hey all,
Been enjoying this group for a couple days... Although, I must admit,
the Linear Algebra and Statistics are a bit over my head most of the
time... (I'm hitting the books again, please recommend any online
materials, books, magazines, etc.)
Anyway, if you all would tell me what you think of this, I'd
appreciate it...
So you generate irrational numbers... Like the square root of 2.
They are good little numbers because there is no way to predict the
next digit from previous digits... Unlike psuedo-random numbers...
Which could be predictable if the period is too small, right?
And there are an infinite number of them. A loose proof:
- Given, there are an infinite number of prime numbers ... (any good
references to this?)
- I *think* that the square root of any prime number is irrational
(need to write some code...)
- Therefore, if you create new numbers just by using square roots of
primes, you have an infinite amount to choose from...
I'm sure there are other ways to calculate irrational numbers (any
good links?)
So this is good so far... and if you want to get crazy, you can use
diagonalization to pick bits from different irrational numbers...
This is symmetric encryption, right? You can use this number as a key
to say, XOR bits, shuffle them around, pad the data, etc...
Downside, you have to find a secure way to share the key (doesn't
matter if you encrypt for your own use)... which kinda sucks...
Also, it could take a damn long time to generate enough bits of an
irrational number... especially the square root method because you end
up keeping track of (and subtracting) larger and larger strings...
Hopefully, it would take less time to make a decent sized key then to
figure out the plaintext, right?
What do pro's use to make text look "random"?
OK... THAT WAS A REALLY LOADED SET OF QUESTIONS...
I'm basically looking for more links to check/read...
(Flame away!) :)
Jon
- Next message: Panu Hämäläinen: "Re: Ciphers versus S/W &H/W"
- Previous message: Mike Curry: "Re: Meganet's "unbreakable" cryptography? I'm skeptical."
- Next in thread: Mok-Kong Shen: "Re: Newbie question(s)..."
- Reply: Mok-Kong Shen: "Re: Newbie question(s)..."
- Reply: Gregory G Rose: "Re: Newbie question(s)..."
- Reply: M.S. Bob: "Re: Newbie question(s)..."
- Reply: Bob Silverman: "Re: Newbie question(s)..."
- Reply: Douglas A. Gwyn: "Re: Newbie question(s)..."
- Reply: Ernst Lippe: "Re: Newbie question(s)..."
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|