Article ID Journal Published Year Pages File Type
10331268 Information Processing Letters 2005 5 Pages PDF
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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Partial known plaintext attack on Koyama scheme
Authors
,