Home
Search

Participants

SEMINAR PROGRAM

KNUDSEN Lars

Dakota hashing from a combination of modular arithmetic and symmetric cryptography
Abstract
We propose a cryptographic hash function, where collision resistance is based upon an assumption that involves squaring modulo an RSA modulus in combination with a one-way function that does not compress its input, and may therefore be constructed from standard techniques and assumptions. We are not able to reduce collision finding to factoring, but on the other hand, our hash function is more efficient than any known construction that makes use of modular squaring.


TimeInfo: arrival on Sunday late and leave Friday early.
Dakota.pdf

"KNUDSEN Lars" is mentioned on: Home | Participants


(C) 2007 University of Luxembourg

Printable Version
VeryQuickWiki - HTML Export
Version: 2.7.1 (UniLux: 1.15.0 2006-01-19)
Modified: 2008-02-01 11:41:01
Exported: 2010-01-06 02:36:55