LSH: A New Fast Secure Hash Function Family

Kim, Dong-Chan; Hong, Deukjo; Lee, Jung-Keun; Kim, Woo-Hwan; Kwon, Daesung

doi:10.1007/978-3-319-15943-0_18

Cited by 16 publications

(21 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The two‐word mix function M X r , l ( X , Y ) = ( X ′, Y ′) is defined by , where α r , β r , and γ l are constants. As to the round constants

S C_{l}^{r}

, we refer the readers to for detailed definitions.

\begin{matrix} aX & \leftarrow X + Y, \\ bX & \leftarrow {(aX \oplus S C_{l}^{r})}^{⋘ α_{r}}, \\ aY & \leftarrow bX + Y, \\ bY & \leftarrow a Y^{⋘ β_{r}} \\ X^{'} & \leftarrow bX + bY \\ Y^{'} & \leftarrow b Y^{⋘ γ_{l}} \end{matrix}

Word‐Permutation Function.…”

Section: Preliminarymentioning

confidence: 99%

“…Therefore, a hash function with good software performance would be more marketable when considering the present and the near future. The LSH , a new hash function family proposed by Kim et al at ICISC 2014, is designed in accordance with such circumstances and considerations. As a software oriented hash function, LSH has two versions namely LSH‐256 and LSH‐512, suitable for 32‐bit and 64‐bit processors, respectively.…”

Section: Introductionmentioning

confidence: 99%

“…As a software oriented hash function, LSH has two versions namely LSH‐256 and LSH‐512, suitable for 32‐bit and 64‐bit processors, respectively. In the original introduction of LSH , the designers have given thorough evaluations to the security of LSH against different attacking models. But we find that their analysis is still insufficient,especially evaluating the resistance against the distinguishing attacks such as boomerang.…”

Section: Introductionmentioning

confidence: 99%

“…As to the boomerang attack on LSH, the designers claim “ we can construct 16‐step and 17‐step boomerang distinguishers [53] for LSH‐ 256 and LSH‐512, respectively, by combining short differential characteristics ”. According to the authors, the 16‐round and 17‐round distinguishers requires complexities 2 468 and 2 772 , respectively, which exceeds the generic bounds 2 256 for LSH‐256 and 2 512 for LSH‐512.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Cryptanalysis of the LSH hash functions

Hao

2016

Security Comm. Networks

View full text Add to dashboard Cite

In this paper, we study the security of the LSH hash functions. We find that the wide‐pipe MD‐structural LSH hash functions apply the 17th PGV scheme which is “backward attackable”. This property equips us with trivial attacks including pseudo‐preimage, free‐start collision, and Type II boomerang. These attacks can never be available to previous MD‐structural hash functions like Skein. We stress that such trivial attacks can only be regarded as distinguishers rather than real threat to the LSH in nowadays' practical applications. But we should still be cautious about the possible malicious use of LSH in specific situations in the future. We also launch 14‐round boomerang attacks on LSH‐512 and LSH‐256 hash functions with complexities 2308 and 2242, respectively. We verify the correctness of our boomerang attacks by giving practical 11‐round boomerang quartets. To the best of our knowledge, these are the first practically verifiable boomerang results on the LSH hash functions. These boomerang results indicate that the round functions of LSH are well designed. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

“…The two‐word mix function M X r , l ( X , Y ) = ( X ′, Y ′) is defined by , where α r , β r , and γ l are constants. As to the round constants

S C_{l}^{r}

, we refer the readers to for detailed definitions.

\begin{matrix} aX & \leftarrow X + Y, \\ bX & \leftarrow {(aX \oplus S C_{l}^{r})}^{⋘ α_{r}}, \\ aY & \leftarrow bX + Y, \\ bY & \leftarrow a Y^{⋘ β_{r}} \\ X^{'} & \leftarrow bX + bY \\ Y^{'} & \leftarrow b Y^{⋘ γ_{l}} \end{matrix}

Word‐Permutation Function.…”

Section: Preliminarymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cryptanalysis of the LSH hash functions

Hao

2016

Security Comm. Networks

View full text Add to dashboard Cite

show abstract

“…[9,10] 본 논문에서는 실제 무결성 검사를 위해 사용 되는APP Protect라는 솔루션에 적용되어 있는 SHA [11] 와 국내에서 개발된 LSH [12] 의 성능을 비교한다. …”

unclassified

A Study on the Cryptography Algorithm Performance Comparison Used in Modulation and Forgery

Lee¹,

Chang²

2017

The Journal of Korean Institute of Communications and Informati

View full text Add to dashboard Cite

Recently, the use of mobile devices has increased in order to provide a variety of services, and thus there has been a surge in the number of application malicious attacks on the Android platform. To resolve the problem, the domestic financial sector has been introducing the app anti-tamper solution based on cryptographic algorithms.However, since the capacity of apps installed in smartphones continues to increase and environments with limited resources as wearables and IoTs spread, there are limitations to the processing speed of the anti-tamper solutions.In this paper, we propose a novel anti-tamper solution by using lightweight hash function LEA and LSH. We also present the test results of a simulation program that implements this method and compare the performance with anti-tamper solutions based on the previous cryptographic algorithms. [1] 일반적으로 위·변조 방지 기술은 암호 알고

show abstract

Optimization of PBKDF2-HMAC-SHA256 and PBKDF2-HMAC-LSH256 in CPU Environments

Choi

Seo

2020

Information Security Applications

View full text Add to dashboard Cite

LSH: A New Fast Secure Hash Function Family

Cited by 16 publications

References 33 publications

Cryptanalysis of the LSH hash functions

Cryptanalysis of the LSH hash functions

A Study on the Cryptography Algorithm Performance Comparison Used in Modulation and Forgery

Optimization of PBKDF2-HMAC-SHA256 and PBKDF2-HMAC-LSH256 in CPU Environments

Contact Info

Product

Resources

About