In the paper http://eprint.iacr.org/2006/147, titled "New
Integrated proof Method on Iterated Hash Structure and New Structures
", the author give an integrated proof method on security proof of
iterated hash structure. Based on the proof method, one can
distinguish the security of Merkel-Damag{\aa}rd structure, wide-pipe
hash, double-pipe hash and 3c hash, the paper also give a new recommend
structure.

At last, a new hash called F-hash, MAC called F-MAC and encryption
model Called FBC-mode are given, based on same block cipher round
function and key schedule algorithm, which means with a same block
cipher round function and key schedule algorithm, we can have a Hash,
MAC and block cipher and Encryption Mode, the proof based knowledge of
that was based on security of Feistel structure. The AES with 256 bits
key and plaintext (called Rijndael) is good selection.

How about considering using same round function and key schedule
algorithm to build a block cipher, MAC and Hash.

[Proginoskes, presumably to JSH]

That was a JSH forgery (check the headers), although at least most of the
94KB consisted of earlier JSH postings.

"The real" JSH recently started another seemingly JSH-only Google group:

http://groups.google.com/group/AboutMyMath

In his blog, he encouraged participation by noting that:

After all, at a whim, in a moment, without much effort at all,
I can delete all of it.

Just in case you were afraid he might let something embarrassing survive ;-)

I have been gathering all my years of work, sucesses, and break throughs to
publish in a book, including my postings and Blog. This will be HUGE as I
pull it all together, it will change the world, it is all clear to me now.
You so called mathematitions have just been holding me back. The following
is in the first part of my new book of my discoveries, to be called
"Advanced Factoring Algorithms" by James Harris;

my prime counting function:
http://en.wikipedia.org/w/index.php?title=Prime_counting_function&oldid=9142249

I have an open source project. It's a tool for Java programmers that lets
them look up class information. I think it's a useful thing for coding.
You can see how it ranks worldwide in its category:

http://www.google.com/Top/Computers/Programming/Languages/Java/Development_Tools.../

So yeah, I dump out information on my mathematical ideas, and I know
now that some of you never realized why you couldn't stop me from
posting, as you don't understand the relief.

These idea push inside of me until I get them out.

Like I said in my previous post, I don't like mathematicians. I never
really considered myself all that mathematically inclined, as my degree
is in physics.

Let's say I want to implement password-based encryption with Phelix
(http://www.schneier.com/paper-phelix.html) with a minimum of code.
Normally PBE has three steps to convert a password to a key
1. Come up with a random salt.
2. Hash the password with the salt.
3. Iterate the hash.

I'm thinking of using Phelix itself instead of a traditional hash
function. With no iteration, the procedure would be
a. Come up with a random nonce.
b. i. Initialize Phelix with a key of 128 zero bits and the nonce
from step a.
ii. Encrypt the password and discard the ciphertext.
iii. Save the 128-bit Phelix MAC of the password.
c. Initialize Phelix using the MAC from step b.iii as the key and the
nonce from step a.
d. Encrypt the message and put out the nonce from step a, the
ciphertext and the MAC.

1) I don't see any problem with using the same nonce in step b.i and
step c. Nonces don't even have to be random. Unlike CBC, it's OK to have
the Phelix nonce chosen by the attacker as long as the...

C12-GAMMA is a finalised branch of Caesarion v12; a free software
product for the FreeBSD and Linux operating systems.

The software provides secure (E-mail) communications facilities;
communications secrecy, user-authentication and data-integrity
verification.

http://www.caesarion.org.uk

Apologies in advance if you receive multiple copies of this announcement.

-Ralf

================================================================================

CLC2006 - Workshop on Codes and Lattices in Cryptography

September 25th-27th, 2006
Technische Universitaet Darmstadt

================================================================================

Organizers:

Johannes Buchmann - Alexander May - Ulrich Vollmer

================================================================================

Confirmed Speakers:

Hello everyboy.
I'm inteested in the application of Montgomery product on RSA Modular
Exponentiation.
I found out that in order to convert from to Montgomery space it is
necessary to know r2 mod n.
However I never found out a technique described in order to evaluate
this expression, the papers that I say that this expression has to be
precoumputed.
Is tere someone that can indicate me some reference ()if there is one)
on how to perform this task efficiently
Many thanks
Giovanni

I only know what symmetric and public-key encryption systems are and
how they work. I assume 3DES is a symmetric encryption technique.

I came accross this term ECB mode with reference to 3DES encryption.
Can someone explain what this means?

On 2006-07-30, Mike Amling foobaz.com> wrote:

"Bob Terwilliger" noneOfYourBusiness.com> wrote
in message news:12cjhna87ql4aaa@corp.supernews.com...

you are too late to the dance, monkey butt.

JSH was put back in his cubby.
He will be back out soon enough, usally takes a month or two.
Then he will be out and about, and a few months later, they will put a net
over him again.