This paper describes a pedestrian detection system that integrates image intensity
information with motion information. We use a detection style algorithm that scans a detector …

In this article, it is discussed how to construct a compression function with 2 n-bit output
using a component function with n-bit output. The component function is either a smaller …

This paper reconsiders the established Merkle-Damgård design principle for iterated hash
functions. The internal state size w of an iterated n-bit hash function is treated as a security …

摘! 要! 分组密码工作模式是利用分组密码解决实际问题的密码方案9 好的工作模式可以弥补
分组密码的某些缺憾'相反& 不好的工作模式可能带来安全隐患9 工作模式的研究始终伴随着 …

Incremental hash functions have gained much attention due to their incremental property, ie
hashes of updated messages can be speedily computed from previous hashes without …

We consider how to build an efficient compression function from a small number of random,
non-compressing primitives. Our main goal is to achieve a level of collision resistance as …

This paper considers the hash function MD2 which was developed by Ron Rivest in 1989.
Despite its age, MD2 has withstood cryptanalytic attacks until recently. This paper contains …

We provide the first proof of security for MDC-2, the most well-known construction for turning
an n-bit blockcipher into a 2 n-bit cryptographic hash function. Our result, which is in the …

Suppose we are given a perfect n+ c-to-n bit compression function f and we want to
construct a larger m+ s-to-s bit compression function H instead. What level of security, in …

We provide a proof of security for a huge class of double block length hash function that we
will call Cyclic-DM. Using this result, we are able to give a collision resistance bound for …