Results 291 to 300 of about 37,018 (310)
Some of the next articles are maybe not open access.

Malicious SHA-3

Fundamenta Informaticae, 2019
In this paper, we investigate Keccak — the cryptographic hash function adopted as the SHA-3 standard. We propose a malicious variant of the function, where new round constants are introduced. We show that for such a variant, collision and preimage attacks are possible.
openaire   +1 more source

The SHA-3 competition

Proceedings of the 6th International Conference on Security of Information and Networks, 2013
Cryptographic hash functions play a central role in cryptography: they map arbitrarily large input strings to fixed length output strings. The main applications are to create a short unique identifier to a string, to transform a string with a one-way mapping, and to commit to a string or to confirm its knowledge without revealing it.
openaire   +1 more source

Pipelined SHA-3 Implementations on FPGA

Proceedings of the Second Workshop on Cryptography and Security in Computing Systems, 2015
Efficient and high-throughput designs of hash functions will be in great demand in the next few years, given that every IPv6 data packet is expected to be handled with some kind of security features.In this paper, pipelined implementations of the new SHA-3 hash standard on FPGAs are presented and compared aiming to map the design space and the choice ...
Harris E. Michail   +2 more
openaire   +1 more source

A SHA-3 Co-Processor for IoT Applications

2020 Workshop on Communication Networks and Power Systems (WCNPS), 2020
The Secure Hash Algorithm 3 (SHA-3) is the latest member of the secure hash family of algorithms (SHA) on top of which several technologies are built upon, such as in Blockchain, security applications and protocols, including TLS, SSL, PGP, SSH, IPsec, and S/MIME.
Igor L.R. Azevedo   +2 more
openaire   +1 more source

Differential Fault Analysis of SHA-3

2015
In this paper we present the first differential fault analysis DFA of SHA-3. This attack can recover the internal state of two versions of SHA-3 namely, SHA3-512 and SHA3-384 and can be used to forge MAC's which are using these versions of SHA-3. Assuming that the attacker can inject a random single bit fault on the intermediate state of the hash ...
Nasour Bagheri   +2 more
openaire   +1 more source

A Journey from MD5 to SHA-3

2020
If X is sender of a message and Y is the receiver of the same, then X encrypts the same with Y’s public key and then sends the encrypted data to Y. It confirms about authenticity and authorization of receiver. If X sends message and Y receives, X encrypts the message with X’s private key and sends the encrypted data to Y.
Sandip Ghoshal   +3 more
openaire   +1 more source

Comparison and Analysis Study of SHA-3 Finalists

2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT), 2012
The competition of the NIST contenders in SHA-3 increased between the candidates hash functions to choose the winner in the end of 2012. However, NIST has outlined different requirements to measure different hash functions criteria such as, security, structure, and performance. Therefore, this paper addresses a comparative study of round 3 finalist SHA-
Imad Fakhri Alshaikhli   +2 more
openaire   +1 more source

Integral Distinguishers of Some SHA-3 Candidates

2010
In this paper, we study structural Integral properties on reduced versions of the compression functions of some SHA-3 candidates: Hamsi-256, LANE-256 and Grostl-512. More precisely, we improve on the Integral distinguishers of Hamsi-256 (less time complexity or deterministic instead of probabilistic) and present the first known Integral distinguishers ...
Marine Minier   +2 more
openaire   +1 more source

Hardware implementation analysis of SHA-3 candidates algorithms

2010 10th IEEE International Conference on Solid-State and Integrated Circuit Technology, 2010
In order to select a new Standard Hash Algorithm (SHA-3) which supplies more security, a public competition was organized by NIST in 2007. Up to now, 14 candidates have passed the 2nd round. In this paper, we focus on two of these candidate algorithms, namely BLAKE and Shabal. We present the common structure for all the SHA3 candidates.
Liang Han, Bai Guoqiang
openaire   +1 more source

Lightweight Implementations of SHA-3 Candidates on FPGAs

2011
The NIST competition for developing the new cryptographic hash algorithm SHA-3 has entered its third round. One evaluation criterion is the ability of the candidate algorithm to be implemented on resource-constrained platforms. This includes FPGAs for embedded and hand-held devices.
Jens-Peter Kaps   +6 more
openaire   +1 more source

Home - About - Disclaimer - Privacy