Cryptography-Digest Digest #589, Volume #14 Mon, 11 Jun 01 18:13:01 EDT
Contents:
Unknown encryption (Terrence Koeman)
Re: Unknown encryption ("Tom St Denis")
Shannon Paper ("Jack Lindso")
Re: Shannon Paper ("Tom St Denis")
Re: Simple C crypto ("Dirk Bruere")
Re: Simple C crypto ("Tom St Denis")
Crypto Math Package (Steve)
Re: Shannon Paper ("Jack Lindso")
HUMOR Re: Humor, "I Must be a Threat to National Security" (Terry L. Cowart)
Off-topic: Plural agreement in English (David Hopwood)
Off-topic: Plural agreement in English (David Hopwood)
Re: Crypto Math Package (Paul Rubin)
Re: Crypto Math Package ("Tom St Denis")
Re: Crypto Math Package ("Tom St Denis")
3 trip encryption Exchange ("Yaron Oren-Pines")
Re: Any Informed Opinions? ("Dirk Bruere")
Re: Crypto Math Package (Paul Rubin)
Re: 3 trip encryption Exchange ("Tom St Denis")
Re: Crypto Math Package ("Tom St Denis")
----------------------------------------------------------------------------
From: Terrence Koeman <[EMAIL PROTECTED]>
Subject: Unknown encryption
Date: Mon, 11 Jun 2001 20:12:59 GMT
Hello, I've been trying to crack an encrypted textfile as part of a
challenge, but I'm STUCK!
I think the lines starting with "0110100" have something to do with
the key or something, but that's about as far as I get :(
Maybe someone here can help me cracking this text?
Regards,
Terrence Koeman
This is the text and there's a hint: "holes":
0100110000010101
0110111110101111
0110111101100011
0110101100101011
0010000000011111
0111010010110101
0110100010100001
0111001010110010
0110111101101111
0111010100000010
0110011110101001
0110100000010111
0010000011001111
0111010010000101
0110100010101011
0110010110000001
0010000000101111
0110100010101000
0110111101100000
0110110001100101
0110010110001010
0111001110010100
0010000011001111
0111010010110000
0110111110101111
0010000000100011
0111001010000001
0110010110101010
0111011001110010
0110010110101010
0110000101101110
0110110000100001
0010000011001111
0111010010010101
0110100010101000
0110010101101010
0010000001000111
0111001110110100
0110010110100010
0110001101101101
0111001001110010
0110010101101001
0111010000010001
0010000011011111
0110100010101000
0110100110100110
0110010001101000
0110010000001011
0110010110000010
0110111001100110
0010000011001111
0111011110000111
0110100100000110
0111010010110101
0110100010011111
0110100111111111
0110111011111111
0010000011111111
0110110111111111
0110010111111111
------------------------------
From: "Tom St Denis" <[EMAIL PROTECTED]>
Subject: Re: Unknown encryption
Date: Mon, 11 Jun 2001 20:21:20 GMT
"Terrence Koeman" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]...
>
>
> Hello, I've been trying to crack an encrypted textfile as part of a
> challenge, but I'm STUCK!
>
> I think the lines starting with "0110100" have something to do with
> the key or something, but that's about as far as I get :(
>
> Maybe someone here can help me cracking this text?
Sorry this is OT for sci.crypt. Try rec.puzzles.
Also note that the leading digit is 0 in all columns. Not a good sign.
Tom
------------------------------
From: "Jack Lindso" <[EMAIL PROTECTED]>
Subject: Shannon Paper
Date: Mon, 11 Jun 2001 23:49:54 +0200
Does anyone know where can I get Shannon's "Communication Theory of Secrecy
Systems" in a digital format. I've searched the web and the only thing I was
able to find, were horrific image scans, also it seems my university has
Bell's journals since 1950, but not 1949.
Thanks
--
Anticipating the future is all about envisioning the Infinity.
http://www.atstep.com
====================================================
------------------------------
From: "Tom St Denis" <[EMAIL PROTECTED]>
Subject: Re: Shannon Paper
Date: Mon, 11 Jun 2001 20:58:05 GMT
"Jack Lindso" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]...
> Does anyone know where can I get Shannon's "Communication Theory of
Secrecy
> Systems" in a digital format. I've searched the web and the only thing I
was
> able to find, were horrific image scans, also it seems my university has
> Bell's journals since 1950, but not 1949.
I have the "Mathematical Theory of Communication" at
http://tomstdenis.home.dhs.org/shannon.zip
(it's a .PS copy)
or at
http://tomstdenis.home.dhs.org/shannon.pdf
It's not the same paper you're looking for but still rather interesting to
read.
Tom
------------------------------
From: "Dirk Bruere" <[EMAIL PROTECTED]>
Subject: Re: Simple C crypto
Date: Mon, 11 Jun 2001 21:57:28 +0100
"Tom St Denis" <[EMAIL PROTECTED]> wrote in message
news:AhtU6.71137$[EMAIL PROTECTED]...
>
> "Sam Simpson" <[EMAIL PROTECTED]> wrote in message
> news:n5tU6.30707$[EMAIL PROTECTED]...
> > Having previously seen his requirements, I think TEA will be more than
> > sufficient!
>
> Xoring with 0xAA will fulfill his needs.
It may do, but I thought I'd have a look around first.
Why do I feel like a guy in a Rolls Royce showroom trying to buy a Skoda?
Dirk
------------------------------
From: "Tom St Denis" <[EMAIL PROTECTED]>
Subject: Re: Simple C crypto
Date: Mon, 11 Jun 2001 21:07:33 GMT
"Dirk Bruere" <[EMAIL PROTECTED]> wrote in message
news:BdaV6.9336$[EMAIL PROTECTED]...
>
> "Tom St Denis" <[EMAIL PROTECTED]> wrote in message
> news:AhtU6.71137$[EMAIL PROTECTED]...
> >
> > "Sam Simpson" <[EMAIL PROTECTED]> wrote in message
> > news:n5tU6.30707$[EMAIL PROTECTED]...
> > > Having previously seen his requirements, I think TEA will be more than
> > > sufficient!
> >
> > Xoring with 0xAA will fulfill his needs.
>
> It may do, but I thought I'd have a look around first.
> Why do I feel like a guy in a Rolls Royce showroom trying to buy a Skoda?
The problem you're trying to solve has been tried before. There is no known
solution. The reason why is many. Typically one can bypass cryptic
implementations. For example, I don't need to be a hardware engineer to
pirate CDs since CSS is just an algorithm I can plug into my own program.
Also typically "protection" schemes can be bypassed.
Let's suppose you have something like
fp_writebyte(FILE *out, int c)
{
fputc(c ^ cipher_make_byte(), out);
}
i could patch your executable such that cipher_make_byte() will always
return zero.
Don't think it's hard. When I was 12 I patched "Borland Turbo C Lite" so I
could run programs outside of the IDE. (and I had a very limited knowledge
of x86 assembler at that time).
I don't want to be mean, but if your intent is secure obsecure crypto you
will get burnt to a crisp if anyone seriously hacks the program.
Tom
------------------------------
From: [EMAIL PROTECTED] (Steve)
Subject: Crypto Math Package
Date: 11 Jun 2001 14:18:27 -0700
Hello,
Just to let everyone know that we've released CypherMath8, the 8-bit
version of our CypherMath Cryptographic Math Package.
Intended for 8-bit embedded systems, CypherMath8 provides a collection
of multi-precision integer math routines for performing
exponentiation, modular multiplication, Montgomery math, etc.
Written entirely in C, you can compile CypherMath into a library for
your target, or paste the C functions directly into your source code.
Full C-source code is available, along with sample code that shows how
to call the functions from your applications. (A Win32 version called
CypherMathWin32 is also available.)
CypherMath is the math engine behind our CypherCalc Cryptographer's
Calculator, a full-featured, programmable calculator designed to
assist those who work in multi-precision integer arithmetic.
More information and sample code downloads for CypherMath8 and
CypherMathWin32 are at www.cyphercalc.com/math. You can get
information on our CypherCalc Cryptographer's Calculator there, too.
We would welcome any comments or suggestions you might have for making
CypherMath more useful to cryptographers.
Regards,
Steve West
EPS/Solutions
www.cyphercalc.com
[EMAIL PROTECTED]
===========================
------------------------------
From: "Jack Lindso" <[EMAIL PROTECTED]>
Subject: Re: Shannon Paper
Date: Tue, 12 Jun 2001 00:21:59 +0200
I read it, it's good, a bit complicated for my math but I'm catching up.
However I need the other one....
--
Anticipating the future is all about envisioning the Infinity.
http://www.atstep.com
====================================================
"Tom St Denis" <[EMAIL PROTECTED]> wrote in message
news:xhaV6.88272$[EMAIL PROTECTED]...
>
> "Jack Lindso" <[EMAIL PROTECTED]> wrote in message
> news:[EMAIL PROTECTED]...
> > Does anyone know where can I get Shannon's "Communication Theory of
> Secrecy
> > Systems" in a digital format. I've searched the web and the only thing I
> was
> > able to find, were horrific image scans, also it seems my university has
> > Bell's journals since 1950, but not 1949.
>
> I have the "Mathematical Theory of Communication" at
>
> http://tomstdenis.home.dhs.org/shannon.zip
> (it's a .PS copy)
>
> or at
>
> http://tomstdenis.home.dhs.org/shannon.pdf
>
> It's not the same paper you're looking for but still rather interesting to
> read.
>
> Tom
>
>
------------------------------
From: [EMAIL PROTECTED] (Terry L. Cowart)
Crossposted-To: comp.security.misc
Subject: HUMOR Re: Humor, "I Must be a Threat to National Security"
Date: Mon, 11 Jun 2001 20:32:16 GMT
On Fri, 08 Jun 2001 05:13:02 GMT, Miguel Cruz <[EMAIL PROTECTED]> wrote:
>Please forgive my bluntness:
>
>If those three innocuous rejection letters are enough to make you go off on
>a web/usenet rant about the government and the evil they do and conspiracies
>against you, then I can only assume you have at least a slight
>predisposition for this sort of behavior.
>
Analogy test:
humor is to security as oil is to ?????
If you answered water, you might be ready for a job in another field
:)
Officially NOT posted in the capacity of any of the following:
Terry L. Cowart [EMAIL PROTECTED]
Solutions Architect, SCA Technologies http://www.scatech.com
Brainbench MVP for Internet Security http://www.brainbench.com
------------------------------
Date: Mon, 11 Jun 2001 18:56:08 +0100
From: David Hopwood <[EMAIL PROTECTED]>
Subject: Off-topic: Plural agreement in English
Boyd Roberts wrote:
> "JPeschel" <[EMAIL PROTECTED]> a =E9crit dans le message news: 2=
[EMAIL PROTECTED]
> > Wrong.
> > Tom, pay no attention to Boyd; he's wrong.
> =
> yeah, wrong. i'm pleading an 'upper respiratory infection' defence.
> =
> "A plethora of people is here" just sounds so wrong to the ear, but
> given 'a plethora' is singular it should be 'is', unless it's an
> exception and english has a bunch of them :)
Consider the similar cases "A crowd of people is here" and
"A crowd of people are here". Both are correct, and neither sounds
wrong, but they have subtly different meanings. "A crowd of people
is here" treats the crowd as a unit, whereas "A crowd of people are
here" means that all of the people making up the crowd are here.
Now, going back to "A plethora of people is here", the meaning of
"plethora" suggests that the speaker probably did not intend to treat
the group of people as a single unit. That's why "a plethora of people
is here" sounds wrong (to the brain, rather than the ear :-). Although
using "is" is grammatically correct, "A plethora of people are here"
is both correct and makes more sense.
In David Scott's original statement "A bunch of nuts claim ...",
"a bunch of nuts" is plural (i.e. more than one allegedly nutty
person, independently claiming something), so "claim" is correct for
the intended meaning. Tom's criticism was bogus in any case, because
he didn't understand that "claim" and "are claiming" have the same
plural agreement.
(Incidentally, this is why grammar checking is such a hard problem to
automate; the grammatical correctness of a sentence often depends on
its intended meaning. I'm not surprised that Word gets this particular
case wrong; when "a bunch of ..." is meant literally, as in a bunch of
fruit, for example, it is almost always treated as singular.)
-- =
David Hopwood <[EMAIL PROTECTED]>
Home page & PGP public key: http://www.users.zetnet.co.uk/hopwood/
RSA 2048-bit; fingerprint 71 8E A6 23 0E D3 4C E5 0F 69 8C D4 FA 66 15 0=
1
Nothing in this message is intended to be legally binding. If I revoke a
public key but refuse to specify why, it is because the private key has b=
een
seized under the Regulation of Investigatory Powers Act; see www.fipr.org=
/rip
------------------------------
Date: Mon, 11 Jun 2001 19:54:29 +0100
From: David Hopwood <[EMAIL PROTECTED]>
Subject: Off-topic: Plural agreement in English
=====BEGIN PGP SIGNED MESSAGE=====
Boyd Roberts wrote:
> "JPeschel" <[EMAIL PROTECTED]> a =E9crit dans le message news: 2=
[EMAIL PROTECTED]
> > Wrong.
> > Tom, pay no attention to Boyd; he's wrong.
> =
> yeah, wrong. i'm pleading an 'upper respiratory infection' defence.
> =
> "A plethora of people is here" just sounds so wrong to the ear, but
> given 'a plethora' is singular it should be 'is', unless it's an
> exception and english has a bunch of them :)
Consider the similar cases "A crowd of people is here" and
"A crowd of people are here". Both are correct, and neither sounds
wrong, but they have subtly different meanings. "A crowd of people
is here" treats the crowd as a unit, whereas "A crowd of people are
here" means that all of the people making up the crowd are here.
Now, going back to "A plethora of people is here", the meaning of
"plethora" suggests that the speaker probably did not intend to treat
the group of people as a single unit. That's why "a plethora of people
is here" sounds wrong (to the brain, rather than the ear :-). Although
using "is" is grammatically correct, "A plethora of people are here"
is both correct and makes more sense.
In David Scott's original statement "A bunch of nuts claim ...",
"a bunch of nuts" is plural (i.e. more than one allegedly nutty
person, independently claiming something), so "claim" is correct for
the intended meaning. Tom's criticism was bogus in any case, because
he didn't understand that "claim" and "are claiming" have the same
plural agreement.
(Incidentally, this is why grammar checking is such a hard problem to
automate; the grammatical correctness of a sentence often depends on
its intended meaning. I'm not surprised that Word gets this particular
case wrong; when "a bunch of ..." is meant literally, as in a bunch of
fruit, for example, it is almost always treated as singular.)
- -- =
David Hopwood <[EMAIL PROTECTED]>
Home page & PGP public key: http://www.users.zetnet.co.uk/hopwood/
RSA 2048-bit; fingerprint 71 8E A6 23 0E D3 4C E5 0F 69 8C D4 FA 66 15 0=
1
Nothing in this message is intended to be legally binding. If I revoke a
public key but refuse to specify why, it is because the private key has b=
een
seized under the Regulation of Investigatory Powers Act; see www.fipr.org=
/rip
=====BEGIN PGP SIGNATURE=====
Version: 2.6.3i
Charset: noconv
iQEVAwUBOyUT1jkCAxeYt5gVAQHnNgf/ff8mBlFibgVzoyGfKLxN6Bsq7l4xH7jA
XYsOQCeVU5ihBAdSRBcmYbm4/A5DjnI6vZj79O8p3ghnAkZRJdIcXv+j7DfJ71qO
NlWFyD+07nF8oLAmPZgDwlfNqJAu1iVsBAkbzjkJtaTZPKi+dyexk3oB9lCocRWK
1EQ4ZcUPO/wYWuZtjFb+j0/Kk6rjVnMGLz8OpB6IRHxKN1jRh66K/+ixXyikx7P8
yDVdl/0erO2i/uHdusmwcgZ5YALsdR3AsnXeGyZdjlulT2jWFnrZdN04VIxfxAE/
Wjtxs8sOS8l9l1Sn5VRqHKkysq1IWbuce5kK9p+c2mgA5GGlmvmsrQ=3D=3D
=3D0LX9
=====END PGP SIGNATURE=====
------------------------------
From: Paul Rubin <[EMAIL PROTECTED]>
Subject: Re: Crypto Math Package
Date: 11 Jun 2001 14:47:41 -0700
[EMAIL PROTECTED] (Steve) writes:
> We would welcome any comments or suggestions you might have for making
> CypherMath more useful to cryptographers.
How about some description on the web page about why anyone would want
to use this relatively expensive package instead of one of the many
other packages out there (MIRACL, GMP, Cryptlib, etc.) that are out
there which have more functions and/or are free?
------------------------------
From: "Tom St Denis" <[EMAIL PROTECTED]>
Subject: Re: Crypto Math Package
Date: Mon, 11 Jun 2001 21:53:24 GMT
"Paul Rubin" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]...
> [EMAIL PROTECTED] (Steve) writes:
> > We would welcome any comments or suggestions you might have for making
> > CypherMath more useful to cryptographers.
>
> How about some description on the web page about why anyone would want
> to use this relatively expensive package instead of one of the many
> other packages out there (MIRACL, GMP, Cryptlib, etc.) that are out
> there which have more functions and/or are free?
As far as I can tell the advantages their package has could be speed or size
on the 8-bit platforms. As for a Win32 platform MPI is available. It's
free, simple, compact and best of all has more features.
GMP is a pain to build on non-NIX platforms and MIRACL is not free afaik.
tom
------------------------------
From: "Tom St Denis" <[EMAIL PROTECTED]>
Subject: Re: Crypto Math Package
Date: Mon, 11 Jun 2001 21:55:28 GMT
"Steve" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]...
> Hello,
>
> Just to let everyone know that we've released CypherMath8, the 8-bit
> version of our CypherMath Cryptographic Math Package.
>
> Intended for 8-bit embedded systems, CypherMath8 provides a collection
> of multi-precision integer math routines for performing
> exponentiation, modular multiplication, Montgomery math, etc.
5000$ for a math package? Are you guys out of your F$$$ minds?
Considering it's all in C (no asm optimizations) I wouldn't pay more than
... well I dunno ZERO for it.
If you had a complete package optimized for a 6805, 8051 or AVR I might pay
for it.
As it stands you really have no edge over anything else out there. C isn't
particularly efficient on an 8-bit cpu..
BTW please don't spam this group.
Tom
------------------------------
Reply-To: "Yaron Oren-Pines" <[EMAIL PROTECTED]>
From: "Yaron Oren-Pines" <[EMAIL PROTECTED]>
Subject: 3 trip encryption Exchange
Date: Mon, 11 Jun 2001 21:57:03 GMT
Does anyone know this encrypion protocol?
Thanks
Yaron
------------------------------
From: "Dirk Bruere" <[EMAIL PROTECTED]>
Subject: Re: Any Informed Opinions?
Date: Mon, 11 Jun 2001 23:01:32 +0100
"Douglas A. Gwyn" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]...
> Dirk Bruere wrote:
> > It depends on outside influences performing a QM 'measurement'.
> > Nobody knows for sure what that actual process entails.
> Sure we do. Transition between mixed and pure states, i.e.
> projection by a measurement operator (with a well-known set
> of requirements). It seems that you think a reduction to
> actions of some more elementary "components" is necessary,
> but we know that that is not possible. What *might* be
> possible would be a better way to *understand* the known
> properties, which are far removed from most people's
> everyday experience.
There is a great deal of controversy surrounding the details of the
measurement process, particularly concerning the 'infinite regression'
exemplified by 'Wigners friend' and von Neumanns regression.
Although the mathematics are straightforward (apparently) the detail as to
what is required to perform a measurement (ie 'what is a measuring
apparatus') is not well understood at all.
The best that can be said (AFAIK) is that something as big as buckeyballs
can be put into a superposition without any kind of 'self measurement'
occuring, but mice can't (probably).
Can a virus be put into a superposition and held there if there is no
outside measurement process? What about a bacterium?
Dirk
------------------------------
From: Paul Rubin <[EMAIL PROTECTED]>
Subject: Re: Crypto Math Package
Date: 11 Jun 2001 15:03:27 -0700
"Tom St Denis" <[EMAIL PROTECTED]> writes:
> As far as I can tell the advantages their package has could be speed or size
> on the 8-bit platforms. As for a Win32 platform MPI is available. It's
> free, simple, compact and best of all has more features.
The 8-bit stuff is interesting but the web page doesn't give any specifics
about size or speed. It would help if it gave some.
> GMP is a pain to build on non-NIX platforms and MIRACL is not free afaik.
MIRACL isn't free, but it has a heck of a lot more capabilities than
the cyphercalc package, it's free for noncommercial users, and it's a
heck of a lot cheaper for other users (unless you count the no-source
DLL version of Cyphercalc, but no one should want a no-source package).
------------------------------
From: "Tom St Denis" <[EMAIL PROTECTED]>
Subject: Re: 3 trip encryption Exchange
Date: Mon, 11 Jun 2001 22:04:17 GMT
"Yaron Oren-Pines" <[EMAIL PROTECTED]> wrote in message
news:P8bV6.1778$[EMAIL PROTECTED]...
> Does anyone know this encrypion protocol?
Ya it's Shamirs Protocol.
1. You send M^e.
2. They send M^e^d
3. You send M^e^d^(1/e)
They compute M^e^d^(1/e)^(1/d) to get M
(These are all mod p, where p is a large prime)
Tom
------------------------------
From: "Tom St Denis" <[EMAIL PROTECTED]>
Subject: Re: Crypto Math Package
Date: Mon, 11 Jun 2001 22:06:10 GMT
"Paul Rubin" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]...
> "Tom St Denis" <[EMAIL PROTECTED]> writes:
> > As far as I can tell the advantages their package has could be speed or
size
> > on the 8-bit platforms. As for a Win32 platform MPI is available. It's
> > free, simple, compact and best of all has more features.
>
> The 8-bit stuff is interesting but the web page doesn't give any specifics
> about size or speed. It would help if it gave some.
>
> > GMP is a pain to build on non-NIX platforms and MIRACL is not free
afaik.
>
> MIRACL isn't free, but it has a heck of a lot more capabilities than
> the cyphercalc package, it's free for noncommercial users, and it's a
> heck of a lot cheaper for other users (unless you count the no-source
> DLL version of Cyphercalc, but no one should want a no-source package).
Agreed. 5000$ is a bit much for math package. I mean the machines are
cheaper (a 8051 "system" costs about 30 to 50$ if you build it yourself, i.e
one i8032, one 256kbit SRAM, one 64kbit EPROM (for a monitor), a MAX232,
11Mhz crystal, and other misc stuff) than the math package.
Tom
------------------------------
** 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 by posting to sci.crypt.
End of Cryptography-Digest Digest
******************************
