Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 송정환 | - |
dc.date.accessioned | 2019-11-26T01:53:38Z | - |
dc.date.available | 2019-11-26T01:53:38Z | - |
dc.date.issued | 2017-06 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF INFORMATION SECURITY, v. 16, no. 3, page. 263-269 | en_US |
dc.identifier.issn | 1615-5262 | - |
dc.identifier.issn | 1615-5270 | - |
dc.identifier.uri | https://link.springer.com/article/10.1007%2Fs10207-016-0332-2 | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/114435 | - |
dc.description.abstract | 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. | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | SPRINGER | en_US |
dc.subject | Security evaluation | en_US |
dc.subject | SHA-1 | en_US |
dc.subject | Microsoft Office | en_US |
dc.subject | Exhaustive search | en_US |
dc.subject | Password cracking | en_US |
dc.title | A modified exhaustive search on a password system using SHA-1 | en_US |
dc.type | Article | en_US |
dc.relation.no | 3 | - |
dc.relation.volume | 16 | - |
dc.identifier.doi | 10.1007/s10207-016-0332-2 | - |
dc.relation.page | 263-269 | - |
dc.relation.journal | INTERNATIONAL JOURNAL OF INFORMATION SECURITY | - |
dc.contributor.googleauthor | Kim, Minchul | - |
dc.contributor.googleauthor | Jung, Younghoon | - |
dc.contributor.googleauthor | Song, Junghwan | - |
dc.relation.code | 2017007501 | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF NATURAL SCIENCES[S] | - |
dc.sector.department | DEPARTMENT OF MATHEMATICS | - |
dc.identifier.pid | camp123 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.