The elastic block cipher design employs the round function of a given, b-bit block cipher in a black box fashion, embedding it in a network structure to construct a family of ciphers in a uniform manner. The family is parameterized by block size, for any size between b and 2b. The design assures that the overall workload for encryption is proportional to the block size. When considering the app...

Based on Stanek’s results [1] we know that in model with integer rate PGV like compression functions no high speed collision resistant compression functions exist. Thus we try to study more general multiple block ciphers based model of compression functions with rational rate, like 6/5. We show a new upper bound of the rate of collision resistant compression functions in this model. 1 Motivatio...

In this investigation, we have developed an unbreakable block cipher with extended play color cipher algorithm. This includes multiple transpositions, substitutions, modular arithmetic, integral functions and a 32 characters alphanumeric key. These functions mutate the plain text in various ways before it takes the shape of cipher text. The process of encryption, decryption and the sub key gene...

The security requirements in Wireless Sensor Networks (WSNs) and the mechanisms to support the requirements, demand a critical examination. Therefore, the security protocols employed in WSNs should be so designed, as to yield the optimum performance. The efficiency of the block cipher is, one of the important factors in leveraging the performance of any security protocol. In this paper, therefo...

Morris Dworkin, a mathematician from NIST’s Computer Security Division, served as the moderator of the workshop. He welcomed the attendees and introduced the other participants from NIST: Bill Burr, Elaine Barker, Aaron Nelson, and, at the registration table, Vickie Harris and Teresa Vicente. He reviewed the three current Federal Information Processing Standards (FIPS) that establish block ciph...

Recently, Shoichi Hirose [2] proposed several double block length (DBL) hash functions. Each DBL hash function uses a constant which has a role to make the DBL hash function collision-resistant in the ideal cipher model. However, we have to instantiate a block cipher. In this paper, we show that the constant may be used as a trapdoor to help a attacker to find a collision easily. In case of 256...

In this paper attacks on double block length hash functions using a block cipher are considered. We present attacks on all double block length hash functions of hash rate 1, that is, hash functions where in each round the block cipher is used twice, s.t. one encryption is needed per message block. In particular, our attacks break the Parallel-DM presented at Crypto'9333].