Analysis of SHA-512/224 and SHA-512/256

Dobraunig, Christoph; Eichlseder, Maria; Mendel, Florian

doi:10.1007/978-3-662-48800-3_25

Cited by 50 publications

(20 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each hash algorithm produces a fixed length of MD such as 160 for SHA1 and 224, 256, 384, and 512 for SHA2 and SHA3 [50]. Table 1 shows the comparison between SHA1, SHA2, and SHA3 [51].…”

Section: -Sha Familymentioning

confidence: 99%

REISCH: Incorporating Lightweight and Reliable Algorithms into Healthcare Applications of WSNs

Al-Zubaidie

Zhang

2020

Applied Sciences

View full text Add to dashboard Cite

Healthcare institutions require advanced technology to collect patients’ data accurately and continuously. The tradition technologies still suffer from two problems: performance and security efficiency. The existing research has serious drawbacks when using public-key mechanisms such as digital signature algorithms. In this paper, we propose Reliable and Efficient Integrity Scheme for Data Collection in HWSN (REISCH) to alleviate these problems by using secure and lightweight signature algorithms. The results of the performance analysis indicate that our scheme provides high efficiency in data integration between sensors and server (saves more than 24% of alive sensors compared to traditional algorithms). Additionally, we use Automated Validation of Internet Security Protocols and Applications (AVISPA) to validate the security procedures in our scheme. Security analysis results confirm that REISCH is safe against some well-known attacks.

show abstract

“…Each hash algorithm produces a fixed length of MD such as 160 for SHA1 and 224, 256, 384, and 512 for SHA2 and SHA3 [50]. Table 1 shows the comparison between SHA1, SHA2, and SHA3 [51].…”

Section: -Sha Familymentioning

confidence: 99%

REISCH: Incorporating Lightweight and Reliable Algorithms into Healthcare Applications of WSNs

Al-Zubaidie

Zhang

2020

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…In [7], the authors have proposed a scheme to secure IPv6 address which includes the modifications to the RFC 3972 standard by reducing the granularity factor of a sec from 16 to 8 and replacing RSA with ECC and ECSDSA, using SHA-256 [6] hash function. This method improves the address configuration performance, but it does not eliminate the address conflict.…”

Section: Related Workmentioning

confidence: 99%

“…This paper treats the SLAAC phases and explains the problems associated with them. So, we propose a new algorithm based on SHA-512 [6] in order to optimize IPv6 security in SmObNet6, This paper is organized as follows: Section 2 presents a related work to our field when Section 3 describes some IPv6 functionalities, in particular, the DAD process. Section 4 shows the parameters and methodology following in this work and we present our algorithm in Section 4.…”

Section: Introductionmentioning

confidence: 99%

Towards a New Algorithm to Optimize IPv6 Neighbor Discovery Security for Small Objects Networks

Ksimi

Leghris

2018

Security and Communication Networks

View full text Add to dashboard Cite

In order to verify the uniqueness of link-local or unicast addresses, nodes must perform a Duplicate Address Detection process before using them. However, this process is subject to many attacks and the security is willing to be the most important issues in Small Object Networks with IPv6. In this paper, we developed a new algorithm to optimize the security in IPv6-DAD process; this method is based on SHA-512 to verify the identity of the Neighbor Discovery messages transmitted in the link local. First, before sending the NS message, the new node uses the function SHA-512 to hash to the target address and use the last 64 bits in a new field and then encrypt the result with its private key. When receiving the secure message, the existing nodes decrypt it. Our algorithm is going to secure the DAD process by using a digital signature. Overall, this algorithm showed a significant effect in terms of the Address Configuration Success Probability (ACSP).

show abstract

“…Compared with search algorithms implemented from scratch in general purpose programming languages [17][18][19][20][21][22][23][24], the CP based approach allows the cryptanalysts to state the problem very naturally, and at a high level without having to say how it should be solved. The resolution of the problem is delegated to generic solvers, and therefore decoupled from the formulation of the problem.…”

Section: Introductionmentioning

confidence: 99%

Programming the Demirci-Selçuk Meet-in-the-Middle Attack with Constraints

Shi

Sun

Derbez

et al. 2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Cryptanalysis with SAT/SMT, MILP and CP has increased in popularity among symmetric-key cryptanalysts and designers due to its high degree of automation. So far, this approach covers differential, linear, impossible differential, zero-correlation, and integral cryptanalysis. However, the Demirci-Selçuk meet-in-the-middle (DS-MITM) attack is one of the most sophisticated techniques that has not been automated with this approach. By an in-depth study of Derbez and Fouque's work on DS-MITM analysis with dedicated search algorithms, we identify the crux of the problem and present a method for automatic DS-MITM attack based on general constraint programming, which allows the cryptanalysts to state the problem at a high level without having to say how it should be solved. Our method is not only able to enumerate distinguishers but can also partly automate the key-recovery process. This approach makes the DS-MITM cryptanalysis more straightforward and easier to follow, since the resolution of the problem is delegated to offthe-shelf constraint solvers and therefore decoupled from its formulation. We apply the method to SKINNY, TWINE, and LBlock, and we get the currently known best DS-MITM attacks on these ciphers. Moreover, to demonstrate the usefulness of our tool for the block cipher designers, we exhaustively evaluate the security of 8! = 40320 versions of LBlock instantiated with different words permutations in the F functions. It turns out that the permutation used in the original LBlock is one of the 64 permutations showing the strongest resistance against the DS-MITM attack. The whole process is accomplished on a PC in less than 2 hours. The same process is applied to TWINE, and similar results are obtained.

show abstract

Analysis of SHA-512/224 and SHA-512/256

Cited by 50 publications

References 21 publications

REISCH: Incorporating Lightweight and Reliable Algorithms into Healthcare Applications of WSNs

REISCH: Incorporating Lightweight and Reliable Algorithms into Healthcare Applications of WSNs

Towards a New Algorithm to Optimize IPv6 Neighbor Discovery Security for Small Objects Networks

Programming the Demirci-Selçuk Meet-in-the-Middle Attack with Constraints

Contact Info

Product

Resources

About