Finding Collisions against 4-Round SHA-3-384 in Practical Time

Computer Science

• Connectivity Problem 50%
• Cryptanalysis 50%
• Cryptographic Primitive 50%
• Hash Function 50%
• Satisfiability Problem 50%
• Secure Hash Algorithm 50%
• Time Complexity 100%

Keyphrases

• 2-blocks 11%
• Collision Attack 33%
• Collision Finding 11%
• Connection Problem 11%
• Cryptanalysis 11%
• Cryptographic Primitives 11%
• Hash Function 11%
• Indian Institute of Technology 11%
• Input Space 11%
• Keccak 22%
• Linearization Techniques 22%
• Memory Complexity 11%
• National Institute of Standards 11%
• Nonlinear Layer 11%
• Random Properties 11%
• Satisfiability Problem 11%
• Satisfiability Solvers 11%
• Security Margin 11%
• SHA-3 100%
• Sieving Algorithms 11%
• Sponge Function 11%
• Time Complexity 22%