eyenot
|
|
Powerful new encryption designed by Eyenot - Mr.Jima Encryption
| 
Apr 12 22:05 UTC 2000 |
Mr.Jima v 1.0 (c) 4-13-2000 by Gabriel "Eyenot" Petrie
portions (c) 1983, 92 by Borland International, Inc.
classes : freeware + utility
shortdesc: encryption
filename : mrjima.exe
included : mrjima.doc
file size: 13k bytes
platform : MS-DOS
requires : disk file space of at least 14k bytes free
3 free file handles
286 or better processor
keyboard or other line-input device
descript : encryption / decryption of any size file into file of same size,
using a key file of any size smaller than 2.147 gigabytes.
all relevant documentation is stored inside executable, just run
the file by itself to read opening documentation.
cost : free from author
register : no registration required, no crippleware involved.
e-mail : eyenot@cyberspace.org
IRC : yes. mostly EFNet and UnderNet.
future : next version will include multiple passes on file in one session
"Mr.Jima Documentation" (c) 4-13-2000 by Gabriel "Eyenot" Petrie
FYI: Mr.Jima is NOT "Replacement Encryption", "XOR", "Bit-Shift", or
random/psuedo-random algorhythm Encryption.
The process I coded into Mr.Jima is capable of encrypting a file into deeper
and deeper layers, each one further from the original file. Just encrypt
the already encrypted file again, naming itself as the output file.
If you change keys between layers, encryption will be more effective BUT
you will need to keep track of which keys you used on which layers, because
you have to be able to decrypt the file again with each key for each layer
in reverse order.
Two teaser files are included in the first distribution. These files have
been encrypted to 1 level, using one key for each of them. If you find these
two files easy to crack, try again after you've used Mr.Jima to encrypt them
to 2 or 3 layers using different keys. Experiment: use graphic, command,
archive, or even text files as your keys.
Any file can be encrypted, and the maximum size of the file is unlimited.
The encrypted file is always the same size as its unencrypted original.
The key itself however must be smaller than 2.147 gigabytes in size .
Distribution Archives are available from the following webpage sites:
www.cyberspace.org/~eyenot
www.lunarsurf.com/~eyenot
The file is freeware, if you like it please distribute it. Send any comment
to eyenot@cyberspace.org
-eyenot
|
mdw
|
|
response 4 of 55:
|
Apr 13 05:31 UTC 2000 |
It's hard to say without source (and I don't feel like disassembling the
object although that would be easy enough) - but at a very cursory
glance it doesn't look very secure. A simple character frequency count
shows the character with octal code 350 appears 7 times in secret.enc
Just for the sake of comparison, I encrypted the last paragraph (280
characters) using idea & rc4, with the key "foobar". With idea, the
most common character, octal 375, appeared 4 times, and 7 other
characters appeared three times. With rc4, the most common character
was %, 4 times, & 4 other characters appeared 4 times. secret.enc is
actually smaller (only 212 characters) so I would not expect to see 350
7 times, # 5 times, * 4 times, and 7 other characters 3 times.
Not all good random numbers are of cryptographic strength, but good
cryptographic routines should (in general) be good random number
generators. For the output from a cryptographic routine not to be
statistically random suggests that there is a pattern, and of course,
patterns are what a cryptoanalyst would look for and use to break the
algorithm.
The strings inside the binary say it uses "byte rotation". That by
itself is certainly not at all sufficient (although certain modern
algorithms, including rc6 and mars do indeed use variable rotation of
words as a small *part* of their algorithm.)
|
