scholarly journals Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV

2002 ◽  
pp. 320-335 ◽  
Author(s):  
John Black ◽  
Phillip Rogaway ◽  
Thomas Shrimpton
Keyword(s):  
Hash Function ◽  
Block Cipher ◽  
Black Box

scholarly journals A New Design of Cryptographic Hash Function: Gear

2016 ◽  
Vol 1 (1) ◽  
Author(s):  
Abdulaziz M Alkandari ◽  
Khalil Ibrahim Alkandari ◽  
Imad Fakhri Alshaikhli ◽  
Mohammad A. AlAhmad
Keyword(s):  
Hash Function ◽  
Block Cipher ◽  
Hash Functions ◽  
Fixed Size ◽  
Compression Function ◽  
Cryptographic Hash Function ◽  
Mode Of Operation ◽  
Main Components ◽  
Map Data ◽  
And Diffusion

A hash function is any function that can be used to map data of arbitrary sizeto data of fixed size. A hash function usually has two main components: a permutationfunction or compression function and mode of operation. We will propose a new concretenovel design of a permutation based hash functions called Gear in this paper. It is a hashfunction based on block cipher in Davies-Meyer mode. It uses the patched version ofMerkle-Damgård, i.e. the wide pipe construction as its mode of operation. Thus, theintermediate chaining value has at least twice larger length than the output hash. Andthe permutations functions used in Gear are inspired from the SHA-3 finalist Grøestl hashfunction which is originally inspired from Rijndael design (AES). There is a very strongconfusion and diffusion in Gear as a result.

scholarly journals Single Key Variant of PMAC_Plus

2017 ◽  
pp. 268-305 ◽  
Author(s):  
Nilanjan Datta ◽  
Avijit Dutta ◽  
Mridul Nandi ◽  
Goutam Paul ◽  
Liting Zhang
Keyword(s):  
Standard Model ◽  
Design Principle ◽  
Block Cipher ◽  
Black Box ◽  
Arbitrary Field ◽  
Message Authentication ◽  
Message Authentication Code ◽  
Authentication Code ◽  
Parallel Network ◽  
Beyond Birthday Bound

At CRYPTO 2011, Yasuda proposed the PMAC_Plus message authentication code based on an n-bit block cipher. Its design principle inherits the well known PMAC parallel network with a low additional cost. PMAC_Plus is a rate-1 construction like PMAC (i.e., one block cipher call per n-bit message block) but provides security against all adversaries (under black-box model) making queries altogether consisting of roughly upto 22n/3 blocks (strings of n-bits). Even though PMAC_Plus gives higher security than the standard birthday bound security, with currently available best bound, it provides weaker security than PMAC for certain choices of adversaries. Moreover, unlike PMAC, PMAC_Plus operates with three independent block cipher keys. In this paper, we propose 1k-PMAC_Plus, the first rate-1 single keyed block cipher based BBB (Beyond Birthday Bound) secure (in standard model) deterministic MAC construction without arbitrary field multiplications. 1k-PMAC_Plus, as the name implies, is a simple one-key variant of PMAC_Plus. In addition to the key reduction, we obtain a higher security guarantee than what was proved originally for PMAC_Plus, thus an improvement in two directions.

scholarly journals Direct Construction of Optimal Rotational-XOR Diffusion Primitives

2017 ◽  
pp. 169-187 ◽  
Author(s):  
Zhiyuan Guo ◽  
Renzhang Liu ◽  
Si Gao ◽  
Wenling Wu ◽  
Dongdai Lin
Keyword(s):  
Diffusion Layer ◽  
Hash Function ◽  
Block Cipher ◽  
Exhaustive Search ◽  
Maximum Distance ◽  
Mds Codes ◽  
Cyclic Structure ◽  
Core Component ◽  
Direct Construction ◽  
Maximum Distance Separable

As a core component of SPN block cipher and hash function, diffusion layer is mainly introduced by matrices built from maximum distance separable (MDS) codes. Up to now, most MDS constructions require to perform an equivalent or even exhaustive search. In this paper, we study the cyclic structure of rotational-XOR diffusion layer, a commonly used diffusion primitive over (

scholarly journals Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF

2018 ◽  
pp. 36-92 ◽  
Author(s):  
Nilanjan Datta ◽  
Avijit Dutta ◽  
Mridul Nandi ◽  
Goutam Paul
Keyword(s):  
Hash Function ◽  
Random Function ◽  
Design Principle ◽  
Block Cipher ◽  
Security Requirements ◽  
Design Paradigm ◽  
Beyond Birthday Bound ◽  
Generic Design

SUM-ECBC (Yasuda, CT-RSA 2010) is the first beyond birthday bound (BBB) secure block cipher based deterministic MAC. After this work, some more BBB secure deterministic MACs have been proposed, namely PMAC_Plus (Yasuda, CRYPTO 2011), 3kf9 (Zhang et al., ASIACRYPT 2012) and LightMAC_Plus (Naito, ASIACRYPT 2017). In this paper, we have abstracted out the inherent design principle of all these BBB secure MACs and present a generic design paradigm to construct a BBB secure pseudo random function, namely Double-block Hash-then- Sum or in short (DbHtS). A DbHtS construction, as the name implies, computes a double block hash on the message and then sum the encrypted output of the two hash blocks. Our result renders that if the underlying hash function meets certain security requirements (namely cover-free and block-wise universal advantage is low), DbHtS construction provides 2n/3-bit security. We demonstrate the applicability of our result by instantiating all the existing beyond birthday secure deterministic MACs (e.g., SUM-ECBC, PMAC_Plus, 3kf9, LightMAC_Plus) as well as a simple two-keyed variant for each of them and some algebraic hash based constructions.

scholarly journals Design of a New Cryptographic Hash Function – Titanium

2018 ◽  
Vol 10 (2) ◽  
pp. 827 ◽  
Author(s):  
Mohammad A. AlAhmad
Keyword(s):  
Hash Function ◽  
Stream Cipher ◽  
Block Cipher ◽  
Cryptographic Hash Function ◽  
Construction Paper ◽  
Speed Performance ◽  
State Of Art

<span>This paper introduces a new cryptographic hash function that follows sponge construction. Paper begins with outlining the structure of the construction. Next part describes the functionality of Titanium and cipher used. A competition between block cipher and stream cipher is presented and showed the reason of using block cipher rather than stream cipher. Speed performance is calculated and analyzed using state-of-art CPUs.</span>

Sign in / Sign up

Export Citation Format

Share Document