Results 1 to 10 of about 21,838,242 (247)
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. In particular, SHA-2 is today a ubiquitous hashing primitive.
Raffaele Martino, Alessandro Cilardo
semanticscholar +7 more sources
Performance Analysis of Sha-2 and Sha-3 Finalists [PDF]
International Journal on Cryptography and Information Security, 2013 National Institute of Science and Technology (NIST) published the first Secure Hash Standard SHA-0 in 1993 as Federal Information Processing Standard publication (FIPS PUBS) which two years later was replaced by SHA-1 to improve the original design and added SHA-2 family by subsequent revisions of the FIPS.
Ram Krishna Dahal +2 more
semanticscholar +6 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. SHA-2 functions are often implemented on hardware to optimize performance and power.
Hoai Luan Pham +3 more
semanticscholar +5 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, especially implementation cost and energy efficiency.
Raffaele Martino, Alessandro Cilardo
semanticscholar +8 more sources
Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 Family [PDF]
IACR Cryptology ePrint Archive, 2012 We present a new concept of biclique as a tool for preimage attacks, which employs many powerful techniques from differential cryptanalysis of block ciphers and hash functions. The new tool has proved to be widely applicable by inspiring many authors to publish new results of the full versions of AES, KASUMI, IDEA, and Square. In this paper, we show
Dmitry Khovratovich +2 more
semanticscholar +3 more sources
Routing Using Trust Based System with SHA-2 Authentication
Procedia Computer Science, 2015 AbstractMobile Ad hoc NETwork (MANET) is an infrastructure independent network with every mobile node acting as the router in the network formation. These networks are most useful when the present infrastructure is destroyed or at remote locations which are deprived of these amenities.
Ravilla Dilli +1 more
semanticscholar +4 more sources
Efficient FPGA Hardware Implementation of Secure Hash Function SHA-2 [PDF]
International Journal of Computer Network and Information Security, 2014 The Hash function has been studied by designers with the goal to improve its performances in terms of area, frequency and throughput. The Hash function is used in many embedded systems to provide security. It is become the default choice for security services in numerous applications.
Hassen Mestiri +3 more
semanticscholar +4 more sources
Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3 [PDF]
ACM Symposium on Applied Computing, 2017 Same as the published version to appear in the Selected Areas of Cryptography (SAC) 2016. Comments are welcome!
Matthew Amy +5 more
semanticscholar +6 more sources
Improving SHA-2 Hardware Implementations [PDF]
, 2006 This paper proposes a set of new techniques to improve the implementation of the SHA-2 hashing algorithm. These techniques consist mostly in operation rescheduling and hardware reutilization, allowing a significant reduction of the critical path while the required area also decreases.
Ricardo Chaves +3 more
openalex +3 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 curve E2.
Nils Bruin
openalex +5 more sources