ANALYSIS OF POSSIBLE PRE-COMPUTATION AIDED DLP SOLVING ALGORITHMS
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hong, Jin | - |
dc.contributor.author | Lee, Hyeonmi | - |
dc.date.accessioned | 2022-07-07T05:37:55Z | - |
dc.date.available | 2022-07-07T05:37:55Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2015-07 | - |
dc.identifier.issn | 0304-9914 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/143429 | - |
dc.description.abstract | A trapdoor discrete logarithm group is a cryptographic primitive with many applications, and an algorithm that allows discrete logarithm problems to be solved faster using a pre-computed table increases the practicality of using this primitive. Currently, the distinguished point method and one extension to this algorithm are the only pre-computation aided discrete logarithm problem solving algorithms appearing in the related literature. This work investigates the possibility of adopting other pre-computation matrix structures that were originally designed for used with cryptanalytic time memory tradeoff algorithms to work as pre-computation aided discrete logarithm problem solving algorithms. We find that the classical Hellman matrix structure leads to an algorithm that has performance advantages over the two existing algorithms. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | KOREAN MATHEMATICAL SOC | - |
dc.title | ANALYSIS OF POSSIBLE PRE-COMPUTATION AIDED DLP SOLVING ALGORITHMS | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Hyeonmi | - |
dc.identifier.doi | 10.4134/JKMS.2015.52.4.797 | - |
dc.identifier.scopusid | 2-s2.0-84933529971 | - |
dc.identifier.wosid | 000357757800008 | - |
dc.identifier.bibliographicCitation | JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, v.52, no.4, pp.797 - 819 | - |
dc.relation.isPartOf | JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY | - |
dc.citation.title | JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY | - |
dc.citation.volume | 52 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 797 | - |
dc.citation.endPage | 819 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.identifier.kciid | ART002005236 | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.description.journalRegisteredClass | kci | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.subject.keywordAuthor | discrete logarithm problem | - |
dc.subject.keywordAuthor | pre-computation | - |
dc.subject.keywordAuthor | distinguished point | - |
dc.subject.keywordAuthor | time memory tradeoff | - |
dc.identifier.url | http://koreascience.or.kr/article/JAKO201520448049072.page | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.