Skip to search formSkip to main contentSkip to account menu

Grøstl

Known as: Groestl, Grostl, Gröstl 
Grøstl is a cryptographic hash function submitted to the NIST hash function competition by Praveen Gauravaram, Lars Knudsen, Krystian Matusiewicz… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Avalanche effectCollision attackCryptoNoteCryptographic hash function

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Development of the approach to proving the security of block ciphers to impossible differential attack
Trends in the development of symmetric cryptography are constantly associated with the increasing of the sizes of keys and blocks… 
2012
2012
Hardware Performance Evaluation of SHA-3 Candidate Algorithms
Secure Hashing Algorithms (SHA) showed a significant importance in today’s information security applications. The National… 
2012
2012
JAAVR: Introducing the Next Generation of Security-Enabled RFID Tags
JAAVR stands for Just Another AVR, is a clone of the popular ATmega128 microprocessor, and is used as the core component of a… 
2012
2012
Look-Up Table Based Implementations of SHA-3 Finalists: JH, Keccak and Skein
Cryptographic hash functions are widely used in many information security applications like digital signatures, message… 
Review
2011
Review
2011
Status Report on the Second Round of the SHA-3 Cryptographic Hash Algorithm Competition
The National Institute of Standards and Technology (NIST) opened a public competition on November 2, 2007 to develop a new… 
2011
2011
Hash instruction execution groestl
描述了一种方法。 该方法包括执行对状态矩阵执行一个或多个与2的伽罗瓦域(GF)相乘运算的指令以及执行用异或(XOR)函数将所述一个或多个与2的GF相乘运算的结果进行组合以生成结果矩阵的指令。 
2011
2011
Byte slicing Grøstl Optimized Intel AES-NI and 8-bit implementations of the SHA-3 finalist Grøstl
Grøstl is an AES-based hash function and one of the 5 finalists of the SHA-3 competition. In this work we present high-speed… 
2010
2010
Improved Collision Attacks on the Reduced-Round Grøstl Hash Function
We analyze the Grostl hash function, which is a 2nd-round candidate of the SHA-3 competition. Using the start-from-the-middle… 
Highly Cited
2010
Highly Cited
2010
Rebound Attacks on the Reduced Grøstl Hash Function
Grostl is one of 14 second round candidates of the NIST SHA-3 competition. Cryptanalytic results on the wide-pipe compression… 
2010
2010
Comprehensive Comparison of Hardware Performance of Fourteen Round 2 SHA-3 Candidates with 512-bit Outputs Using Field Programmable Gate Arrays
In this paper, we extend our evaluation of the hardware performance of 14 Round 2 SHA-3 candidates, accepted for the presentation… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)