Cryptography-Digest Digest #365
Cryptography-Digest Digest #365, Volume #14 Wed, 16 May 01 11:13:01 EDT Contents: Re: ON-topic - UK crime statistics (was Re: Best, Strongest Algorithm) (Trevor L. Jackson, III) Re: Evidence Eliminator works great. Beware anybody who claims it doesn't work (propaganda) (Paul Crowley) Re: ON-topic - UK crime statistics (was Re: Best, Strongest Algorithm) (Richard Herring) Re: Newbie Question: Crytography - Unlimited Inputs/Outputs? (SCOTT19U.ZIP_GUY) Re: Karnaugh Maps (Pascal Junod) RE: Karnaugh Maps (Alexis Machado) Re: ON-topic - UK crime statistics (was Re: Best, Strongest Algorithm) (SCOTT19U.ZIP_GUY) Re: ON-topic - UK crime statistics (was Re: Best, Strongest Algorithm) (SCOTT19U.ZIP_GUY) How to develop a 64-bit key (ritesh_swd) Re: Karnaugh Maps (Sam Simpson) Re: Are low exponents a problem with RSA? (DJohn37050) Re: taking your PC in for repair? WARNING: What will they find? (Shaun Hollingworth) Re: request for encryption software suggestions (Anton Stiglic) Re: Karnaugh Maps (jlcooke) Re: How to develop a 64-bit key (jlcooke) Re: Probablistic Algorithms For Square Roots of QRs in Z/n (Anton Stiglic) Re: Karnaugh Maps (jlcooke) How can I see the symmetric enncryption keysize in SSL? (no_carrier) Any SEC free program for Visa? (no_carrier) America Civil War Private Shorthand (Dave Smith) Re: function decomposition (jlcooke) Re: function decomposition (jlcooke) Re: MISTY -- no simple truncated difs (jlcooke) Re: function decomposition (Mark Wooding) Re: Karnaugh Maps (Pascal Junod) From: Trevor L. Jackson, III [EMAIL PROTECTED] Subject: Re: ON-topic - UK crime statistics (was Re: Best, Strongest Algorithm) Date: Wed, 16 May 2001 12:37:54 GMT Tim Tyler wrote: SCOTT19U.ZIP_GUY [EMAIL PROTECTED] wrote: : No wonder violent crime is up in the UK you can't shoot : the bastards that break into you own house. [...] I believe shooting someone for breaking and entering would itself be regarded as a violent crime in the UK. And in the U.S. BE, while a violent crime, does not rise to the level of a threat of death or great bodily harm. The only actions that justify a potentially lethal response are rape, arson, a lethal threat and their respective attempts. -- Crossposted-To: alt.privacy,alt.security.pgp,alt.security.scramdisk,alt.privacy.anon-server Subject: Re: Evidence Eliminator works great. Beware anybody who claims it doesn't work (propaganda) From: Paul Crowley [EMAIL PROTECTED] Date: Wed, 16 May 2001 12:39:32 GMT EE Support [EMAIL PROTECTED] writes: By now you will have witnessed the mass hysteria about Evidence Eliminator. As regular readers of some of these groups probably know, Evidence Eliminator doesn't work, which is why they spam newsgroups. The report they're keen to badmouth can be found here: http://badtux.org/eric/editorial/scumbags.html I know Eric because he was a thoughtful contributor to the Appraising Microsoft mailing list way back. -- __ Paul Crowley \/ o\ [EMAIL PROTECTED] /\__/ http://www.cluefactory.org.uk/paul/ Conservation of angular momentum makes the world go around - John Clark -- From: [EMAIL PROTECTED] (Richard Herring) Subject: Re: ON-topic - UK crime statistics (was Re: Best, Strongest Algorithm) Date: 16 May 2001 12:14:38 GMT Reply-To: [EMAIL PROTECTED] In article [EMAIL PROTECTED], Douglas A. Gwyn ([EMAIL PROTECTED]) wrote: SCOTT19U.ZIP_GUY wrote: ... No wonder violent crime is up in the UK you can't shoot the bastards that break into you own house. Note: You don't have to actually shoot them; it's the fear of being shot that has deterred many potential home invasions. If they didn't take place, how do you know? In any case, even quite stupid thieves usually have the wit to target empty houses. -- Richard Herring | [EMAIL PROTECTED] -- From: [EMAIL PROTECTED] (SCOTT19U.ZIP_GUY) Subject: Re: Newbie Question: Crytography - Unlimited Inputs/Outputs? Date: 16 May 2001 12:47:51 GMT [EMAIL PROTECTED] (news.singnet.com.sg) wrote in 9dt90f$jk3$[EMAIL PROTECTED]: BlankHi, I am just getting into the world of cryptography and would like to ask a question. If it is too commonly known then please direct me to a website link/other resource. I read/heard somewhere that given an encryption system where the tester is allowed an unlimited number of inputs and outputs, that the system itself will always be possible to break. Is this true? Im theroy if you allow an umlimited amount of inputs and there availabe outputs. you can eventrully get the plaintext for ciphertext. Which is the solution your looking for. Note the above all depends on using a fixed key. But if you have an unlimited number of inputs and test every key then with a properly designed crypto system there will be even with the random data
Cryptography-Digest Digest #365
Cryptography-Digest Digest #365, Volume #13 Tue, 19 Dec 00 16:13:00 EST
Contents:
Re: use of position of characters for encryption (Simon Johnson)
Re: In today´s paper I read how Cuban intelligence bosses are using shortwaves and
the Morse code to communicate with their intelligence agents in Miami interesting
.. when I was in California (I think) I got some strange messages to my head ..
(Juergen Nieveler)
Re: In today´s paper I read how Cuban intelligence bosses are using shortwaves and
the Morse code to communicate with their intelligence agents in Miami
interesting .. when I was in California (I think) I got some strange messages to my
head .. (Kirby Urner)
Re: Why primes? ("Jesper Stocholm")
Steganography using text as carrier ([EMAIL PROTECTED])
Vendor software using CPU spin rate to generate random numbers ("Jeffrey W. Baker")
Re: does CA need the proof of acceptance of key binding ? (Mok-Kong Shen)
Re: In today paper I read how Cuban intelligence (Keith)
Re: Steganography using text as carrier (Mok-Kong Shen)
Re: In =?iso-8859-1?Q?today=B4s?= paper I read how Cuban intelligence (Chumkil)
Re: Vendor software using CPU spin rate to generate random numbers (Steve Portly)
Re: Vendor software using CPU spin rate to generate random numbers
([EMAIL PROTECTED])
SMS security over various networks? (Chris Kantarjiev)
Re: Why primes? (Richard Heathfield)
Re: Q: Result of an old thread? (Bryan Olson)
Re: Why primes? (Jerry Coffin)
Re: Possibly another Encryption method - any thoughts ? (Simon Johnson)
Re: Q: Result of an old thread? (Mok-Kong Shen)
Re: Vendor software using CPU spin rate to generate random numbers ("Jeffrey W.
Baker")
Re: In today´s paper I read how Cuban intelligence bosses are using shortwaves and
the Morse code to communicate with their intelligence agents in Miami
interesting .. when I was in California (I think) I got some strange messages to my
head .. (Kirby Urner)
From: Simon Johnson [EMAIL PROTECTED]
Subject: Re: use of position of characters for encryption
Date: Tue, 19 Dec 2000 15:57:35 GMT
In article [EMAIL PROTECTED],
[EMAIL PROTECTED] wrote:
Would it be better or worse to use a system in
which the ciphertext is created based on the
location of a particular character?
This isn't a bad idea, the only negative effect would be it would
increase the complexity of implementation, and the end cipher would run
slower. Though, if your cautious with what your doing, then the
resultant cipher should be more secure.
For example:
f(x) = (position(x) + x) * key
position(x) = x'th character in plaintext.
x = character
I think that implementing this would
destroy the ability to use a type of trans-
position, but which one is better?
Well, this algorithm here isn't very clever. F(x) size is partly
determined by position(x), it is clear this would result in cipher-text
expantion. Not only this, but if this where used to directly encipher
it would be very weak indeed. It would require only two cipher-text's
to break:
x0= first plain-text, f(x0) = First cipher-text
x1 = sencond plain-text, f(x0) = Second cipher-text
we know the key's are equal:
F(x0) = (position(x0) + x0) * key
F(x1) = (position(x1) + x1) * key
:. F(x1)/(position(x2) + x1) = F(x0)/(position(x0) + x0)
By resubstitution you can find the key.
This doesn't mean your original idea is incorrect, you just don't do it
that way.
Simon.
--
Hi, i'm the signuture virus,
help me spread by copying me into Signiture File
Sent via Deja.com
http://www.deja.com/
--
From: [EMAIL PROTECTED] (Juergen Nieveler)
Crossposted-To: alt.2600,alt.security,comp.security
Subject: Re: In today´s paper I read how Cuban intelligence bosses are using
shortwaves and the Morse code to communicate with their intelligence agents in Miami
interesting .. when I was in California (I think) I got some strange messages to
my head ..
Date: 19 Dec 2000 16:10:21 GMT
Markku J. Saarelainen [EMAIL PROTECTED] wrote:
It was the Morse code for "SOS" ... and I understood it, but did not
really know what was going on, but it was very very strange, because I
had not had similar experiences before .. but in the next news that I
read, I read about the accident of the nuclear submarine Kursk. So I
realized something ...
Uh... you did notice that the Kursk was 100m deep UNDER water when it had
the accident?
And that you cannot transmit radio signals from that depth?
F'up to alt.security, because it would be way off-topic for the other
groups...
--
Juergen Nieveler
Support the ban of Dihydrogen Monoxide: http://www.dhmo.org/
"The people united can never be ignited!"- Sgt. Colon, Ankh-Morpork Watch
PGP-Key available under www.netcologne.de/~nc-nievelju/
--
From: Kirby Urner [EMAI
Cryptography-Digest Digest #365
Cryptography-Digest Digest #365, Volume #12 Sun, 6 Aug 00 12:13:00 EDT
Contents:
Re: New William Friedman Crypto Patent (filed in 1933) ("Douglas A. Gwyn")
Re: Q: CD ("Douglas A. Gwyn")
Re: Hashing Algorithms (Mack)
Re: Secure Operating Systems (Mack)
RSA Cryptography Today FAQ (1/1) ([EMAIL PROTECTED])
Re: Has RSADSI Lost their mind? (Paul Rubin)
Re: IV for arfour (Guy Macon)
Re: Let us have Lattice (Tim Tyler)
Re: Random numbers and online-gambling (Tim Tyler)
Re: Secure Operating Systems ([EMAIL PROTECTED])
Re: New William Friedman Crypto Patent (filed in 1933) (Mok-Kong Shen)
Re: New toy cipher, please comment... (Mok-Kong Shen)
Q: Functions that are slow to invert (Mok-Kong Shen)
Re: Let us have Lattice (Mok-Kong Shen)
Re: Applications for One-Way Function? (Mok-Kong Shen)
Re: just saw a pre-release copy of Schneier's new book on ebay (Bruce Schneier)
Coupon collector's problem ("Artemios G. Voyiatzis")
From: "Douglas A. Gwyn" [EMAIL PROTECTED]
Subject: Re: New William Friedman Crypto Patent (filed in 1933)
Date: Sun, 06 Aug 2000 01:45:12 -0400
[EMAIL PROTECTED] wrote:
... They could be 50 years backlogged in reviewing material for
declassification.
There is a fairly recent Executive Order requiring all classified
material to be reviewed and re/declassified after 50 years. The
amount that was classified over 50 years ago is staggering, and
very likely the backlog is such that they'll never catch up to
the point that they are reviewing just material from 50 to 51
years old. In addition to this supposedly automatic review,
re/declassification occurs when special attention has been
directed toward specific items, e.g. in response to a FOIA query.
I don't know what triggered the patent declassification; it might
have been in response to the USPTO trying to clean up their own
files.
--
From: "Douglas A. Gwyn" [EMAIL PROTECTED]
Subject: Re: Q: CD
Date: Sun, 06 Aug 2000 01:51:31 -0400
Mok-Kong Shen wrote:
Is there an easily obtainable software with which one can
conveniently read out bits from a CD at any specified (hardware)
position? Thanks.
If you mean the encoded "pits", you'd need special hardware
support. By the time the information reached the computer
bus it has already been decoded.
If you mean the decoded data, it's almost trivial under many
UNIX-like operating systems:
fd = open("/dev/rdsk/cd0" /* or whatever */ , 0);
lseek(fd, 0, desired_offset);
read(fd, buffer, amount);
close(fd);
--
From: [EMAIL PROTECTED] (Mack)
Subject: Re: Hashing Algorithms
Date: 06 Aug 2000 06:15:52 GMT
I reference Tom McCune here when I say that SHA1 is better than MD5...
http://www.mccune.cc/PGPpage2.htm#Hash
references:
http://www.math.ohio-state.edu/~fiedorow/PGP/MD5_discussion The good
stuff here!!! (no offense Tom : )
"George" [EMAIL PROTECTED] wrote in message
news:[EMAIL PROTECTED]...
First I'd like to thank everyone for the speedy responses to my last
question
about IDEA. I have done some research on hashing algorithms, and I have
been
told that the best hashing algorithms are MD5 and SHA. Am I outdated
again
with my resources? What is the most "secure" hashing algorithm available
to
the public today? Thank you for your time.
--
-George
[EMAIL PROTECTED]
I believe there is an RSA inc. document recommending against using
MD5 in new designs. That seems to be a good argument against it
if the company supporting it thinks it is time to start taking it off the
shelf.
Mack
Remove njunk123 from name to reply by e-mail
--
From: [EMAIL PROTECTED] (Mack)
Subject: Re: Secure Operating Systems
Date: 06 Aug 2000 06:27:31 GMT
Mok-Kong Shen [EMAIL PROTECTED] wrote:
[...]
layered approach. Crypto could then be an outer layer. At the time
of design of UNIX, intrusion detection wasn't yet a word in the
vocabulary of CS, I suppose. To give a (certainly far-fetched)
[...]
When Unix was written, the world was a whole different place. It was
normal for most places to simply leave the administrative account
logged in on the console all day. (Because any console user was
authorised to use it). Offices in the building didn't generally have
locks on the doors, and the standard login mechanism provided abundant
security against networked intrusion. (After all, there were no
unfriendly hosts, and networks were primarily dial-up connections)
Indeed, crypt(3) itself was impervious to exhaustive search, since a
typical large, timesharing system could manage just over a single key
check per second.
The real answer though, is probably that the average user doesn't need
or want what most people are talking about when you say secure
operating system. It doesn't even
