Improved Algorithm for Solving Discrete Logarithm Problem by Expanding Factor

• 作 者: Bin Qi Jie Ma Kewei Lv
• 机 构: StateKeyLaboratoryofInformationSecurity,DataAssuranceCommunicationSecurityResearchCenter,SchoolofCyb
• 出 处: 中国通信:英文版
• 发表日期: 2020年4期
• 关键词: discrete LOGARITHM ALGORITHM pollard’s KANGAROO ALGORITHM JUMPING DISTANCE
• 基金项目: partially supported by National Key R&D Program of China(no.2017YFB0802500),The 13th Five-Year National Cryptographic Development Foundation(no.MMJJ20180208),Beijing Science and Technology Commiss

The discrete logarithm problem(DLP)is to find a solution n such that g~n=h in a finite cyclic group G=,where h∈G.The DLP is the security foundation of many cryptosystems,such as RSA.We propose a method to improve Pollard’s kangaroo algorithm,which is the