JPH10214026A - Electronic signature method - Google Patents

Electronic signature method

Info

Publication number
JPH10214026A
JPH10214026A JP9016273A JP1627397A JPH10214026A JP H10214026 A JPH10214026 A JP H10214026A JP 9016273 A JP9016273 A JP 9016273A JP 1627397 A JP1627397 A JP 1627397A JP H10214026 A JPH10214026 A JP H10214026A
Authority
JP
Japan
Prior art keywords
information
signature
logical operation
random number
initial
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
Application number
JP9016273A
Other languages
Japanese (ja)
Inventor
Toshihiko Yamagami
俊彦 山上
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nippon Telegraph and Telephone Corp
Original Assignee
Nippon Telegraph and Telephone Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nippon Telegraph and Telephone Corp filed Critical Nippon Telegraph and Telephone Corp
Priority to JP9016273A priority Critical patent/JPH10214026A/en
Publication of JPH10214026A publication Critical patent/JPH10214026A/en
Pending legal-status Critical Current

Links

Abstract

PROBLEM TO BE SOLVED: To flexibly control the complicatedness of a signature. SOLUTION: Signature object information is sectioned by 128 bits and exclusively ORed (XOR) to obtain 120-bit modified information X (S2), and logical operations f(X,Y)=(=X+T), g(X,Y)(=X XOR Y) including X and secret information Y on this signer as variables are found to generate pieces of initial information f(X,Y) and g(X,Y) (S4). Then g(X,Y) is stored in a work area and the other f(X,Y) is sectioned by 4 bit in order and decoded into decimal numbers to generate operation sequences... (S6). Then logical operations corresponding to respective numerals of the operation sequences are performed for f(X,Y) on the basis of a predetermined numeral and logical operations (left shift, right shift, OR between high-order and low-order halves,...) to generate (S8, S9) signature information, and the sum of this information and signature object information is sent out (S10).

Description

【発明の詳細な説明】DETAILED DESCRIPTION OF THE INVENTION

【0001】[0001]

【発明の属する技術分野】この発明は署名対象情報に対
し、署名者が電子的に署名する方法に関する。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for a signer to digitally sign information to be signed.

【0002】[0002]

【従来の技術】図3を参照して従来の電子署名方法を説
明する。署名者の秘密情報を秘密情報記憶部11に予め
記憶しておき、署名を行う際には、制御部12は郵便の
内容などの署名対象情報記憶部13から署名対象情報を
読み出し、変形署名対象情報生成部14へ供給する変形
署名対象情報生成部14は署名をするための情報(変形
署名対象情報)、例えば署名対象情報の全体から生成さ
れる128ビット情報を生成する。この生成には例えば
署名対象情報を128ビット毎に区切ってそれらの排他
的論理和をとるなどの方法をとり、変形署名対象情報を
得る。このようにすれば、どの1ビットが変化しても生
成後の変形署名対象情報が変化するような方法が実現で
きる。
2. Description of the Related Art A conventional digital signature method will be described with reference to FIG. The signer's secret information is stored in the secret information storage unit 11 in advance, and when performing the signature, the control unit 12 reads out the signature target information from the signature target information storage unit 13 such as the contents of mail, The modified signature target information generation unit 14 to be supplied to the information generation unit 14 generates information for signature (modified signature target information), for example, 128-bit information generated from the entire signature target information. For this generation, for example, modified signature target information is obtained by dividing the signature target information in units of 128 bits and taking an exclusive OR of them. In this way, it is possible to realize a method in which the modified signature target information after generation changes even if any one bit changes.

【0003】この変形署名対象情報を署名部15へ送
る。署名部15は秘密情報記憶部12に記憶された秘密
情報を読み出し、この秘密情報と変形署名対象情報とに
より署名情報を生成する。この生成は予め定められた暗
号アルゴリズムによって、変形署名対象情報を秘密情報
を鍵として暗号化して実現される。その署名情報と署名
対象情報は通信処理部16よりネットワーク17を介し
て送信される。受信者は、署名者の秘密情報を知ってい
るもののみ、その署名の正当性を検証することができ
る。
[0003] The modified signature target information is sent to the signature unit 15. The signature unit 15 reads the secret information stored in the secret information storage unit 12, and generates signature information based on the secret information and the modified signature target information. This generation is realized by encrypting the modified signature target information by using a secret information as a key by a predetermined encryption algorithm. The signature information and the signature target information are transmitted from the communication processing unit 16 via the network 17. Only the recipient who knows the signer's secret information can verify the validity of the signature.

【0004】[0004]

【発明が解決しようとする課題】従来の電子署名方法
は、暗号化方法を利用し、処理が複雑であって、簡単な
署名、高度な署名などとその複雑さを変更することがで
きず、また最初に設計された情報の長さに制約され、他
の情報の長さのものを処理することができない。また暗
号化などの方法を援用しているためネットワーク上で論
理演算操作を転送して実現するようなネットワークプロ
グラミング言語では遅いという欠点もあった。
The conventional digital signature method uses an encryption method, and the processing is complicated, and the complexity cannot be changed to a simple signature or an advanced signature. In addition, the length of the originally designed information is restricted, and it is impossible to process other information having a length. Also, since a method such as encryption is used, there is a disadvantage that a network programming language that transfers and implements a logical operation operation over a network is slow.

【0005】[0005]

【課題を解決するための手段】請求項1の発明によれば
署名対象情報と秘密情報(署名者の)を互いに処理し
て、異なった複数初期情報を生成し、その初期情報の1
つを所定ビット数の区分に分割し、その各区分を、その
内容に応じた論理演算操作に変換して操作列を得、その
操作列の各操作を、複数の初期情報の残りに順次施して
署名情報を得る。
According to the first aspect of the present invention, the information to be signed and the secret information (of the signer) are mutually processed to generate a plurality of different pieces of initial information.
Is divided into sections of a predetermined number of bits, and each section is converted into a logical operation operation according to the content thereof to obtain an operation sequence, and each operation of the operation sequence is sequentially performed on the rest of the plurality of initial information. To obtain signature information.

【0006】請求項2の発明によれば署名対象情報と秘
密情報を互いに処理して少くとも1つの初期情報を生成
し、その初期情報と署名対象情報及び秘密情報の少くと
も一方とから予め決めた1つを選択して所定ビット数の
区分に分割し、その各区分をその内容に応じた論理演算
操作に変換して操作列を得、この変換した各論理演算操
作を、上記選択の残りに順次施して署名情報を得る。
According to the second aspect of the present invention, the information to be signed and the secret information are mutually processed to generate at least one piece of initial information, and the predetermined information is determined in advance from the initial information and at least one of the information to be signed and the secret information. The selected one is divided into sections of a predetermined number of bits, and each section is converted into a logical operation operation according to the content thereof to obtain an operation sequence. In order to obtain signature information.

【0007】請求項4の発明によれば、署名対象情報及
び秘密情報の一方を所定ビット数の区分に分割し、その
各区分を、その内容に応じた論理演算操作に変換して操
作列を得、その変換した各論理演算操作を、署名対象情
報及び秘密情報の他方に順次施して署名情報を得る。ま
た疑似乱数を生成し、その疑似乱数を初期情報の生成に
含め、あるいは論理演算操作に疑似乱数を含め、乱数を
署名情報に付加する。
According to the fourth aspect of the present invention, one of the signature target information and the secret information is divided into sections of a predetermined number of bits, and each section is converted into a logical operation operation according to the content to form an operation sequence. Then, the converted logical operation operations are sequentially performed on the other of the signature target information and the secret information to obtain signature information. Further, a pseudo random number is generated, and the pseudo random number is included in the generation of the initial information, or the pseudo random number is included in the logical operation operation, and the random number is added to the signature information.

【0008】[0008]

【発明の実施の形態】請求項1の発明の実施例を適用し
た電子署名装置の機能構成を図1A〜図3と対応する部
分に同一符号を付けて示す。この実施例では秘密情報記
憶部11内の秘密情報と、変形署名対象情報とを互いに
処理して複数の互いに異なる初期情報が初期情報生成部
21で生成され、それら初期情報に作業情報記憶部22
に記憶され、その1つの初期情報が所定ビット数の区分
に分割され、その分割された各区分が予め決めたもの、
例えば10進数に情報復号部23で復号され、その復号
された内容に応じて、情報操作部24により、操作記憶
部25内に記憶されている論理演算操作が順次読み出さ
れて論理演算操作の列が作られる。
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The functional configuration of an electronic signature apparatus to which the embodiment of the first aspect of the present invention is applied is shown by attaching the same reference numerals to parts corresponding to those in FIGS. In this embodiment, the secret information in the secret information storage unit 11 and the deformed signature target information are processed with each other to generate a plurality of different initial information in the initial information generation unit 21, and the initial information is stored in the work information storage unit 22.
Is stored, and the one piece of initial information is divided into sections of a predetermined number of bits, and each of the divided sections is determined in advance.
For example, the data is decoded into a decimal number by the information decoding unit 23, and the logical operation stored in the operation storage unit 25 is sequentially read out by the information operation unit 24 in accordance with the decoded content, and the logical operation is performed. A row is created.

【0009】情報復号部23で各区分がその内容に応じ
て10進数に復号される場合、その10進数に応じて例
えば図1Bに示すように復号値が「1」なら左シフト、
「2」なら右シフト、「3」なら対象情報の上位側の半
分と下位側の半分との排他的論理和(XOR)、「4」
なら上位側の半分と下位側の半分との論理積・・・とそ
れぞれ実行すべき論理演算操作が予め対応ずけられ、こ
の対応が操作記憶部25に記憶されている。
When each section is decoded into a decimal number in accordance with the contents by the information decoding unit 23, if the decoded value is "1" as shown in FIG.
If "2", right shift, "3", exclusive OR (XOR) of upper half and lower half of target information, "4"
If so, the logical product of the upper half and the lower half is associated with the logical operation to be executed in advance, and the correspondence is stored in the operation storage unit 25.

【0010】次に図2を参照して請求項1の発明の実施
例を説明する。署名を行う時は、制御部12に署名を指
示する。制御部12は署名指示を受信すると(S1)、
署名対象記憶部13から署名対象情報を読み出して変形
署名対象情報生成部14へ供給し、生成部14は図3中
のそれと同様に、例えば128ビットの変形署名対象情
報Xを生成する(S2)。変形署名対象情報Xは、原署
名対象情報が1ビットでも変化しても変わるものであ
る。
Next, an embodiment of the present invention will be described with reference to FIG. When signing, the control unit 12 is instructed to sign. When the control unit 12 receives the signature instruction (S1),
The signature target information is read from the signature target storage unit 13 and supplied to the modified signature target information generation unit 14, and the generation unit 14 generates, for example, 128-bit modified signature target information X in the same manner as in FIG. 3 (S2). . The modified signature target information X changes even if the original signature target information changes even by one bit.

【0011】次に秘密情報記憶部11から署名者の秘密
情報Yを読み出し(S3)、その秘密情報Yと変形署名
対象情報Xとを初期情報生成部21へ送る。初期情報生
成部21は秘密情報Yと変形署名対象情報Xとを互いに
処理して互いに異なる複数の初期情報を生成する(S
4)。つまり例えばf(X,Y)=X+Y,g(X,
Y)=X XOR Yをそれぞれ演算してf(X,Y)
とg(X,Y)を生成する。この初期情報生成処理を複
雑にするために、f(X,Y),g(X,Y)を、Yの
上位4ビットに応じて右回転を行うなどしてもよい。こ
のようにf( ),g( )と論理演算を行うことよ
り、秘密情報Yの推定を困難にしている。
Next, the secret information Y of the signer is read from the secret information storage unit 11 (S3), and the secret information Y and the modified signature target information X are sent to the initial information generation unit 21. The initial information generation unit 21 processes the secret information Y and the modified signature target information X to generate a plurality of mutually different initial information (S
4). That is, for example, f (X, Y) = X + Y, g (X,
Y) = X XOR Y and calculate f (X, Y)
And g (X, Y). In order to complicate this initial information generation processing, f (X, Y) and g (X, Y) may be rotated rightward in accordance with the upper 4 bits of Y. Performing the logical operation with f () and g () makes it difficult to estimate the secret information Y.

【0012】生成した初期情報f( )、g( )の一
方、g(X,Y)を作業情報記憶部22に格納し(S
5)、他方f(X,Y)を情報復号部23へ供給する。
情報復号部23はf(X,Y)を、所定ビット、例えば
4ビット又は8ビットずつ区切って、区間列とし、その
各区間を10進数に復号して操作列、例えば1,10,
15,11,3,3,5・・・を作る(S6)。その操
作列の最初から各1つの操作(この例では10進数)を
順次取出し(S8)、それぞれ操作記憶部25から対応
する論理演算操作を、作業情報記憶部22のg(X,
Y)に対して施し(S9)、情報復号部23で作成した
操作列の操作番号がなくなるまで各論理演算操作を行う
(S7)。
One of the generated initial information f () and g (), g (X, Y) is stored in the work information storage unit 22 (S
5) The other side f (X, Y) is supplied to the information decoding unit 23.
The information decoding unit 23 divides f (X, Y) by predetermined bits, for example, 4 bits or 8 bits, to obtain an interval sequence, decodes each interval into a decimal number, and performs an operation sequence, for example, 1,10,
Are made (S6). One operation (decimal number in this example) is sequentially fetched from the beginning of the operation sequence (S8), and a corresponding logical operation operation is respectively performed from the operation storage unit 25 by g (X,
Y) (S9), and perform each logical operation until there is no operation number in the operation sequence created by the information decoding unit 23 (S7).

【0013】このようにして得られたg(X,Y)に対
する一連の論理演算結果が署名情報とされ、これと記憶
部13の署名対象情報とが通信処理部16を通じて送信
される。これを受信した受信者は署名者の秘密情報Yを
知っており、かつ操作記憶部25と同一の記憶内容を持
っていれば、受信情報から同様にしてf(X,Y)、g
(X,Y)を作り、更にf(X,Y)から操作列を作
り、g(X,Y)に対し、対応論理演算操作を順次施
し、その結果が受信情報中の署名情報と一致していれ
ば、真の署名者により署名された署名対象情報であるこ
とを検証できる。
A series of logical operation results for g (X, Y) obtained as described above is used as signature information, and this and the information to be signed in the storage unit 13 are transmitted through the communication processing unit 16. If the receiver who has received the information knows the signer's secret information Y and has the same storage content as the operation storage unit 25, the receiver obtains f (X, Y), g in the same manner from the received information.
(X, Y), an operation sequence is further formed from f (X, Y), and a corresponding logical operation is sequentially performed on g (X, Y), and the result matches the signature information in the received information. If so, it can be verified that the information is the signature target information signed by the true signer.

【0014】上述においては初期情報をf(X,Y),
g(X,Y)の二つとしたが、3つ以上とし、その1つ
を操作列の作成に用い、残りに対し、復号結果にもとづ
く論理演算操作をするようにしてもよい。この場合、初
期情報としてf(X,Y),g(X,Y),p(X,
Y)を生成した場合、g(X,Y)を操作列の生成に用
いると、復号操作結果に応じて、例えば図1Cに示すよ
うに、f(X,Y)XOR p(X,Y)のような演算
を行うことができ、複雑な処理を行うことができる。更
に複雑な論理演算列としては3つのパラメータp1,p
2,p3に対してLOLを左論理シフト、LORを右論
理シフト、modを剰余演算、EXORを排他的論理和
として、 ((p1LOR(p2mod8))+1)EXOR
((p3+1)LOL((p2EXORp3)mod
8)) などを行うようにしてもよい。
In the above description, the initial information is f (X, Y),
Although g (X, Y) is two, three or more may be used, and one of them may be used for generating an operation sequence, and the other may be subjected to a logical operation based on the decoding result. In this case, f (X, Y), g (X, Y), p (X,
In the case of generating Y), if g (X, Y) is used to generate an operation sequence, f (X, Y) XOR p (X, Y), for example, as shown in FIG. Can be performed, and complicated processing can be performed. As a more complicated logical operation sequence, three parameters p1 and p
For (2, p3), LOL is left logical shift, LOR is right logical shift, mod is modulo operation, EXOR is exclusive OR, ((p1LOR (p2mod8)) + 1) EXOR
((P3 + 1) LOL ((p2EXORp3) mod
8)) may be performed.

【0015】更にX,Yを変数とする関数による初期情
報を少くとも1つ作り、これと、変形署名対象X及び秘
密情報Yの少くとも一方とを含む中から、予め決めた1
つを操作列の生成に利用し、残りをその操作列に基づく
論理演算操作の対象として署名情報を生成してもよい。
更には初期情報を生成することなく、変形署名対象情報
Xと秘密情報Yの一方を操作列の生成に用い、他方を操
作列にもとづく論理演算操作の対象にして署名情報を生
成してもよい。
Further, at least one piece of initial information based on a function using X and Y as variables is created, and the information including at least one of the object X and the secret information Y is determined in advance.
One of them may be used for generating an operation sequence, and the rest may be used as a target of a logical operation operation based on the operation sequence to generate signature information.
Further, without generating the initial information, signature information may be generated by using one of the modified signature target information X and the secret information Y for generating an operation sequence and the other as a target of a logical operation operation based on the operation sequence. .

【0016】上述では同一人が同一文書(情報)に対し
て複数回署名をするとこれらは同一のものとなる。この
同一署名を署名を行うごとに異なるものとすることもで
きる。その場合は疑似乱数Rを生成し、これを初期情報
の生成に含め、つまりf(X,Y,R),g(X,Y,
R)とし、初期情報の生成後の処理は前記実施例を同一
とする。ただし署名情報に対し、乱数Rも付加して送信
する。
In the above description, if the same person signs the same document (information) a plurality of times, they become the same. The same signature may be different each time the signature is performed. In that case, a pseudo-random number R is generated and included in the generation of the initial information, that is, f (X, Y, R), g (X, Y,
R), and the processing after the generation of the initial information is the same as in the above-described embodiment. However, a random number R is also added to the signature information and transmitted.

【0017】このように乱数Rを用いる手法としては、
これを論理演算操作に含めてもよい。例えば初期情報と
してf(X,Y),g(X,Y),p(X,Y)を生成
し、その1つg(X,Y)により操作列を作り、g
(X,Y),p(X,Y)と乱数Rとを例えば図1Cに
示すように、論理演算操作を復号操作番号「2」でp
(X,Y)×R、「3」でf(X,Y)+p(X,Y)
×RなどとRを含む論理演算操作を行うようにしてもよ
い。この場合も、乱数Rを署名情報に付加して送信す
る。上述において変形署名対象Xの代りに原署名対象情
報を用いてもよい。
As a method of using the random number R,
This may be included in the logical operation. For example, f (X, Y), g (X, Y), p (X, Y) are generated as initial information, and an operation sequence is created by one of them, g (X, Y).
(X, Y), p (X, Y) and a random number R are represented by, for example, a logical operation using decoding operation number “2” as shown in FIG. 1C.
(X, Y) × R, f (X, Y) + p (X, Y) at “3”
A logical operation including R and XR may be performed. Also in this case, the random number R is added to the signature information and transmitted. In the above description, original signature target information may be used instead of the modified signature target X.

【0018】[0018]

【発明の効果】以上述べたように、この発明によれば、
署名対象情報と秘密情報(署名者の)を用い、それ自体
又はこれらを互いに処理した初期情報を用い、その1つ
を所定ビット数の区間に分割して、その各区間を復号し
(これは数値に限らず論理演算との対応が付けばよ
い)、操作列を得、その各操作に対応した論理演算を残
りのものに処理しているため、秘密情報、変形署名対象
情報が直接現われていなく、秘密情報を知っている受信
者のみ署名の正当性を検証できる。操作記憶部25に記
憶する各復号結果に対する論理演算操作を比較的簡単な
ものにしておけば簡単な処理、短時間で署名処理を行う
ことができ、また論理演算操作を複雑なものとしておけ
ば、不正署名を確実に防ぐことができる。
As described above, according to the present invention,
Using the information to be signed and the secret information (of the signer), using the information itself or the initial information obtained by mutually processing them, one is divided into sections of a predetermined number of bits, and each section is decrypted (this Not only numerical values but also logical operations may be added), the operation sequence is obtained, and the logical operations corresponding to each operation are processed for the remaining ones, so that the secret information and the modified signature target information appear directly. Instead, only the recipient who knows the secret information can verify the validity of the signature. If the logical operation operation for each decryption result stored in the operation storage unit 25 is relatively simple, the signature processing can be performed in a simple process and in a short time, and the logical operation operation can be complicated. In addition, an unauthorized signature can be reliably prevented.

【0019】何れの場合も、論理演算には、f(X,
Y),g(X,Y)の演算結果の最上位ビットが1なら
ば、そのf(X,Y)、g(X,Y)をビット反転する
など、一方向に操作を行うと、元へ戻すことが難しくな
るように簡単に行え、それだけ不正に強いものとなる。
また情報を暗号化するという特定のアルゴリズムに限定
された利用方法ではなく、この発明の方法では情報自体
が様々な論理演算操作の組み合わせを表現することによ
り、署名の柔軟さが大幅に向上し、つまり複雑さの制御
を、署名対象情報の重要度に応じて行うことができる。
In each case, f (X,
If the most significant bit of the operation result of Y) and g (X, Y) is 1, if the operation is performed in one direction, such as inverting the bits of f (X, Y) and g (X, Y), the original It's easy to make it harder to get back, and it's more fraudulently stronger.
In addition, the method of the present invention is not limited to a specific algorithm of encrypting information, but in the method of the present invention, the information itself represents a combination of various logical operation operations, thereby greatly improving the flexibility of signature, That is, the complexity can be controlled according to the importance of the signature target information.

【0020】更に、操作列を作るため初期情報、又はX
あるいはYのビット長が、分割区分のビット数で割切れ
ればよく、一度署名装置を決めてしまうと、その用いる
処理は8ビット、16ビット、32ビットなど限られな
い。
Further, initial information or X
Alternatively, it is only necessary that the bit length of Y is divisible by the number of bits of the divided section. Once the signature device is determined, the processing to be used is not limited to 8 bits, 16 bits, or 32 bits.

【図面の簡単な説明】[Brief description of the drawings]

【図1】Aはこの発明方法を実施可能な電子署名装置の
機能構成例を示すブロック図、B及びCはその操作記憶
部25の記憶内容の例を示す図である。
FIG. 1A is a block diagram showing an example of a functional configuration of an electronic signature device capable of implementing the method of the present invention, and FIGS. 1B and 1C are diagrams showing examples of contents stored in an operation storage unit 25;

【図2】この発明の実施例の処理手順を示す流れ図。FIG. 2 is a flowchart showing a processing procedure according to the embodiment of the present invention.

【図3】従来の電子署名装置の機能構成を示すブロック
図。
FIG. 3 is a block diagram showing a functional configuration of a conventional electronic signature device.

Claims (5)

【特許請求の範囲】[Claims] 【請求項1】 署名対象情報と秘密情報を互いに処理し
て異なった複数の初期情報を生成する初期情報生成過程
と、 上記複数の初期情報の1つを所定ビット数の区分に分割
する分割過程と、 上記各区分を、その内容に応じた論理演算操作に変換し
て論理演算操作列を得る変換過程と、 上記変換した各論理演算操作を、上記複数の初期情報の
残りに順次施して署名情報を得る論理演算過程と、を有
する電子署名方法。
1. An initial information generating step of processing signature object information and secret information to generate a plurality of different initial information, and a dividing step of dividing one of the plurality of initial information into sections of a predetermined number of bits. A conversion step of converting each of the divisions into a logical operation according to the content thereof to obtain a logical operation sequence; and sequentially applying each of the converted logical operation to the rest of the plurality of initial information and signing A digital operation method for obtaining information.
【請求項2】 署名対象情報と秘密情報を互いに処理し
て少くとも1つの初期情報を生成する初期情報生成過程
と、 上記初期情報と上記署名対象情報及び上記秘密情報の少
くとも一方とから予め決めた1つを選択して所定ビット
数の区分に分割する分割過程と、 上記各区分を、その内容に応じた論理演算操作に変換し
て操作列を得る変換過程と、 上記変換した各論理演算操作を、上記選択の残りに順次
施して署名情報を得る論理演算過程と、を有する電子署
名方法。
2. An initial information generating step of processing at least one of the signature target information and the secret information by mutually processing the signature target information and the secret information; and determining in advance the initial information, the signature target information, and at least one of the secret information. A dividing step of selecting the determined one and dividing it into sections of a predetermined number of bits; a converting step of converting each of the sections into a logical operation according to the content thereof to obtain an operation sequence; A logical operation step of sequentially performing operation operations on the rest of the selection to obtain signature information.
【請求項3】 疑似乱数を生成する乱数生成過程を有
し、上記初期情報過程の初期情報生成に上記疑似乱数を
含め、 上記署名情報に上記疑似乱数を付加することを特徴とす
る請求項1又は2記載の電子署名方法。
3. The method according to claim 1, further comprising the step of generating a random number for generating a pseudo random number, including the pseudo random number in initial information generation of the initial information step, and adding the pseudo random number to the signature information. Or the electronic signature method according to 2.
【請求項4】 署名対象情報及び秘密情報の一方を所定
ビット数の区分に分割する分割過程と、 上記各区分を、その内容に応じた論理演算操作に変換し
て操作列を得る変換過程と、 上記変換した各論理演算操作を、上記署名対象情報及び
上記秘密情報の他方に順次施して署名情報を得る論理演
算過程と、を有する電子署名方法。
4. A dividing step of dividing one of the signature target information and the secret information into sections of a predetermined number of bits, and a converting step of converting each of the sections into a logical operation operation according to the content to obtain an operation sequence. A logical operation step of sequentially applying each of the converted logical operation operations to the other of the signature target information and the secret information to obtain signature information.
【請求項5】 疑似乱数を生成する乱数生成過程を有
し、 上記変換過程での上記論理演算操作中に、上記疑似乱数
を用いる演算を含め、 上記署名情報に上記疑似乱数を付加することを特徴とす
る請求項1、2又は4記載の電子署名方法。
5. The method according to claim 1, further comprising the step of: generating a pseudo-random number, including adding the pseudo-random number to the signature information during the logical operation in the conversion step, including an operation using the pseudo-random number. The digital signature method according to claim 1, 2 or 4, wherein:
JP9016273A 1997-01-30 1997-01-30 Electronic signature method Pending JPH10214026A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP9016273A JPH10214026A (en) 1997-01-30 1997-01-30 Electronic signature method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP9016273A JPH10214026A (en) 1997-01-30 1997-01-30 Electronic signature method

Publications (1)

Publication Number Publication Date
JPH10214026A true JPH10214026A (en) 1998-08-11

Family

ID=11911949

Family Applications (1)

Application Number Title Priority Date Filing Date
JP9016273A Pending JPH10214026A (en) 1997-01-30 1997-01-30 Electronic signature method

Country Status (1)

Country Link
JP (1) JPH10214026A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010244218A (en) * 2009-04-03 2010-10-28 Hitachi Omron Terminal Solutions Corp Biometric authentication device and system
JP2014028275A (en) * 2013-09-09 2014-02-13 Hitachi Omron Terminal Solutions Corp Biometric authentication system, computer, and program
CN112805770A (en) * 2018-10-10 2021-05-14 日本电信电话株式会社 Secret right shift operation system, secret division operation system, methods thereof, secret calculation device, and program

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010244218A (en) * 2009-04-03 2010-10-28 Hitachi Omron Terminal Solutions Corp Biometric authentication device and system
JP2014028275A (en) * 2013-09-09 2014-02-13 Hitachi Omron Terminal Solutions Corp Biometric authentication system, computer, and program
CN112805770A (en) * 2018-10-10 2021-05-14 日本电信电话株式会社 Secret right shift operation system, secret division operation system, methods thereof, secret calculation device, and program
CN112805770B (en) * 2018-10-10 2023-10-03 日本电信电话株式会社 Secret right shift operation system and method, secret division operation system and method, secret calculation device, and recording medium

Similar Documents

Publication Publication Date Title
EP0839418B1 (en) Cryptographic method and apparatus for non-linearly merging a data block and a key
JP2760799B2 (en) Encryption method
US7451310B2 (en) Parallelizable authentication tree for random access storage
JP2628660B2 (en) Encryption / decryption method and apparatus
US7190791B2 (en) Method of encryption using multi-key process to create a variable-length key
US20010014154A1 (en) Data encrypting/decrypting conversion methods and apparatuses and data communication system adopting the same
US6463150B1 (en) Encryption device for information in binary code
JPH10240500A (en) Random number generator and method, enciphering device and method, decoder and method and stream cipher system
EP0996250A2 (en) Efficient block cipher method
EP1059760A1 (en) Method for the block-encryption of discrete data
JP2950485B2 (en) Stream cipher processor
JPH10214026A (en) Electronic signature method
JPH10340048A (en) Hash value generating method, data ciphering method, data deciphering method, hash value generating device data ciphering device, and data deciphering device
JP2002510058A (en) Method for cryptographic conversion of binary data blocks
JP2000089667A (en) Algorithm generation type secret key encryption system
JP2980085B2 (en) Encryption method and decryption method
KR980007156A (en) Secret key block encryption and decryption method
JP2000019958A (en) Cipher processor, cipher processing method and storage medium storing cipher processing program
JPH08286607A (en) Ciphering device
JPH05316104A (en) Coder and decoder
JPH0725436U (en) File encryption method
Moreau The Frogbit cipher, a data integrity algorithm
JPH09311627A (en) Method and device for generating cipher key of cipher based on circulating computation
JP2000112348A (en) Encryption apparatus and decryption apparatus
JPH02112345A (en) Compressed cipher system