Results 1 to 10 of about 21,378,475 (318)
Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3 [PDF]
arXiv, 2016 We investigate the cost of Grover's quantum search algorithm when used in the context of pre-image attacks on the SHA-2 and SHA-3 families of hash functions. Our cost model assumes that the attack is run on a surface code based fault-tolerant quantum computer.
M. Amy +5 more
arxiv +13 more sources
A High-Efficiency FPGA-Based Multimode SHA-2 Accelerator [PDF]
IEEE Access, 2022 The secure hash algorithm 2 (SHA-2) family, including the SHA-224/256/384/512 hash functions, is widely adopted in many modern domains, ranging from Internet of Things devices to cryptocurrency.
Hoai Luan Pham +3 more
doaj +5 more sources
A Flexible Framework for Exploring, Evaluating, and Comparing SHA-2 Designs [PDF]
IEEE Access, 2019 Hash functions are a crucial tool in a large variety of applications, ranging from security protocols to cryptocurrencies down to the Internet-of-Things devices used, for example, as biomedical appliances.
Raffaele Martino, Alessandro Cilardo
doaj +7 more sources
SHA-2 Acceleration Meeting the Needs of Emerging Applications: A Comparative Survey [PDF]
IEEE Access, 2020 While SHA-2 is a ubiquitous cryptographic hashing primitive, its role in emerging application domains, e.g. blockchains or trusted IoT components, has made the acceleration of SHA-2 very challenging due to new stringent classes of requirements ...
Raffaele Martino, Alessandro Cilardo
doaj +7 more sources
22-Step Collisions for SHA-2 [PDF]
arXiv, 2008 In this note, we provide the first 22-step collisions for SHA-256 and SHA-512. Detailed technique of generating these collisions will be provided in the next revision of this note.
Somitra Kumar Sanadhya, Palash Sarkar
arxiv +5 more sources
Time-Space Complexity of Quantum Search Algorithms in Symmetric Cryptanalysis [PDF]
Quantum Inf Process (2018) 17: 339, 2018 Performance of cryptanalytic quantum search algorithms is mainly inferred from query complexity which hides overhead induced by an implementation. To shed light on quantitative complexity analysis removing hidden factors, we provide a framework for estimating time-space complexity, with carefully accounting for characteristics of target cryptographic ...
Panjin Kim, Daewan Han, Kyung Chul Jeong
arxiv +5 more sources
Visualising Sha[2] in Abelian surfaces [PDF]
Mathematics of Computation, 2004 Given an elliptic curve E1 over a number field and an element s in its 2-Selmer group, we give two different ways to construct infinitely many Abelian surfaces A such that the homogeneous space representing s occurs as a fibre of A over another elliptic ...
Nils Bruin
core +7 more sources
Exhibiting SHA[2] on hyperelliptic Jacobians [PDF]
Journal of Number Theory, 2005 We discuss approaches to computing in the Shafarevich-Tate group of Jacobians of higher genus curves, with an emphasis on the theory and practice of visualisation.
Nils Bruin, E. V. Flynn
core +7 more sources
Performance Analysis of Sha-2 and Sha-3 Finalists [PDF]
International Journal on Cryptography and Information Security, 2013 SHA ...
Ram Krishna Dahal +2 more
semanticscholar +6 more sources
Carry-based Differential Power Analysis (CDPA) and its Application to Attacking HMAC-SHA-2
Transactions on Cryptographic Hardware and Embedded Systems, 2023 In this paper, we introduce Carry-based Differential Power Analysis (CDPA), a novel methodology that allows for attacking schemes that use arithmetical addition. We apply this methodology to attacking HMAC-SHA-2. We provide full mathematical analysis of
Yaacov Belenky +6 more
doaj +4 more sources