본문 바로가기
  • Home

Modified Baby-Step Giant-Step Algorithm for Discrete Logarithm

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2013, 18(8), pp.87-93
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

A baby-step giant-step algorithm divides  by blocks that possess ⌈ ⌉ elements,and subsequently computes and stores modfor elements in the 1st block. It then calculates mod for  blocks and identifies each of them with those in the 1st block of an identical elemental value. This paper firstly proposes a modified baby-step giant-step algorithm that divides⌈ ⌉blocks with elements applying ≡ mod and mod ≡ mod principles. This results in a 50% decrease in the process of the giant-step. It then suggests a reverse baby-step giant step algorithm that performs and saves⌈ ⌉blocks firstly and computesmod for elements. The proposed algorithm is found to successfully halve the memory and search time of the baby-step giant step algorithm

Citation status

* References for papers published after 2022 are currently being built.