Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Finding Collisions against 4-Round SHA-3-384 in Practical Time
Senyang Huang
, Orna Agmon Ben-Yehuda
,
Orr Dunkelman
, Alexander Maximov
Caesarea Rothschild Institute for Interdisciplinary Applications of Computer Science (C.R.I.)
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Finding Collisions against 4-Round SHA-3-384 in Practical Time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Time Complexity
100%
Cryptanalysis
50%
Hash Function
50%
Cryptographic Primitive
50%
Connectivity Problem
50%
Satisfiability Problem
50%
Secure Hash Algorithm
50%
Keyphrases
SHA-3
100%
Collision Attack
33%
Time Complexity
22%
Keccak
22%
Linearization Techniques
22%
Cryptanalysis
11%
Nonlinear Layer
11%
Hash Function
11%
Input Space
11%
Memory Complexity
11%
Cryptographic Primitives
11%
Security Margin
11%
Collision Finding
11%
Sponge Function
11%
Satisfiability Problem
11%
Connection Problem
11%
Indian Institute of Technology
11%
National Institute of Standards
11%
2-blocks
11%
Sieving Algorithms
11%
Random Properties
11%
Satisfiability Solvers
11%