Cryptography-Digest Digest #357, Volume #10 Sun, 3 Oct 99 21:13:03 EDT
Contents:
Cryptography with Mathematica ("Dominik Grolimund")
Does anyone have more information? (Michael =?iso-8859-1?Q?=D8stergaard?= Pedersen)
Re: On oldy encryptions (Mok-Kong Shen)
dadada ([EMAIL PROTECTED])
rc5-128 bit ("John Croll")
Blowfish exportable? (dogHaus)
A simple preprocessing scheme for plaintexts (Mok-Kong Shen)
Re: gnu mp library exponentiation function (Amos Waterland)
Re: Is 128 bits safe in the (far) future? ("Trevor Jackson, III")
Re: rc5-128 bit ("John Croll")
Re: radioactive random number generator (Hironobu SUZUKI)
Re: Factoring public keys attack? (Matt Gibson)
512-bit key broken in microseconds?! (Arthur Dardia)
Re: factoring with quadratic sieve (jerome)
Re: Compression Encryption & Plain Text Attacks (wtshaw)
Re: Addition/subtraction mod 256 vs. XOR (Mike DeTuri)
Re: 512-bit key broken in microseconds?! ("William Morton")
Re: Compression Encryption & Plain Text Attacks (wtshaw)
Help with Cryptanalysis ("Benjamin Slavin")
----------------------------------------------------------------------------
From: "Dominik Grolimund" <[EMAIL PROTECTED]>
Subject: Cryptography with Mathematica
Date: Sun, 3 Oct 1999 21:37:12 +0200
Hello
I'm an 19-year-old student from Switzerland. I have to do a project with
Mathematica at school, and as topic I chose 'Cryptography'. Has anyone of
you any code, a notebook or a package which you could send me by email? Any
stuff to start with could help me.
My work is it to do a 'package' in Mathematica 3.0 with which you can code
plain text with any algorithm. Wonderful would it be, if I had an assymetric
algorithm like rsa, etc. (public key).
Thanks for any help.
Dominik Grolimund
--
email: [EMAIL PROTECTED] - web: http://www.caleido.ch
------------------------------
From: Michael =?iso-8859-1?Q?=D8stergaard?= Pedersen <[EMAIL PROTECTED]>
Subject: Does anyone have more information?
Date: Sun, 03 Oct 1999 20:42:26 +0200
If you go to
http://www.sunday-times.co.uk/news/pages/tim/99/09/29/timintint02001.html?1341861
you find an article that a 512-bits RSA have been broken in 12
microseconds.
Anyone have some more news on this? Personally I think this is a big
hoax, but perhaps some of you have more information...
------------------------------
From: Mok-Kong Shen <[EMAIL PROTECTED]>
Subject: Re: On oldy encryptions
Date: Sun, 03 Oct 1999 22:17:40 +0200
[EMAIL PROTECTED] wrote:
>
> I wouldn't recommend going back to paper-and-pencil style methods simply
> because some modern encryption programs use bloated file formats.
>
> Encrypting with DES or Blowfish only requires that your message be at
> least eight bytes long.
As I said, sophisticated users would probably even choose to use
quintuple AES or perhaps stronger systems.
M. K. Shen
------------------------------
From: [EMAIL PROTECTED]
Subject: dadada
Date: Sun, 3 Oct 1999 22:36:02 +0100
sorry...
------------------------------
From: "John Croll" <[EMAIL PROTECTED]>
Subject: rc5-128 bit
Date: Sun, 3 Oct 1999 15:46:35 -0500
this program allows any one who is good at logic problems and word games
to decypher plain text from an rc-5 cypher regardless of key length. the
only
caveat is that the plaintext must conform to standard english grammar. this
method is not well suited to extracting numerical data. as is, the program
only dumps data concerning one cypher hex and one letter at a time. their
is a rem'ed out block where i tried to add scoring for the whole alphabet.
but my programming skills are not up to the task. if you improve it, you
may copyright that improvement.
begin below----------------------
file://microft visual c++ 5.0
#include <stdlib.h >
#include <stddef.h>
#include <stdio.h >
#include <math.h >
#include <ios.h >
#include <iostream.h>
#include <conio.h>
#include <cstring>
#include <ostream>
#include <stdarg.h >
#include <sstream>
void main()
{
int m;
int n;
char ms[3];
int temp1;
int temp2;
int temp3;
int temp4;
unsigned int ROT_IT;
unsigned int ROR_IT;
int ND_IT;
int XOR_IT;
int MOD_IT;
int MOD_IT2;
int OR_IT;
int SCO;
int OUTPA[255][255];
char ns;
n=1;
m=1;
for( int k = 32; k < 128; ++k )
{
for( int j = 32; j < 128; ++j )
{
OUTPA[m][n]=1;
n ++;
}
m ++;
}
cout << "copyright c 1999, Richard Lee King Jr." << endl;
while (m!=999){
cout << "Enter the Hexadecimal Value of the Cypher Byte:(01 to ff)" << endl;
cin >> ms;
temp1=0;
temp2=0;
temp3=0;
temp4=0;
temp1=ms[0];
temp2=ms[1];
temp3=temp1;
temp4=temp2;
if (temp1<64)
{
temp1=(temp1-48)*16;
}
if (temp2<64)
{
temp2=(temp2-48);
}
if (temp3>95)
{
temp1=(temp1-97+10)*16;
}
if (temp4>95)
{
temp2=(temp2-97+10);
}
m=(temp1+temp2);
cout << m << endl;
if (m>128){m=m-128;}
n=32;
SCO=0;
for( int i = 32; i < 128; ++i )
{
ROT_IT= _rotl(m,n);
if ( ROT_IT>255 ){ ROT_IT=ROT_IT%256;}
ROR_IT= _rotr(m,n);
if ( ROR_IT>255 ){ ROR_IT=ROR_IT%256;}
ND_IT= m&n;
XOR_IT= m^n;
MOD_IT= m%n;
MOD_IT2= n%m;
OR_IT=m|n;
if ((MOD_IT2==XOR_IT) && (MOD_IT==m)){SCO ++;}
if ((ROT_IT==192) && (MOD_IT==m)){SCO ++;SCO ++;}
if ((((ROT_IT==0) && (MOD_IT==m)) && (OR_IT==n)) && ((XOR_IT%8)==1)){SCO
++;}
if ((ROT_IT==0) && (MOD_IT==m) && (OR_IT==127) && ((ND_IT%8)==0)){SCO ++;}
if ((ROT_IT==0) && (MOD_IT==MOD_IT2) && (XOR_IT==0) && (ND_IT==n) &&
(OR_IT==n) && (MOD_IT==0)){SCO ++;}
if ((ROT_IT==0) && (MOD_IT2==n) && (ND_IT==n)){SCO ++;}
if ((ROT_IT==0) && (MOD_IT==m) && (OR_IT==121) && (XOR_IT==95)){SCO ++;}
if ((ROT_IT==0) && (MOD_IT==m) && ((ND_IT%8)==0) && (OR_IT==121)){SCO ++;}
if ((ROT_IT==0) && (MOD_IT2==0) && ((ND_IT%8)==0) && (OR_IT==125)){SCO ++;}
if ((ROT_IT==0) && (MOD_IT2==n) && (OR_IT==127) && (ND_IT==98)){SCO ++;}
if ((ROT_IT==0) && (MOD_IT==m) && (OR_IT==126)){SCO ++;}
if ((ROT_IT==128) && (MOD_IT2==n) && (ND_IT==n)){SCO ++;}
if ((MOD_IT==ND_IT) && (XOR_IT==n) && (ROT_IT==0)){SCO ++;}
if ((MOD_IT==ND_IT) && (OR_IT==n) && (ROT_IT==0)){SCO ++;}
file://if (((ND_IT%32)==0) && (M_IT==m)){SCO ++;}
OUTPA[1][n-1]=SCO;
SCO=0;
n ++;
}
cout << "Input Trial Letter to See Logic Output at Bottom: " << endl;
cin >> ns;
n=ns+1;
/* this block does not function correctly.
cout << "A: " << OUTPA[1][65] << " B: " << OUTPA[1][66] << " C: " <<
OUTPA[1][67] << " D: " << OUTPA[1][68] << " E: " << OUTPA[1][69] << " F: "
<< OUTPA[1][70] << " G: " << OUTPA[1][71] << " H: " << OUTPA[1][72] << " I:
" << OUTPA[1][73] << " J: " << OUTPA[1][74] << endl;
cout << "K: " << OUTPA[1][75] << " L: " << OUTPA[1][76] << " M: " <<
OUTPA[1][77] << " N: " << OUTPA[1][78] << " O: " << OUTPA[1][79] << " P: "
<< OUTPA[1][80] << " Q: " << OUTPA[1][81] << " R: " << OUTPA[1][82] << " S:
" << OUTPA[1][83] << " T: " << OUTPA[1][84] << endl;
cout << "u: " << OUTPA[1][85] << " V: " << OUTPA[1][86] << " W: " <<
OUTPA[1][87] << " X: " << OUTPA[1][88] << " Y: " << OUTPA[1][89] << " Z: "
<< OUTPA[1][90]<< endl;
cout << " " << endl;
cout << "a: " << OUTPA[1][97] << " b: " << OUTPA[1][98] << " c: " <<
OUTPA[1][99] << " d: " << OUTPA[1][100] << " e: " << OUTPA[1][101] << "
f: " << OUTPA[1][102] << " g: " << OUTPA[1][103] << " h: " << OUTPA[1][104]
<< " i: " << OUTPA[1][105] << " j: " << OUTPA[1][106] << endl;
cout << "k: " << OUTPA[1][107] << " l: " << OUTPA[1][108] << " m: " <<
OUTPA[1][109] << " n: " << OUTPA[1][110] << " o: " << OUTPA[1][111] << " p:
" << OUTPA[1][112] << " q: " << OUTPA[1][113] << " r: " << OUTPA[1][114] <<
" s: " << OUTPA[1][115] << " t: " << OUTPA[1][116] << endl;
cout << "u: " << OUTPA[1][117] << " v: " << OUTPA[1][118] << " w: " <<
OUTPA[1][119] << " x: " << OUTPA[1][120] << " y: " << OUTPA[1][121] << " z:
" << OUTPA[1][121] << endl;
cout << " " << endl;
cout <<"(0) " << OUTPA[1][48] << " (1) " << OUTPA[1][49] << " (2) " <<
OUTPA[1][48] << " (3) " << OUTPA[1][49] << " (4) " << OUTPA[1][50] << " (5)
" << OUTPA[1][51] << " (6) " << OUTPA[1][52] << " (7) " << OUTPA[1][53] << "
(8) " << OUTPA[1][54] << " (9) " << OUTPA[1][55] << " (10) " << OUTPA[1][56]
<< endl;
cout <<"(/) " << OUTPA[1][47] << " (-) " << OUTPA[1][43] << endl;
*/ end of funky block.
file://if (m>128){m=m-128;}
ROT_IT=_rotl(m,n);
if ( ROT_IT>255 ){ ROT_IT=ROT_IT%256;}
ROR_IT= _rotr(m,n);
if ( ROR_IT>255 ){ ROR_IT=ROR_IT%256;}
ND_IT= m&n;
XOR_IT= m^n;
MOD_IT2= n%m;
MOD_IT= m%n;
OR_IT=m|n;
cout << "ROTL " << ROT_IT << endl;
cout << "ROTR " << ROR_IT << endl;
cout << "AND " << ND_IT << endl;
cout << "XOR " << XOR_IT << endl;
cout << "MOD " << MOD_IT << endl;
cout << "OR " << OR_IT << endl;
cout << "MOD2 " << MOD_IT2 << endl;
cout << " " << endl;
cout << "sub_key= " << (m^n) << endl;
printf ("letter is: %c = %d \n ", n-1, n);
}
}
------------------------------
From: dogHaus <[EMAIL PROTECTED]>
Subject: Blowfish exportable?
Date: Sun, 3 Oct 1999 13:28:53 -0700
[This followup was posted to sci.crypt and a copy was sent to the cited
author.]
I am developing software that includes encryption capabilities. The
encryption is only used to encrypt communications between my client
software and a central server.
Blowfish looks suitable for my needs - if I embed Blowfish, will my
client software still be exportable overseas?
--
Please cc replies to email. Thanks!
- dogHaus development
------------------------------
From: Mok-Kong Shen <[EMAIL PROTECTED]>
Subject: A simple preprocessing scheme for plaintexts
Date: Sun, 03 Oct 1999 22:17:07 +0200
Plaintexts are generally such that they can be easily recognized
as such and that they often have statistical properties that
under circumstances could be exploited. If therefore these are
preprocessed in appropriate ways before being processed by a
block cipher, then certain security advantages should accrue.
We propose in the following to preprocess the plaintexts blocks
through combining two or more blocks using the simple mechanism
of XOR. That is, given the blocks P1, P2, ... Pn, we generate
Q1, Q2, ... Qn such that each Qi is XOR of some blocks in the
set {P1, P2, ... Pn}.
Evidently, the Qi's cannot be generated entirely arbitrarily, for
otherwise it could happen that the Pi's cannot be fully recovered.
Let M be an n*n boolean matrix and S = [P1, P2, ... Pn] and
T = [Q1, Q2, ... Qn] such that
T = M * S
Then
S = M^(-1) * T
showing that Pi's can be recovered if and only if M is invertible.
We propose to obtain a random boolean matirx M as follows: Start
from an n*n identity matrix. Generate a series of random number
pairs (ri, rj), ri <> rj, 1 <= ri, rj <= n, and perform the
operations:
row ri := (row ri) XOR (row rj)
Evidently the resulting matrix is invertible. It is useful to
ensure that no row of the final matrix M contains a single 1,
thus guaranteeing that in general Qi <> Pj for any i and j.
M. K. Shen
===========================
http://home.t-online.de/home/mok-kong.shen
------------------------------
From: Amos Waterland <[EMAIL PROTECTED]>
Subject: Re: gnu mp library exponentiation function
Date: Sun, 03 Oct 1999 16:20:37 -0500
> > If you're trying to generate big Mersenne primes, gnump isn't the
> > right type of library to use. Ask on sci.math.
>
> MIRACL works really well for that.
> ftp://ftp.compapp.dcu.ie/pub/crypto/
Thank you both :-)
------------------------------
Date: Sun, 03 Oct 1999 16:47:02 -0400
From: "Trevor Jackson, III" <[EMAIL PROTECTED]>
Crossposted-To: comp.security.pgp.discuss,alt.security.pgp
Subject: Re: Is 128 bits safe in the (far) future?
Why use arbitrary units like mm^3 or moon-sized?
Pick the most ridiculous numbers conceivable, like the size of the universe
for the collection of machines, the fermi distance for the size of each
computing element, and the fermi time for the computational cycle. This gives
you a silly overestimate of the potential processing rate of any non-divine
computer (including a quantum computer due to representational density). Use
the time required for the heat death of the universe* as the life of the
information to be protected and you still get a number of a few hundred bits
of key being suffcient to defeat exhaustive search.
*The time required for a black hole the size of the universe to evaporate by
Hawking radiation.
Thomas J. Boschloo wrote:
> Arne Hoffmann wrote:
> >
> > ... but in a paper of Ralf Senderek I read this:
> >
> > ______________________________________________________________________
> >
>
> <snip>
>
> > If you assume the size of a high-performance computer system performing
> > keytests is 0.3 mm for electronic or optical transfer of information, it
> > can only perform 1 000 000 000 000 operations (10^12) per second,
> > otherwise it has to be smaller. Over a period of 317 years or 10 003 759
> > 200 seconds that will sum up to 10 003 759 200 000 000 000 000
> > operations. This ability to perform no more than 10^22 operation during
> > 317 years is truly not sufficient for testing 10^22 different IDEA-keys
> > because every keytest requires more than a single operation cycle. But
> > even if it was possible to do a keytest that fast, the large number of
> > 10^38 IDEA-keys would be searched for no more than 0.000 000 000 000 000
> > 029 percent. Thus a specific IDEA-key will not be found even if "lots"
> > of those high-performance computers will work parallel to test the keys.
>
> But if the size of one functioning component is 1 Angstrom unit (1e-10
> m), and the size of the computer system is 0.3 x 0.3 x 0.3 mm^3, the
> numbers would become different.
>
> (3e8 m/s) / (1e-10 m) = 3e18 operations a second
> (0.3 mm)^3 / (1e-10 m)^3 = 2,7e-11 m^3 / 1e-30 m^3 = 2,7e19 units
>
> Multiplied this becomes 8,1e37 operations a second. This is 2^126 bits
> (I didn't aim to get this number!). So with four of those machines you
> would exhaust the keyspace of IDEA in just one second.
>
> A box of (3476 km)^3, in which our moon would fit, filled with these
> mighty units however would do 1,3e68 operations a second. Equaling 2^226
> operations a second. Running this for a hundred years (2^10 seconds)
> would just about crack a 237 bit key (could be a hundred years later if
> you have bad luck).
>
> Back to the real world; my P150MMX does 1,5e8 operations a second. Not
> 10^12 or 10^18 ;-) And a circuit the size of an angstrom will probably
> never be, maybe a few thousand angstroms. So you could at least
> substract 15 bits from your for ever safe number of bits. And it will
> never be the size of the moon, so you could gain another 30 bits there.
> So that leaves 190 as the ultimate safe number of bits?
>
> Please review these numbers (rougly) and comment,
> Thomas
>
> BTW We're not talking about the next few hundred years! We are talking
> about the _far_ _far_ future, with a lot of technology, time, money and
> resources at our disposal!
> --
> AMD K7 Athlon 650 Mhz! <http://www.bigbrotherinside.com/#help>
>
> PGP key: http://x11.dejanews.com/getdoc.xp?AN=453727376
> Email: boschloo_at_multiweb_dot_nl
------------------------------
From: "John Croll" <[EMAIL PROTECTED]>
Subject: Re: rc5-128 bit
Date: Sun, 3 Oct 1999 16:40:23 -0500
the way you use this program is try all the letters of the alphabet with
each
cypher hex. write down the 7 or 8 letters that give the best "coincidenses".
do this with the whole message. now find a comfortable chair and try to
chain together a message. keep in mind that the correct letter only has
a 70% chance of being in your list. you may wish to go back to check
particular letters over again. you will find that only one clear text is
possible that makes grammatical sense.
please reply to:
[EMAIL PROTECTED]
btw, i named this program ultratour version 1.2 because i got the general
idea
from a tv program about the touring machine.
John Croll <[EMAIL PROTECTED]> wrote in message
news:7t8f6e$gen$[EMAIL PROTECTED]...
> this program allows any one who is good at logic problems and word games
> to decypher plain text from an rc-5 cypher regardless of key length. the
> only
> caveat is that the plaintext must conform to standard english grammar.
this
> method is not well suited to extracting numerical data. as is, the program
> only dumps data concerning one cypher hex and one letter at a time. their
> is a rem'ed out block where i tried to add scoring for the whole alphabet.
> but my programming skills are not up to the task. if you improve it, you
> may copyright that improvement.
------------------------------
From: Hironobu SUZUKI <[EMAIL PROTECTED]>
Crossposted-To: sci.electronics.design,sci.electronics.equipment
Subject: Re: radioactive random number generator
Date: 04 Oct 1999 04:36:13 +0900
Rolf Bombach <[EMAIL PROTECTED]> writes:
> amount of Bq's. Anyway, today's regulations concerning radioactive
> material are ..hm..
I didn't see all of this discussion, but I guess that background
radiation is OK for little length of random number or seeds for
pesudo-random number generator.
Background radiation can be detected by big size of Geiger-Muller
counter tube or many number of Geiger-Muller counter tubes.
--hironobu
------------------------------
From: [EMAIL PROTECTED] (Matt Gibson)
Subject: Re: Factoring public keys attack?
Date: Sun, 3 Oct 1999 22:38:31 +0100
In article <[EMAIL PROTECTED]>,
[EMAIL PROTECTED] says...
> Gosh, are there lots of primes?
I don't know yet; I'm still counting them.
M
--
"It's the gaps between the rain that count,
and learning how to live amongst them"
-- Jeff Noon, _Pixel Juice_
Matt Gibson http://www.gothick.dial.pipex.com
------------------------------
From: Arthur Dardia <[EMAIL PROTECTED]>
Subject: 512-bit key broken in microseconds?!
Date: Sun, 03 Oct 1999 19:44:59 -0400
I just read on Slashdot that apparently Israelis have broken 512-bet
keys in the microseconds. Check it out at:
http://www.sunday-times.co.uk/news/pages/tim/99/09/29/timintint02001.html?1341861
I want proof, so just send me the machine. :)
--
Arthur Dardia Wayne Hills High School [EMAIL PROTECTED]
PGP 6.5.1 Public Key http://www.webspan.net/~ahdiii/ahdiii.asc
------------------------------
From: [EMAIL PROTECTED] (jerome)
Crossposted-To: sci.math
Subject: Re: factoring with quadratic sieve
Reply-To: [EMAIL PROTECTED]
Date: Mon, 04 Oct 1999 00:03:14 GMT
first thanks for all your answers
On Fri, 01 Oct 1999 17:45:59 GMT, Bob Silverman wrote:
>
>See my paper in Math. Comp.
>
i would if i had it :) any online version ?
------------------------------
From: [EMAIL PROTECTED] (wtshaw)
Subject: Re: Compression Encryption & Plain Text Attacks
Date: Sun, 03 Oct 1999 18:26:05 -0600
Sorry David, I probably jumped the gun being too broadly critical of such
things as your compression scheme and its crytographic usefulness and let
loose a demi-rant. As one who deals with sometimes obscure methods to
check them out, I should be more patient.
I ought to be thankful for the physical progress that I have made in one
month, such as it is, and smile at everybody for awhile. Thanks to the
delete key and mouse, you are granted deliverace from my typos which make
yours look rather benign.
--
Sometimes a small mistake can lead to fortunate reward.
Charlie Chan
------------------------------
From: [EMAIL PROTECTED] (Mike DeTuri)
Subject: Re: Addition/subtraction mod 256 vs. XOR
Date: Mon, 04 Oct 1999 00:21:52 GMT
On Sat, 02 Oct 1999 07:00:24 GMT, [EMAIL PROTECTED] (Mike DeTuri)
wrote:
>I was wondering if there is any benefit to encrypting using addtion
>mod 256 in RC4 instead of the standard XOR. Of course, decryption
>would be subtraction mod 256. Has anyone tried this? I've searched
>DejaNews but found nothing conclusive.
Thanks to all who answered. :-)
------------------------------
From: "William Morton" <[EMAIL PROTECTED]>
Subject: Re: 512-bit key broken in microseconds?!
Date: Mon, 04 Oct 1999 00:24:23 GMT
Arthur Dardia wrote in message <[EMAIL PROTECTED]>...
>I just read on Slashdot that apparently Israelis have broken 512-bet
>keys in the microseconds. Check it out at:
>
>http://www.sunday-times.co.uk/news/pages/tim/99/09/29/timintint02001.html?1
341861
>
>I want proof, so just send me the machine. :)
>
Sounds a bit bogus to me. While the article claims that a "hand held" device
is used that combines quantum computing and "special optical technology" the
article ends on the following note:
As one member of EIQC, who wished to remain anonymous, predicts: "While
quantum computers may be some time off, when they are available no
communication will be secure unless it is quantum."
So quantum computing exists but doesn't exist. Besides, if they can get this
to work don't you think that they would really be working on a functional
palm top?
Regards
Bill+
------------------------------
From: [EMAIL PROTECTED] (wtshaw)
Subject: Re: Compression Encryption & Plain Text Attacks
Date: Sun, 03 Oct 1999 18:35:59 -0600
In article <7t6er1$1gpi$[EMAIL PROTECTED]>, [EMAIL PROTECTED]
(SCOTT19U.ZIP_GUY) wrote:
> I have to admit I have not looked deeply into you GVA method. But I think
> it was based on a limited character set. I sometimes get carried away in
> my responses and I know you are a fellow texan. But what about a mixture.
> You can compress you message with my method encrypt with the AES
> method of your choice. Then use my one to one conditional uncompression
> to put that result into the character set you like. Then using your GVA to
> further encrypt it. I know thats a lot of work but thats the kind of work
> computers can do.
> Would this form of encryption make you feel happy?
It is worth really considering. There are so many good options when you
start combining procedures, build composite algorithms.
The base translation stuff is one way to deal with limited character sets,
but the algorithms themselved can have other procedures; for instance, one
implementation with a set of 40 character alphabets has the ability to
handle the keyboard, and another that deals with 65 character alphabets,
all but a few allowed characters, can add upper case letters with the
shift key as a character. It may well be suitable to look at a GVA
implementation that uses some of the tricks we have learned lately
>
--
Sometimes a small mistake can lead to fortunate reward.
Charlie Chan
------------------------------
From: "Benjamin Slavin" <[EMAIL PROTECTED]>
Subject: Help with Cryptanalysis
Date: Sun, 3 Oct 1999 17:27:21 -0400
Hello:
I am a high school student that is interested in doing a science fair
project revolving around cryptanalysis. I am wondering if any of you could
either give me some pointers on cryptanalysis, or at least point me in the
right direction.
I greatly appreciate your assistance,
--Benjamin Slavin
PS.
If possible, when you post a reply to this, please CC it to me.
------------------------------
** 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
******************************
