A modified exhaustive search on a password system using SHA-1

Kim, Minchul; Jung, Younghoon; Song, Junghwan

doi:10.1007/s10207-016-0332-2

상세 보기

A modified exhaustive search on a password system using SHA-1

Kim, Minchul;
Jung, Younghoon;
Song, Junghwan

Citations

WEB OF SCIENCE

1

Citations

SCOPUS

2

초록

In this paper, we show a method of exhaustive search on a password system that uses SHA-1 iteratively. Our method uses both the technique shown in Steube [16] and a technique for computing repetitions of SHA-1. Combining these two techniques reduces the total number of operations. We also show how to apply our method to MS Office (Microsoft Office) 2007/2010.

키워드

Security evaluation; SHA-1; Microsoft Office; Exhaustive search; Password cracking

제목: A modified exhaustive search on a password system using SHA-1

저자: Kim, Minchul; Jung, Younghoon; Song, Junghwan

DOI: 10.1007/s10207-016-0332-2

발행일: 2017-06

유형: Article

저널명: International Journal of Information Security

권: 16

호: 3

페이지: 263 ~ 269