Cryptography-Digest Digest #154, Volume #10 Wed, 1 Sep 99 14:13:03 EDT
Contents:
Re: RC4 question ("Yuriy Stul")
Re: What if RSA / factoring really breaks? (Jean-Jacques Quisquater)
Re: Implementing crypto algorithms in Fortran. ("Tony T. Warnock")
Plaintext block size ("Kwong Chan")
Re: "Cause and Effect" ("Tony T. Warnock")
Re: What if RSA / factoring really breaks? (SCOTT19U.ZIP_GUY)
Re: One to One Compression updated (SCOTT19U.ZIP_GUY)
Re: Matrix Exponentiation (Herman Rubin)
Members Only Key Exchange (Gary)
Pincodes ("JuDa$")
Re: n-ary Huffman Template Algorithm (Mok-Kong Shen)
Re: What if RSA / factoring really breaks? (SCOTT19U.ZIP_GUY)
Re: Implementing crypto algorithms in Fortran. (Mok-Kong Shen)
Re: WT Shaw temporarily sidelined (Medical Electronics Lab)
THINK PEOPLE (SCOTT19U.ZIP_GUY)
Re: Standaarden in België (Mok-Kong Shen)
Re: Schneier/Publsied Algorithms ([EMAIL PROTECTED])
Re: Statue for Enigma hero (Aidan Skinner)
Password Encrytion Algo ([EMAIL PROTECTED])
Re: RC4 question (Kent Briggs)
----------------------------------------------------------------------------
From: "Yuriy Stul" <[EMAIL PROTECTED]>
Subject: Re: RC4 question
Date: Wed, 1 Sep 1999 13:19:58 +0200
David Bourgeois <[EMAIL PROTECTED]> wrote in message
news:7qiqb1$aiq$[EMAIL PROTECTED]...
> I sincerely apologize in advance for this newbie question. I am
programmer
> by hobby only and am trying to understand RC4 better.
>
> struct rc4_key {
> unsigned char state[256];
> unsigned x, y;
> };
>
> If this is the structure for an RC4 key - what makes it 40-bit or 128-bit?
Key length what will be used for initializing of key (function
RC4_set_key(...)
> Why isn't it (256 x 8)
> 2048-bit?
>
> Is it that when calling the function:
> void prepare_key(unsigned char *keydata, unsigned len, struct
> rc4_key *key)
Yes.
> only 5-bytes are used in "keydata" and the len = 5? (assuming 40-bit
> implemenation).
>
> Thanks
>
>
>
>
--
Regards
Yuriy Stul
<mailto:[EMAIL PROTECTED]> <http://www.tashilon.com>
------------------------------
From: Jean-Jacques Quisquater <[EMAIL PROTECTED]>
Subject: Re: What if RSA / factoring really breaks?
Date: Wed, 01 Sep 1999 17:08:25 +0200
Any debate about cryptography is difficult. Why?
Because we are not speaking about the same things
while using the same words.
Examples?
(1) "DES is insecure"
That's not correct: What we know is:
The state of the art in computation and the length
of one key of DES is such that in a chosen plaintext
attack we break it in 1 day. That are the facts.
The algorithm DES itself is not broken at all.
(2) "Factorization is insecure because quantum computing is
doing it in polytime"
While the theory is very nice we are waiting for the crucial
experiment.
Now compare (1) and (2): the facts and implementations
are exhaustive search of 56 bits in one case,
factorisation of numbers of few bits in the other one.
That's not the same story.
Same story with the TWINKLE from Adi Shamir. We saw conclusions
for today based on implementations of tomorrow: then logically
the conclusion is only valid for tomorrow?
We have several parameters to put together:
- the facts and the experiments:
- the theoretical improvements and their possible implementations
and use at a large scale with a realistic schedule:
- the "law" of Moore.
Be careful to apply each step one time and to put the improvements
at the right place.
Jean-Jacques,
------------------------------
From: "Tony T. Warnock" <[EMAIL PROTECTED]>
Subject: Re: Implementing crypto algorithms in Fortran.
Date: Wed, 01 Sep 1999 08:40:58 -0600
Reply-To: [EMAIL PROTECTED]
Steven Alexander wrote:
> Thanks, I appreciate the help. One more question though: How do I handle
> addition/subtraction with signed integers in Fortran so that they will
> behave like unsigned integers in C? TEA for instance uses a slew of
> addition operations, how would I use them without causing unforseen results.
> If you have any old Fortran source that would illustrate this I would
> appreciate it. Thanks again in advance.
>
> -steven
I'm not familiar with TEA but most Fortran's treat integers as modulo the base.
For example, with 32-bit integers, the numbers 0-2147483647 are treated as
posivive and 2147483648-4294967295 as negative. Most hardware does not interrupt
on integer overflow so the results act like base 2^32 arithmetic. If your
numbers are small, there is no problem. If you need to check on sizes, just
check first for negative then for sizes. The same problem arises when sorting.
Comparisons may give incorrect results when there is an overflow. Assembly
language may have the same problem. In addition, if the sum of two positive
numbers is negative, there has been overflow, etc.
Tony
------------------------------
From: "Kwong Chan" <[EMAIL PROTECTED]>
Subject: Plaintext block size
Date: Wed, 1 Sep 1999 23:04:30 +0800
Block ciphers such as DES, AES, etc., can be viewed as a monoalphabetic
substitution cipher which require a plaintext block size at least 128-bit
long.
For a polyalphabetic substitution block cipher, what is the minimum
requirement for the plaintext block size?
To my understanding, a stream cipher can also be viewed as a polyalphabetic
block cipher with plaintext block size=1 and a key cycle length equal to the
period of the employed generator.
------------------------------
From: "Tony T. Warnock" <[EMAIL PROTECTED]>
Crossposted-To: sci.physics
Subject: Re: "Cause and Effect"
Date: Wed, 01 Sep 1999 09:10:12 -0600
Reply-To: [EMAIL PROTECTED]
"Cause and Effect" is not a simple concept. (Nor is is according to
POTUS.) To fall back on a modification of Aristotle's treatment, we can
look things in terms of "events" and "properties." A succession of
events can be looked at as a "causal" chain if the succession always
happens. This corresponds to the "effective cause" of Aristotle. If an
event occurs whenever a particular set of properties obtains, this would
correspond to the "material cause." Both are legitimate descriptions of
what is happening.
For example: in a collision between pool balls (elastic spheres), the
striking of the cue ball by the cue precedes the collision and can be
considered the effective cause. The positions and momenta of the balls
at the time of the collision can be considered the material cause. In
this case the material cause is more basic in that it does not matter
how the cue ball acquired its momentum, cue stick, cannon, 5-iron, etc.
It doesn't violate the material cause principle if one of the properties
is that: something random occurs. A particle moving under Newtonian
rules with a Brownian motion term attached would be an example. We could
have an atom whose property is that it may undergo beta decay.
Randomness doesn't violate material causality. It may seem to violate
effective causality. What happens is that one only gets a statistical
description of effective causes.
Tony
------------------------------
From: [EMAIL PROTECTED] (SCOTT19U.ZIP_GUY)
Subject: Re: What if RSA / factoring really breaks?
Date: Wed, 01 Sep 1999 16:46:42 GMT
In article <[EMAIL PROTECTED]>, Anton Stiglic <[EMAIL PROTECTED]> wrote:
>> and there is no known one-way functions in the quantum setting (remember
>> that factoring is easy for quantum computers). it is a MAJOR open
>> research problem, I was talking to many quantum computer guys during the
>> latest AQIP workshop. Many of them admitted that this is an important
>> problem and they had thought about it. No one had even a candidate
>> function!
>
>Yes, but there is quantum cryptography, that enables a public secret key
>exchange
>between Alice and Bob, in which if Oscar gets any info on the key, Alice and
>Bob
>will know about it and try again. They then use the one time pad.
>Brassard and Bennet are the inventors.
>
>see http://www.CS.McGill.CA/~crepeau/CRYPTO/Biblio-QC.html
>for refs.
>
>anton
But this requires a very special type of communications channel so it
not available to the averge users.
>
David A. Scott
--
SCOTT19U.ZIP NOW AVAILABLE WORLD WIDE
http://www.jim.com/jamesd/Kong/scott19u.zip
http://members.xoom.com/ecil/index.htm
NOTE EMAIL address is for SPAMERS
------------------------------
From: [EMAIL PROTECTED] (SCOTT19U.ZIP_GUY)
Subject: Re: One to One Compression updated
Date: Wed, 01 Sep 1999 16:27:12 GMT
In article <7qjb2u$i8j$[EMAIL PROTECTED]>, Tom St Denis <[EMAIL PROTECTED]> wrote:
>In article <7qe9kv$2vko$[EMAIL PROTECTED]>,
> [EMAIL PROTECTED] (SCOTT19U.ZIP_GUY) wrote:
>> > [EMAIL PROTECTED] (SCOTT19U.ZIP_GUY) wrote:
>> >> I updated my "one to one" adaptive huffman compression
>> >> routines. These are routines that treat any file as a compressed
>> >> file or as an uncompressed file there are no headers. Would
>> >> be of great use as a first pass before encryption see my
>> >> compression page at
>> >>
>> >> http:/members.xoom.com/ecil/compress.htm
>> >>
>> >
>> >Why?
>> Why not?
>
>Um, huffman compression has been around 30 years or more, then next year you
>will get into shano-fano type methods, maybe even range coding who knows how
>far you will advance.
I have looked into others. It is just that Huffman is very interesting
to me. Yes I know that it would compress better with arithmetic and yes
I will do that. But I thought it would be easyer for people to understand
the mods. When using the huffman type of compression first.
>
>First off you are not the first person to ever code statistical entropy
>coders. I did some when I started programming 4 years ago (in C). Second,
>why would I use a pathetic entropy coder (cuz most are) if I could use a
>string matching algorithm like DEFLATE (or BWT used in bzip2). I am not
>'dissing' your code, I am just saying entropy coders are a 'tack on' to get
>an extra 2% of ratio. They are not the only means though.
>
>So I ask again, why?
>
>Tom
Tom I really don't know why you ask such questions. You sound frustated
you might as well ask why did the chicken cross the road. Or what came
first the chicken or the egg.
But I did spend a great deal of time on the BWT (burrow wheeler transform)
and for a while I was hoping and predicting that I could use it as the
front end to a "one to one" type of compression. But I failed I just could not
do it. It is a beautiful clever method but the problem was that any file could
be transformed by the method (plus the added postion information) But i could
not find a way to do the reverse transfrom for an arbitrary file. If you just
make up data you can run into inconsetances during the reverse process so
in essence the sturcture of the thing you are trying to reverse may or may not
be reversable. The transofrm itself is not one to one. I looked for added
rules to make it such and thought I was getting close but in the end. It is on
the back burrner of my brain. If you find a way so that "any file" can be un
BTWed by a few added rules let me know.
Yes I have used bzip2 also. It is very nice and for general file compression
it is a winner. But in my mind as it stands it is very weak for encryption.
The reason is this. Suppose I have a file that is used as a key to
scott19u.zip And all I want is to send the file encrypted to some one.
(I know it in general would not compress so don't ask just go with
the flow for a minute) so they can use my program. He currently has
a program like QHQ ( i made this up PGP plus 1) it uses a wizz bang
bzip2 like compression on all input files simalar to PGP is it not. IT then
encrpyts it with some wizz bang AES method. It is even user firendly
so that many keys are eliminated since it has the nice feature of good
ole PGP approved export crypto that the key is used for a parital qucik
and dirty check sum of some type to do a quick check to see that
the key has a good chance of being the correct key.
we use this to send my
soctt19u key. Since scott19u can really use any file and I pick rather
randomly and since I have not yet sent a message using my porgram
with this ket to my new friend. You would think it is 100% safe. But is
it. First the NSA using information theory may imiititaly eliminate all
keys that don't pass the convinent quick and dirty check. You say this
may at most reduce the key space by 16 bits or so. Then it looks at
this random set of remaining bytes. It then analzyse what keys lead to
files that can be decompressed by this compression method. Don't forget
bzip2 is multistaged. IT can do this at every stage. know we get to the
last stage and they look to see if the file is a valid output from BTW itself
they check the index value to see if it makes sense. They may try to
do the reverse table. I am not sure if it this point with all the friendly
checks and "nice" features in the variuos stages of compression that the
NSA may find only a very few possiblitys left for this "random key" that
has never been used. But of course in your young mind you can't see
that as even a remotely real possiblirty.
David A. Scott
--
SCOTT19U.ZIP NOW AVAILABLE WORLD WIDE
http://www.jim.com/jamesd/Kong/scott19u.zip
http://members.xoom.com/ecil/index.htm
NOTE EMAIL address is for SPAMERS
------------------------------
From: [EMAIL PROTECTED] (Herman Rubin)
Subject: Re: Matrix Exponentiation
Date: 1 Sep 1999 10:22:34 -0500
In article <7qj8q2$gli$[EMAIL PROTECTED]>, Bob Silverman <[EMAIL PROTECTED]> wrote:
>In article <[EMAIL PROTECTED]>,
> Gary <[EMAIL PROTECTED]> wrote:
>> Matrix Exponentiation (Mod 2)
>> A is 32X32 Matrix (Mod 2), 1024 bits long
>> Let N be any integer
>> i) Given only A and A^N (A to the power of N), can N be calculated?
>Yes.
>> ii) Given A^N and N, can A be calculated?
>Yes.
These are certainly incorrect. As we are working over GF(2),
there are only a finite number of distinct powers, so that
there are repetitions. If A is non-singular, A^N can be
the identity infinitely often, and for some N, A^N will be
the identity for all nonsingular A.
--
This address is for information only. I do not claim that these views
are those of the Statistics Department or of Purdue University.
Herman Rubin, Dept. of Statistics, Purdue Univ., West Lafayette IN47907-1399
[EMAIL PROTECTED] Phone: (765)494-6054 FAX: (765)494-0558
------------------------------
From: Gary <[EMAIL PROTECTED]>
Subject: Members Only Key Exchange
Date: Wed, 1 Sep 1999 12:12:12 -0400
A chair(wo)man of an Internet club wishes to issue members with keys that
can
be used in a key exchange system so that they can all communicate securely
with each other.
The chair(wo)man wants to have a secret primitive such that only (s)he can
register new members.
The only ways I could think of doing this was
i)RSA like variant of Diffie Hellman.
The modulus must be composite (like RSA).
The chair(wo)man uses a secret primitive s and assigns the pair s^k (mod pq)
and k to each member. The members can communicate in a DH manner without
discovering the primitive.
ii)Exponentiation of a Hash of a secret primitive.
Each member is securely given the pair H^k(s) (secret primitive s hashed k
times) and their name in a certain readable format. k is derived from a
different smaller hash of the member's name etc.
The member A sends their name to another member B. B hashes A's name using
the
different smaller Hash and raises their secret exponentiated Hash to this
value. B sends their name to A who small hashes this and raises their secret
exponentiated hash to the result. Both have the same secret key.
I've probably made a mistake somewhere in this.
Anyway there probably is an even easier way of doing this, please let me
know
if there is.
Thanks
Gary
============================================================
Get your FREE web-based e-mail and newsgroup access at:
http://MailAndNews.com and http://MailAndNews.co.uk
Create a new mailbox, or access your existing IMAP4 or
POP3 mailbox from anywhere with just a web browser.
============================================================
------------------------------
From: "JuDa$" <[EMAIL PROTECTED]>
Subject: Pincodes
Date: Tue, 31 Aug 1999 17:35:48 +0200
Hello !
I need help to break pincodes, can somebody help me please ?
------------------------------
From: Mok-Kong Shen <[EMAIL PROTECTED]>
Crossposted-To: sci.image.processing,sci.math,alt.comp.compression
Subject: Re: n-ary Huffman Template Algorithm
Date: Wed, 01 Sep 1999 18:58:58 +0200
Alex Vinokur wrote:
>
> > > Mok-Kong Shen <[EMAIL PROTECTED]> wrote:
> > > > A question just for my understanding: How can frequencies be
> > > > non-numerical at all? If you have a number of frequencies and have
> > > > only their ordering according to magnitude but not know their
> > > > numerical values, how can you expect to obtain a coding that is
> > > > optimal?
> >
> > > > So from Huffman algorithm point of view
> > > > it is not important what type of cost is.
> > > > The algorithm is using only operator< and operator+.
> >
> > This only reflects the fact that a Huffman tree can correspond to a
> > wide range of frequency distributions, i.e. that a Huffman tree does
> > not uniquely defines the frequencies of the nodes. But a non-numerical
> > data type 'by definition' can't support the operator +
>
> In C++ you can define the operator+ (and other operators)
> for any class (type).
>
> > (excepting that
> > + is often employed to represent string concatenation, so A + B
> becomes
> > aabb, if A is the string 'aa' and B is the string 'bb'). Could you
> show
> > (with a concrete real-life example) an instance of a 'non-numerical
> > cost', i.e. the 'value' of a variable of that type and the result of
> > applying your operator + on two such 'values' so that one may better
> > comprehend the semantics of that operator?
>
> See special page of DevCentral Learning Center:
> http://devcentral.iftech.com/learning/tutorials/c-cpp/cpp/7.asp
You have not answered my question. I was not asking how one can
implement an operator if one has the proper semantics. I was asking
about the semantics itself. In fact, the question involves matters
at the most basic level. A data type by definition consists of
a (finite/infinite) set of values and the operators that can
work (operate) on these values. Now I know till now with my humble
knowledge only values of the data type 'numerical cost', like 500
dollars, 20 francs, etc. Can you give similar examples of values of
the data type 'non-numerical cost'??? (I am fairly convinced that
the majority of readers also haven't heard of 'non-numerical costs'
before.) Without knowing the set of values underlying a data type,
there is no sense to talk about defining an operator for that data
type, let alone to write a program to process variables/constants
of that data type.
M. K. Shen
------------------------------
From: [EMAIL PROTECTED] (SCOTT19U.ZIP_GUY)
Subject: Re: What if RSA / factoring really breaks?
Date: Wed, 01 Sep 1999 16:57:04 GMT
In article <[EMAIL PROTECTED]>, Jean-Jacques Quisquater
<[EMAIL PROTECTED]> wrote:
>Any debate about cryptography is difficult. Why?
>Because we are not speaking about the same things
>while using the same words.
>
>Examples?
>
>(1) "DES is insecure"
>
>That's not correct: What we know is:
Actually it was insecure from the day the public first found out about it.
And you can't prove my statement wrong. True it does not mean mine
as an absoulte fact. But then neither is yours. Just becuase you aren't
privy to the interworking of NSA type of groups you think you know everything.
>
>The state of the art in computation and the length
>of one key of DES is such that in a chosen plaintext
>attack we break it in 1 day. That are the facts.
Lets be honest here. Fact you think that it is secure because of
your limited knowledge your brain has learned. The facts are you
think that it takes a day to find a key. That is FACT. But what you
fail to state is that it may be FACT the NSA can get the key in 10
seconds. You really don't know wther the NSA can break it in 10
seconds or less. So you are like the Ostridge that has its head stuck
in the sand. If you don't see that it can't be. If you lived half a century
ago you would be screaming it is impossible to get to the moon.
David A. Scott
--
SCOTT19U.ZIP NOW AVAILABLE WORLD WIDE
http://www.jim.com/jamesd/Kong/scott19u.zip
http://members.xoom.com/ecil/index.htm
NOTE EMAIL address is for SPAMERS
------------------------------
From: Mok-Kong Shen <[EMAIL PROTECTED]>
Subject: Re: Implementing crypto algorithms in Fortran.
Date: Wed, 01 Sep 1999 19:00:58 +0200
Steven Alexander wrote:
>
> cryptographers and cryptanalysts alike. Anyway, it does not seem that
> Fortran natively supports unsigned integers which will completely botch my
> implementations. If anyone has any information on using unsigned integers
> in Fortran or implementing any cryptosystem in Fortran I would greatly
> appreciate their help. I'm not asking for anyone to write my homework, I
It can be regarded as a defect of Fortran that it doesn't have the
unsigned integer type. (The forthcoming Frotran 2000 standard also
does not provide that, as far as I know.) Assuming one is using 32
bit computers, one can use the functions ishft, ibits, ior, etc. to
compose any 32 bit sequences one wants in an integer variable. If
the first bit is set, Fortran will treat it as negative. However,
you can neglect this fact and assume that you did have an unsigned
integer type if you do addition, subtraction and multiplication with
such integers (results are modulo 2**32, of course). This holds also
for division and the function mod, with the exception that in these
cases the operands must be of 31 bits, i.e. in the interval
[0, 2**31-1], otherwise the results are incorrect.
M. K. Shen
------------------------------
From: Medical Electronics Lab <[EMAIL PROTECTED]>
Subject: Re: WT Shaw temporarily sidelined
Date: Wed, 01 Sep 1999 12:11:51 -0500
don garrisan wrote:
>
> Thanks for all the banter, guys.......... I have been taking copies of
> the posts for him to read.
>
> He is hoping to get back to the newsgroups ASAP, but the doctors
> weren't too keen on him using a laptop on Sunday.
>
> Monday he used my machine for a short while, but the hospital
> switchboard was frowning on our use of the phone line.
>
> talk about control freaks!
:-) Too much fun causes stress. Besides, the hospital guys can't
play their games if the bandwidth is used up.
>
> BTW, Bill is an OLD FART!....early fifties
To a 90 year old, he's still a kid. Tell him to get well soon.
Patience, persistence, truth,
Dr. mike
------------------------------
From: [EMAIL PROTECTED] (SCOTT19U.ZIP_GUY)
Subject: THINK PEOPLE
Date: Wed, 01 Sep 1999 17:15:28 GMT
It really amazes me how little thinking gets done in this group.
It is if there is a bunch of grouppies waiting for the BS and David
Wagner types to release some knowlede. Well it is not going
to happen that is not in there agenda. I have an open question
that I doubt if they have the honesty to anwser in a fair way.
They talk about my crypto as that of a weak ametur but even
when they announce it is dead and someone actually looks into
it they are wrong.
People here is an example that can not be done with the weak
form of crypto these kinds of people and government wants you
to use.
Take a message several thousands of bytes long. Lets say
you send this message to 3 people. You use the same encryption
method for each person you also use the same key. But near
the middle of the message you have information that is unique
to each of the 3 people. Other than that the information and
files used are the same. And the key used was the same.
Lets suppose the enemy who every that could be. Gets
the 2 of the mesage you sent to 2 of the people includeing
all the source code the keys used and the the plain text
and encrypted files. Lets say they raid the third house
and due to a screw do not get a copy of the thrid message
decrypted. But they get all but the last 100 bytes of the
encrypted message. They have the KEY and they know
what 90%+ of the message is.
The question that Bruce and Dave will not honestly anwser is
how safe is the information if coded with any of there AES methods
or Blowfish or any other smelly fishy algorithm. Using only the
approved 3-letter chaining methods.
They will not anwser becasue they know the data is not safe by
there methods. Beacasue they want you to use methods that
are easy to break. If scott16u or scott19u is used your safe and
it they had any honesy they would tell you.
If I am wrong. Don't just scream and yell. SHow me. I have an
open mind and will admit they errors of me ways. All you have
to do is show me if you can.
David A. Scott
--
SCOTT19U.ZIP NOW AVAILABLE WORLD WIDE
http://www.jim.com/jamesd/Kong/scott19u.zip
http://members.xoom.com/ecil/index.htm
NOTE EMAIL address is for SPAMERS
------------------------------
From: Mok-Kong Shen <[EMAIL PROTECTED]>
Subject: Re: Standaarden in België
Date: Wed, 01 Sep 1999 19:14:00 +0200
Jean-Jacques Quisquater wrote:
>
> In one sentence: cryptography is free in Belgium.
Crypto is also free in Germany, at least for the coming 2 years.
France has earlier abandoned its own highly restrictive crypto laws.
So it seems that the crypto part of the Wassenaar Arrangement has
been partialy blocked.
M. K. Shen
------------------------------
From: [EMAIL PROTECTED]
Subject: Re: Schneier/Publsied Algorithms
Date: Wed, 01 Sep 1999 16:25:20 GMT
>
> I THINK THE QUESTION WAS TO TECHNICAL FOR MR "BS" HIMSELF
> THE GUY ASKED FOR TEST VECTORS. SURELY YOU HAVE SOME
> LIKE THE ONES I USE IN MY GLOAT CONTEST. THE KIND OF CONTEST
> THAT YOUR WEAK METHOD COULD NOT RUN USING ANY OF YOUR
> FAVORITE "FIPS" 3 LETTER CHAINNING METHODS.
>
> THE GUY EVEN CPITALIZED """"TEST VECTORS""" MORE THAN ONCE
> BUT I GUESS YOUR BRAIN OVER LOOKED IT. MAYBE THE USE OF
> CAPITAL LETTERS MADE IT TO HARD TO READ. HOW THE HELL DO
> YOU EXPECT HIM TO FIND THE ERRORS IF YOU CAN'T SEEM TO HAVE
> THE ABILITY TO ANWSER DIRECT QUESTION PUT TO YOU. DO YOU
> HAVE """TEST VECTORS""" FOR THE GUY OR NOT???
>
> SURELY THE "nsa" COULD SUPPLY SOME THAT WOULD SATISFY EVERY
> BODY OR ARE YOU TRYING TO HIDE CERTAIN FACTS. BECASUE I SUSPECT
> YOU CAN READ THE LETTER. AND THE LETTER PLAINLY ASKED FOR
>
> """""""""" TEST VECTORS """"""""" HEY WAKE UP
>
> David A. Scott
> --
> SCOTT19U.ZIP NOW AVAILABLE WORLD WIDE
> http://www.jim.com/jamesd/Kong/scott19u.zip
> http://members.xoom.com/ecil/index.htm
> NOTE EMAIL address is for SPAMERS
>
What is your problem DS? The question was how can bugs be in Bruce's
source code printed in the book. Yes I did see the embedded about TEST
VECTORS, but this was not the primary question. Why don't you re-read
the post and look at the very first question "How is it posible that
some of your published algorithms...2fish have bugs in your source
code?" and the very last question "But please Bruce...explain to us How
is it that there are bugs in your own published algorithms..."
I am sure this is a waste of time asking you this since you have such
an "I am better than everyone attitude" and will probably now start to
personnaly attack me, even though you have no idea who I am.
Sent via Deja.com http://www.deja.com/
Share what you know. Learn what you don't.
------------------------------
From: [EMAIL PROTECTED] (Aidan Skinner)
Subject: Re: Statue for Enigma hero
Date: 1 Sep 1999 16:53:24 GMT
Reply-To: [EMAIL PROTECTED]
On Tue, 31 Aug 1999 12:52:43 GMT, Nick Battle <[EMAIL PROTECTED]> wrote:
>There's more information on the film "U-571" (a Hollywood version of
>similar events) at http://members.tripod.com/Rose22/u571.htm
"version" in this case meaning "hollywood re-writing of events with
American heros, even though it took place before the US entered the
war and the US govt. ignored the warnings given to them by British
intellgence".
Sorry, pet peeve right now. I'm studying history as well as a computer
science. ;)
- Aidan
--
http://www.skinner.demon.co.uk/aidan/
http://www.gla.ac.uk/Clubs/WebSoc/~9704075s/
What evil shall I do today?
------------------------------
From: [EMAIL PROTECTED]
Subject: Password Encrytion Algo
Date: Wed, 01 Sep 1999 15:13:22 GMT
I am looking for a reliable encryption algorithm to encrypt
data/password before storing them into an ASCII file.
Any help would be appreciated
Sent via Deja.com http://www.deja.com/
Share what you know. Learn what you don't.
------------------------------
From: Kent Briggs <[EMAIL PROTECTED]>
Subject: Re: RC4 question
Date: Wed, 01 Sep 1999 15:20:24 GMT
"Trevor Jackson, III" wrote:
> For Marketing reasons they need to be able to claim 128-bit strength. For export
> reasons they need to have 40-bit strength.
FYI: general purpose encryption systems can now be exported with 56-bit strength
(after the usual approval process).
--
Kent Briggs, [EMAIL PROTECTED]
Briggs Softworks, http://www.briggsoft.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
******************************
