Partial known plaintext attack on Koyama scheme

  • Authors:
  • Sahadeo Padhye

  • Affiliations:
  • School of Studies in Mathematics, Pt. Ravishankar Shukla University, Raipur (C.G.), India

  • Venue:
  • Information Processing Letters
  • Year:
  • 2005

Quantified Score

Hi-index 0.89

Visualization

Abstract

This paper analyzes the conjecture made by Koyama regarding partial known plaintext attack on Koyama scheme. According to him, such attack is not possible even if one ordinate of the plaintext pair is known. We have shown that partial known plaintext attack is possible in such case.