4

Camellia Design and Analysis document refers to a paper:

[24] M. Matsui, "Differential Path Search of the Block Cipher E2," (in Japanese), Technical report of IE- ICE, ISEC99-19, pp.57-64, The Institute of Electronics, Information and Communication Engineers, 1999

Does someone know the algorithm presented in the above paper, as I couldn't find the paper. It will be great if someone can link to the paper or the portion containing algorithm contents.

Patriot
  • 3,087
  • 3
  • 16
  • 63
crypt
  • 2,291
  • 15
  • 31
  • @Biv I think the question asks us to find the paper or its content actually. – SEJPM Mar 13 '17 at 16:22
  • It's paywalled, but I think this is the right one: http://ci.nii.ac.jp/naid/110003297502/en – pg1989 Mar 15 '17 at 23:18
  • Matsui and his collaborator wrote another paper on E2 in 1999, "Cryptanalysis of a Reduced Version of the Block Cipher E2" (available in proceedings of FSE) which may contain some of the same techniques. You can also try emailing Matsui and seeing if a non-Japanese version of the tech report is available. – pg1989 Mar 15 '17 at 23:22
  • @pg1989 actually it is in Japanese! I will look in the paper you mentioned, and update the question – crypt Mar 16 '17 at 05:24
  • Section 3.1 of [Shirai, Kanamaru, and Abe](https://doi.org/10.1007/3-540-45661-9_10) is not the original source, but it's a more or less clear description of the method applied to Camellia. Note that today this kind of task would be done with a MILP solver much more easily and conveniently. – Samuel Neves Apr 03 '18 at 02:23
  • @SamuelNeves how MILP can be helpful for Fiestel Cipers, how to map the Xor of F function output and right half? – crypt Apr 04 '18 at 06:37
  • @SamuelNeves, MILP (Mixed Integer Linear Program)? – kodlu Sep 01 '18 at 14:04
  • @kodlu yes MILP is Mixed Integer Linear Programming – crypt Sep 02 '18 at 07:23

0 Answers0