Results 31 to 40 of about 18,274,004 (195)

The first collision for full SHA-1 [PDF]

, 2017
SHA-1 is a widely used 1995 NIST cryptographic hash function standard that was officially deprecated by NIST in 2011 due to fundamental security weaknesses demonstrated in various analyses and theoretical attacks.
Karpman, P. (Pierre), Karpman, Pierre, Stevens, Marc, Y. Markov (Yarik), Bursztein, E. (Elie), Ange Albertini, Bursztein, Elie, A. Albertini (Ange), Elie Bursztein, Albertini, Ange, Yarik Markov, Markov, Y. (Yarik), Pierre Karpman, Stevens, M.M.J. (Marc), Marc Stevens, Albertini, A. (Ange), E. Burztein (Eilie), Markov, Yarik   +17 more
core   +2 more sources

An Enhanced Text Steganography Technique (SHA-Logic): Based on Conditional Logic and SHA-3 (Secure Hash Algorithm 3)

JISR on Computing
Text teganography is a method used to hide confidential messages in a message's text without arousing suspicion. This technique has been used in the past, from ancient Greece's scytale tool to modern methods such as Lempel-Ziv-Welch compression and ...
Kisakye Diana Michelle, Ocen Gilbert Gilibrays, Odongtoo Godfrey   +2 more
doaj   +1 more source

On security arguments of the second round SHA-3 candidates [PDF]

International Journal of Information Security, 2012
In 2007, the US National Institute for Standards and Technology (NIST) announced a call for the design of a new cryptographic hash algorithm in response to vulnerabilities like differential attacks identified in existing hash functions, such as MD5 and SHA-1. NIST received many submissions, 51 of which got accepted to the first round.
Elena Andreeva 0001, Andrey Bogdanov, Bart Mennink, Bart Preneel, Christian Rechberger   +4 more
openaire   +4 more sources

Quick Boot of Trusted Execution Environment With Hardware Accelerators

IEEE Access, 2020
The Trusted Execution Environment (TEE) offers a software platform for secure applications. The TEE offers a memory isolation scheme and software authentication from a high privilege mode.
Trong-Thuc Hoang, Ckristian Duran, Duc-Thinh Nguyen-Hoang, Duc-Hung Le, Akira Tsukamoto, Kuniyasu Suzaki, Cong-Kha Pham   +6 more
doaj   +1 more source

Grøstl - a SHA-3 candidate [PDF]

, 2011
Grøstl is a SHA-3 candidate proposal. Grøstl is an iterated hash function with a compression function built from two fixed, large, distinct permutations.
Knudsen, Lars R., Schläffer, Martin, Mendel, Florian, Gauravaram, Praveen, Rechberger, Christian, Thomsen, Søren S., Matusiewicz, Krystian   +6 more
core  

Improved Preimage Attacks on 3-Round Keccak-224/256

IACR Transactions on Symmetric Cryptology, 2021
In this paper, we provide an improved method on preimage attacks of standard 3-round Keccak-224/256. Our method is based on the work by Li and Sun. Their strategy is to find a 2-block preimage instead of a 1-block one by constructing the first and second
Xiaoen Lin, Le He, Hongbo Yu
doaj   +1 more source

Grøstl – a SHA-3 candidate [PDF]

, 2008
Grøstl is a SHA-3 candidate proposal. Grøstl is an iterated hash function with a compression function built from two fixed, large, distinct permutations. The design of Grøstl\ud is transparent and based on principles very different from those used in the
Knudsen, Lars R., Schläffer, Martin, Mendel, Florian, Gauravaram, Praveen, Rechberger, Christian, Thomsen, Søren S., Matusiewicz, Krystian   +6 more
core  

Breaking Ground: A New Area Record for Low-Latency First-Order Masked SHA-3

Transactions on Cryptographic Hardware and Embedded Systems
SHA-3, the latest hash standard from NIST, is utilized by numerous cryptographic algorithms to handle sensitive information. Consequently, SHA-3 has become a prime target for side-channel attacks, with numerous studies demonstrating successful breaches ...
Cankun Zhao, Hang Zhao, Jiangxue Liu, Bohan Yang, Wenping Zhu, Shuying Yin, Min Zhu, Shaojun Wei, Leibo Liu   +8 more
doaj   +1 more source

SHA-3 Design and Cryptanalysis Report [PDF]

, 2010
The competition to select a new secure hash function standard SHA-3 was initiated in response to surprising progress in the cryptanalysis of existing hash function constructions that started in 2004.
Daemen, Joan, De Canniere, Christophe, Bjorstad, Tor, Gauravaram, Praveen, Rechberger, Christian   +4 more
core  

Preimage Attacks on the Round-reduced Keccak with Cross-linear Structures

IACR Transactions on Symmetric Cryptology, 2017
In this paper, based on the work pioneered by Aumasson and Meier, Dinur et al., and Guo et al., we construct some new delicate structures from the roundreduced versions of Keccakhash function family. The new constructed structures are called cross-linear
Ting Li, Yao Sun, Maodong Liao, Dingkang Wang   +3 more
doaj   +1 more source