US4969190A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Encrypting system of data
Assignee: Hitachi Ltd
•
Filing: 1989-04-12
•
Granted: 1990-11-06
•
Expires: 2009-04-12
Abstract
Abstract A data encrypting system according to the CBC system involves a limitation in a range of a numerical value which expresses data (smaller than a predetermined integer N). The encrypting system has an encrypting apparatus including a block encrypting section for receiving data, which is expressed by an integer value X smaller than a predetermined integer value N, for executing a data conversion C=enc (X) where 0≦C≦N-1 using an RSA algorithm, and for outputting C; and an arithmetic operating section connected to receive data, as one input, which is expressed by an integer value M smaller than the integer value N, and the output C of the block encrypting section as the other input, for performing an arithmetic operation for both of the inputs so that a resultant arithmetic value is smaller than the integer value N, and for outputting the arithmetic value as an input of the block encrypting section. Further, a decoding apparatus has a block decoding section for receiving data which is expressed by an integer value C smaller than the integer value N, for executing an inverse conversion Y=dec (C) of the encrypting for the input signal by using the RSA algorithm; and a modulo subtracting section for subtracing the input data C from the output Y of the block decoding section and for outputting a remainder M' M'=Y-C (mod N) which is derived by dividing a resultant subtracted value by the integer value N.
Inventors
- 👤 Kazuo Takaragi
- 👤 Fusao Nakagawa
- 👤 Yasuhiko Nagai
- 👤 Ryoichi Sasaki
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 10:51
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/06; H04L9/0618; H04L9/0637
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
150 words
A data encrypting apparatus using a cipher block chaining system, comprising: block encrypting means for receiving data, as an input signal, which is expressed by an integer value X smaller than a predetermined integer value N, for executing a data conversion C=enc(X) where, C is an integer value and 0≦C≦N-1 for said input signal by using an RSA algorithm, and for outputting said C; and arithmetic operating means, connected to receive data, as one input, which is expressed by an integer value M smaller than said integer value N, and the output C of said block encrypting means as the other input, for executing a predetermined expression using values of both of said one input and said other input, said predetermined expression providing a solution whose value is smaller than the integer value N, said value of the solution being applied to said block encrypting means as said input signal.
Claim 2
Dependent Claim
150 words
A data encrypting apparatus using a cipher block chaining system, comprising: block encrypting means for receiving data, as an input signal, which is expressed by an integer value X smaller than a predetermined integer value N, for executing a data conversion C=enc(X) where, C is an integer value and 0≦C≦N-1 for said input signal by using an RSA algorithm, and for outputting said C; and arithmetic operating means, connected to receive data, as one input, which is expressed by an integer value M smaller than said integer value N, and the output C of said block encrypting means as the other input, for executing a predetermined expression using values of both of said one input and said other input, said predetermined expression providing a solution whose value is smaller than the integer value N, said value of the solution being applied to said block encrypting means as said input signal.
Claim 3
Dependent Claim
144 words
A data encrypting apparatus using a cipher block chaining system, comprising: block encrypting means for receiving data, as an input signal, which is expressed by an integer value X smaller than a predetermined integer value N, for executing a data conversion C=enc(X) where, C is an integer value and 0≦C≦N-1 for said input signal by using an RSA algorithm, and for outputting said C; and modulo adding means for receiving data, as one input, which is expressed by an integer value M smaller than said integer value N, for receiving the output C of said block encrypting means as the other input, for adding both of said inputs and obtaining a remainder X' X'=M+C (mod N) which is derived by dividing a resultant added value by said integer value N, and for outputting said remainder X' as an input of the block encrypting means.
Claim 4
Dependent Claim
144 words
A data encrypting apparatus using a cipher block chaining system, comprising: block encrypting means for receiving data, as an input signal, which is expressed by an integer value X smaller than a predetermined integer value N, for executing a data conversion C=enc(X) where, C is an integer value and 0≦C≦N-1 for said input signal by using an RSA algorithm, and for outputting said C; and modulo adding means for receiving data, as one input, which is expressed by an integer value M smaller than said integer value N, for receiving the output C of said block encrypting means as the other input, for adding both of said inputs and obtaining a remainder X' X'=M+C (mod N) which is derived by dividing a resultant added value by said integer value N, and for outputting said remainder X' as an input of the block encrypting means.
Claim 5
Dependent Claim
191 words
A data encrypting apparatus for receiving data, as a unit block, which is expressed by a numerical value smaller than a predetermined integer value N and for sequentially encrypting said block data, comprising: block encrypting means for receiving data, as an input signal, which is expressed by an integer value X n (n is the block number and n=1, 2, 3, . . . ) smaller than said integer value N, for executing a data conversion C.sub.n =enc(X.sub.n) where, C n is an integer value and 0≦C n ≦N-1 for said input signal by using an RSA algorithm, and for outputting said C n ; and modulo adding means for receiving data, as one input, which is expressed by an integer value M n smaller than said integer value N, for receiving an output C n-1 of said block encrypting means as the other input, for adding both of the inputs and obtaining a remainder X n X.sub.n =M.sub.n +C.sub.n-1 (mod N) which is derived by dividing a resultant added value by said integer value N, and for outputting said remainder X n as an input of the block encrypting means.
Claim 6
Dependent Claim
191 words
A data encrypting apparatus for receiving data, as a unit block, which is expressed by a numerical value smaller than a predetermined integer value N and for sequentially encrypting said block data, comprising: block encrypting means for receiving data, as an input signal, which is expressed by an integer value X n (n is the block number and n=1, 2, 3, . . . ) smaller than said integer value N, for executing a data conversion C.sub.n =enc(X.sub.n) where, C n is an integer value and 0≦C n ≦N-1 for said input signal by using an RSA algorithm, and for outputting said C n ; and modulo adding means for receiving data, as one input, which is expressed by an integer value M n smaller than said integer value N, for receiving an output C n-1 of said block encrypting means as the other input, for adding both of the inputs and obtaining a remainder X n X.sub.n =M.sub.n +C.sub.n-1 (mod N) which is derived by dividing a resultant added value by said integer value N, and for outputting said remainder X n as an input of the block encrypting means.
Claim 7
Dependent Claim
38 words
An apparatus according to claim 3, wherein said modulo adding means uses a predetermined value B (0≦B≦N-1) in place of said C n-1 as the other input which is added to the first block input M 1 .
Claim 8
Dependent Claim
29 words
An apparatus according to claim 4, wherein said modulo adding means includes means for delaying the output of said block encrypting means by a time of one block length.
Claim 9
Independent Claim
105 words
An apparatus for decoding data which was encrypted by a cipher block chaining system, comprising: block decoding means for receiving data, as an input signal, which is expressed by an integer value C smaller than a predetermined integer value N, for executing an inverse conversion Y=dec(C) of the encrypting for said input signal by using an RSA algorithm, and for outputting said Y; and modulo subtracting means for subtracting said input data C from the output Y of said block decoding means and for outputting a remainder M' M'=Y-C (mod N) which is derived by dividing a resultant subtracted value by said integer value N.
Claim 10
Independent Claim
105 words
An apparatus for decoding data which was encrypted by a cipher block chaining system, comprising: block decoding means for receiving data, as an input signal, which is expressed by an integer value C smaller than a predetermined integer value N, for executing an inverse conversion Y=dec(C) of the encrypting for said input signal by using an RSA algorithm, and for outputting said Y; and modulo subtracting means for subtracting said input data C from the output Y of said block decoding means and for outputting a remainder M' M'=Y-C (mod N) which is derived by dividing a resultant subtracted value by said integer value N.
Claim 11
Dependent Claim
149 words
A data decoding apparatus for receiving data C n , as s unit block, which is expressed by a numerical value smaller than a predetermined integer value N which was encrypted and for sequentially decoding said block data, comprising: block decoding means for receiving data, as an input signal, which is expressed by an integer value C n (n is the block number and N=1, 2, 3, . . . ) smaller than said integer value N, for executing an inverse conversion Y.sub.n =dec(C.sub.n) of the encrypting for said input signal by using an RSA algorithm, and for outputting said Y n ; and modulo subtracting means for subtracting said input data C n-1 from the output Y n of said block decoding means and for outputting a remainder M n M.sub.n =Y.sub.n -C.sub.n-1 (mod N) which is derived by dividing a resultant subtracted-value by said integer value N.
Claim 12
Dependent Claim
149 words
A data decoding apparatus for receiving data C n , as s unit block, which is expressed by a numerical value smaller than a predetermined integer value N which was encrypted and for sequentially decoding said block data, comprising: block decoding means for receiving data, as an input signal, which is expressed by an integer value C n (n is the block number and N=1, 2, 3, . . . ) smaller than said integer value N, for executing an inverse conversion Y.sub.n =dec(C.sub.n) of the encrypting for said input signal by using an RSA algorithm, and for outputting said Y n ; and modulo subtracting means for subtracting said input data C n-1 from the output Y n of said block decoding means and for outputting a remainder M n M.sub.n =Y.sub.n -C.sub.n-1 (mod N) which is derived by dividing a resultant subtracted-value by said integer value N.
Claim 13
Dependent Claim
40 words
An apparatus according to claim 7, wherein said modulo subtracting means uses a predetermined value B (0≦B≦N-1) in place of said C n-1 as input data which is subtracted from the first output Y 1 of said block decoding means.
Claim 14
Dependent Claim
30 words
An apparatus according to claim 8, wherein said modulo adding means further includes means for delaying the output of said block decoding means by a time of one block length.
Claim 15
Dependent Claim
286 words
An encrypting communication system for receiving data, as a unit block, which is expressed by a numerical value smaller than a predetermined integer value N, for sequentially encrypting said block data, and for decoding said encrypted data, comprising: block encrypting means for receiving data, as an input signal, which is expressed by an integer value X n (n is the block number and n=1, 2, 3, . . . ) smaller than said integer value N, for executing a data conversion C.sub.n =enc(X.sub.n) where, C n is an integer value and 0≦C n ≦N-1 for said input signal by using an RSA algorithm, and for outputting said C n ; modulo adding means for receiving data, as one input, which is expressed by an integer value M n smaller than said integer value N, for receiving the output C n-1 of said block encrypting means as the other input, for adding both of said inputs and obtaining a remainder X n X.sub.n =M.sub.n +C.sub.n-1 (mod N) which is derived by dividing a resultant added value by said integer value N, and for outputting said remainder X n as an input of the block encrypting means; block decoding means for receiving the output C n of the block encrypting means as an input signal, for executing an inverse conversion Y.sub.n =dec(C.sub.n) of the encrypting for said input signal by using the RSA algorithm, and for outputting said Y n ; and modulo subtracting means for subtracting said input data C n-1 from the output Y n of said block decoding means, and for outputting a remainder M n M.sub.n =Y.sub.n -C.sub.n-1 (mod N) which is derived by dividing a resultant subtracted value by said integer value N.
Claim 16
Dependent Claim
286 words
An encrypting communication system for receiving data, as a unit block, which is expressed by a numerical value smaller than a predetermined integer value N, for sequentially encrypting said block data, and for decoding said encrypted data, comprising: block encrypting means for receiving data, as an input signal, which is expressed by an integer value X n (n is the block number and n=1, 2, 3, . . . ) smaller than said integer value N, for executing a data conversion C.sub.n =enc(X.sub.n) where, C n is an integer value and 0≦C n ≦N-1 for said input signal by using an RSA algorithm, and for outputting said C n ; modulo adding means for receiving data, as one input, which is expressed by an integer value M n smaller than said integer value N, for receiving the output C n-1 of said block encrypting means as the other input, for adding both of said inputs and obtaining a remainder X n X.sub.n =M.sub.n +C.sub.n-1 (mod N) which is derived by dividing a resultant added value by said integer value N, and for outputting said remainder X n as an input of the block encrypting means; block decoding means for receiving the output C n of the block encrypting means as an input signal, for executing an inverse conversion Y.sub.n =dec(C.sub.n) of the encrypting for said input signal by using the RSA algorithm, and for outputting said Y n ; and modulo subtracting means for subtracting said input data C n-1 from the output Y n of said block decoding means, and for outputting a remainder M n M.sub.n =Y.sub.n -C.sub.n-1 (mod N) which is derived by dividing a resultant subtracted value by said integer value N.
Claim 17
Dependent Claim
176 words
A data encrypting method whereby data which is expressed by a numerical value smaller than a predetermined integer value N is input as a unit block and said block data is sequentially encrypted, comprising the steps of: receiving data, as an input signal, which is expressed by an integer value X n (n is the block number and n=1, 2, 3, . . . ) smaller than said integer value N and executing a data conversion C.sub.n =enc(X.sub.n) where, C n is an integer value and 0≦C n ≦N-1 for said input signal by using an RSA algorithm; receiving data, as one input, which is expressed by an integer value M n smaller than said integer value N, receiving an output C n-1 of said data conversion as the other input, adding both of said inputs, and calculating a remainder X n X.sub.n =M.sub.n +C.sub.n-1 (mod N) which is derived by dividing a resultant added value by said integer value N; and giving said resultant arithmetic value X n as an input of said data conversion.
Claim 18
Dependent Claim
176 words
A data encrypting method whereby data which is expressed by a numerical value smaller than a predetermined integer value N is input as a unit block and said block data is sequentially encrypted, comprising the steps of: receiving data, as an input signal, which is expressed by an integer value X n (n is the block number and n=1, 2, 3, . . . ) smaller than said integer value N and executing a data conversion C.sub.n =enc(X.sub.n) where, C n is an integer value and 0≦C n ≦N-1 for said input signal by using an RSA algorithm; receiving data, as one input, which is expressed by an integer value M n smaller than said integer value N, receiving an output C n-1 of said data conversion as the other input, adding both of said inputs, and calculating a remainder X n X.sub.n =M.sub.n +C.sub.n-1 (mod N) which is derived by dividing a resultant added value by said integer value N; and giving said resultant arithmetic value X n as an input of said data conversion.
Claim 19
Dependent Claim
136 words
A data decoding method whereby data C n which is expressed by a numerical value smaller than a predetermined integer value N which was encrypted is inputted as a unit block and said block data is sequentially decoded, comprising the steps of: receiving data, as an input signal, which is expressed by an integer value C n (n is the block number and n=1, 2, 3, . . . ) smaller than said integer value N and executing an inverse conversion Y.sub.n =dec(C.sub.n) of the encrypting for said input signal by using an RSA algorithm; and subtracting said input data C n-1 from the output Y n of said inverse conversion and calculating a remainder M n M.sub.n =Y.sub.n -C.sub.n-1 (mod N) which is derived by dividing a resultant subtracted value by said integer value N.
Claim 20
Dependent Claim
136 words
A data decoding method whereby data C n which is expressed by a numerical value smaller than a predetermined integer value N which was encrypted is inputted as a unit block and said block data is sequentially decoded, comprising the steps of: receiving data, as an input signal, which is expressed by an integer value C n (n is the block number and n=1, 2, 3, . . . ) smaller than said integer value N and executing an inverse conversion Y.sub.n =dec(C.sub.n) of the encrypting for said input signal by using an RSA algorithm; and subtracting said input data C n-1 from the output Y n of said inverse conversion and calculating a remainder M n M.sub.n =Y.sub.n -C.sub.n-1 (mod N) which is derived by dividing a resultant subtracted value by said integer value N.
Claim 21
Dependent Claim
240 words
An encryption communicating method whereby data which is expressed by a numerical value smaller than a predetermined integer value N is inputted as a unit block, said block data is sequentially encrypted, and said encrypted data is decoded, comprising the steps of: receiving data, as an input signal, which is expressed by an integer value X n (n is the block number and n=1, 2, 3, . . . ) smaller than said integer value N and executing a data conversion C.sub.n =enc(X.sub.n) where, C n is an integer value and 0≦C n ≦N-1 for said input signal by using an RSA algorithm; receiving data, as one input, which is expressed by an integer value M n smaller than said integer value N, receiving an output C n-1 of said data conversion as the other input, adding both of said inputs, and calculating a remainder X n X.sub.n =M.sub.n +C.sub.n-1 (mod N) which is derived by dividing a resultant added value by said integer value N; receiving the output C n of said data conversion as an input signal and executing an inverse conversion Y.sub.n =dec(C.sub.n) of said data conversion for said input signal by using the RSA algorithm; and subtracting said input data C n-1 from the output Y n of said inverse conversion and calculating a remainder M n M.sub.n =Y.sub.n -C.sub.n-1 (mod N) which is derived by dividing a resultant subtracted value by said integer value N.
Claim 22
Dependent Claim
240 words
An encryption communicating method whereby data which is expressed by a numerical value smaller than a predetermined integer value N is inputted as a unit block, said block data is sequentially encrypted, and said encrypted data is decoded, comprising the steps of: receiving data, as an input signal, which is expressed by an integer value X n (n is the block number and n=1, 2, 3, . . . ) smaller than said integer value N and executing a data conversion C.sub.n =enc(X.sub.n) where, C n is an integer value and 0≦C n ≦N-1 for said input signal by using an RSA algorithm; receiving data, as one input, which is expressed by an integer value M n smaller than said integer value N, receiving an output C n-1 of said data conversion as the other input, adding both of said inputs, and calculating a remainder X n X.sub.n =M.sub.n +C.sub.n-1 (mod N) which is derived by dividing a resultant added value by said integer value N; receiving the output C n of said data conversion as an input signal and executing an inverse conversion Y.sub.n =dec(C.sub.n) of said data conversion for said input signal by using the RSA algorithm; and subtracting said input data C n-1 from the output Y n of said inverse conversion and calculating a remainder M n M.sub.n =Y.sub.n -C.sub.n-1 (mod N) which is derived by dividing a resultant subtracted value by said integer value N.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-11-05 | 1994-05-07 | 1994-11-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-11-05 | 1998-05-07 | 1998-11-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-11-05 | 2002-05-07 | 2002-11-06 | $7700.00 | Window Closed / Lapsed |