Title:
オイラー方陣の作成装置
Document Type and Number:
Japanese Patent JP3573671
Kind Code:
B2
Abstract:
PROBLEM TO BE SOLVED: To solve the problem that it is difficult to create an Euler square by a conventional creating method, and the method is not only troublesome but limits the creatable number of Euler squares, and as a result, it is impossible to enhance utility value and effect of an Euler square. SOLUTION: The number of order (n) of an Euler square, selection sequence of a mark m, a position where the mark m among n-rows and n-columns is firstly arranged, a sequence for arranging the mark m along the direction of row or column of the n-rows and n-columns, and a 1st value of the mark m are set, respectively (steps S1-S3). Next, the 1st value of the mark m is set at the next position to the 1st arrangement position of the mark m, and thereafter, the position of the mark m is changed in the selection order one after another until the same mark is lost at an earlier position, and when the same mark is lost at the previous position and a mark m not including a mark of the same value m1 or m2 at the positions of the same row and column so far, the 1st value of the mark m is further set at the following position, and then, the similar processing are performed (steps S4-S12).
Inventors:
Toru Ito
Application Number:
JP35403899A
Publication Date:
October 06, 2004
Filing Date:
December 14, 1999
Export Citation:
Assignee:
Netcom Sec Co., Ltd.
International Classes:
G09C1/00; G06F17/10; H04L9/22; (IPC1-7): G09C1/00; G06F17/10; H04L9/22
Domestic Patent References:
| JP10105544A |
Other References:
加藤正隆,“基礎暗号学 単一形式換字暗号 その6 破壊防止(2)”,数理科学,日本,株式会社サイエンス社,1979年12月 1日,No.198,p.70-77
山本幸一,“ラテン方陣の種々相”,数理科学,日本,株式会社サイエンス社,1979年 6月 1日,No.192,p.62-66
山本幸一,“ラテン方陣の種々相”,数理科学,日本,株式会社サイエンス社,1979年 6月 1日,No.192,p.62-66
Attorney, Agent or Firm:
Kaneyuki Matsuura