Hi, all. Recently, I want to construct a specified hash function, which
satisfies

y=h(x), x can be any string, and y must belong to [g^a mod p,g^{a+1}
mod p,...,g^b mod p], and no body knows the discrete logrithm of y
based on g. a,b are known.

H( ): {0,1}

I received a nasty e-mail from an individual and I am wondering how to
connect the e-mail address to the person. Here is the data from the
header:

X-Message-Status: n:0
X-SID-PRA: justice baseball gmail.com>
X-SID-Result: Pass
X-Message-Info: LsUYwwHHNt3j0YsgRLKNC5G9rP8E0pc3bBcfhNsQBYo=
Received: from nz-out-0102.google.com ([64.233.162.192]) by
bay0-mc4-f5.bay0.hotmail.com with Microsoft SMTPSVC(6.0.3790.2444);
Tue, 31 Oct 2006 09:37:34 -0800
Received: by nz-out-0102.google.com with SMTP id 13so1507985nzp
for hotmail.com>; Tue, 31 Oct 2006 09:37:33 -0800
(PST)
DomainKey-Signature: a=rsa-sha1; q=dns; c=nofws;
s=beta; d=gmail.com;

h=received:message-id:date:from:to:subject:mime-version:content-type;

the **theory-edge** mailing list tracks technical
advances & breakthroughs, particularly those relating to
the interplay between

- software
- hardware
- cyberspace
- culture
- theory

sign up and/or browse messages here

http://groups.yahoo.com/group/theory-edge/

- daily news link updates
- 8.5 years old
- 1.5K subscribers
- 10K messages
- fully searchable archives
- RSS feed
- email addrs spam protected

this link returns latest messages, most recent at bottom:

http://groups.yahoo.com/group/theory-edge/messages/?expand=1

Hi,

Is there any hash function based on block cipher described in any
standard (such as IEEE P1363) or used in any widely used system ?

Also, can a Cipher based MAC (eg: OMAC) with a known cipher key be used
as a Hash ?

Thanks

Hi,

I'm reading ISO 18033 (well, a draft of it anyway), and I dont
understand what the purpose of "Labels" is.

The draft I'm reading is : http://www.shoup.net/iso/std6.pdf

Labels are first introduced in section 7.2 and used in the DEMs
described in section 9...

I dont get what they are in a "real world" example.

Thanks

Hi all,

I would like comments on the security of secure hash algorithms versus
block ciphers used for authentication. For instance 3DES versus SHA-256
and family.

The reason for asking is that I want to benefit from an existing 3DES
implementation in my application, and use it for authentication purposes
(with different keys, of course) instead of using expensive code space
for some SHA implementation also.

Pros and cons, please.

Best regards,
Rein Anders Apeland

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

The following is something that jumped to mind yesterday. At this point
I don't have any particular plans to develop the necessary formats,
protocols, and Firefox extensions, but it seems like a potentially
interesting project--or group of projects.

Firstly, is anyone already trying this? Secondly, is there anything
fundamentally wrong with these notions?

Thanks -- PSM

OpenPGP and X.509 are two systems by which strong encryption in
electronic communication can be achieved. Their primary difference is
trust models: X.509 is based on a hierarchical trust model with Root
Certificate Authorities (CAs) providing the be-all end-all
certifications, while OpenPGP employs a more personal "web-of-trust"
(WoT) system.

Hello,

I am currently trying to write some syntax that will append some custom
extensions to an X509 certificate request and I am having problems
doing so.

At the moment I am trying to add an X.400 address to the subject alt
name extension of the certificate using a GeneralName structure but I
continue to get an exception stating that the format is not supported.

Does anyone have some example syntax of how I would build this X400
data into the subject alt name extension?

Many thanks in advance,

Adam

I download some free code to create SHA1 hashes and AES encryption.
Using this code I created a program to encrypt strings by first
initializing the cipher with a SHA1 hash of the password, and then
encrypting the data with the password. It seems to work great by
encrypting a string such as "Encrypted String" and a password of
"password" to a resulting string of "J4lgK+NgpWWtXTyWmeNgow==". Now if
I try and decrypt ONLY PART of the encrypted string, say
"J4lgK+NgpWWtXT" with the password "password", part of the string is
decrypted successfully. I get a decrypted result of "Encrypted". This
seems odd. I would think by truncating part of the decrypted string, I
would get a bunch of garbage in the decrypted string.

Is this a cause for concern?

In light of (fairly recent) attacks on MD5, is it still safe enough to
use in password hashing, for example in unix-passwd-like salted password
hashes?

Related to this, how do attacks vary with the length of hashed string
(pre-image)? I'd guess that longer documents more vulnerable, but is it
true?