Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이현미 | - |
dc.date.accessioned | 2017-01-16T05:59:54Z | - |
dc.date.available | 2017-01-16T05:59:54Z | - |
dc.date.issued | 2015-06 | - |
dc.identifier.citation | JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, v. 52, NO 4, Page. 797-819 | en_US |
dc.identifier.issn | 0304-9914 | - |
dc.identifier.issn | 2234-3008 | - |
dc.identifier.uri | http://koreascience.or.kr/article/ArticleFullRecord.jsp?cn=DBSHBB_2015_v52n4_797 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.11754/25177 | - |
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. | en_US |
dc.description.sponsorship | The first author was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, JOT & Future Planning (NRF-2012R1A1B4003379). The second author was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (NRF-2012R1A1A2008392). | en_US |
dc.language.iso | en | en_US |
dc.publisher | KOREAN MATHEMATICAL SOC | en_US |
dc.subject | discrete logarithm problem | en_US |
dc.subject | pre-computation | en_US |
dc.subject | distinguished point | en_US |
dc.subject | time memory tradeoff | en_US |
dc.title | ANALYSIS OF POSSIBLE PRE-COMPUTATION AIDED DLP SOLVING ALGORITHMS | en_US |
dc.type | Article | en_US |
dc.relation.no | 4 | - |
dc.relation.volume | 52 | - |
dc.identifier.doi | 10.4134/JKMS.2015.52.4.797 | - |
dc.relation.page | 797-819 | - |
dc.relation.journal | JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY | - |
dc.contributor.googleauthor | Hong, Jin | - |
dc.contributor.googleauthor | Lee, Hyeonmi | - |
dc.relation.code | 2015010039 | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF NATURAL SCIENCES[S] | - |
dc.sector.department | DEPARTMENT OF MATHEMATICS | - |
dc.identifier.pid | hyeonmi | - |
dc.identifier.researcherID | L-1680-2016 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.