425 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author송정환-
dc.date.accessioned2019-11-26T01:53:38Z-
dc.date.available2019-11-26T01:53:38Z-
dc.date.issued2017-06-
dc.identifier.citationINTERNATIONAL JOURNAL OF INFORMATION SECURITY, v. 16, no. 3, page. 263-269en_US
dc.identifier.issn1615-5262-
dc.identifier.issn1615-5270-
dc.identifier.urihttps://link.springer.com/article/10.1007%2Fs10207-016-0332-2-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/114435-
dc.description.abstractIn 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.isoen_USen_US
dc.publisherSPRINGERen_US
dc.subjectSecurity evaluationen_US
dc.subjectSHA-1en_US
dc.subjectMicrosoft Officeen_US
dc.subjectExhaustive searchen_US
dc.subjectPassword crackingen_US
dc.titleA modified exhaustive search on a password system using SHA-1en_US
dc.typeArticleen_US
dc.relation.no3-
dc.relation.volume16-
dc.identifier.doi10.1007/s10207-016-0332-2-
dc.relation.page263-269-
dc.relation.journalINTERNATIONAL JOURNAL OF INFORMATION SECURITY-
dc.contributor.googleauthorKim, Minchul-
dc.contributor.googleauthorJung, Younghoon-
dc.contributor.googleauthorSong, Junghwan-
dc.relation.code2017007501-
dc.sector.campusS-
dc.sector.daehakCOLLEGE OF NATURAL SCIENCES[S]-
dc.sector.departmentDEPARTMENT OF MATHEMATICS-
dc.identifier.pidcamp123-
Appears in Collections:
COLLEGE OF NATURAL SCIENCES[S](자연과학대학) > MATHEMATICS(수학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE