Project

Back to overview

Design principles for cryptographic hash functions: foundations, primitives and transforms

English title Design principles for cryptographic hash functions: foundations, primitives and transforms
Applicant Lenstra Arjen K.
Number 122162
Funding scheme Project funding (Div. I-III)
Research institution Istituto del Software (SI) Facoltà di scienze informatiche
Institution of higher education Università della Svizzera italiana - USI
Main discipline Information Technology
Start/End 01.10.2008 - 30.09.2011
Approved amount 294'555.00
Show all

Keywords (10)

cryptography; hash functions; collision resistance; random oracle; domain extension; range extension; provable security; hash function; security; ideal cipher model

Lay Summary (English)

Lead
Lay summary
Cryptographic hash functions are arguably the most commonly used cryptographic object. They appear in nearly every security protocol, typically to prevent against en route manipulation of the data, to provide a measure of randomness, or to reduce a large data string to a short characteristic representation prior to applying another (often computationally expensive) cryptographic operation. Despite our heavy reliance on hash functions for security, we still know surprisingly little about their proper design and behavior under various adversarial situations. This project will examine these fundamental issues by 1) delving into the fundamental definitions of hash function security as well as the theoretical methods used to reason about them; 2) exploring new designs of primitive objects (like compression functions and blockciphers) used to build modern hash functions; and 3) researching methods to transform these primitives into hash functions that are fast and afford a wide range of inputs (from packets to the entire contents of a hard drive, say) and provide security over a range of output sizes.
Direct link to Lay Summary Last update: 21.02.2013

Responsible applicant and co-applicants

Employees

Publications

Publication
Faster and Smoother - VSH Revisited
Sarinay Juraj (2011), Faster and Smoother - VSH Revisited, in 16th Australasian Conference on Information Security and Privacy (ACISP), MelbourneSpringer, Berlin.
Interpreting Hash Function Security Proofs
Sarinay Juraj (2010), Interpreting Hash Function Security Proofs, in 4th International Conference on Provable Security, MalaccaSpringer, Berlin.

-