Results 11 to 20 of about 37,018 (310)
Visualizing Elements of Sha[3] in Genus 2 Jacobians [PDF]
Mazur proved that any element xi of order three in the Shafarevich-Tate group of an elliptic curve E over a number field k can be made visible in an abelian surface A in the sense that xi lies in the kernel of the natural homomorphism between the cohomology groups H^1(k,E) -> H^1(k,A).
Bruin, Nils, Dahmen, Sander R.
openaire +6 more sources
Hardware Performance Evaluation of SHA-3 Candidate Algorithms
Secure Hashing Algorithms (SHA) showed a significant importance in today’s information security applications. The National Institute of Standards and Technology (NIST), held a competition of three rounds to replace SHA1 and SHA2 with the new SHA-3, to ensure long term robustness of hash functions.
Yaser Jararweh +3 more
openalex +3 more sources
Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3 [PDF]
Discussions about the choice of a tree hash mode of operation for a standardization have recently been undertaken. It appears that a single tree mode cannot address adequately all possible uses and specifications of a system. In this paper, we review the
Kevin Atighehchi, Alexis Bonnecaze
doaj +5 more sources
SAT-based analysis of SHA-3 competition finalists
Рассматриваются финалисты конкурса SHA-3, организованного для принятия нового стандарта криптографической хеш-функции. Все пять финалистов до сих пор являются стойкими к поиску прообраза, т.е. для них невозможно за реальное время найти вход по известному выходу.
Oleg Zaikin +2 more
openalex +3 more sources
Breaking Ground: A New Area Record for Low-Latency First-Order Masked SHA-3
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 +8 more
doaj +3 more sources
Concurrent Error Detection for Reliable SHA-3 Design [PDF]
Cryptographic systems are vulnerable to random errors and injected faults. Soft errors can inadvertently happen in critical cryptographic modules and attackers can inject faults into systems to retrieve the embedded secret. Different schemes have been developed to improve the security and reliability of cryptographic systems. As the new SHA-3 standard,
Pei Luo, Cheng Li, Yunsi Fei
openalex +2 more sources
Design of an Energy-Efficient SHA-3 Accelerator on Artix-7 FPGA for Secure Network Applications [PDF]
As the demand for secure communication and data integrity in embedded and networked systems continues to grow, there is an increasing need for cryptographic solutions that provide robust security while efficiently using energy and hardware resources ...
Abdulmunem A. Abdulsamad +1 more
doaj +2 more sources
Finding Collisions against 4-Round SHA-3-384 in Practical Time
The Keccak sponge function family, designed by Bertoni et al. in 2007, was selected by the U.S. National Institute of Standards and Technology (NIST) in 2012 as the next generation of Secure Hash Algorithm (SHA-3).
Senyang Huang +3 more
doaj +1 more source
Applying Grover's Algorithm to Hash Functions: A Software Perspective
Quantum software frameworks provide software engineers with the tools to study quantum algorithms as applied to practical problems. We implement classical hash functions MD5, SHA-1, SHA-2, and SHA-3 as quantum oracles to study the computational resource ...
Richard H. Preston
doaj +1 more source
Analysis of the Possibility of Using Selected Hash Functions Submitted for the SHA-3 Competition in the SDEx Encryption Method [PDF]
The paper presents analysis of the possibility of using selected hash functions submitted for the SHA-3 competition in the SDEx encryption method. The group of these functions will include the finalists of the SHA-3 competition, i.e.
Artur Hłobaż
doaj +1 more source

