ANALYSIS OF POSSIBLE PRE-COMPUTATION AIDED DLP SOLVING ALGORITHMS
- Authors
- Hong, Jin; Lee, Hyeonmi
- Issue Date
- Jul-2015
- Publisher
- KOREAN MATHEMATICAL SOC
- Keywords
- discrete logarithm problem; pre-computation; distinguished point; time memory tradeoff
- Citation
- JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, v.52, no.4, pp.797 - 819
- Indexed
- SCIE
SCOPUS
KCI
- Journal Title
- JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY
- Volume
- 52
- Number
- 4
- Start Page
- 797
- End Page
- 819
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/143429
- DOI
- 10.4134/JKMS.2015.52.4.797
- ISSN
- 0304-9914
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 자연과학대학 > 서울 수학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/143429)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.