JPS62281537A - Data protection system - Google Patents
Data protection systemInfo
- Publication number
- JPS62281537A JPS62281537A JP61123315A JP12331586A JPS62281537A JP S62281537 A JPS62281537 A JP S62281537A JP 61123315 A JP61123315 A JP 61123315A JP 12331586 A JP12331586 A JP 12331586A JP S62281537 A JPS62281537 A JP S62281537A
- Authority
- JP
- Japan
- Prior art keywords
- key
- block
- ciphering
- product
- section
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 230000002427 irreversible effect Effects 0.000 claims abstract description 4
- 238000000034 method Methods 0.000 claims description 7
- 238000006243 chemical reaction Methods 0.000 abstract description 5
- 230000000694 effects Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000003795 chemical substances by application Substances 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
Abstract
Description
【発明の詳細な説明】
3、発明の詳細な説明
〔産業上の利用分野〕
本発明は、伝送データ、ファイルデータ等、データの破
損、改憲等の防止に係り、特に銀行システム、VAN等
で重要課題となっている暗号技術に関する。[Detailed Description of the Invention] 3. Detailed Description of the Invention [Field of Industrial Application] The present invention relates to the prevention of data corruption, constitutional amendment, etc. of transmission data, file data, etc., and is particularly applicable to banking systems, VANs, etc. Concerning cryptographic technology, which has become an important issue.
従来の暗号方式は、擬似乱数を和算する方式(米国特許
3,535,642号、3,681,708号、3,6
91,472号、3,816,764号、3,838,
259号、 3,911,216号)と米国商務省によ
る米国標準暗号方式(米国特許3.796,830号)
等が挙げられる。Conventional encryption methods include a method of summing pseudorandom numbers (U.S. Pat. Nos. 3,535,642, 3,681,708, 3,6
No. 91,472, No. 3,816,764, No. 3,838,
259, 3,911,216) and the U.S. Standard Encryption System by the U.S. Department of Commerce (U.S. Patent No. 3,796,830).
etc.
これらは、端末=端末を同一の鍵で使用する前提で作ら
れている。このため、複雑な通信網での使用には、解説
される危険がある。これを改良したものが日本特許願出
特願昭59−272909である。These are created on the premise that terminals are used with the same key. Therefore, there is a risk of being exposed when used in complex communication networks. An improved version of this is Japanese Patent Application No. 59-272909.
この方式で、暗号強度を低下させないで暗号処理を行う
には、電文毎に鍵を変えたnrt号処理が望ましい。従
って、上記方式は鍵変更が煩雑である。In order to perform cryptographic processing without reducing the cryptographic strength using this method, it is desirable to perform NRT cryptographic processing in which the key is changed for each message. Therefore, in the above method, changing the key is complicated.
本発明の目的は、ブロック暗号方式において、暗号化鍵
の使用を簡便にする自動鍵暗号方式を提供することにあ
る。An object of the present invention is to provide an automatic key cryptosystem that facilitates the use of encryption keys in a block cryptosystem.
上記目的を達成するために、本発明は、非可逆機能を組
合せて構成したもので、複雑の非−(TI逆種機能積暗
号回路と復号回路により平文を鍵に変換する積アルゴリ
ズム暗号方式である。In order to achieve the above object, the present invention is configured by combining irreversible functions, and is a product algorithm cryptosystem that converts plaintext into a key using a complex non-(TI inverse kind function product cryptographic circuit and a decryption circuit). be.
以下、本発明の一実施例を説明する。 An embodiment of the present invention will be described below.
積暗号アルゴリズムは、平文M、暗文C,鍵にとしたと
き
(、=MXk (mad S)
(1)である。ここにSは素数又は多項式である
。The product encryption algorithm is given as plaintext M, cryptogram C, and key (, = MXk (mad S)
(1). Here, S is a prime number or a polynomial.
第1図を例に説明する。This will be explained using FIG. 1 as an example.
本発明における基本的暗号化アルゴリズムは、C2=M
IXF(Mz、kz)(mods) (2)C1=
M!十F(Mz、 kz) (mad S) (3
)復号化アルゴリズムは、
N2:CIX F ((、z、 kz) (mad
S)=M2÷F (C2,kz) XF (C2,kz
)=Mx (mod S) (4)
N1=C2÷F (Nz、 ki) (mod S)
=MxXF (Mz、kt)÷F(N2.に工)=Ms
(mad S) (5)ここで、
F(a、b)XG(a、b)==1(mos s)
(6)なるG (a、b)を導入すると、暗号化ア
ルゴリズム(2)、(3)は
Cz=MtXF (Mz、kt)(mod S) (
7)C1=M2XG (C2,kz)(mod S)
(8)復号(4)、(5)は
Nl=C2XG (C2,kz) (mod S
) (9)Nl=C2XG (N2.kt) (
IIlod 5)(10)となる。The basic encryption algorithm in this invention is C2=M
IXF (Mz, kz) (mods) (2) C1=
M! 10F (Mz, kz) (mad S) (3
) decoding algorithm is N2: CIX F ((, z, kz) (mad
S)=M2÷F (C2, kz) XF (C2, kz
)=Mx (mod S) (4)
N1=C2÷F (Nz, ki) (mod S)
= MxXF (Mz, kt) ÷ F (N2. work) = Ms
(mad S) (5) Here, F(a, b)XG(a, b)==1(mos s)
(6) When introducing G (a, b), the encryption algorithms (2) and (3) become Cz=MtXF (Mz, kt) (mod S) (
7) C1=M2XG (C2, kz) (mod S)
(8) Decoding (4) and (5) is Nl=C2XG (C2, kz) (mod S
) (9) Nl=C2XG (N2.kt) (
IIlod 5) (10).
ここで、5ビット信号を処理するどきGF(21″)の
生成多項式Sに
S=Xδ+x′L+、1
を選んでいて、F (a、b)が
F (a、b)=x’+x+1
となったとすれば
5−xx+F (a、b) ・G (a、b)=1の
関係より
:x1=G (a、b)
とおいて。Here, when processing a 5-bit signal, S = Xδ + x'L +, 1 is selected as the generating polynomial S of GF (21''), and F (a, b) becomes F (a, b) = x' + x + 1. Then, from the relationship 5-xx+F (a, b) ・G (a, b) = 1, set: x1 = G (a, b).
(x6+x”+1)XZ+(X’+x+l)X+=1(
X4十X+1)(XX2+X1)+(X+ L)X2=
= L(x + 1 )((x’+ x”+ x)Xa
+ X2)+ Xs= 、1にて、
X s= x X 2+ XI = 1(x + 1)
((X”+ x”+ x)XaXz)= 0Xz=xδ
+xz+x
X L = G (a 、 b ) = x番十x
8+ x2+ 1G(a、b)=x’+x”+x”+1
が、求まる。(x6+x”+1)XZ+(X'+x+l)X+=1(
X40X+1) (XX2+X1)+(X+L)X2=
= L(x + 1) ((x'+ x"+ x)Xa
+ X2) + Xs= , at 1, X s= x
((X”+ x”+ x)XaXz)= 0Xz=xδ
+xz+x X L = G (a, b) = x number ten x
8+ x2+ 1G(a, b)=x'+x''+x''+1 is found.
さらに、長ビット(n)ブロックを処理しようとすれば
、高次GF(2′″)による処理が必要となるが、これ
には、サブブロックに分割して処理すれば良い。Furthermore, if a long bit (n) block is to be processed, processing using a higher-order GF (2''') is required, but this can be done by dividing the block into sub-blocks.
なお、非線形(非可逆)関数F (a、b)は。Note that the nonlinear (irreversible) function F (a, b) is.
F (a、b)=C
の逆関数F−1(α)=a′、b′、・・・の解が唯一
に定まらないものであればよい。It suffices if the solution to the inverse function F-1(α)=a', b', . . . of F (a, b)=C is not uniquely determined.
、F記に従って、暗号、復号の一例を示す。電文を符号
化してM ” M 1 + M xとし、M+=x’+
x+ 1 、Mz=x’+11!kt、kzを
に1=x’+x2.kz=x’+x
OF(2’)を生成する多項式Sを
S =x’十x”+ 1
非線形関数F (a、b)を
F (a 、 b) = [(a b(mid x’)
)/ x”]二二に、[y / z ]は、y/zの商
を示し、剰余は切り捨てる単純なものとする。, an example of encryption and decryption is shown below. Encode the message as M '' M 1 + M x, M+=x'+
x+ 1, Mz=x'+11! kt, kz to 1=x'+x2. kz=x'+x OF(2') The polynomial S that generates S =x'10x"+1 The nonlinear function F (a, b)
)/x'']22, [y/z] indicates the quotient of y/z, and the remainder is simply rounded down.
暗号化は、まず。First of all, encryption.
F(Mz、kz)=[(x’+1)(x’+x2)(m
ad x ’)/ x 2]
=X番十x2+1
Cz=(xδ+x+ 1)(x’+x2+1)(mad
5)=x+1
F(C2,Lcz)=[(x+1)(x”+x)(no
d x ’)/ x 2]
=x2+x+1
ユークリッドに定理により、
G(Cz、Kz)=x3+xz
Ct=(x’+1)(x3+x2)(mod 5)=x
’+x
同様に、復号化は、
F(Cz、kz):=x2+x+1
Nz=(x’+x)(x”+x+ 1)(mad 5)
=X番+にM2
F(N21 kt)= x’+ x”+1G(Nz、
kl)=x’+x8+x
Nt=(x+ 1)(x’+ x3+ x)(mod
S)= x ’ + x + L = M tで復号
できた。F(Mz,kz)=[(x'+1)(x'+x2)(m
ad x ') / x 2] = X number ten x2+1 Cz = (xδ+x+ 1) (x'+x2+1) (mad
5)=x+1 F(C2,Lcz)=[(x+1)(x”+x)(no
d x ') / x 2] = x2 + x + 1 According to Euclid's theorem, G (Cz, Kz) = x3 + xz Ct = (x' + 1) (x3 + x2) (mod 5) = x
'+x Similarly, the decoding is F(Cz, kz):=x2+x+1 Nz=(x'+x)(x''+x+ 1)(mad 5)
= M2 F (N21 kt) = x'+ x''+1G (Nz,
kl)=x'+x8+x Nt=(x+1)(x'+x3+x)(mod
S) = x' + x + L = M t.
以下、第1図、第2図により本発明の詳細な説明する。The present invention will be explained in detail below with reference to FIGS. 1 and 2.
暗号化は、第1図において、伝送文Mを2つに分けて、
ブロック入力部11.12にM t 。In Figure 1, the encryption is performed by dividing the transmission message M into two parts,
M t in block input 11.12.
N2として入力する。ブロックM2は非線形関数作成部
13にI!I!k t と共に入力し、 F(N2.1
(1)を作る。このF (Mx、 kz)を鍵に、ブロ
ックM1を積暗号処理部15で積暗号処理を行う、結果
C2とブロックM2は、中間バッファ16に一時いれて
おく。Input as N2. Block M2 sends I! to the nonlinear function creation unit 13. I! F(N2.1
Make (1). Using this F (Mx, kz) as a key, the product encryption processing unit 15 performs product encryption processing on the block M1, and the result C2 and block M2 are temporarily stored in the intermediate buffer 16.
次に中間バッファ内のC2と11!k zを共に非線形
関数作成部13に入力し、F (C2,kz)を作る。Next, C2 and 11 in the intermediate buffer! Both k and z are input to the nonlinear function creation unit 13 to create F (C2, kz).
17では、まず、F−+G変換を行い、続いてG(Cz
、 kz)を鍵にしてMzの積暗号処理を行う。17, first perform F−+G conversion, then G(Cz
, kz) is used as a key to perform Mz product encryption processing.
結果は、Clブロック出力部18とC2ブロック出力部
19に、出力される。The results are output to the Cl block output section 18 and the C2 block output section 19.
同様に、復号は、第2図で示され、暗号文Cを2つに分
けて、ブロック入力部21.22にCL。Similarly, decryption is shown in FIG. 2, where the ciphertext C is divided into two parts and the CL is sent to the block inputs 21 and 22.
C2として入力する。ブロックC2は非線形関数作成部
23にta k 2と共に入力し−F (C211cz
)を作る。このFCCx、kz)を鍵に、ブロックc1
を積暗号処理部15で積復号処理を行う。結果N2とブ
ロックC2は、中間バッファ26に一時いれておく。Enter as C2. Block C2 is input to the nonlinear function creation unit 23 together with ta k 2, and −F (C211cz
)make. Using this FCCx, kz) as a key, block c1
The product encryption processing unit 15 performs product decryption processing. The result N2 and block C2 are temporarily stored in the intermediate buffer 26.
次に、中間バッファ内のN2と鍵に1を共に非線形関数
作成部23に入力し、 F’ (N211ct)を作る
。Next, N2 in the intermediate buffer and 1 as the key are both input to the nonlinear function creation unit 23 to create F' (N211ct).
17では、まずF→G変換を行い、続いてG(N2.
kt)を鍵にしてC2の積復号処理を行う。17, first performs F→G conversion, then converts G(N2.
Kt) is used as a key to perform product decryption processing of C2.
結果は、M1ブロック出力部28とN2ブロック出力部
29に、復号されて出力する。The results are decoded and output to the M1 block output section 28 and the N2 block output section 29.
〔発明の効果〕
本発明によれば、暗号化および、復号化において、伝送
文をそのまま鍵にする効果があり、このために、暗号シ
ステムにおけるMW理を容易にする効果がある。[Effects of the Invention] According to the present invention, there is an effect that a transmitted text is used as a key in encryption and decryption, and therefore, there is an effect that MW management in a cryptographic system is facilitated.
本実施例の復号機構構成図。FIG. 3 is a configuration diagram of a decoding mechanism according to the present embodiment.
11・・・M1ブロック入力部、12・・−N2ブロッ
ク入力部、13・・・非線形関数F (a、b)作成部
、14・・・鍵、15・・・積暗号処理部、16・・中
間バッファ部、17・・・F−+G変換と積暗号処理部
、]8・・C1ブロック出力部、]9・・・C2ブロッ
ク出力部、21・・・Cニブロック入力部、22・・・
C2ブロック入力部、23・・・非線形関数F (a、
b)作成部、24・・鍵、25・・・積暗号処理部、2
6・・中間バッファ部、27・・・FIG変換と積暗号
処理部、28・Mlブロック出力部、29・・・MZブ
ロック代理人 弁理士 小ノ11勝男(
′@ l 口
暗号イし
慕 2 口
麦−!IAしDESCRIPTION OF SYMBOLS 11... M1 block input part, 12... -N2 block input part, 13... Nonlinear function F (a, b) creation part, 14... Key, 15... Product encryption processing part, 16... - Intermediate buffer unit, 17...F-+G conversion and product encryption processing unit, ]8... C1 block output unit, ]9... C2 block output unit, 21... C ni block input unit, 22...・・・
C2 block input part, 23... nonlinear function F (a,
b) Creation unit, 24...key, 25...product encryption processing unit, 2
6...Intermediate buffer section, 27...FIG conversion and product cipher processing section, 28.Ml block output section, 29...MZ block agent Patent attorney Katsuo Ono 11 ('@l Oral code Ishibo 2 Mugi-!IAshi
Claims (1)
て、平文を暗号鍵に変換するとき、非可逆機能と積アル
ゴリズムにより暗号処理を行うことを特徴とするデータ
保護方式。1. A data protection method characterized by performing cryptographic processing using an irreversible function and a product algorithm when converting plaintext into an encryption key in a fixed processing unit encryption method (block encryption method).
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP61123315A JPS62281537A (en) | 1986-05-30 | 1986-05-30 | Data protection system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP61123315A JPS62281537A (en) | 1986-05-30 | 1986-05-30 | Data protection system |
Publications (1)
Publication Number | Publication Date |
---|---|
JPS62281537A true JPS62281537A (en) | 1987-12-07 |
Family
ID=14857510
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP61123315A Pending JPS62281537A (en) | 1986-05-30 | 1986-05-30 | Data protection system |
Country Status (1)
Country | Link |
---|---|
JP (1) | JPS62281537A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5703952A (en) * | 1992-12-30 | 1997-12-30 | Telstra Corporation Limited | Method and apparatus for generating a cipher stream |
-
1986
- 1986-05-30 JP JP61123315A patent/JPS62281537A/en active Pending
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5703952A (en) * | 1992-12-30 | 1997-12-30 | Telstra Corporation Limited | Method and apparatus for generating a cipher stream |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4127472B2 (en) | Data conversion apparatus, data conversion method and program for data conversion apparatus, and computer-readable recording medium | |
JP2006141032A (en) | Method, device and system for generating anonymous public keys in secure communication system | |
US7894608B2 (en) | Secure approach to send data from one system to another | |
JP3180836B2 (en) | Cryptographic communication device | |
JPH01261689A (en) | System for keeping secrecy of data | |
US6128386A (en) | Multiple number base encoder/decoder using a corresponding exclusive or function | |
JPS62281537A (en) | Data protection system | |
US5068895A (en) | Encryption and decryption methods using bit-length preservation decryptor | |
JPH04335730A (en) | Random ciphering communication system | |
JPH10153954A (en) | Ciphering device | |
JPH09269727A (en) | Ciphering method and ciphering device | |
JP2002252610A (en) | Encryption device and decryption device, and public key encryption system and public key decryption system | |
KR100262384B1 (en) | Encryption method and apparatus | |
JPH1152850A (en) | Device and method for cipher conversion | |
JP3238670B2 (en) | Hash function method | |
JPS6259437A (en) | Ciphering system | |
JPH0591101A (en) | Ciphering device and decoding device | |
JP2870532B2 (en) | Cryptographic converter | |
RU2127024C1 (en) | Encrypting unit | |
JPH10153955A (en) | Ciphering device | |
JPS63308432A (en) | Sequence generating method | |
TW484296B (en) | Checksum device used in cryptography | |
JPH10153953A (en) | Ciphering device | |
JPH0465939A (en) | Cryptographic device | |
JPS5972840A (en) | Coding device for key distribution |