By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
459,948 Members | 1,559 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 459,948 IT Pros & Developers. It's quick & easy.

Supercomputer and encryption and compression @ rate of 96%

P: n/a
Supercomputer and encryption and compression @ rate of 96%

Take a document then or a 3D matrix document change it two random or
binary code or just a program for 0's and 1's and fold it over and over
like a piece of paper then having the 1 and 0 add each other or the
0,1's canceling each other out 1+0=0 and 0+1=1 1+1=1 0+0=0 if you gave
the folds addresses like on a spread sheet there would be no math.
First A 1-24 would fold to k 1-24 down.(See Example A ) Then at F1-24
down two k 1-24 ( See example B ) If you written a very long letter
and then change it two binary code it would look like this.
123456789.............24
a.01010101010101010101010
b.10010101010101010101010
c.01010101001010101010010
e.00010101000101010101010
f.10010101010100101010101 First A 24 would fold to k 24 down
g.01010101010100001100101 See Example A
h.01001010101010101010111
I.11110111001101010101010
j.01010101010101010101010
k.10101010101010101010101
See Example A
123456789.............24
f.10010101010100101010101
g.01010101010100001100101
h.01001010101010101010111 Then at F1-24 down two k 1-24
I.11110111001101010101010
j.01010101010101010101010
k.10101010101010101010101
See example B
123456789.............24
I.11110111001101010101010
j.01010101010101010101010 Then from I 1-24 to K 1-24
k.10101010101010101010101

123456789.............24
j.01010101010101010101010 Then from j-24 to j-1

123456789...
j.010101010101 Then from j-12 to j-1

123456
j.010101 Then from j-6 to j1

123
j.010 Then from j-3 to j1

12
j.01 Then from j-2 to j1
j.0 Then you would have
1 bit to transfer over the
Internet
The bit sent would be 0 and the key code would be F1-24,k 1-24,
I 1-24,K 1-24,j24,j1,j12,j1,j6,j1,j3,j1,j2,j1 and would unzip or be new
encryption you could encrypt or compress 100 terabits down to 1 bit of
information. Now if you take this idea from my web site you could make
this allot more complex and unbreakable. Data encryption 360 degrees
rotation document 90 degrees and encrypt on every angel then 45 degrees
change it two binary code do it again and again and fold it over like a
piece of paper then having the one's and zero cancel each other out. In
theory you could send a 100 terabit program to someone's computer and
have it unzip and run and install or make
A computer processor like the new 64 bit AMD have the bit unzip into a
large ram drive and buffer use one half of the 64 bit processor decode
the message and the main 64 bit run the numbers. Another way of doing
this is to have a parallel computers with using one of the processes
run the compressed 1 bit of information give the uncompressed a address
on the ram drive to change and not even go threw the processor and then
with different information on each machine compare and run statistics
on information on a 45 tflops supercomputer and turn that 45 tflops
computer into a 1 bit = 100,000 terabits to infinite as long as you
have the ram for storage! with my calculations 45 tflops wouldn't
matter any more it would be how much data you have on a 32bit operating
system changing that to a 1 bit system it would be 32 * 45tflops would
= 1440 tflops Matter moves so fast that it intergreats and
deintergreats faster then any speed we can see it like water from a
hose at real close speed it moves in -------- lines.

Jul 17 '05 #1
Share this Question
Share on Google+
3 Replies


P: n/a
c3*******@yahoo.com wrote:

I thought April Fools was over already?

But in case you ARE serious...

Supercomputer and encryption and compression @ rate of 96%

Take a document then or a 3D matrix document change it two random or
binary code or just a program for 0's and 1's and fold it over and over
like a piece of paper then having the 1 and 0 add each other or the
0,1's canceling each other out 1+0=0 and 0+1=1 1+1=1 0+0=0 if you gave
the folds addresses like on a spread sheet there would be no math.
First A 1-24 would fold to k 1-24 down.(See Example A ) Then at F1-24
down two k 1-24 ( See example B ) If you written a very long letter
and then change it two binary code it would look like this.
123456789.............24
a.01010101010101010101010
b.10010101010101010101010
c.01010101001010101010010
e.00010101000101010101010
f.10010101010100101010101 First A 24 would fold to k 24 down
g.01010101010100001100101 See Example A
h.01001010101010101010111
I.11110111001101010101010
j.01010101010101010101010
k.10101010101010101010101
See Example A
123456789.............24
f.10010101010100101010101
g.01010101010100001100101
h.01001010101010101010111 Then at F1-24 down two k 1-24
I.11110111001101010101010
j.01010101010101010101010
k.10101010101010101010101
See example B
123456789.............24
I.11110111001101010101010
j.01010101010101010101010 Then from I 1-24 to K 1-24
k.10101010101010101010101

123456789.............24
j.01010101010101010101010 Then from j-24 to j-1

123456789...
j.010101010101 Then from j-12 to j-1

123456
j.010101 Then from j-6 to j1

123
j.010 Then from j-3 to j1

12
j.01 Then from j-2 to j1
j.0 Then you would have
1 bit to transfer over the
Internet
fine. NOT.

Now you lost all the information.

You wrote:
having the 1 and 0 add each other or the 0,1's canceling each other out
1+0=0 and 0+1=1 1+1=1 0+0=0

So how will you tell a 1 was a 0+1 or a 1+1 ?
The bit sent would be 0 and the key code would be F1-24,k 1-24,
I 1-24,K 1-24,j24,j1,j12,j1,j6,j1,j3,j1,j2,j1 and would unzip or be new
encryption you could encrypt or compress 100 terabits down to 1 bit of
information.

Now if you take this idea from my web site you could make this allot more complex and unbreakable.
If the idea was correct: yes. But it is not. ;-)

Data encryption 360 degrees rotation document 90 degrees and encrypt on every angel then 45 degrees
change it two binary code do it again and again and fold it over like a
piece of paper then having the one's and zero cancel each other out. In
theory you could send a 100 terabit program to someone's computer and
have it unzip and run and install or make
A computer processor like the new 64 bit AMD have the bit unzip into a
large ram drive and buffer use one half of the 64 bit processor decode
the message and the main 64 bit run the numbers. Another way of doing
this is to have a parallel computers with using one of the processes
run the compressed 1 bit of information give the uncompressed a address
on the ram drive to change and not even go threw the processor and then
with different information on each machine compare and run statistics
on information on a 45 tflops supercomputer and turn that 45 tflops
computer into a 1 bit = 100,000 terabits to infinite as long as you
have the ram for storage! with my calculations 45 tflops wouldn't
matter any more it would be how much data you have on a 32bit operating
system changing that to a 1 bit system it would be 32 * 45tflops would
= 1440 tflops Matter moves so fast that it intergreats and
deintergreats faster then any speed we can see it like water from a
hose at real close speed it moves in -------- lines.

I cannot wait untill you release your first demoversion.

Regards,
Erwin Moller
Jul 17 '05 #2

P: n/a
"Erwin Moller"
<si******************************************@spam yourself.com> wrote in
message news:42*********************@news.xs4all.nl...
c3*******@yahoo.com wrote:

I thought April Fools was over already?

But in case you ARE serious...

Supercomputer and encryption and compression @ rate of 96%

Take a document then or a 3D matrix document change it two random or
binary code or just a program for 0's and 1's and fold it over and over
like a piece of paper then having the 1 and 0 add each other or the
0,1's canceling each other out 1+0=0 and 0+1=1 1+1=1 0+0=0 if you gave
the folds addresses like on a spread sheet there would be no math.
First A 1-24 would fold to k 1-24 down.(See Example A ) Then at F1-24
down two k 1-24 ( See example B ) If you written a very long letter
and then change it two binary code it would look like this.
123456789.............24
a.01010101010101010101010
b.10010101010101010101010
c.01010101001010101010010
e.00010101000101010101010
f.10010101010100101010101 First A 24 would fold to k 24 down
g.01010101010100001100101 See Example A
h.01001010101010101010111
I.11110111001101010101010
j.01010101010101010101010
k.10101010101010101010101
See Example A
123456789.............24
f.10010101010100101010101
g.01010101010100001100101
h.01001010101010101010111 Then at F1-24 down two k 1-24
I.11110111001101010101010
j.01010101010101010101010
k.10101010101010101010101
See example B
123456789.............24
I.11110111001101010101010
j.01010101010101010101010 Then from I 1-24 to K 1-24
k.10101010101010101010101

123456789.............24
j.01010101010101010101010 Then from j-24 to j-1

123456789...
j.010101010101 Then from j-12 to j-1

123456
j.010101 Then from j-6 to j1

123
j.010 Then from j-3 to j1

12
j.01 Then from j-2 to j1
j.0 Then you would have
1 bit to transfer over the
Internet


fine. NOT.

Now you lost all the information.

You wrote:
having the 1 and 0 add each other or the 0,1's canceling each other out
1+0=0 and 0+1=1 1+1=1 0+0=0

So how will you tell a 1 was a 0+1 or a 1+1 ?
The bit sent would be 0 and the key code would be F1-24,k 1-24,
I 1-24,K 1-24,j24,j1,j12,j1,j6,j1,j3,j1,j2,j1 and would unzip or be new
encryption you could encrypt or compress 100 terabits down to 1 bit of
information.

Now if you take this idea from my web site you could make
this allot more complex and unbreakable.


If the idea was correct: yes. But it is not. ;-)

Data encryption 360 degrees
rotation document 90 degrees and encrypt on every angel then 45 degrees
change it two binary code do it again and again and fold it over like a
piece of paper then having the one's and zero cancel each other out. In
theory you could send a 100 terabit program to someone's computer and
have it unzip and run and install or make
A computer processor like the new 64 bit AMD have the bit unzip into a
large ram drive and buffer use one half of the 64 bit processor decode
the message and the main 64 bit run the numbers. Another way of doing
this is to have a parallel computers with using one of the processes
run the compressed 1 bit of information give the uncompressed a address
on the ram drive to change and not even go threw the processor and then
with different information on each machine compare and run statistics
on information on a 45 tflops supercomputer and turn that 45 tflops
computer into a 1 bit = 100,000 terabits to infinite as long as you
have the ram for storage! with my calculations 45 tflops wouldn't
matter any more it would be how much data you have on a 32bit operating
system changing that to a 1 bit system it would be 32 * 45tflops would
= 1440 tflops Matter moves so fast that it intergreats and
deintergreats faster then any speed we can see it like water from a
hose at real close speed it moves in -------- lines.

I cannot wait untill you release your first demoversion.

Regards,
Erwin Moller


Do you realize how many full length DVD quality movies could fit on a
single floppy disk using this method?!

Norm
--
FREE Avatar hosting at www.easyavatar.com
Jul 17 '05 #3

P: n/a
One quick glance of an experienced eye allowed to understand the blurred
and almost unreadable Norman Peelman's handwriting:
"Erwin Moller"
<si******************************************@spam yourself.com> wrote
in message news:42*********************@news.xs4all.nl...
I cannot wait untill you release your first demoversion.


Do you realize how many full length DVD quality movies could fit on a
single floppy disk using this method?!


Yeah, wow, great thing! The future of encryption! The mother of all
D'OHs! :)

Cheers
Mike
Jul 17 '05 #4

This discussion thread is closed

Replies have been disabled for this discussion.