Cryptography-Digest Digest #130, Volume #12 Wed, 28 Jun 00 14:13:01 EDT
Contents:
Re: Try it. (John)
Re: How Uncertain? (Mark Wooding)
Re: Encryption on missing hard-drives (Guy Macon)
Re: Try it. (John)
Re: Try it. (John)
Re: Which algorithm? (dexMilano)
Re: Which algorithm? (Mark Wooding)
Re: Compression & Encryption in FISHYLAND (SCOTT19U.ZIP_GUY)
Re: Quantum computing (Anton Stiglic)
Re: very large primes ("Tony T. Warnock")
Re: Encryption on missing hard-drives ("Tony T. Warnock")
Re: Dynamical Cryptography algorithm (Sylvain Martinez)
Re: Which algorithm? (dexMilano)
Re: scramdisk and e4m security problem? (Mack)
Re: Yardley: Codebreaking or Torture (Ichinin)
Re: very large primes (Simon Johnson)
Re: Observer 4/6/2000: "Your privacy ends here" (JimD)
Re: Sellotape and scotch tape (JimD)
Re: what does it mean: "to find collision in bytes" (Mike Rosing)
Re: Does anyone have code for generating primitive polynomials? (Mike Rosing)
Re: what does it mean: "to find collision in bytes" (Simon Johnson)
Re: very large primes (Mike Andrews)
Hey Tom, you wanted to break it ! ;-) (Runu Knips)
Re: Encryption on missing hard-drives (Mike Rosing)
Re: very large primes ([EMAIL PROTECTED])
Re: very large primes (Simon Johnson)
Re: breaking encryption - help! (Steve Basford)
Re: very large primes (Darren New)
Re: what does it mean: "to find collision in bytes" (tomstd)
Re: Dynamical Cryptography algorithm (Simon Johnson)
Re: Dynamical Cryptography algorithm (tomstd)
----------------------------------------------------------------------------
Subject: Re: Try it.
From: John <[EMAIL PROTECTED]>
Date: Wed, 28 Jun 2000 08:09:31 -0700
I never made any assumptions about security in my CS courses.
Some courses in security and encryption are available in some CS
courses, granted, not a lot.
The Machine WILL DO exactly as you tell it. If we make the
wrong assumptions, it is we who are in error. Good analysis of
code is aimed to reduce errors. Security and CS need not be
mutually exclusive!
Got questions? Get answers over the phone at Keen.com.
Up to 100 minutes free!
http://www.keen.com
------------------------------
From: [EMAIL PROTECTED] (Mark Wooding)
Subject: Re: How Uncertain?
Date: 28 Jun 2000 15:11:59 GMT
Tim Tyler <[EMAIL PROTECTED]> wrote:
> Douglas A. Gwyn <[EMAIL PROTECTED]> wrote:
>
> : It appears that there are at least 6 bits of entropy per 8-bit octet
> : of uncompressed newsgroup plaintext, maybe closer to 7.
>
> I doubt usenet messages are terribly different. Your estimate would
> make more sense if it referred to the /lack/ of entropy.
Maybe Doug is having a little joke with us about the amount of random
rubbish which gets posted to Usenet. ;-)
-- [mdw]
------------------------------
From: [EMAIL PROTECTED] (Guy Macon)
Subject: Re: Encryption on missing hard-drives
Date: 28 Jun 2000 11:13:14 EDT
Tony T. Warnock wrote:
>
>
>Guy Macon wrote:
>
>> The people who disarm nuclear weapons in the field and the people who
>> go into and out of a high security safe aren't the same people.
>
>In this case, they are exactly the same people.
>
I don't believe you. The people who were going into the high security
safe, according to the news reports, included the military, who used
sign out procedures, and the scientists, who did not.
------------------------------
Subject: Re: Try it.
From: John <[EMAIL PROTECTED]>
Date: Wed, 28 Jun 2000 08:11:39 -0700
I agree. The more things change, the more they are the same
thing. Maybe it would be good to look at the history of
encryption/security. Things have changed a bit there.
http://www.aasp.net/~speechfb
Got questions? Get answers over the phone at Keen.com.
Up to 100 minutes free!
http://www.keen.com
------------------------------
Subject: Re: Try it.
From: John <[EMAIL PROTECTED]>
Date: Wed, 28 Jun 2000 08:16:44 -0700
Well, that only shows that not all institutions are equal in
what they teach. I never got a great deal of crypto or security
in my dyas at RIC either. There are a few things to remember.
1. A BS or BA isn't intended to make you a specialist in your
field. It would be a great mistake to think that you can appoint
yourself an expert, just because you had some courses.
2. I know some people who went to Tuffs U and did get a whole
semester of crypto. Better than what I got.
3. If you want to specialize, get a Masters or Ph.D
http://www.aasp.net/~speechfb
Got questions? Get answers over the phone at Keen.com.
Up to 100 minutes free!
http://www.keen.com
------------------------------
From: dexMilano <[EMAIL PROTECTED]>
Subject: Re: Which algorithm?
Date: Wed, 28 Jun 2000 15:23:17 GMT
Thanks for suggestion, Mark.
How can I de-cipher the ciphered stream?
In the source you highlight there is on the cipher, and I can't find
any explanation about the de-cipher.
I'm starting to study it to see if it's feasible.
I'll let you know.
dex
In article <[EMAIL PROTECTED]>,
[EMAIL PROTECTED] (Mark Wooding) wrote:
> dexMilano <[EMAIL PROTECTED]> wrote:
>
> > I thought to substitution but it's too simple.
> > DO you know some kind of variation i can use to make it more secure.
>
> You could try implementing RC4. It's very simple. See, for example
>
> ftp://idea.sec.dsi.unimi.it/pub/security/crypt/code/rc4.revealed.gz
>
> -- [mdw]
>
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: [EMAIL PROTECTED] (Mark Wooding)
Subject: Re: Which algorithm?
Date: 28 Jun 2000 15:32:33 GMT
dexMilano <[EMAIL PROTECTED]> wrote:
> Thanks for suggestion, Mark.
>
> How can I de-cipher the ciphered stream?
Encryption and decryption with RC4 are the same operation.
-- [mdw]
------------------------------
From: [EMAIL PROTECTED] (SCOTT19U.ZIP_GUY)
Subject: Re: Compression & Encryption in FISHYLAND
Date: 28 Jun 2000 15:29:08 GMT
[EMAIL PROTECTED] (John Savard) wrote in
<[EMAIL PROTECTED]>:
... snip....
Nr John Savard I gues what gets to me is your lack of
understand simple basic facts and your inability to face
the truth. How many years did it take you to describe the
inferior chaining that PGP used. I told you over and over
it was wrong but in your usual style your were to fuckin
lazy to look it up. Yet you claimed over and over again you
did look it up. You remind me strongly of a man I use to know
that whould wrongly mix mathematical theories to get the
results he wants and then was at loss when reality did
not work the way his warped mind expected it too.
As I have told you many times. With my huffman compression routine
you can change the last byte to any of its 256 combinations and
in each case it will decompress to a file that when compressed
back it will be that same file. THis concept is apparently over
your head.
ALso with my condtional compress you can limit the input file
to the character of chioce witht the starting frequences of choice.
So that when you compress a file with this method and you change
the last byte to any of its 256 values and decompress the file
you get 256 different unique file that are only in the character
set of the "condition file". These files when compressed goto the
same file they were uncompressed from in a 1-1 way. From what I
have glemmed from your ranting you say this is impossible to.
But you don't seem capable of getting off your lazy ass to check
it out. Since you have such blind faith in your rantings.
Be sure to think abit and use real files. Some of my methods
are for "finitely odd files" so do the proper conversions at
the proper time. You can use the code at my site if you wish,
The nice thing about my code is if you would get off your ass
you can test the code with a small number of files and never have
to bother your self with looking at the source code which I doubt
you could follow anyway,
Take Care
David A. Scott
--
SCOTT19U.ZIP NOW AVAILABLE WORLD WIDE
http://www.jim.com/jamesd/Kong/scott19u.zip
Scott famous encryption website NOT FOR WIMPS **no JavaScript allowed**
http://members.xoom.com/ecil/index.htm
Scott rejected paper for the ACM
http://members.xoom.com/ecil/dspaper.htm
Scott famous Compression Page WIMPS allowed ** JavaScript OK**
http://members.xoom.com/ecil/compress.htm
**NOTE EMAIL address is for SPAMERS***
I leave you with this final thought from President Bill Clinton:
"The road to tyranny, we must never forget, begins with the destruction
of the truth."
------------------------------
From: Anton Stiglic <[EMAIL PROTECTED]>
Subject: Re: Quantum computing
Date: Wed, 28 Jun 2000 12:06:16 -0400
Roger Schlafly wrote:
>
> Dido Sevilla wrote:
> > enough to pedagogically demonstrate some ideas of quantum computers, as
> > well as simulate some simple quantum phenomena, but not enough to factor
> > a big number using Shor's algorithm...
>
> That's all they are. They demo some quantum ideas, but do not
> compute anything. Cannot even factor 4=2x2.
>
> Maybe I'm in the minority, but I don't think we'll see any
> quantum computers without some big theoretical and technological
> breakthroughs.
People seem to forget that television, for example, was invented only
46 years ago. I don't see how anyone can say that, 50 years from now
we won't have the technology to build a quantum computer.
It's obvious that if one ever exists (a practical one, that is), it will
not use current technology, but technology evolves all the time...
Anton
------------------------------
From: "Tony T. Warnock" <[EMAIL PROTECTED]>
Subject: Re: very large primes
Date: Wed, 28 Jun 2000 10:17:00 -0600
Reply-To: [EMAIL PROTECTED]
1!-1=0 not a prime
2!-1=1 not a prime (ok, the Lehmer's called it a prime.)
3!-1=5 prime
4!-1=23 prime
5!-1=119 not a prime
(dis-)Proof by counter example.
------------------------------
From: "Tony T. Warnock" <[EMAIL PROTECTED]>
Subject: Re: Encryption on missing hard-drives
Date: Wed, 28 Jun 2000 10:20:21 -0600
Reply-To: [EMAIL PROTECTED]
Guy Macon wrote:
> Tony T. Warnock wrote:
> >
> >
> >Guy Macon wrote:
> >
> >> The people who disarm nuclear weapons in the field and the people who
> >> go into and out of a high security safe aren't the same people.
> >
> >In this case, they are exactly the same people.
> >
>
> I don't believe you. The people who were going into the high security
> safe, according to the news reports, included the military, who used
> sign out procedures, and the scientists, who did not.
You are allowed to believe what you wish. It is the NEST team that has
access to the vault. In fact these are the same people who train to disarm
bombs in the field. I do not know if they have had an actual live bomb to
disarm yet. Unlike the police bomb-squads, these guys do not risk any injury
in case of a mistake.
------------------------------
From: Sylvain Martinez <[EMAIL PROTECTED]>
Subject: Re: Dynamical Cryptography algorithm
Date: Wed, 28 Jun 2000 16:42:22 GMT
> Quick! Tell Bruce Schneier! I'm sure he'd be delighted to know that
> Blowfish has a variable block size.
:O)
ok apparently not...
Sorry I am not familiar with blowfish and thought it was the case.
Is there any cryptography algorithm around allowing the user to change
different value such as the size of the different blocks used in the
crypt process ? (I am not speaking about the keylength, but the size of
the block the algorithm will work with)
> Which particular ciphers are you thinking of here? Please ensure that
> your answer clearly distinguishes your cipher from RC4, SEAL, CAST128,
> Khufu, DES, and Hasty Pudding in this respect.
What I try to say is that:
I am an amateur, I read many books (yes, even bruce schneir ones and I
managed to say something wrong). I am not a math genius, creating a new
algorithm using complex mathematical formalas would have been useless
because I would then more or less copied an existing algorithm.
Instead I have used another aproach to the problem and I did not use any
really complex maths. This doesn't mean the BUGS algorithm is weak.
This doesn't mean either it is powerful.
If the different ciphers you talk about are not using complex maths then
BUGS is like them.
> > 3) The algorithm has been designed to take advantage of any type of
> > integer width (16,32,64,128,etc)
> > If you crypt a file using 32 bits integer you can only decrypt it if
you
> > use again 32 bit integers...
>
> Then it's a family of incompatible algorithms.
Right,
But because you've got the source, you can choose to use the integer
width you whish (if your OS let you use 256bits int then you can use
this kind of integer). This is really easy to do (no programming skill
required). Now, you crypt a message the attacker will not only need to
guess your password, but also the type of integer you used ...
This is NOT the most amazing security ever found, right...
but my idea in developping this algorithm has been to resist to attacks
done by programms such as crack.
Te more your algorithm can be customized the more difficult it would be
to crack it. Because to crack it you need to find out more information
than just the password, its length ,etc ...
that is what I think, I do not pretend this is completly true but it's
what I believe...
This new BUGS algorithm is surely not the best in the world, but I am
convinced it is still quite powerfull and original.
If I am right, it's gonna be boring because I won't have to work on it
again.
If I am wrong... that will push me to do better and have a better
understanding of cryptography. (the new algorithm beeing the result of a
year of comments from internet user and tester)
Either way, I like this project.
Cheers,
Sylvain.
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: dexMilano <[EMAIL PROTECTED]>
Subject: Re: Which algorithm?
Date: Wed, 28 Jun 2000 16:43:22 GMT
many many many many many many many
thx
dex
I'll keep you informed
dex
In article <[EMAIL PROTECTED]>,
[EMAIL PROTECTED] (Mark Wooding) wrote:
> dexMilano <[EMAIL PROTECTED]> wrote:
> > Thanks for suggestion, Mark.
> >
> > How can I de-cipher the ciphered stream?
>
> Encryption and decryption with RC4 are the same operation.
>
> -- [mdw]
>
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: [EMAIL PROTECTED] (Mack)
Subject: Re: scramdisk and e4m security problem?
Date: 28 Jun 2000 16:55:54 GMT
Michael Gu [EMAIL PROTECTED] wrote:
>> Yes use an different IV for each sector
>> try MD5(sector number | key) or some
>> variation like that. Or even DES(key,sector number).
>> That should complicate things a good bit.
>>
>> Mack
>> Remove njunk123 from name to reply by e-mail
>
>Ok, this does complicate things, but by how much?
>
>The attacker can use the same IV to get the plain text. The problem now is
>that he is not sure which block is all zero. But I guess he can try it out,
>by assuming it is all zero.
>
>I was thinking of something different. Maybe we can use a key-IV-initiated
>PRNG to xor-the sector before encrypting it. That way, an attacker would
>not be able to know the plain text. It's seems to be a more complicated
>calculation, however.
>
>
The attack must determin the key to find the IV
under the assumtion that MD5 and DES are strong.
Not nesessarily true but it is certainly a lot of work to
brute force DES or MD5. Other CBC attacks that
don't depend on the underlying cipher would probably
be easier.
Mack
Remove njunk123 from name to reply by e-mail
------------------------------
From: Ichinin <[EMAIL PROTECTED]>
Reply-To: [EMAIL PROTECTED]
Subject: Re: Yardley: Codebreaking or Torture
Date: Wed, 28 Jun 2000 18:57:15 +0200
Paul Rubin wrote:
> Has history treated him too well?
Same question about Alan Turing, one of the people that broke the
enigma, and helped to preserv (most of) Europe a free speech zone,
history didn't treat this guy well either.
I guess there are tonnes of secrets and atrocities in all wars
that we 'civvies' will never know about. Both sides in all
conflicts will just throw the internatinal media a bone now and
then (Saddam speeches weren't the most convincing). Nasty things
happen in wars, an iraqi defector's wife was killed by mistake,
in my town (IN SWEDEN) during the gulf war.
Ok, this is Sci.crypt.. I'll shut ut now.
/Ichinin
------------------------------
Subject: Re: very large primes
From: Simon Johnson <[EMAIL PROTECTED]>
Date: Wed, 28 Jun 2000 10:10:57 -0700
Right, i've got another such problem......
Does F(x)= 6(X) + 1 always produce a prime, is there a
proof/disproof of this?
Got questions? Get answers over the phone at Keen.com.
Up to 100 minutes free!
http://www.keen.com
------------------------------
From: [EMAIL PROTECTED] (JimD)
Crossposted-To:
uk.media.newspapers,uk.legal,alt.security.pgp,alt.privacy,uk.politics.parliament,uk.politics.crime,talk.politics.crypto,alt.ph.uk,alt.conspiracy.spy,alt.security.scramdisk,uk.telecom
Subject: Re: Observer 4/6/2000: "Your privacy ends here"
Date: Wed, 28 Jun 2000 16:21:00 GMT
Reply-To: JimD
On Tue, 27 Jun 2000 21:25:34 +0100, Andy Dingley <[EMAIL PROTECTED]> wrote:
>[EMAIL PROTECTED] (JimD) a �crit :
>
>>>>>Maybe the webmaster's been assassinated by MI6.
>
>>Absolutely. There was that woman from Shrewsbury they had
>>murdered.
>
>Hilda Murrell ?
None other.
--
Jim Dunnett.
g4rga at thersgb.net
------------------------------
From: [EMAIL PROTECTED] (JimD)
Subject: Re: Sellotape and scotch tape
Date: Wed, 28 Jun 2000 16:21:05 GMT
Reply-To: JimD
On Tue, 27 Jun 2000 17:13:44 -0600, John Myre <[EMAIL PROTECTED]> wrote:
>This is way off-topic, except that Sellotape was actually
>mentioned in another post.
>Meanwhile, this is the first I've heard of Sellotape. Is it
>sold in the US? Is Scotch tape sold in the UK?
Both are sold in the UK. Scotch is now owned by 3M.
Sellotape is the ordinary transparent 'Scotch' tape;
as far as I know it's British.
--
Jim Dunnett.
g4rga at thersgb.net
------------------------------
From: Mike Rosing <[EMAIL PROTECTED]>
Subject: Re: what does it mean: "to find collision in bytes"
Date: Wed, 28 Jun 2000 12:28:57 -0500
MP wrote:
>
> What does that term mean in cryptoanalysis ??
It's usually in reference to hash functions. A hash takes lots of
data as input and generates a fixed sized output. Because the fixed
size is smaller than the input (or can be) you can have a "collision"
where two different inputs have the same output.
The ability to find such collisions allows attacks of digital signatures
and message authentication.
Patience, persistence, truth,
Dr. mike
------------------------------
From: Mike Rosing <[EMAIL PROTECTED]>
Subject: Re: Does anyone have code for generating primitive polynomials?
Date: Wed, 28 Jun 2000 12:25:05 -0500
Mack wrote:
>
> I am looking for some good code for generating primitive polynomials.
> Pointers are appreciated. UBASIC is my first choice of
> languages. Something in C is also acceptable (with or without
> a LIP library).
Do you want to work in GF(2^n) or GF(p^n) p>2? For GF(2^n) you can
use an irreducible() routine to check if a polynomial is prime, then
take x^d for all d|(2^n-1) modulo your polynomial and check to see
if it's not 1. You can find code for this at
http://www.terracom.net/~eresrch under "polynomial.c"
Have fun!
Patience, persistence, truth,
Dr. mike
------------------------------
Subject: Re: what does it mean: "to find collision in bytes"
From: Simon Johnson <[EMAIL PROTECTED]>
Date: Wed, 28 Jun 2000 10:30:27 -0700
In hashing algorithms it means, to find two different texts that
hash to the same value. I.e.
H(x) = H(x')
By randomly trying pairs of x & x' the quickest attack
(providing the hash is perfectly secure) will find a collison
after an average of 2**(n/2) pairs
n.b. N is the size of the hash value in bits.
Got questions? Get answers over the phone at Keen.com.
Up to 100 minutes free!
http://www.keen.com
------------------------------
From: [EMAIL PROTECTED] (Mike Andrews)
Subject: Re: very large primes
Date: Wed, 28 Jun 2000 17:35:21 GMT
Scripsit Simon Johnson <[EMAIL PROTECTED]>:
: Right, i've got another such problem......
: Does F(x)= 6(X) + 1 always produce a prime, is there a
: proof/disproof of this?
The way to answer questions like this (and your previous one,
where you asked if F(x)=X!-1 was always prime) is to try a few
cases. They're _both_ easy to test with nothing more than a pencil
and a sheet of paper for the first five or so integers.
This is the way _real_ mathematicians (and other researchers) work.
They actually try to answer their own questions.
6*1+1=7
6*2+1=13
6*3*1=19
and so on.
So your formula gives the sequence F(X) =
7, 13, 19, 25, 31, 37, 43, 49, 55, 61, 67, 73, 79, 85, 91, 97, 103, 109, 115, 121, ...
for X =
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
Note that there are values of F(X) that end in 5. Can they be prime?
How about 49, 91, and 121? Tho of those (49 and 121) are squares,
and the third (91) is composite.
If you have to try a large number of cases, it may be worthwhile to write
a computer program to generate and test the cases.
How about _you_ trying to answer your own question next time?
If you think the question and its answers are interesting to people
doing cryptology, then this is an appropriate newsgroup to post the
research in.
--
...most SF writers are small blokes; they spent a lot of time grubbing
around on the floor for old SF mags, not stretching up to the top shelf for
pornography...As an aside, Douglas Adams is quite tall -- Terry Pratchett
------------------------------
Date: Wed, 28 Jun 2000 19:31:43 +0200
From: Runu Knips <[EMAIL PROTECTED]>
Subject: Hey Tom, you wanted to break it ! ;-)
Now what is Tom doing ? Still not ready with
the exams ? ;-)
------------------------------
From: Mike Rosing <[EMAIL PROTECTED]>
Subject: Re: Encryption on missing hard-drives
Date: Wed, 28 Jun 2000 12:32:44 -0500
Tony T. Warnock wrote:
> You are allowed to believe what you wish. It is the NEST team that has
> access to the vault. In fact these are the same people who train to disarm
> bombs in the field. I do not know if they have had an actual live bomb to
> disarm yet. Unlike the police bomb-squads, these guys do not risk any injury
> in case of a mistake.
Yeah, being vaporized in 20 nanoseconds isn't really an "injury".
:-)
Patience, persistence, truth,
Dr. mike
------------------------------
From: [EMAIL PROTECTED]
Subject: Re: very large primes
Date: Wed, 28 Jun 2000 17:41:06 GMT
Simon Johnson <[EMAIL PROTECTED]> wrote:
> Right, i've got another such problem......
> Does F(x)= 6(X) + 1 always produce a prime, is there a
> proof/disproof of this?
Assuming you mean multiplication here, and the difference in x's is a
typo and not something else:
6(0) + 1 = 1
6(4) + 1 = 25
And no, neither 1 nor 25 is a prime.
--
Matt Gauthier <[EMAIL PROTECTED]>
------------------------------
Subject: Re: very large primes
From: Simon Johnson <[EMAIL PROTECTED]>
Date: Wed, 28 Jun 2000 10:47:54 -0700
Yah. Point taken.......
But then i'm not a real mathematician, nor a researcher.....
Indeed if i was, then i would not have to consult this forum.
And prehaps critically, i don't have the time for it.
Got questions? Get answers over the phone at Keen.com.
Up to 100 minutes free!
http://www.keen.com
------------------------------
From: Steve Basford <[EMAIL PROTECTED]>
Subject: Re: breaking encryption - help!
Date: Wed, 28 Jun 2000 18:52:58 +0100
On 26 Jun 2000 22:28:36 -0700, Andru Luvisi <[EMAIL PROTECTED]> wrote:
>Could you post the rest of the aXa encryptions, one for every value of
>X it will allow you to put in?
03 00 00 00-39 57 09-0A = aaa
03 00 00 00-39 54 B1-0A = aba
03 00 00 00-39 55 46-0A = aca
03 00 00 00-39 52 75-0A = ada
03 00 00 00-39 53 E8-0A = aea
03 00 00 00-39 50 7F-0A = afa
03 00 00 00-39 51 52-0A = aga
03 00 00 00-39 5E 9F-0A = aha
03 00 00 00-39 5F DA-0A = aia
03 00 00 00-39 5C 52-0A = aja
03 00 00 00-39 5D 62-0A = aka
03 00 00 00-39 5A 69-0A = ala
03 00 00 00-39 5B CE-0A = ama
03 00 00 00-39 58 DD-0A = ana
03 00 00 00-39 59 ED-0A = aoa
03 00 00 00-39 46 43-0A = apa
03 00 00 00-39 47 AD-0A = aqa
03 00 00 00-39 44 07-0A = ara
03 00 00 00-39 45 8F-0A = asa
03 00 00 00-39 42 E4-0A = ata
03 00 00 00-39 43 3A-0A = aua
03 00 00 00-39 40 2C-0A = ava
03 00 00 00-39 41 EE-0A = awa
03 00 00 00-39 4E 4A-0A = axa
03 00 00 00-39 4F DF-0A = aya
03 00 00 00-39 4C 92-0A = aza
does that help a little?
Cheers,
steve
------------------------------
From: Darren New <[EMAIL PROTECTED]>
Reply-To: [EMAIL PROTECTED]
Subject: Re: very large primes
Date: Wed, 28 Jun 2000 17:55:12 GMT
> is (n!-1) always a prime, and does anyone know of a proof or disproof?
I think you're thinking of (n!+1)
--
Darren New / Senior MTS & Free Radical / Invisible Worlds Inc.
San Diego, CA, USA (PST). Cryptokeys on demand.
"You know Lewis and Clark?" "You mean Superman?"
------------------------------
Subject: Re: what does it mean: "to find collision in bytes"
From: tomstd <[EMAIL PROTECTED]>
Date: Wed, 28 Jun 2000 11:01:16 -0700
"MP" <[EMAIL PROTECTED]> wrote:
>What does that term mean in cryptoanalysis ??
There could be collisions in block ciphers if it's not a
multipermutation which means that changing only a certain part
of the input makes a certain part of the output remain
unchanged. That is a collision as well.
Tom
Got questions? Get answers over the phone at Keen.com.
Up to 100 minutes free!
http://www.keen.com
------------------------------
Subject: Re: Dynamical Cryptography algorithm
From: Simon Johnson <[EMAIL PROTECTED]>
Date: Wed, 28 Jun 2000 11:04:58 -0700
Hold on!
Give it a chance, someone have a go at breaking it....... ( i
can't i don't know how )
Have you done analysis on your algorithm yourself?
Got questions? Get answers over the phone at Keen.com.
Up to 100 minutes free!
http://www.keen.com
------------------------------
Subject: Re: Dynamical Cryptography algorithm
From: tomstd <[EMAIL PROTECTED]>
Date: Wed, 28 Jun 2000 11:07:00 -0700
[EMAIL PROTECTED] wrote:
>Hi,
>
>there is a new cryptography algorithm around
>available on:
>http://www.bccrypt.com
What type of cryptographic algorithm? A hash, prng, pk
algorithms, symmetric algorithms, signatures, fair coin toss???
>It is free and open source.
That is good.
>A full documentation (technical and also for
>beginners) is available, source code explained.
>Only the unix package is available for the latest
>version of the algorithm and provides:
>a secure chat (beta), file encryption, login apps.
>
>As I said everything is explained on the web site
>so I won't waste your time any longer, here is
>just a summary of the main feature of this
>algorithm:
>
>BUGS (Big and Useful Great Security) Algorithm V
>3.0.0
>
>Private key algorithm
>Dynamical cryptography algorithm
Dynamical is not even a word so this phrase is meaningless.
>Source code can be public without making the
>algorithm weak.
That's to be EXPECTED!
>Multiplateform application(Unix, Windows
>NT/9x/2000)
The algorithm really should be independant of the platform.
> Specifities:
>Infinite key length, default : 128 bits
Please tell me how you use a key with a length of infinity?
>Bilateral bits swapping with variable windows.
Meaningless without a specified geometry bilateral could mean
anything.
>Bilateral Pseudo randomly binary operations.
Meaningless for the same reason.
>Addition of a random number to the key
How are these random numbers supplied at the receiving end?
>5 differents crypt's level
Whoopy-doo
>Seed and shuffle functions
What types?
>A clear text can be crypted using its own data
>2 methods of execution: direct disk access or
>memory cache
Ja this is a cryptosystem not an algorithm perse.
>Common point with the IBM algorithm : DES
>Strong Key generator
What type of key generator makes DES strong?
>Hide engine (simple algorithm)
Which is?
>Login application (only with the Unix application)
>Secure Chat (Beta version)
Secure how? What does it prevent?
>Graphical Used interface for windows
Yeehaw.
>Pleasedo not hesiate to contact me for further
>information.
>
>Cheers,
>Sylvain.
How about stop inventing words and terms without any meaningful
definitions!!!
Tom
Got questions? Get answers over the phone at Keen.com.
Up to 100 minutes free!
http://www.keen.com
------------------------------
** FOR YOUR REFERENCE **
The service address, to which questions about the list itself and requests
to be added to or deleted from it should be directed, is:
Internet: [EMAIL PROTECTED]
You can send mail to the entire list (and sci.crypt) via:
Internet: [EMAIL PROTECTED]
End of Cryptography-Digest Digest
******************************
