463 0

ANALYSIS OF POSSIBLE PRE-COMPUTATION AIDED DLP SOLVING ALGORITHMS

Title
ANALYSIS OF POSSIBLE PRE-COMPUTATION AIDED DLP SOLVING ALGORITHMS
Author
이현미
Keywords
discrete logarithm problem; pre-computation; distinguished point; time memory tradeoff
Issue Date
2015-06
Publisher
KOREAN MATHEMATICAL SOC
Citation
JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, v. 52, NO 4, Page. 797-819
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.
URI
http://koreascience.or.kr/article/ArticleFullRecord.jsp?cn=DBSHBB_2015_v52n4_797http://hdl.handle.net/20.500.11754/25177
ISSN
0304-9914; 2234-3008
DOI
10.4134/JKMS.2015.52.4.797
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