Cryptography-Digest Digest #53, Volume #11 Fri, 4 Feb 00 19:13:01 EST
Contents:
BlackIce filetype *enc ("Zwadke")
Re: Challenge: Who can discover the encryption used here? (Kevin Buhr)
My another contact email -- actually I am operating currently in public locations
(due to my current financial problems) (Markku J. Saarelainen)
Re: Hill Climbing (James Pate Williams, Jr.)
Re: RSA survey ("Joseph Ashwood")
E-commerce Stocks at my URL is a preliminary gift for our cooperation and team work
(Markku J. Saarelainen)
Re: How to Annoy the NSA ("Joseph Ashwood")
I have provided some basics how we would go and get Nokia's business intelligence
from Europe with our human network and assets - this is real ! (Markku J. Saarelainen)
I have provided some basics how we would go and get Nokia's business intelligence
from Europe with our human network and assets - this is real ! (Markku J. Saarelainen)
Re: Jaws Technologies' L5 Data Encryption Algorithm? (Keith A Monahan)
Re: Available Algorithms (Keith A Monahan)
Re: Jaws Technologies' L5 Data Encryption Algorithm? (Jerry Coffin)
Re: Court cases on DVD hacking is a problem for all of us (Paul Crowley)
Re: How to password protect files on distribution CD (Alan J Rosenthal)
Re: Using blowfish as a one-way hash? (Bruce Schneier)
Re: How to Annoy the NSA ([EMAIL PROTECTED])
Re: Available Algorithms (John Savard)
Re: How to choose public-key e on RSA? ("Miryadi")
Re: Hill Climbing ("Douglas A. Gwyn")
Re: Math contest winner from Ireland... ("Douglas A. Gwyn")
Re: Cipher challenge (of sorts) ("TJ")
Re: Challenge: Who can discover the encryption used here? ("TJ")
Re: How to Annoy the NSA (Hammer)
----------------------------------------------------------------------------
From: "Zwadke" <[EMAIL PROTECTED]>
Subject: BlackIce filetype *enc
Date: Fri, 4 Feb 2000 22:14:06 +0100
Hi,
Can anyone help me to decrypt the file-extension *enc within the program
BlackIce Defender.
I have been hacked and cracked before i bought this program and i'm getting
attacked all the time. Before i send there IP to my provider i will warn
them just one time.
Please help me out,
Greetings from Holland,
Henk de Jonge
------------------------------
From: [EMAIL PROTECTED] (Kevin Buhr)
Subject: Re: Challenge: Who can discover the encryption used here?
Date: 04 Feb 2000 15:29:21 -0600
"TJ" <[EMAIL PROTECTED]> writes:
>
> 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.
Yeah, sorry we're so dumb. Try "rec.org.mensa". That's where the
eggheads hang out.
Kevin <[EMAIL PROTECTED]>
------------------------------
From: Markku J. Saarelainen <[EMAIL PROTECTED]>
Crossposted-To: alt.politics.org.cia
Subject: My another contact email -- actually I am operating currently in public
locations (due to my current financial problems)
Date: Fri, 04 Feb 2000 21:24:41 GMT
You can reach me also at [EMAIL PROTECTED] - I am serious about
getting our team work going to solve some problems that Nokia
Telecommunications is currently developing and implementing. Actually,
I know few people from my high school times who are or were working for
Nokia Telecommunication. You may already have few contact email
addresses, but not really facts and details.
Best regards,
Markku
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: [EMAIL PROTECTED] (James Pate Williams, Jr.)
Subject: Re: Hill Climbing
Date: Fri, 04 Feb 2000 21:41:28 GMT
On Fri, 4 Feb 2000 16:29:43 -0000, "Michael Darling"
<[EMAIL PROTECTED]> wrote:
>I'm hearing a lot about hill climbing algorithms - can anyone tell me of any
>links or books which would
>tell me more about them.
>
Hill-climbing algorithms are used in the branch of computer science
known as artificial intelligence to solve constraint satisfaction
problems such as the N-queens problem and graph k-coloring
problem. Jim Gillogly (sp?) can tell you about the shotgun
hill-climbing algorithm that is used in the cryptanalysis of some
classic encryption systems.
==Pate Williams==
[EMAIL PROTECTED]
http://www.mindspring.com/~pate
------------------------------
From: "Joseph Ashwood" <[EMAIL PROTECTED]>
Subject: Re: RSA survey
Date: Fri, 4 Feb 2000 13:35:09 -0000
[please feel free to ignore the rather extended delay]
[snip my comment about using the highest security margin
that I can afford the time for]
> Isn't the while point of PGP to be able to communicate
securely with OTHER
> PEOPLE?
Yes it is, but I figure if I can wait a few seconds to send
a message than so can the other person. Since my policy is
to sign when sender authentication would be desired, and
encrypt only when the information really needs protecting, I
only send encrypted messages a few times a week (and not a
single time this week). The result is that even if I chose a
10Kbit key the delay between the messages supplies more than
enough time.
I could send a massive amount of e-mails encrypted and
signed (when I'm working sometimes as high as several
hundred per day), but to do that I'd lower the keylength for
faster processing, instead I chose to use a longer
keylength, and only send important data encrypted. I simply
determined that for my purposes it's more useful.
Joe
------------------------------
From: Markku J. Saarelainen <[EMAIL PROTECTED]>
Crossposted-To: alt.politics.org.cia
Subject: E-commerce Stocks at my URL is a preliminary gift for our cooperation and
team work
Date: Fri, 04 Feb 2000 21:28:22 GMT
http://homestead.virtualjerusalem.com/waeg/
Click also MY cell phone ... :) Got the picture ...
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: "Joseph Ashwood" <[EMAIL PROTECTED]>
Subject: Re: How to Annoy the NSA
Date: Fri, 4 Feb 2000 13:45:40 -0000
I'm just taking a few lines to point out the bit of
slef-fulfilling prophecy that is this conversation.
It is generally assumed that the NSA reads sci.crypt looking
to find how good various people are.
As I'm sure most of us have noticed you have to read
everything on here, or you miss something (no matter how
useless the post looks)
By increasing the traffic with useless words, you annoy the
NSA.
------------------------------
From: Markku J. Saarelainen <[EMAIL PROTECTED]>
Crossposted-To: alt.politics.org.cia
Subject: I have provided some basics how we would go and get Nokia's business
intelligence from Europe with our human network and assets - this is real !
Date: Fri, 04 Feb 2000 21:39:56 GMT
I have provided some basic how we would go and get Nokia's business
intelligence from Europe with our human network and assets. And this
proposal is real.
I am ready to work with you, if you pay. I think we can all mutually
benefits from this arrangement and efforts.
My sincere regards,
Markku
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: Markku J. Saarelainen <[EMAIL PROTECTED]>
Crossposted-To: alt.politics.org.cia
Subject: I have provided some basics how we would go and get Nokia's business
intelligence from Europe with our human network and assets - this is real !
Date: Fri, 04 Feb 2000 21:40:04 GMT
I have provided some basic how we would go and get Nokia's business
intelligence from Europe with our human network and assets. And this
proposal is real.
I am ready to work with you, if you pay. I think we can all mutually
benefit from this arrangement and efforts.
My sincere regards,
Markku
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: [EMAIL PROTECTED] (Keith A Monahan)
Subject: Re: Jaws Technologies' L5 Data Encryption Algorithm?
Date: 4 Feb 2000 22:02:41 GMT
Question: Whenever someone submits, let's say, an encryption algorithm
for a patent, they have to submit the idea and methodology, etc. Are
they required to submit the implementation of that idea? (ie jaws source)
Keith
Trevor Jackson, III ([EMAIL PROTECTED]) wrote:
: Keith A Monahan wrote:
: > And my guess is they probably won't even AFTER the patent.
: They have no choice. The purpose of the patent system is to disseminate
: inventions widely, so that any proficient practitioner can employ the
: invention. In exchange the patent holder gets a limited monopoly.
: But no matter what, trade secret protection ceases as soon as a patent issues.
: > Although their
: > web page says, "Experts tell us it would be secure even if someone found
: > out our method", I suspect that they wouldn't want to risk someone
: > finding out their algorithm is insecure. And although their page
: > leads you to believe they trust their methods -- I doubt they trust them
: > enough to let the cryptographic community review it. And see, what they
: > don't understand is that with a GOOD solid secure cipher they have
: > nothing to fear.
: >
: > Keith
: >
: > Trevor Jackson, III ([EMAIL PROTECTED]) wrote:
: > : Paul Koning wrote:
: >
: > : > John Savard wrote:
: > : > > ... the fact that they've applied for a patent
: > : > > means that eventually they will be able to disclose their algorithm
: > : >
: > : > No; if they have applied for a patent they can disclose the
: > : > algorithm *now*.
: >
: > : They can, but the need not. If the patent application is rejected they
: > : may want to preserve the information.
------------------------------
From: [EMAIL PROTECTED] (Keith A Monahan)
Subject: Re: Available Algorithms
Date: 4 Feb 2000 22:05:34 GMT
Paul,
Paul Schlyter ([EMAIL PROTECTED]) wrote:
: Is addition patented? If so, where do I have to pay royalties the next
: time I balance my checkbook? :-))))))))))))))))
Yes it is, I own the patent. Let me give you my address for you to
forward the funds.... :)
Keith
:
: --
: ----------------------------------------------------------------
: Paul Schlyter, Swedish Amateur Astronomer's Society (SAAF)
: Grev Turegatan 40, S-114 38 Stockholm, SWEDEN
: e-mail: [EMAIL PROTECTED] [EMAIL PROTECTED] [EMAIL PROTECTED]
: WWW: http://hotel04.ausys.se/pausch http://welcome.to/pausch
------------------------------
From: Jerry Coffin <[EMAIL PROTECTED]>
Subject: Re: Jaws Technologies' L5 Data Encryption Algorithm?
Date: Fri, 4 Feb 2000 15:14:43 -0700
In article <87fia1$psb$[EMAIL PROTECTED]>, [EMAIL PROTECTED]
says...
> Question: Whenever someone submits, let's say, an encryption algorithm
> for a patent, they have to submit the idea and methodology, etc. Are
> they required to submit the implementation of that idea? (ie jaws source)
No. At one time a model of the invention was required, but it's no
longer required except for supposed perpetual motion machines.
--
Later,
Jerry.
The universe is a figment of its own imagination.
------------------------------
From: Paul Crowley <[EMAIL PROTECTED]>
Subject: Re: Court cases on DVD hacking is a problem for all of us
Date: 4 Feb 2000 18:47:29 -0000
[EMAIL PROTECTED] (Highdesertman) writes:
> Ok. I yeild the floor to my esteemed newsgroup peers. I seem to be the
> only individual here that sees something wrong in taking that which
> does not belong to you.
In fact, you're the only one who sees anyone taking that which doesn't
belong to them.
--
__
\/ o\ [EMAIL PROTECTED] Got a Linux strategy? \ /
/\__/ Paul Crowley http://www.hedonism.demon.co.uk/paul/ /~\
------------------------------
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 21:37:54 GMT
[EMAIL PROTECTED] (Roger Gammans) writes:
>knuth:~$ ifconfig -a | grep HWaddr
>eth0 Link encap:Ethernet HWaddr 00:20:18:8B:14:E3
This is useless as a verification of hardware identity. All you have to
do is "ifconfig eth0 hwaddr whatever". I assume the previous poster was
talking about the hardwired value which the driver loads as the MAC address
by default. I don't know how one accesses this, although I guess I would
start by reading the code for the ethernet driver.
------------------------------
From: [EMAIL PROTECTED] (Bruce Schneier)
Subject: Re: Using blowfish as a one-way hash?
Date: Fri, 04 Feb 2000 22:33:35 GMT
On Mon, 31 Jan 2000 11:17:56 -0700, Eric Lee Green <[EMAIL PROTECTED]>
wrote:
>ChenNelson wrote:
>> In _Applied Cryptography_ Schneier noted that blowfish is not to be
>> used as a one-way hash. Why is this so, in CBC mode?
>
>I would presume it is because blowfish only has a 64-bit block size.
>
>It'd be interesting to see whether twofish, with its larger 128-bit block
>size, would be useful for this purpose.
Actually, it's because of the speed. The good constructions that turn
a block cipher into a one-way hash or a MAC require the algorithm to
be rekeyed for each block. Blowfish is VERY slow to key, making this
annoying at best.
Bruce
**********************************************************************
Bruce Schneier, Counterpane Internet Security, Inc. Phone: 612-823-1098
101 E Minnehaha Parkway, Minneapolis, MN 55419 Fax: 612-823-1590
Free crypto newsletter. See: http://www.counterpane.com
------------------------------
From: [EMAIL PROTECTED]
Subject: Re: How to Annoy the NSA
Date: Fri, 04 Feb 2000 22:41:16 GMT
In article <87esjj$qpk$[EMAIL PROTECTED]>,
[EMAIL PROTECTED] wrote:
> Tim Tyler <[EMAIL PROTECTED]> wrote:
> > Jerry Coffin <[EMAIL PROTECTED]> wrote:
> > : [EMAIL PROTECTED] says...
>
>
> I don't think Science Magazine *or* Doug Gwyn have to be wrong. I
> think it's just nermal_83's interpretation that's wrong. Look how
> he/she writes this: The "or NP-Complete" part is not in quotes. If I
> had to bet, I'd bet that Science Magazine said something like "hard
> problems underlie nearly all cryptography and computer security
> codes". Certainly nothing wrong with that statement. And then
> nermal_83 adds the "or NP-Complete" since in several postings he seems
> to think that "hard problems" and NP-complete are the same thing.
Sir, you are correct! We took a look at this
article and it DOES say that "hard" problems
and NOT NP-complete problems are what
underlies cryptography. However, the article
is misleading because it uses the traveling
salesman problem as a specific example and
this problem is NP-complete. The article
never refers explicitly to NP-completeness
and is actually about the speculative notion of
introducing "limits" into the theory of
computational complexity. NP-complete
problems are the "hardest" type of NP
problems and few cryptosystems are actually
based on constructions of an NP-complete
problem.
>
> And on another comment you made: No, Shor's result does *not*
> generalize to all NP problems. I have seen a reference stating that
> if you extend the quantum model even more (to non-linear operations)
> that you can solve NP-complete problems, but I haven't seen the paper
> that was referenced (it was in a physics journal, not a C.S. journal),
> so I don't really know what's being referred to there.
>
Correct again! It has been proven that Shor's
algorithm cannot be generalized to all NP
problems. However, this algorithm can be
modified for bulk quantum computation and
then it will apply to the general case. See
//arXiv.org/abs/quant-ph/9907067
> --
> Steve Tate --- srt[At]cs.unt.edu | Gratuitously stolen quote:
> Dept. of Computer Sciences | "The box said 'Requires Windows 95, NT,
> University of North Texas | or better,' so I installed Linux."
> Denton, TX 76201 |
>
The straight poo from the NSA- respect our
awwthoitay ! ! !
Sent via Deja.com http://www.deja.com/
Before you buy.
------------------------------
From: [EMAIL PROTECTED] (John Savard)
Subject: Re: Available Algorithms
Date: Fri, 04 Feb 2000 15:48:19 GMT
"G. R. Bricker" <[EMAIL PROTECTED]> wrote, in part:
>Or construct your own algorithm. Buy a Shaum's Mathematical Formulas book
>(abou $13) and pick through it. no infringement of trademark or patent
>worries. I bought this in my freshmen year and have dog-eared it to death.
Huh? Just how would you go about constructing an encryption algorithm
with the aid of one of those?
John Savard (jsavard<at>ecn<dot>ab<dot>ca)
http://www.ecn.ab.ca/~jsavard/crypto.htm
------------------------------
From: "Miryadi" <[EMAIL PROTECTED]>
Subject: Re: How to choose public-key e on RSA?
Date: Sat, 5 Feb 2000 05:50:20 +0700
Thanks for all the respond.
------------------------------
From: "Douglas A. Gwyn" <[EMAIL PROTECTED]>
Subject: Re: Hill Climbing
Date: Fri, 04 Feb 2000 22:59:46 GMT
Michael Darling wrote:
> I'm hearing a lot about hill climbing algorithms - can anyone tell
> me of any links or books which would tell me more about them.
Check out texts on optimization.
The basic idea is to think of the problem parameters as a domain,
generally sketched on the blackboard as the domain of a 2-D map
(although there may be more than 2 independent parameters),
and the "goodness value" of the function to be maximized as
altitude, so one envisions a 3-D relief map where good values
for the parameters are hills and bad values are valleys. A
hill-climbing algorithm searches for a maximum value by sampling
the domain and trying to follow the terrain up hills. Since
each hill is merely a *local* maximum, a global optimum can be
found only by special variations on this general method, such
as sampling several random points in the domain every so often.
One thing necessary for hill climbing is a scalar "goodness"
function. For many applications, this is obvious (least cost,
least work, etc.), but for the cryptographic problem it might
not be obvious: Is AJSOWL better than EOQJDS? (Neither one
has any straightforward relation to the actual plaintext.)
In case there is no local structure (no obvious connection
between values for one parameter set and an adjacent parameter
set), the whole method breaks down. Ideally, changing any key
bit causes about half the PT bits to change under a (spurious)
decipherment, which kills hill-climbing methods.
------------------------------
From: "Douglas A. Gwyn" <[EMAIL PROTECTED]>
Subject: Re: Math contest winner from Ireland...
Date: Fri, 04 Feb 2000 23:01:57 GMT
Derek Bell wrote:
> Her algorithm is called the "Caley-Purser" algorithm after the 19th
> century English algebraist and a lecturer in TCD who was involved
> with Baltimore.
To be precise, that's what Sarah Flannery wanted it to be called,
but that's not how algorithms are named. If it catches on, it
will undoubtedly be known as the Flannery algorithm.
------------------------------
From: "TJ" <[EMAIL PROTECTED]>
Subject: Re: Cipher challenge (of sorts)
Date: Fri, 04 Feb 2000 23:49:00 GMT
Thats what I thought about premiere, but there are one or two associated
files and exe's that have "Compressed using Adobe premiere" and then gives a
detail of the settings used.
I mean, I really know nothing of these things, but I do have an associated
file which does a similar thing to standard typed text, but it doesnt seem
to be the same method used with this file, as I cannot decode it.
The mystery continues :O)
TJ
Glenn Larsson <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]...
> 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: "TJ" <[EMAIL PROTECTED]>
Subject: Re: Challenge: Who can discover the encryption used here?
Date: Fri, 04 Feb 2000 23:51:12 GMT
Kevin Buhr writes:
> >
> Yeah, sorry we're so dumb.
I never said/implied/meant that :0)
Try "rec.org.mensa". That's where the
> eggheads hang out.
>
On my way, thanks...........
TJ
------------------------------
From: Hammer <[EMAIL PROTECTED]>
Subject: Re: How to Annoy the NSA
Date: Fri, 04 Feb 2000 23:54:04 GMT
In article <8778es$r8d$[EMAIL PROTECTED]>,
[EMAIL PROTECTED] wrote:
[..]
> Everyone should know that Al Gore did not
> invent the internet and that it was first
> developed as a military project about 30 years
> ago.
No way!! You can't be serious...
Hammer [dying laughing...]
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
******************************
