Cryptography-Digest Digest #118, Volume #13 Wed, 8 Nov 00 00:13:00 EST
Contents:
Re: MORE THAN FULLY BIJECTIVE ! (John Savard)
Re: XOR Software Utility (freeware) available from Ciphile Software (Andre van
Straaten)
Re: hacker...beware ("Michael")
Re: Updated XOR Software Utility (freeware) Version 1.1 from Ciphile Software
(Andre van Straaten)
Re: example code for your use (Richard Heathfield)
Re: Updated XOR Software Utility (freeware) Version 1.1 from Ciphile Software (Tom
St Denis)
Re: Updated XOR Software Utility (freeware) Version 1.1 from Ciphile (Anthony
Stephen Szopa)
Re: Updated XOR Software Utility (freeware) Version 1.1 from Ciphile (Anthony
Stephen Szopa)
Re: Help Needed with Public Key Cryptography (Lee Hasiuk)
Re: Help Needed with Public Key Cryptography (Lee Hasiuk)
Re: XOR Software Utility (freeware) available from Ciphile Software (Anthony Stephen
Szopa)
Re: XOR Software Utility (freeware) available from Ciphile Software (Anthony Stephen
Szopa)
Re: A question about RSA ("Scott Fluhrer")
Re: XOR Software Utility (freeware) available from Ciphile Software (Anthony Stephen
Szopa)
----------------------------------------------------------------------------
From: [EMAIL PROTECTED] (John Savard)
Subject: Re: MORE THAN FULLY BIJECTIVE !
Date: Wed, 08 Nov 2000 01:00:12 GMT
On 7 Nov 2000 13:59:48 GMT, [EMAIL PROTECTED]
(SCOTT19U.ZIP_GUY) wrote, in part:
> Comments welcome.
There is a way to be bijective and use modes like CBC that require an
IV that I think is very nice. Unfortunately, I believe it is covered
by a patent (owned by IBM, with Mihir Bellare the inventor).
Say you need a 128-bit IV.
Step 1: break the file to be encrypted into two pieces. The first
piece is 128 bits long, the second is the rest of it.
Step 2: Create a 128-bit hash of the rest of the file. XOR it with the
first piece.
Step 3: The changed first piece is your IV, now encrypt the rest of
the file.
The first piece is secure, because you need to decrypt the rest of the
file before knowing what was XORed with it.
John Savard
http://home.ecn.ab.ca/~jsavard/crypto.htm
------------------------------
From: Andre van Straaten <[EMAIL PROTECTED]>
Subject: Re: XOR Software Utility (freeware) available from Ciphile Software
Crossposted-To: talk.politics.crypto,alt.hacker,talk.politics.misc
Date: 7 Nov 2000 19:15:45 -0600
In sci.crypt Andre van Straaten <[EMAIL PROTECTED]> wrote:
> In sci.crypt Richard Heathfield <[EMAIL PROTECTED]> wrote:
>> Andre van Straaten wrote:
>>>
>>> In sci.crypt Richard Heathfield <[EMAIL PROTECTED]> wrote:
>>> > [alt.freespeech snipped from crosspost - my news server hates free
>>> > speech]
>>>
>> <snip>
>>> > [...] I will happily post portable
>>> > C source code to do this, on alt.crypto.sources (to avoid clogging up
>>> > all the splendid newsgroups to which this was cross-posted).
>> <snip>
>>> BTW: I couldn't find that NG "alt.crypto.sources". Even on Deja.com I
>>> could find it.
>> My mistake. news:alt.sources.crypto is correct. (The code's there now.)
> Apropos Solaris servers: Unfortunately, they both (usenet.com +
> verio.net) don't have "alt.sources.crypto", and Deja.com has only
> "alt.sources".
> This NG is indeed very crypto.
Sorry, found it now on newsfeed.com (3rd server).
-- avs
Andre van Straaten
http://www.vanstraatensoft.com
______________________________________________
flames please to [EMAIL PROTECTED]
====== Posted via Newsfeeds.Com, Uncensored Usenet News ======
http://www.newsfeeds.com - The #1 Newsgroup Service in the World!
======= Over 80,000 Newsgroups = 16 Different Servers! ======
------------------------------
Reply-To: "Michael" <[EMAIL PROTECTED]>
From: "Michael" <[EMAIL PROTECTED]>
Crossposted-To:
alt.lang.basic,alt.surfing,alt.surfing.europe.uk,aus.computers.linux,comp.os.linux.setup
Subject: Re: hacker...beware
Date: Wed, 8 Nov 2000 10:34:46 +1000
"Gary" <[EMAIL PROTECTED]> wrote in message
news:3a0884ad$0$19405$[EMAIL PROTECTED]...
> The following person (who posts on the above newsgroups)has been detected
by
> my firewall as attempting to hack into my system. He/she has been reported
> to the isp concerned and details are as follows.
>
> Name E-mail address Date Thread Newsgroup
> Vic Drastik [EMAIL PROTECTED] 00/04/20 comp.lang.basic.misc
> Mongolian Horde [EMAIL PROTECTED] 00/01/05 alt.surfing
> *Lauren* [EMAIL PROTECTED] 99/11/06 alt.music.moffatts
> Mongolian Horde [EMAIL PROTECTED] 99/11/05 alt.surfing
> Mongolian Horde [EMAIL PROTECTED] 99/11/05
> Location of 203.101.94.94:
> Country = Australia
> Region = New South Wales
> City = Sydney
> Standard network info
> [ nslookup (1): ip=203.101.94.94,
hostname=async93-wol-isp-1.nas.one.net.au]
>
Thanks for the warning, however next time please use the correct
terminology. This person is a cracker, not a hacker. Please refer to the
jargon file www.tuxedo.org/~esr or the printed (slightly out of date)
version, "The new hacker dictionary".
Cheers
--
Michael - please change puddle to pond to reply
------------------------------
From: Andre van Straaten <[EMAIL PROTECTED]>
Subject: Re: Updated XOR Software Utility (freeware) Version 1.1 from Ciphile Software
Crossposted-To: alt.freespeech,talk.politics.misc,talk.politics.crypto
Date: 7 Nov 2000 19:33:30 -0600
In sci.crypt Anthony Stephen Szopa <[EMAIL PROTECTED]> wrote:
> Tom St Denis wrote:
>>
>> In article <[EMAIL PROTECTED]>,
>> Hawke <[EMAIL PROTECTED]> wrote:
>> > sorry for the massive crosspost...
>> >
>> > too bad this software is winblows only.
>> > it'd be nice to have an app like this in linux...
>>
>> You are kidding right?
>>
>> Tom
>>
>> Sent via Deja.com http://www.deja.com/
>> Before you buy.
> The software does what it says it does and this fellow seems to
> think he has need or feels he may have need for such a program.
> So you feel you have the right and need to ridicule him?
> Can you stoop any lower?
> Show this fellow some respect and write him a similar program for
> Linux.
> Here are the specs: the ability to select any two files from any
> two drives/directories and logically XOR them outputting the
> resulting file to any drive/directory. Stopping the XOR process
> upon reaching the end of file of the shortest file selected. And
> allow for any file length to be processed.
Eh ... apart from the "unlimited" length of the file ...I read the
files into memory ...
I posted a Tcl/Tk file on alt.sources.crypto which does just this.
If he has Tcl on his Linux box, he can use this in the meantime or
forever, until someone posts a C/C++ GUI version.
If he can't access alt.sources.crypto, he can e-mail me.
(But a few people only please, I don't want to become an "XOR"
monger.)
-- avs
Andre van Straaten
http://www.vanstraatensoft.com
______________________________________________
flames please to [EMAIL PROTECTED]
====== Posted via Newsfeeds.Com, Uncensored Usenet News ======
http://www.newsfeeds.com - The #1 Newsgroup Service in the World!
======= Over 80,000 Newsgroups = 16 Different Servers! ======
------------------------------
Subject: Re: example code for your use
From: Richard Heathfield <[EMAIL PROTECTED]>
Crossposted-To: comp.lang.c,comp.lang.c.moderated
Date: 08 Nov 2000 01:48:00 GMT
Roger Schlafly wrote:
>
> Richard Heathfield wrote:
> > No. You can print out the source code and snailmail it. Legally! Just
> > don't send it on a floppy disk or CD-ROM. Those might well be illegal.
> > You gotta love USA logic...
>
> Not any more. The USA no longer has any restrictions on sending
> crypto to Europe, Japan, and several other countries. I think
> they wanted to make Al Gore more electable. Meanwhile, the UK
> is becoming one of the most crypto-unfriendly countries in the
> free world.
On the contrary. The UK Government loves enciphered messages - so much
so, in fact, that it wants to read them all.
--
Richard Heathfield
"Usenet is a strange place." - Dennis M Ritchie, 29 July 1999.
C FAQ: http://www.eskimo.com/~scs/C-faq/top.html
K&R answers, C books, etc: http://users.powernet.co.uk/eton
--
comp.lang.c.moderated - moderation address: [EMAIL PROTECTED]
------------------------------
From: Tom St Denis <[EMAIL PROTECTED]>
Crossposted-To: alt.freespeech,talk.politics.misc,talk.politics.crypto
Subject: Re: Updated XOR Software Utility (freeware) Version 1.1 from Ciphile Software
Date: Wed, 08 Nov 2000 03:02:05 GMT
In article <[EMAIL PROTECTED]>,
Anthony Stephen Szopa <[EMAIL PROTECTED]> wrote:
> The software does what it says it does and this fellow seems to
> think he has need or feels he may have need for such a program.
>
> So you feel you have the right and need to ridicule him?
>
> Can you stoop any lower?
>
> Show this fellow some respect and write him a similar program for
> Linux.
I posted ANSI C source code that does the same thing, read the postings.
> Here are the specs: the ability to select any two files from any
> two drives/directories and logically XOR them outputting the
> resulting file to any drive/directory. Stopping the XOR process
> upon reaching the end of file of the shortest file selected. And
> allow for any file length to be processed.
And you think you are doing the world a favor? This is hardly secure
or practical...
Tom
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: Anthony Stephen Szopa <[EMAIL PROTECTED]>
Crossposted-To: alt.freespeech,talk.politics.misc,talk.politics.crypto
Subject: Re: Updated XOR Software Utility (freeware) Version 1.1 from Ciphile
Date: Tue, 07 Nov 2000 19:20:35 -0800
Tom St Denis wrote:
>
> In article <[EMAIL PROTECTED]>,
> Anthony Stephen Szopa <[EMAIL PROTECTED]> wrote:
> > The software does what it says it does and this fellow seems to
> > think he has need or feels he may have need for such a program.
> >
> > So you feel you have the right and need to ridicule him?
> >
> > Can you stoop any lower?
> >
> > Show this fellow some respect and write him a similar program for
> > Linux.
>
> I posted ANSI C source code that does the same thing, read the postings.
>
> > Here are the specs: the ability to select any two files from any
> > two drives/directories and logically XOR them outputting the
> > resulting file to any drive/directory. Stopping the XOR process
> > upon reaching the end of file of the shortest file selected. And
> > allow for any file length to be processed.
>
> And you think you are doing the world a favor? This is hardly secure
> or practical...
>
> Tom
>
> Sent via Deja.com http://www.deja.com/
> Before you buy.
You seem to be an expert on most matters.
Have you provided something of real use to any of us, besides your
opinions?
------------------------------
From: Anthony Stephen Szopa <[EMAIL PROTECTED]>
Crossposted-To: alt.freespeech,talk.politics.misc,talk.politics.crypto
Subject: Re: Updated XOR Software Utility (freeware) Version 1.1 from Ciphile
Date: Tue, 07 Nov 2000 19:23:24 -0800
Andre van Straaten wrote:
>
> In sci.crypt Anthony Stephen Szopa <[EMAIL PROTECTED]> wrote:
> > Tom St Denis wrote:
> >>
> >> In article <[EMAIL PROTECTED]>,
> >> Hawke <[EMAIL PROTECTED]> wrote:
> >> > sorry for the massive crosspost...
> >> >
> >> > too bad this software is winblows only.
> >> > it'd be nice to have an app like this in linux...
> >>
> >> You are kidding right?
> >>
> >> Tom
> >>
> >> Sent via Deja.com http://www.deja.com/
> >> Before you buy.
>
> > The software does what it says it does and this fellow seems to
> > think he has need or feels he may have need for such a program.
>
> > So you feel you have the right and need to ridicule him?
>
> > Can you stoop any lower?
>
> > Show this fellow some respect and write him a similar program for
> > Linux.
>
> > Here are the specs: the ability to select any two files from any
> > two drives/directories and logically XOR them outputting the
> > resulting file to any drive/directory. Stopping the XOR process
> > upon reaching the end of file of the shortest file selected. And
> > allow for any file length to be processed.
>
> Eh ... apart from the "unlimited" length of the file ...I read the
> files into memory ...
> I posted a Tcl/Tk file on alt.sources.crypto which does just this.
>
> If he has Tcl on his Linux box, he can use this in the meantime or
> forever, until someone posts a C/C++ GUI version.
>
> If he can't access alt.sources.crypto, he can e-mail me.
>
> (But a few people only please, I don't want to become an "XOR"
> monger.)
>
> -- avs
>
> Andre van Straaten
> http://www.vanstraatensoft.com
> ______________________________________________
> flames please to [EMAIL PROTECTED]
>
> -----= Posted via Newsfeeds.Com, Uncensored Usenet News =-----
> http://www.newsfeeds.com - The #1 Newsgroup Service in the World!
> -----== Over 80,000 Newsgroups - 16 Different Servers! =-----
At least you try.
That's certainly more than just giving lip service.
------------------------------
From: [EMAIL PROTECTED] (Lee Hasiuk)
Subject: Re: Help Needed with Public Key Cryptography
Date: Wed, 08 Nov 2000 03:45:31 GMT
It doesn't matter to me how long the key is, just how long the
ciphertext is. The public key is embedded in the trialware and can be
arbitrarily long, so what I'm trying to figure out is whether or not
there's a way to send 64 bits (or so) of ciphertext and be able to
verify that it likely came from the holder of the private key.
In digital signature algorithms, how long, typically, is the privately
encrypted message digest? Maybe something along those lines will fit
the bill.
Lee Hasiuk
[EMAIL PROTECTED]
JCA <[EMAIL PROTECTED]> wrote:
> RSA-encrypting an 8 byte long number is easy; you only have
>to pad as appropriate. However, the ciphertext will not in general
>be 8 bytes long. This is all true for the usual RSA keylengths.
>
> Your main problem is that a 512-bit key is too long for you.
>This makes me think that RSA is not what you are looking for. You
>can conceivably resort to a barebones RSA encryption/decryption
>using 64 bit moduli. This would meet your length requirements all
>right, but the result encryption encryption/decryption scheme would
>be trivial to break with the current computing power: a 64 bit integer
>is about 20 digits long in decimal, and factorizing integers that long
>is a piece of cake for modern processors.
>
> Maybe you'd like to look into elliptic curve crypto instead, although
>
>I am afraid that the typical keylengths will still be somewhat bigger
>than you would like.
>
>
>Lee Hasiuk wrote:
>
>> Is there a way to use a public key crypto system to encrypt an 8 byte
>> long number, producing an 8 byte long result, while still maintaining
>> any degree of security (i.e. approximately what a symmetric cipher
>> would give with an 64-bit key)?
>>
>> The application is trailware registration numbers, where a user pays
>> the vendor and supplies their 64-bit serial number (randomly generated
>> at install time), and they get back a 64-bit registration key. The
>> goal is to make it so that the registration key can't be generated
>> using only information on the end-user's system. I realize that
>> there are lots of other attacks possible on trialware applications,
>> and that this is just one small facet of the problem.
>>
>> I've looked at RSA, but it appears that the encryted data is typically
>> the same length as the modulus. For a reasonable modulus size, say
>> 512 bits, that would make the registration keys too long. Is there a
>> way to use RSA but to only send a portion of the encrypted data, but
>> still be able to check that portion using the public key? Perhaps
>> there's something better suited to my application.
>>
>> It's somewhat important that the algorithm be cheap or free and that
>> the code used to check the registration numbers be small. Again, RSA
>> is perfect, because it is free and since the largest part of the code
>> is the key generation, and that isn't necessary in the code which
>> checks the numbers.
>>
>> Thanks for your help!
>>
>> Lee Hasiuk
>> [EMAIL PROTECTED]
>
------------------------------
From: [EMAIL PROTECTED] (Lee Hasiuk)
Subject: Re: Help Needed with Public Key Cryptography
Date: Wed, 08 Nov 2000 03:48:47 GMT
I'm set on 64 bits because I want to allow the possibility of the
registration key being used on a computer which is not connected to
the Internet, where the user would type the code in manually, and that
would be all that's needed to unlock the product. Maybe I shouldn't
allow for that, but it seemed like something that might be easy to do.
Now I'm not so sure.
Lee Hasiuk
[EMAIL PROTECTED]
[EMAIL PROTECTED] wrote:
>In article <[EMAIL PROTECTED]>,
> [EMAIL PROTECTED] (Lee Hasiuk) wrote:
>> Is there a way to use a public key crypto system to encrypt an 8 byte
>> long number, producing an 8 byte long result, while still maintaining
>> any degree of security (i.e. approximately what a symmetric cipher
>> would give with an 64-bit key)?
>
>First let's ask the obvious question. Why are you set on 64-bits? It
>appears that you are depending on the user to type this number in, to
>avoid it being copied. Instead how about, the trialware program
>generates a computer statement (things like CPU ID, HDD ID, MAC
>address, etc), it sends that statement to the server along with a proof
>of payment coupon (which the user may very well have to enter
>him/herself, but is one time). The root server takes that information,
>verifies the freshness and authenticity of the payment coupon, signs
>the computer statement, and sends the signature back. When the
>trialware needs to verify the correctness of the computer, it retrieves
>the information, and checks the signature. The user won't even be
>forced to type in an excessively large number, just the coupon size,
>which 64-bits should be sufficient. It's far from perfect but if it
>fits what you need feel free to use it (I am not aware of any issues,
>however I take no responsibility, if you are concerned consult a very
>good lawyer).
> Joe
>
>
>Sent via Deja.com http://www.deja.com/
>Before you buy.
------------------------------
From: Anthony Stephen Szopa <[EMAIL PROTECTED]>
Crossposted-To: talk.politics.crypto,alt.hacker,talk.politics.misc
Subject: Re: XOR Software Utility (freeware) available from Ciphile Software
Date: Tue, 07 Nov 2000 20:12:07 -0800
Tom St Denis wrote:
>
> In article <[EMAIL PROTECTED]>,
> Anthony Stephen Szopa <[EMAIL PROTECTED]> wrote:
> > Tom St Denis wrote:
> > >
> > > In article <[EMAIL PROTECTED]>,
> > > Anthony Stephen Szopa <[EMAIL PROTECTED]> wrote:
> > > > XOR Software Utility (freeware) available from Ciphile Software
> > > >
> > > > This software simply performs the universally available logical
> XOR
> > > > process on two files chosen by the user and outputs the resulting
> > > > file.
> > > >
> > > > http://www.ciphile.com
> > > >
> > > > goto the Downloads Currently Available web page.
> > > > scroll to the bottom of the page.
> > > >
> > > > Click on the blue anchor tag: CiphileXOR_10.zip (155kb)
> > >
> > > How on earth did you make such a simple program take 155kb?
> > >
> > > Tom
> > >
> > > Sent via Deja.com http://www.deja.com/
> > > Before you buy.
> >
> > Updated XOR Software Utility (freeware) Version 1.1 from Ciphile
> > Software
> >
> > This updated XOR software utility Version 1.1 from Ciphile Software
> > now allows for the two input files AND the output file to each be
> > in a different directory if the user chooses.
> >
> > http://www.ciphile.com
> >
> > go to the Downloads Currently Available web page.
> > scroll to the bottom of the page.
> >
> > Click on the blue anchor tag: CiphileXOR_11.zip (156kb)
>
> Why didn't you answer my question?
>
> Tom
>
> Sent via Deja.com http://www.deja.com/
> Before you buy.
Someone else already answered your question.
------------------------------
From: Anthony Stephen Szopa <[EMAIL PROTECTED]>
Crossposted-To: talk.politics.crypto,alt.hacker,talk.politics.misc
Subject: Re: XOR Software Utility (freeware) available from Ciphile Software
Date: Tue, 07 Nov 2000 20:16:58 -0800
James Felling wrote:
>
> Tom St Denis wrote:
>
> > In article <[EMAIL PROTECTED]>,
> > Anthony Stephen Szopa <[EMAIL PROTECTED]> wrote:
> > > Tom St Denis wrote:
> > > >
> > > > In article <[EMAIL PROTECTED]>,
> > > > Anthony Stephen Szopa <[EMAIL PROTECTED]> wrote:
> > > > > XOR Software Utility (freeware) available from Ciphile Software
> > > > >
> > > > > This software simply performs the universally available logical
> > XOR
> > > > > process on two files chosen by the user and outputs the resulting
> > > > > file.
> > > > >
> > > > > http://www.ciphile.com
> > > > >
> > > > > goto the Downloads Currently Available web page.
> > > > > scroll to the bottom of the page.
> > > > >
> > > > > Click on the blue anchor tag: CiphileXOR_10.zip (155kb)
> > > >
> > > > How on earth did you make such a simple program take 155kb?
> > > >
> > > > Tom
> > > >
> > > > Sent via Deja.com http://www.deja.com/
> > > > Before you buy.
> > >
> > > Updated XOR Software Utility (freeware) Version 1.1 from Ciphile
> > > Software
> > >
> > > This updated XOR software utility Version 1.1 from Ciphile Software
> > > now allows for the two input files AND the output file to each be
> > > in a different directory if the user chooses.
> > >
> > > http://www.ciphile.com
> > >
> > > go to the Downloads Currently Available web page.
> > > scroll to the bottom of the page.
> > >
> > > Click on the blue anchor tag: CiphileXOR_11.zip (156kb)
> >
> > Why didn't you answer my question?
> >
> > Tom
> >
> > Sent via Deja.com http://www.deja.com/
> > Before you buy.
>
> The really 'neat'? thing about this program is it is GROWING between
> versions, and not shrinking. This program even with the trash that windows
> forces you to add is way too large unless you either have embeded images in
> the file, or some other code is taging along.
If you know what you are talking about then you must have resources
to check the behavior of the software while it is running: such as
a firewall or virus protection?
Some are free, you know.
Give us some proof if you can.
Or are you too pathetically feeble minded?
------------------------------
From: "Scott Fluhrer" <[EMAIL PROTECTED]>
Subject: Re: A question about RSA
Date: Tue, 7 Nov 2000 20:37:46 -0800
Chenghuai Lu <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]...
> Suppose we know n (= p * q), which is a multiple of two large primes,
> and phi(n) where phi(x) is the Euler function. Can anybody give the
> algorithm to find p and q in polynomial time?
Bob Silverman of course gave a correct answer: given p*q and (p-1)*(q-1),
it's not that difficult to find p and q. However, I'd like to answer the
question I suspect you meant to ask.
With RSA, the actual relationship between the encryption and the decryption
exponent is actually:
d*e = 1 mod lambda(p*q)
where lambda(p*q) = lcm(p-1, q-1)
So, I posit the question you meant to ask was: given p*q and lambda(p*q),
can anyone give an algorithm to find p and q in polynomial time?
Well, the obvious approach doesn't work if p-1 and q-1 has a large common
factor (which is usually a bad idea for other reasons), but the following
probabilistic polynomial time algorithm works:
- Compute k = lambda(n) / 2**m, where m is the integer required to make k
odd.
- For a random x between 1 and n-1, compute z = x**k mod n
- For i := 1 to m
- If z = 1 or -1 mod n, then this procedure fails
- Compute z2 = z**2 mod n
- If z2 = 1, then the procedure succeeds, with the factors being gcd(z-1,
n), gcd(z+1, n)
- z := z2
- This procedure succeeds, with factors being gcd(z, n), n / gcd(z, n)
I believe that the above procedure has a success probability > 0.5 for a
random x uniformly chosen between 1 and n-1. A similar procedure works if
you know a valid (d, e) pair.
A proof of the above procedure is left as an exercise for the reader :-)
--
poncho
------------------------------
From: Anthony Stephen Szopa <[EMAIL PROTECTED]>
Crossposted-To: talk.politics.crypto,alt.hacker,talk.politics.misc
Subject: Re: XOR Software Utility (freeware) available from Ciphile Software
Date: Tue, 07 Nov 2000 20:39:23 -0800
Tom St Denis wrote:
>
> In article <280O5.729$[EMAIL PROTECTED]>,
> Andre van Straaten <[EMAIL PROTECTED]> wrote:
> > In sci.crypt Tom St Denis <[EMAIL PROTECTED]> wrote:
> > > In article <YH_N5.3261$[EMAIL PROTECTED]>,
> > > Andre van Straaten <[EMAIL PROTECTED]> wrote:
> > >> If you own a Microsoft OS you might have indeed to be very careful.
> > >>
> > >> I have only a Windows 95 on a dual-boot notebook which I use very
> > > rarely
> > >> and only for test purposes.
> > >>
> > >> I use at home FreeBSD where even the kernel is Open Source (motto:
> > > Don't
> > >> trust an OS which you don't have sources for).
> > >> [My NGs I read from 2 different Solaris servers.]
> >
> > > Not that this isn't already OT, but do you honestly understand every
> > > component of <insert your fav open source OS>? I keep hearing
> about
> > > how wonderfull Linux is just because it's open source. Frankly
> you're
> > > all missing the point. The reason Linux is suppose to be better is
> not
> > > because it's open source, but because "real people" are making it.
> > > Unfortunately I have yet to ever get Linux to recognize my
> video/sound
> > > card so it's perfectly lame for my purposes... that's offtopic
> though...
> >
> > > Tom
> >
> > Well, the Open Source code discussion itself is not "sci" nor
> > "crypt".
> > And the same it is with promoting "xor freeware".
> >
> > But with an OS it's the same as with a crypto program.
> > Even if someone doesn't understand the Open Source code, he/she
> > can show the source code someone else to check it for him/her.
> > In case that something smells suspicious.
> >
> > (And on my notebook, the sound card works, plays MP3 and RealPlayer,
> > and silly Macromedia stuff in Linux emulation.
> > Generally, I don't need that, 'cause I'm concentrated to understand
> > the source code.)
> > ;-)
> >
>
> Problems with my drivers I complain until they are fixed. About the
> same speed as in OS.
>
> OS is only relevant when security is concerned. Personally I don't
> care how the mouse works, only that it does. But I do want to be able
> to ensure that my crypto is ok...
>
> Tom
>
> Sent via Deja.com http://www.deja.com/
> Before you buy.
If you downloaded OAP-L3 and checked it out, you would have found
that there are tutorials that test every aspect of the encryption
software. You are also at liberty to design your own files to test
the various processes.
You can be sure that OAP-L3 performs exactly as described and you
can prove it to yourself.
I don't know how many crypto software products provide you with the
means to check every process included with the software and allow
you to create your own verification files?
Two utility programs alone are reason enough to have this software.
Random Statistics: this utility program allows the user to determine
the frequency of each random number in the RandOut0 - RandOut9 and
the RandOutD files. The user inputs the file to read, the offset
indicating where to begin reading the file, and the number of bytes /
numbers to read. The number of random numbers to read can be 64KB,
128KB, 256KB, 512KB, 1MB, 5MB, 10MB, 20MB, 50MB, or 100MB.
The output is written to the StatOut file and includes the name of
the file read, the offset, the number of random numbers read, and
in table format, lists each number in the range and its frequency,
and its deviation in number and percentage.
ReadFile: this program reads a user designated file in binary mode
from a user input offset for an input number of bytes or until the
EOF. The output is written to the ReadFile file and consists of the
read binary character and the decimal ASCII equivalent of that
character.
------------------------------
** 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
******************************
