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 …

The security of hash functions based on a block cipher with a block length of m bits and a
key length of k bits, where k≦m, is considered. New attacks are presented on a large class …

In this paper we propose a fundamental approach to perform the class of Range and
Nearest Neighbor (NN) queries, the core class of spatial queries used in location-based …

In this paper we give a short overview of the state of the art of secret key block ciphers. We
focus on the main application of block ciphers, namely for encryption. The most important …

In this article, we investigate the use of limited-birthday distinguishers to the context of hash
functions. We first provide a proper understanding of the limited-birthday problem and …

Bent and resilient functions play significant roles in cryptography, coding theory, and
combinatorics. However, the numbers of bent and resilient functions on a given number of …

Bent functions deserve our bent to study them... 1 Работа относится к такой области
дискретной математики, как булевы функции и их приложения в комбинаторике …

In this paper we propose the Grindahl hash functions, which are based on components of
the Rijndael algorithm. To make collision search sufficiently difficult, this design has the …

A multicollision for a function is a set of inputs whose outputs are all identical. A. Joux
showed multicollision attacks on the classical iterated hash function. He also showed how …

The fast advancement of quantum computing poses a substantial challenge to the privacy
and security of critical scientific research data. This is because the standard cryptography …