TY - JOUR AU - 이현미 DA - 2015/06 PY - 2015 UR - http://koreascience.or.kr/article/ArticleFullRecord.jsp?cn=DBSHBB_2015_v52n4_797 UR - http://hdl.handle.net/20.500.11754/25177 AB - 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. PB - KOREAN MATHEMATICAL SOC KW - discrete logarithm problem KW - pre-computation KW - distinguished point KW - time memory tradeoff TI - ANALYSIS OF POSSIBLE PRE-COMPUTATION AIDED DLP SOLVING ALGORITHMS IS - 4 VL - 52 DO - 10.4134/JKMS.2015.52.4.797 T2 - JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY ER -