Cryptography-Digest Digest #52, Volume #11 Fri, 4 Feb 00 16:13:01 EST
Contents:
Legitimate Professional Password Cracking? ([EMAIL PROTECTED])
Re: Reversibly combining two bytes? (Tim Tyler)
Re: How to password protect files on distribution CD (Alan J Rosenthal)
Re: Math contest winner from Ireland... (Derek Bell)
Re: Challenge: Who can discover the encryption used here? ("TJ")
Re: Challenge: Who can discover the encryption used here? ("TJ")
Re: Keyword Cipher Cracker program (Derek Bell)
Re: How to Annoy the NSA (Derek Bell)
Re: ASCII ("C. Prichard")
measure for encryption algorithm ([EMAIL PROTECTED])
Re: Legitimate Professional Password Cracking? (Mike Rosing)
Re: ascii to binary (wtshaw)
Re: Legitimate Professional Password Cracking? (JPeschel)
Bluetooth und E0 ("Bernhard Lhlein" <[EMAIL PROTECTED]>)
Re: 26-Dimensional cipher - is it secure (or even possible)? (wtshaw)
Re: free C crypto API (Tom St Denis)
Re: Legitimate Professional Password Cracking? (Tom St Denis)
A proposal -- actually I need some earnings .... Nokia Telecommunication (Markku J.
Saarelainen)
Re: Cipher challenge (of sorts) (Glenn Larsson)
Few additional links (Markku J. Saarelainen)
----------------------------------------------------------------------------
From: [EMAIL PROTECTED]
Subject: Legitimate Professional Password Cracking?
Date: Fri, 04 Feb 2000 17:06:31 GMT
I know this might not be the perfect place to ask this question, but I
don't know where else to start. Please don't flame.
I am looking for a legitimate, professional, consulting type service
that can take a list of passwords and crack them. It is a Unix style
password file or something similar that contains around 300,000 -
500,000 entries. I know that they cannot be 100% accurate, but with
today�s tools I hear accuracy is very high.
Again, this is very much on the up and up, so if you have any
suggestions, please only the legit (legal) ones.
Thanks in advance,
-Ash
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: Tim Tyler <[EMAIL PROTECTED]>
Subject: Re: Reversibly combining two bytes?
Reply-To: [EMAIL PROTECTED]
Date: Fri, 4 Feb 2000 17:06:57 GMT
In sci.crypt Michael Wojcik <[EMAIL PROTECTED]> wrote:
: [EMAIL PROTECTED] (Nick Maclaren) writes:
[balanced Latin Squares with "massive internal state"...?]
:> The converse of having "massive internal state" is that Latin squares
:> have very few degrees of freedom.
Compared to a random square, yes. I'd say there was still a fair few
"degrees of freedom", though.
:> Once you have settled only a few of their numbers, the rest can be
:> arranged only one way (if at all.)
That sounds like a bit of an exaggeration to me.
: True - but the proposed method (generating a square as a random
: permutation of the rotations of a random permutation, then randomly
: swapping rows and/or columns) will always generate a valid square.
This method seems interesting - mainly due to its speed.
It may be that the results will be systematically weak in some way,
though. If I planned to use this, I'd generate some squares and test
them with a stack of orthodox s-box criteria before doing much else.
: Whether that square is "strong" (are all squares equally strong, or
: are some, say, easier to reconstruct from cyphertext?) is another
: question.
Squares are not all equally strong. Squares of the form...
x(i,j) = (i+j) mod n, (i=1->n, j=1->n) would not do at all, for example.
: And of course the quality of the shuffling algorithm and the PRNG
: used to produce the permutations is a potential problem.
Yes. This is a potential problem we have anyway, if we're trying to
generate s-boxes dynamically from a key.
: Would the key also be used in producing the square itself (say by seeding
: the PRNG)? Might this leak information about the key, particularly
: in chosen-plaintext attacks?
I suspect the answer to this is that there's real reason why it should
do, if things are done properly.
I think I'd rather have s-boxes whose contents depended on key bits than
some static s-boxes chosen from a list - if I can afford the time to
generate them before encrypting and decrypting.
--
__________
|im |yler The Mandala Centre http://www.mandala.co.uk/ [EMAIL PROTECTED]
The only way to get rid of temptation is to yield to it.
------------------------------
Crossposted-To: alt.security.pgp,comp.security.unix
From: [EMAIL PROTECTED] (Alan J Rosenthal)
Subject: Re: How to password protect files on distribution CD
Date: 4 Feb 2000 16:38:01 GMT
[EMAIL PROTECTED] (Vernon Schryver) writes:
>If the $30K package worked on the
>system on which you installed it, and stopped only when you made major
>hardware changes, then most technical people as well as some judges and
>juries would figure you're probably not innocent.
It depends on whether the incompatibility with the newer hardware is
legitimate or gratuitous. A specific check for the old hardware and a
refusal to run is obviously the fault of the author(s) of that particular code
(by which term I mean to include those involved in its specification too).
------------------------------
From: Derek Bell <[EMAIL PROTECTED]>
Subject: Re: Math contest winner from Ireland...
Date: 4 Feb 2000 18:11:35 -0000
Douglas A. Gwyn <[EMAIL PROTECTED]> wrote:
: ef wrote:
:> A year or two ago there was a high school girl from Ireland that won a
:> math contest for her solution dealing with algorithms that would produce
:> faster methods of encryption.
: I thought it was a science fair.
Yes, she won the top award for the Young Scientists' science fair a
couple of years back.
:> Does anyone know her name or what's happened to her since?
: Sarah Flannery. Use "Deja news" to find discussion about her.
ISTR a paper of hers was published on jya.com - she had discovered some
potential flaws in her algorithm and listed them. She learned some things about
crypto from people at Baltimore technologies and impressed them. Her algorithm
is called the "Caley-Purser" algorithm after the 19th century English
algebraist and a lecturer in TCD who was involved with Baltimore.
Derek
--
Derek Bell [EMAIL PROTECTED] | Socrates would have loved
WWW: http://www.maths.tcd.ie/~dbell/index.html| usenet.
PGP: http://www.maths.tcd.ie/~dbell/key.asc | - [EMAIL PROTECTED]
------------------------------
From: "TJ" <[EMAIL PROTECTED]>
Subject: Re: Challenge: Who can discover the encryption used here?
Date: Fri, 04 Feb 2000 18:13:14 GMT
> What about contacting the guys who wrote it?
>
Yeah,
I tried that thanks, but they "do not have the human resources to enable us
to deal with such specific and individual requests.......yadda "
I just thought the crew here might be able to decipher the text thats all.
Guess I over-estimated the abilities of those who patronise this newsgroup.
Thanks anyway
TJ
------------------------------
From: "TJ" <[EMAIL PROTECTED]>
Subject: Re: Challenge: Who can discover the encryption used here?
Date: Fri, 04 Feb 2000 18:13:16 GMT
NFN NMI L. <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]...
> <<I deal with trainers>>
>
> Cheat programs.
>
> S.T.L.
If you dont know how to do what I need, or if you do know but aren't willing
to help, why bother replying? It seems to be as much a waste of your time as
mine.
After all, If I wanted or needed your views on the morality of cheating at
computer games I would have asked for that.
Thanks for nothing ;o)
TJ
------------------------------
From: Derek Bell <[EMAIL PROTECTED]>
Subject: Re: Keyword Cipher Cracker program
Date: 4 Feb 2000 18:14:33 -0000
Douglas A. Gwyn <[EMAIL PROTECTED]> wrote:
: Glenn Larsson wrote:
:> Question: Are there any other cryptological museums on this
:> planet? (As in more near Sweden? :o)
: I don't know about Sweden, but Bletchley Park has been turned into
: a museum.
Details about Bletchley are at www.bletchleypark.org.uk
There is also a mailing list which can be read about at
www.cranfield.ac.uk/ccc/bpark/
Derek
--
Derek Bell [EMAIL PROTECTED] | Socrates would have loved
WWW: http://www.maths.tcd.ie/~dbell/index.html| usenet.
PGP: http://www.maths.tcd.ie/~dbell/key.asc | - [EMAIL PROTECTED]
------------------------------
From: Derek Bell <[EMAIL PROTECTED]>
Subject: Re: How to Annoy the NSA
Date: 4 Feb 2000 18:25:38 -0000
[EMAIL PROTECTED] wrote:
: Actually, Doug Gwyn is wrong and why should
: anyone trust his opinion, especially vs.
: Science Magazine.
Doug Gwyn is well-respected for his contributions to sci.crypt - he
knows what he's talking about. A popular magazine can often run the risk of
oversimplifying and sometimes being outright wrong.
: In message #5 of this thread he wrote exactly, "RSA depends for its
: security on the difficulty of factoring
: products of large primes".
This is true. Small examples of products of primes are 15 (3x5),
35 (5x7) and 49 (7x7).
: By definition, it is impossible to factor prime numbers!!!
By definition it is *trivial* to factor prime numbers - a prime number
p is equal to 1xp.
Of course, determining if a number is prime might take a while -
quite a while if the number is several hundred bits long! :-)
Derek
--
Derek Bell [EMAIL PROTECTED] | Socrates would have loved
WWW: http://www.maths.tcd.ie/~dbell/index.html| usenet.
PGP: http://www.maths.tcd.ie/~dbell/key.asc | - [EMAIL PROTECTED]
------------------------------
From: "C. Prichard" <[EMAIL PROTECTED]>
Subject: Re: ASCII
Date: Fri, 04 Feb 2000 18:11:21 GMT
Its an acronym I think.
Actually ASCII properly includes chars 0 - 127 0x00 to 0x7f binary. =
Though most people have become accustomed to thinking of it as the set =
8-bit characters through 255 or 0xff.
The character set most commonly used with the internet is referred to as =
"ISO - Latin 1" and it has 8-bit representation through 0xff 255.
I developed CipherText to cipher common text messages. Thinking them to =
be ASCII, I declared it an ASCII cipher, but it is a slight misnomer as =
a portion of the characters in many messages are technically not ASCII. =
They are in fact in the ISO Latin 1 character set that is commonly =
mistaken for ASCII. Nevertheless, the cipher handles and passes them as =
required. This ups the bandwidth considerably to 0xe0, about 87.5 % =
that of the normal data cipher. Although its possible for a character to =
be anything in the range, its not actually the case as characters are =
limited by the allowed key values.
For efficiency, it seems logical to encrypt text so that the ciphered =
message is also text and ready for transmission using a text protocol. =
You can use binary mode to send a complex message containing some text =
and some 8-bit data, but it seems that the data values 0x00 - 0x1f are =
often mishandled when the client is a common internet browser. To be =
honest I have not tried sending all characters 0x00 - 0x1f to see how =
they are passed. I plan to simply filter all those passed except for the =
designated values like 0x0a and 0x0d.=20
The scheme works well enough for ciphered iso Latin 1 text messages =
containing plaintext within the CGI protocol. For now, this is about as =
far as I need to take my implementation of CipherText as I have found it =
to fit the existing requirement. All messages are ciphered and passed =
without errors or dropout. Message length can be reasonably long before =
causing a timeout due to prioritizing done somewhere in the ATM layer of =
the transport system. Short messages are passed up and back quickly =
requiring no special handling for possible errors because the message is =
checked when it is handled.
That it is preferred that an entirely new protocol is used to handle =
just 12% more values differently seems incredulous. Its clearly more =
efficient to encrypt text that has to be transmitted as ciphertext with =
other plaintext values using an ISO Latin - 1 (ASCII) cipher. But is it =
the choice? Quite implicitly, the answer is of course a true 'no.'
Why?
The following is a entire chapter to explain the system of ... that =
exists today to .... and .... probably will be able to withstand public =
scrutiny until finally ...
Ahem.
-C. Prichard
------------------------------
From: [EMAIL PROTECTED]
Subject: measure for encryption algorithm
Date: Fri, 04 Feb 2000 18:29:59 GMT
Hi !
How is the security of the encryption algorithm measured and can
someone help me out with some figures for IDEA(International data
encryption algorithm)
Please respond to me directly or include my email in the CC list.
thanks
maneesh
[EMAIL PROTECTED]
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: Mike Rosing <[EMAIL PROTECTED]>
Subject: Re: Legitimate Professional Password Cracking?
Date: Fri, 04 Feb 2000 12:36:44 -0600
[EMAIL PROTECTED] wrote:
>
> I know this might not be the perfect place to ask this question, but I
> don't know where else to start. Please don't flame.
>
> I am looking for a legitimate, professional, consulting type service
> that can take a list of passwords and crack them. It is a Unix style
> password file or something similar that contains around 300,000 -
> 500,000 entries. I know that they cannot be 100% accurate, but with
> today?s tools I hear accuracy is very high.
>
> Again, this is very much on the up and up, so if you have any
> suggestions, please only the legit (legal) ones.
Check out www.crak.com or www.counterpane.com
Patience, persistence, truth,
Dr. mike
------------------------------
From: [EMAIL PROTECTED] (wtshaw)
Subject: Re: ascii to binary
Date: Fri, 04 Feb 2000 12:42:38 -0600
In article <[EMAIL PROTECTED]>, [EMAIL PROTECTED]
(NFN NMI L.) wrote:
> Gaaaach. Look at all the cruddy C code.
>
> In any case, ASCII is stored as binary. Maybe you C (scoff) people think of
> ASCII as 0-255, but I've always though of it as 8-bit binary codes since
> reading _Understanding Computers_ (these really cool silvery books that, if I
> recall correctly, Timelife published).
>
Since usual ascii, normal keyboard, uses only 95-96 characters or so, and
since binary values are easily represented in a base of 64, it seems
reasonable to do some of my base translation to get more efficient bits
than you can get from machine bits for ascii.
Pulling our Wharton, base 100 to 64, the above paragraph, with default
listed keys, is easily put into 6-bit characters. I realize some will
have problems if they use programs with embedded characters for format
purposes, and will not get the full picture, but that is easily modified
with change in the 64 set.
3-:j"-)5ir ?m8csv#'?5 a3d>t[:jjl :;wmm7]}j} 'k/$,e}x/: aj?5)4htd"
?pfzo1aqlm {9~qf=xb=> !7uez'[@zs (@{b9-)7iq 'fix37]>uv ?p4>i-)y28
<s)ur"]=05 (@4hkd@sbb a3z'snh)qj >e;8}#sidc :6qz-',q:u a5we3"zj:%
]t:c&ac@ku ?]"kkfd.?s <%1q*w!{{" {f+,sx+=l@ :i/dlezd!~ ]|5!0w$a;e
(t(ny#z-nt ?nt+m#:)g; {7|k!6-[us :izu>1>6:? }+ty)]h8ri
abcdefghijklmnopqrstuvwxyz/0123456789.,?!:;()[]{}<>'"-=*+~#%$&@|
Note that 9 characters in base 100 gives you 10 in base 64. There are
other options, and substitution and transposition keys can be incorporated
into the process, rather were disregarded in this *format* example,
non-encryptive, don't you know. :)
--
A big-endian and a little-endian have been spotted sitting at a
campfire nibling on bytes and pointing at each other as they
argued about who got hit with the most errors.
------------------------------
From: [EMAIL PROTECTED] (JPeschel)
Subject: Re: Legitimate Professional Password Cracking?
Date: 04 Feb 2000 19:37:47 GMT
Mike Rosing [EMAIL PROTECTED] writes:
>[EMAIL PROTECTED] wrote:
>>
>> I know this might not be the perfect place to ask this question, but I
>> don't know where else to start. Please don't flame.
>>
>> I am looking for a legitimate, professional, consulting type service
>> that can take a list of passwords and crack them. It is a Unix style
>> password file or something similar that contains around 300,000 -
>> 500,000 entries. I know that they cannot be 100% accurate, but with
>> today?s tools I hear accuracy is very high.
>>
>> Again, this is very much on the up and up, so if you have any
>> suggestions, please only the legit (legal) ones.
>
>Check out www.crak.com or www.counterpane.com
You might want to try AccessData, too.
http://www.accessdata.com
Joe
__________________________________________
Joe Peschel
D.O.E. SysWorks
http://members.aol.com/jpeschel/index.htm
__________________________________________
------------------------------
From: "Bernhard L<F6>hlein" <[EMAIL PROTECTED]>
Crossposted-To: sci.crypt.research
Subject: Bluetooth und E0
Date: 4 Feb 2000 11:40:11 -0800
Hello,
Bluetooth is a new technology for building wireless
local area networks ( http://www.bluetooth.com ).
The communication link between two entities is
encrypted with the so called E0-Algorithm.
E0 is a synchronous and additive stream cipher.
Does anyone know who has designed this cipher ?
Are there any analysis or attacks on the E0 availible ?
Thanks,
Bernhard
========
Bernhard Loehlein
Department of Communication Systems/FTK
Faculty of Electrical Engineering
University of Hagen
Feithstrasse 142/TGZ
58084 Hagen
Germany
e-mail: [EMAIL PROTECTED]
WWW: http://ks.fernuni-hagen.de
Tel.: +49-2331-987-4172
Fax.: +49-2331-987-397
------------------------------
From: [EMAIL PROTECTED] (wtshaw)
Subject: Re: 26-Dimensional cipher - is it secure (or even possible)?
Date: Fri, 04 Feb 2000 12:50:54 -0600
In article <87drka$jog$[EMAIL PROTECTED]>, [EMAIL PROTECTED] wrote:
I wrote:
>
> > Let me remind those skeptics that anyone can have a shot at
> > multidimmensional algorithms if you are willing to leave the comforts that
> > wandering about in three, and doing algorithms in one or two gives you.
> The only multi-dimensional algorithm I am
> personally aware of is a Monte Carlo
> algorithm. What kinds of algorithms do you
> mean? Also, is it possible to base
> cryptography on higher dimensional automata?
>
Dimensions are just a math thingee, and not necessarily reached by
familiar means. Become Alice, and walk simply where you are taught not
to.
Multidimensional explanations are puzzles for the mind to comprehend, but
can be a way to show what is easily missed by those who think C-code best
illustrates ideas.
I'm trying not to repeat some of my posts that would best answer your
question, but I may be dragged kicking and screaming to do so.
--
A big-endian and a little-endian have been spotted sitting at a
campfire nibling on bytes and pointing at each other as they
argued about who got hit with the most errors.
------------------------------
From: Tom St Denis <[EMAIL PROTECTED]>
Subject: Re: free C crypto API
Date: Fri, 04 Feb 2000 19:58:27 GMT
In article <[EMAIL PROTECTED]>,
Runu Knips <[EMAIL PROTECTED]> wrote:
> Tom St Denis schrieb:
> > In article <862jhk$ohd$[EMAIL PROTECTED]>,
> > Greg <[EMAIL PROTECTED]> wrote:
> > > > Well I decided to release CB a bit early. I am looking for
> > > > comments/suggestions/improvements.
> > > > Basically CB is a complete crypto API. It can make/use RSA
crypto,
> > > > symmetric crypto, has data compression, a RNG, base64 routines
and
> > > > more. [...]
> > > > All of this is free!!!
> > >
> > > I downloaded a copy of your stuff and noticed that you did not
> > > ask me anything. Where is the server located?
> >
> > I will not dignify that. I was hoping for real discussion about
> > working on CB [i.e bugs or what have not]. This group has some of
the
> > smartest people in the world yet they can't stay on task.
> > Did you have any troubles building CB on your computer?
>
> No problems with VC++ 5.0 under Windows. Will check gcc/linux at
> home. And I've seen worser cryptographical libaries before.
> However, many of this stuff is from other people, plus, for
> example, IDEA is patented and can't be used for free. But has
> a twofish implementation, too. Very good, so I can drop IDEA
> anyway :)
>
I am glad you like it. Please note that the current version up there
has some bugs in it. Small glitches... I have been working on it
locally and plan to upload it again soon. In the mean time you can
still look at it and play around.
Tom
-
[EMAIL PROTECTED]
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: Tom St Denis <[EMAIL PROTECTED]>
Subject: Re: Legitimate Professional Password Cracking?
Date: Fri, 04 Feb 2000 20:07:18 GMT
In article <87f0ui$e4v$[EMAIL PROTECTED]>,
[EMAIL PROTECTED] wrote:
> I know this might not be the perfect place to ask this question, but I
> don't know where else to start. Please don't flame.
>
> I am looking for a legitimate, professional, consulting type service
> that can take a list of passwords and crack them. It is a Unix style
> password file or something similar that contains around 300,000 -
> 500,000 entries. I know that they cannot be 100% accurate, but with
> today�s tools I hear accuracy is very high.
>
> Again, this is very much on the up and up, so if you have any
> suggestions, please only the legit (legal) ones.
>
> Thanks in advance,
>
> -Ash
The only real way to attack old unix style password files is to try
every single password and salt combo and look for matches. Newer
software will most likely use a larger hash and salt making brute force
search of the entire file [or even one password] very difficult.
Assuming there is about 60 bits of entropy in the password, and you can
search 10 million keys a second, you need 57,646,075,230 seconds avg
per password. This search can be parallelized giving linear speed ups,
but for the most part very impractical. One prime difficulty is
guessing the length of the password. Because given base 64 you can
stuff 60 bits in 10 ascii chars, but I could spread that over 20 ascii
chars... say 'x x x x x x x x x' [x = ascii char of key]. Which means
the format of the 'key' is also unknown.
Just trying all possible base64 combos upto 14 chars is like tring a 84
bit key...
Of course people will say 'most passwords only have about 30 bits of
entropy or so' but it's finding where the entropy lies is the problem.
Technically the entropy lies in the entire password [in the above
example this includes the spaces], but building a search engine around
this would be difficult.
Trying only alpha's (lowercase) upto 20 chars is like searching a 94
bit key. Upto 10 chars is like a 47 bit key etc...
Enough of me... hehehe
Tom
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: Markku J. Saarelainen <[EMAIL PROTECTED]>
Crossposted-To: alt.politics.org.cia
Subject: A proposal -- actually I need some earnings .... Nokia Telecommunication
Date: Fri, 04 Feb 2000 20:13:10 GMT
I have a proposal for those who are interested. Since I have not been
able to get a contract for a year and need to have some earnings before
I blow my brains out, I would like to make my proposal for any
corporation and business intelligence organization around the world.
I can perform specific counter-intelligence activities to collect the
information and analyze the competitive intelligence practices and
systems of Nokia Telecommunication globally. In addition, I can help to
collect and analyze specific businesses and products of Nokia
Telecommunication. I can also complete many other competitive
intelligence related projects and processes.
My background is ideal for this. I have the Master of Science (studies
in three different universities: Finland, the USSR and the U.S.A.) and
I completed my thesis in a Finnish international corporation (the
thesis: Business Consolidation in the North America) having the
background similar to Nokia Telecommunication. I studied the quality
system, policy and procedures of Nokia Telecommunication in the late
1980's. I have studied with people who are now working for Nokia
Telecommunication (software development, international marketing and
so.) and I know people from my childhood who are or were working in
Nokia Telecommunications. I have an excellent international background
and travel experience. I understand requirements and operational
aspects of international and global businesses. I know, speak, write
and understand fluently the language used by many key executives are
using in Nokia Telecommunication. I have talked in the past with
Nokia's competitive intelligence people and security personnel and
received materials from them. And I am always willing to travel to
strange places and meet strange people.
If you are interested in this, please contact me: P.O. Box 2314,
Duluth, GA 30096, my [EMAIL PROTECTED] or call 678-366-6346 (this is my
current phone number (I just got it - actually for my civil suit
process) (there is currently a problem me accessing my vjmail account).
I really need some earnings.
Best regards,
Markku
P.S. If you are interested and willing to hire me, we'll play the Game
of General / M with the CEO of Nokia Telecommunication.
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: Glenn Larsson <[EMAIL PROTECTED]>
Reply-To: [EMAIL PROTECTED]
Subject: Re: Cipher challenge (of sorts)
Date: Fri, 04 Feb 2000 21:21:47 +0100
TJ wrote:
> ...it may have been encrypted using Adobe Premiere 4.2...
Are you shore you're not just lacking some video CoDec?
Adobe Premiere isn't exactly widely known for it's
encryption capabillities..
/Glenn
_________________________________________________
Spammers will be reported to their government and
Internet Service Provider along with possible legal
reprocussions of violating the Swedish "Personal
Information Act" of 1998. (PUL 1998:204)
------------------------------
From: Markku J. Saarelainen <[EMAIL PROTECTED]>
Crossposted-To: alt.politics.org.cia
Subject: Few additional links
Date: Fri, 04 Feb 2000 20:28:02 GMT
PSYOPS
http://server.bmod.athabascau.ca/html/aupr/cognitive.htm
IWAR
http://www.psycom.net/iwar.1.html
MEMES
http://www.7pillars.com/papers/Memetics.html
CRYPTO PEOPLE (My favorite)
http://www.counterpane.com/researchers.html
IW
http://www.africa2000.com/PNDX/pndx.htm
IW
http://www.infowar.com/
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
** 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
******************************
