The search functionality is under construction.

The search functionality is under construction.

We introduce an efficient interpolation attack which gives the tighter upper bound of the complexity and the number of pairs of plaintexts and ciphertexts required for the attack. In the previously known interpolation attack there is a problem in that the required complexity for the attack can be overestimated. We solve this problem by first, finding the actual number of coefficients in the polynomial used in the attack by using a computer algebra system, and second, by finding the polynomial with fewer coefficients by choosing the plaintexts. We apply this interpolation attack to the block cipher SNAKE and succeeded in attacking many ciphers in the SNAKE family. When we evaluate the resistance of a block cipher to interpolation attack, it is necessary to apply the interpolation attack described in this paper.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E83-A No.1 pp.39-47

- Publication Date
- 2000/01/25

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)

- Category

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Shiho MORIAI, Takeshi SHIMOYAMA, Toshinobu KANEKO, "An Efficient Interpolation Attack" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 1, pp. 39-47, January 2000, doi: .

Abstract: We introduce an efficient interpolation attack which gives the tighter upper bound of the complexity and the number of pairs of plaintexts and ciphertexts required for the attack. In the previously known interpolation attack there is a problem in that the required complexity for the attack can be overestimated. We solve this problem by first, finding the actual number of coefficients in the polynomial used in the attack by using a computer algebra system, and second, by finding the polynomial with fewer coefficients by choosing the plaintexts. We apply this interpolation attack to the block cipher SNAKE and succeeded in attacking many ciphers in the SNAKE family. When we evaluate the resistance of a block cipher to interpolation attack, it is necessary to apply the interpolation attack described in this paper.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_1_39/_p

Copy

@ARTICLE{e83-a_1_39,

author={Shiho MORIAI, Takeshi SHIMOYAMA, Toshinobu KANEKO, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={An Efficient Interpolation Attack},

year={2000},

volume={E83-A},

number={1},

pages={39-47},

abstract={We introduce an efficient interpolation attack which gives the tighter upper bound of the complexity and the number of pairs of plaintexts and ciphertexts required for the attack. In the previously known interpolation attack there is a problem in that the required complexity for the attack can be overestimated. We solve this problem by first, finding the actual number of coefficients in the polynomial used in the attack by using a computer algebra system, and second, by finding the polynomial with fewer coefficients by choosing the plaintexts. We apply this interpolation attack to the block cipher SNAKE and succeeded in attacking many ciphers in the SNAKE family. When we evaluate the resistance of a block cipher to interpolation attack, it is necessary to apply the interpolation attack described in this paper.},

keywords={},

doi={},

ISSN={},

month={January},}

Copy

TY - JOUR

TI - An Efficient Interpolation Attack

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 39

EP - 47

AU - Shiho MORIAI

AU - Takeshi SHIMOYAMA

AU - Toshinobu KANEKO

PY - 2000

DO -

JO - IEICE TRANSACTIONS on Fundamentals

SN -

VL - E83-A

IS - 1

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - January 2000

AB - We introduce an efficient interpolation attack which gives the tighter upper bound of the complexity and the number of pairs of plaintexts and ciphertexts required for the attack. In the previously known interpolation attack there is a problem in that the required complexity for the attack can be overestimated. We solve this problem by first, finding the actual number of coefficients in the polynomial used in the attack by using a computer algebra system, and second, by finding the polynomial with fewer coefficients by choosing the plaintexts. We apply this interpolation attack to the block cipher SNAKE and succeeded in attacking many ciphers in the SNAKE family. When we evaluate the resistance of a block cipher to interpolation attack, it is necessary to apply the interpolation attack described in this paper.

ER -