We consider collisions of moving breathers (MBs) in the Peyrard-Bishop DNA model. Two identical stationary breathers, separated by a fixed number of pair-bases, are perturbed and b...
A. Alvarez, F. R. Romero, J. Cuevas, J. F. R. Arch...
In this paper, we point out some weaknesses in the Salsa20 core function that could be exploited to obtain up to 231 collisions for its full (20 rounds) version. We first find an i...
Abstract—Collision avoidance and resolution multiple access (CARMA) protocols establish a three-way handshake between sender and receiver to attempt to avoid collisions, and reso...
Implementing a fault-tolerant state machine boils down to reaching consensus on a sequence of commands. In wide area networks (WANs), where network delays are typically large and ...
Dan Dobre, Matthias Majuntke, Marco Serafini, Neer...
Abstract— This paper presents a novel methodology for detecting collisions of cylindrically shaped rigid bodies moving in three dimensions. This algorithm uses line geometry and ...
Abstract. In Wang’s attack, message modifications allow to deterministically satisfy certain sufficient conditions to find collisions efficiently. Unfortunately, message modi...
—Tag collisions can impose a major delay in Radio Frequency IDentification (RFID) systems. Such collisions are hard to overcome with passive tags due to their limited capabiliti...
In this paper, we present free-start collisions for the TIB3 hash function with a complexity of about 232 compression function evaluations. By using message modification technique...