WO2000064096A1 - Systeme de communications cryptees - Google Patents

Systeme de communications cryptees Download PDF

Info

Publication number
WO2000064096A1
WO2000064096A1 PCT/JP2000/002554 JP0002554W WO0064096A1 WO 2000064096 A1 WO2000064096 A1 WO 2000064096A1 JP 0002554 W JP0002554 W JP 0002554W WO 0064096 A1 WO0064096 A1 WO 0064096A1
Authority
WO
WIPO (PCT)
Prior art keywords
random number
pseudo
number sequence
bit
communication system
Prior art date
Application number
PCT/JP2000/002554
Other languages
English (en)
Japanese (ja)
Inventor
Junko Suginaka
Toshi Suzuki
Original Assignee
Akita, Yasuo
Fujino, Shigeru
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 Akita, Yasuo, Fujino, Shigeru filed Critical Akita, Yasuo
Publication of WO2000064096A1 publication Critical patent/WO2000064096A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/34—Bits, or blocks of bits, of the telegraphic message being interchanged in time
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/065—Encryption by serially and continuously modifying data stream elements, e.g. stream cipher systems, RC4, SEAL or A5/3
    • H04L9/0656—Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher

Definitions

  • the present invention relates to a secret communication system that communicates various data in a secret state.
  • BACKGROUND ART In recent years, various types of data have been transmitted and received via networks such as the Internet and Internet. At that time, in order to prevent important data from being leaked to a third party, various encryption methods have been proposed to keep the data to be transmitted and received confidential. In many of such encryption methods, a ciphertext is created by repeating a substitution process and a transposition process on a plaintext a predetermined number of times.
  • a predetermined bit length such as a 4-bit length or a 6-bit length is used as a unit of the transposition process, and the transposition process is performed on a predetermined bit position. For this reason, in the conventional encryption method, the characteristic resulting from the transposition process remains in the ciphertext, which may be decrypted.
  • An object of the present invention is to provide a confidential communication system capable of eliminating a characteristic caused by transposition processing in a sent / received encrypted text.
  • a secret communication system generates a pseudo-random number sequence based on predetermined key information, and generates the generated pseudo-random number sequence and a preset pseudo-random number sequence. Based on a fixed transposition rule, a plurality of exchange positions are specified for the bit string of the plaintext, and a transposition process of exchanging values between the plurality of exchange positions is performed. And transmitting and receiving the encrypted text between the transmitting device and the receiving device.
  • the exchange position to be subjected to the transposition processing is specified based on the pseudo-random number sequence in the plaintext bit string, so that the exchange position changes continuously. Therefore, in the sent / received cryptogram, the characteristics caused by the transposition process are eliminated, and a high encryption strength can be obtained.
  • FIG. 1 is an overall conceptual diagram of a secure communication system according to the present invention.
  • FIG. 2 is a configuration diagram of a pseudo random number generator.
  • FIG. 3 is an explanatory diagram showing an example of a pseudo random number sequence.
  • FIG. 4 is an explanatory diagram showing a plaintext blocking process.
  • FIG. 5 is an explanatory diagram showing an example of encryption processing (transposition processing) based on the transposition rule (1).
  • FIG. 6 is a conceptual diagram of the encryption processing shown in FIG.
  • FIG. 7 is an explanatory diagram showing an example of a decoding process (transposition process) based on the transposition rule (1).
  • FIG. 8 is an explanatory diagram showing a process of assembling a block of plaintext.
  • FIG. 9 is an explanatory diagram showing an example of an encryption process in which the transposition process is repeated a plurality of times.
  • FIG. 10 is an explanatory diagram showing a process of extracting a pseudo-random number sequence used in each transposition process from a series of pseudo-random number sequences when the transposition process is repeated a plurality of times.
  • FIG. 11 is an explanatory diagram showing another example of extracting a plurality of pseudo-random number sequences from a series of pseudo-random number sequences.
  • FIG. 12 is an explanatory diagram showing an example of encryption processing (transposition processing) based on the transposition rule (2).
  • FIG. 13 is an explanatory diagram showing an example of encryption processing (transposition processing) based on the transposition rule (3).
  • FIG. 14 is an explanatory diagram showing an example of encryption processing (transposition processing) based on the transposition rule (4).
  • FIG. 15 is an explanatory diagram showing an example of a process of specifying a set of exchange bit positions from a pseudo-random number sequence in an encryption process (transposition process) based on the transposition rule (5).
  • FIG. 16 is an explanatory diagram showing exchange processing in encryption processing (transposition processing) based on the transposition rule (5).
  • FIG. 1 is an overall schematic diagram of a secret communication system according to the present invention.
  • the secure communication system includes a transmitting device 10 and a receiving device 20 that can be connected via a network 30 such as the Internet.
  • the transmitting device 10 includes a pseudorandom number sequence generating means 11 for generating a pseudorandom number sequence based on predetermined key information 40, and a blocking means 12 for dividing a plain text (original text) into blocks having a predetermined bit length.
  • Encrypting means 13 for creating a ciphertext from the plaintext by performing a predetermined transposition process, which will be described later, on each block of the plaintext based on the pseudo-random number sequence, and a network 30
  • transmission means 14 for transmitting to the reception-side device 20 via the communication device.
  • the receiving device 20 generates the same pseudo-random number sequence as the pseudo-random number sequence generating device 11 of the transmitting device 10 based on predetermined key information 40.
  • An assembly means 24 for assembling each block to obtain a plain text (original text) is provided.
  • the transmitting device 10 and the receiving device 20 are constituted by a personal computer or the like. It is configured as a functional block realized by However, as long as the function of each of the above means can be fulfilled, each of the above means can be constituted by hardware such as a dedicated circuit.
  • the transmitting device 10 and the receiving device 20 need not be dedicated devices for transmission or reception, but are desirably transmission / reception devices of a confidential communication system capable of both transmission and reception.
  • the pseudo random number sequence generating means 11 and 21 used for the transmitting side and the receiving side can be shared by one means.
  • the pseudo random number sequence generating means 11 and 21 are provided for both the transmitting device 10 and the receiving device 20.
  • the pseudo random number sequence generating means 11 and 21 have the same configuration. . Therefore, when a transmitting / receiving device having both functions of the transmitting device 10 and the receiving device 20 is configured, the pseudo random number sequence generating means 11 and 21 can be shared.
  • the pseudo-random number sequence generation means 11 and 21 are specifically configured by software that realizes a function corresponding to a circuit for generating a pseudo-random number sequence generally called an M-sequence shown in FIG. 2 on a computer. ing.
  • the pseudo-random number sequence generation means 1 1, 21 is provided with a k-number of Shift register Xi X l ⁇ x k connected in series, the elements that serve as the exclusive OR calculator X OR, each shift register X l ⁇ x k output caries Chi of the feedback terminal specified coefficients a ⁇ ! ⁇ exclusive OR of the specified output by is the input of the shift register evening x k of the most upstream side, of most downstream side shift register pseudo-random number sequence shown from X l in Figure 3 for example is adapted to be sequentially output.
  • the pseudo-random number sequence generated by the pseudo-random number sequence generation means 11 and 21 determines the sequence of the pseudo-random number sequence according to the exclusive OR of the outputs from the shift registers X i X k . That is, the feedback terminal designating coefficient Ai Ak is information indicating a procedure for generating a pseudo random number sequence.
  • the initial value X i to X k applied to the shift register X it to X k is the beginning of the k bits of the value of the pseudo-random number sequence, that is, a default value.
  • the feedback terminal designation coefficient A i Ak and the initial value Xi Xk of the pseudo random number are used as the key information 40.
  • Sender 10 and receive Each of the side devices 20 is provided with input means such as a keyboard for inputting the key information 40 by an operator, or receiving means for obtaining the key information 40 through a communication line or the like. Further, a storage means such as a memory for storing the input or obtained key information 40 is provided.
  • the pseudo-random number sequence generating means 11 and 21 read the key information 40 stored in the storage means in this way, and generate a pseudo-random number sequence based on the key information 40.
  • the blocking means 12 divides the plaintext data transmitted from the transmitting apparatus 10 to the receiving apparatus 20 into blocks each having a predetermined bit length (for example, 64 bit length). Perform the following processing.
  • the plaintext data may be data input from an input means such as a keyboard or data read from a storage means such as a hard disk.
  • the encryption means 13 interprets the pseudo-random number sequence generated by the pseudo-random number sequence generation means 11 based on a preset transposition rule, thereby performing a plurality of exchanges on the blocked plaintext bit string. A position is specified, and a transposition process is performed to exchange values between the specified plurality of replacement positions.
  • transposition rule various rules can be used as described later.
  • the following transposition rule (1) is adopted.
  • the pseudo-random number sequence is a binary value sequence, and in the part where 1 or 0 continues over 2 bits or more in this pseudo-random number sequence, the start bit position and the tail bit position of each continuous part are exchanged. And exchange each other's bit values.
  • the encryption means 13 is provided with input means such as a keyboard for the operator to input such transposition rules, or reception means for obtaining the same through a communication line or the like.
  • storage means such as a memory for storing the input or obtained transposition rules are provided.
  • the encryption means 13 reads out the transposition rule stored in the storage means in this way, and performs transposition processing (encryption processing) based on the transposition rule.
  • FIG. 5 is an explanatory diagram showing a specific example of the transposition process based on the transposition rule (1).
  • plaintext, 6 4-bit string bit length was one block S o, SJ, S 2, ..., a S 6 3, bit value of 0 or 1 is given to each bit.
  • the pseudorandom number sequence also uses the first 64 bits as shown in FIG.
  • the pseudo-random sequence is a plaintext bit sequence S. , S There S 2, ⁇ , it will correspond by S 6 3 and the first bit or al 1-one.
  • bit position 0 and bit position 2 which are the first bits, are specified as a pair of exchange positions.
  • S at bit position 0 of the plaintext.
  • S 2 at bit position 2 exchange bit values with each other.
  • pseudo-random number sequence is 0 are continuous in the bit positions 3, 4, since the bit position 8, 9 0 is continuous, S 3 and S 4, 3 8 and 3 9 of plaintext, one in each Bit values are exchanged.
  • bit string of the plaintext having a length of 64 bits is written into the bit string of the plaintext having the same length of 64 bits.
  • the transposition process shown in FIG. 5 can be schematically represented as the same procedure as that of a so-called “Amidakuji”, as shown in FIG. That is, the bit positions corresponding to the plaintext and the encrypted text are connected by vertical lines, and a schematic diagram is created in which the vertical lines of the set of exchange positions are connected by horizontal lines. In this figure, the vertical line is traced downward from each bit position of the plain text, and when the start point of the horizontal line is reached, the end point of the horizontal line is shifted to the connected vertical line. To reach.
  • the encryption process is a process of writing the bit value of each bit position of the plaintext into the bit position of the ciphertext reached as described above. For example, S in bit 0 of plaintext. Will be written in the second bit position of the ciphertext by the horizontal line.
  • the same transposition process as described above is performed on the second block of the plaintext using the next 64 bits of the pseudo random number sequence.
  • the transmitting means 14 and the receiving means 22 transmit and receive the text created by the encrypting means 13 via the network 30.
  • the transmitting means 14 and the receiving means 22 are composed of software for adding various information to the ciphertext according to a protocol on the network or the like, and hardware such as a modem device.
  • the transmitting means 14 and the receiving means 22 are one transmitting / receiving means having both functions. Can be realized.
  • the decryption unit 23 decrypts the received ciphertext based on the pseudo-random number sequence generated by the pseudo-random number sequence generation unit 21 and the transposition rule used by the encryption unit 13 Perform processing. In this embodiment, since the sentence is divided into blocks, the bit string of the sentence is decoded into a bit string of plain text for each block.
  • the decoding is performed by exactly the same processing as the transposition processing according to the transposition rule (1). Processing can be performed.
  • the decoding means 23 is provided with input means such as a keyboard for the operator to input such transposition rules, or receiving means for obtaining the transposition rules via a communication line or the like.
  • storage means such as a memory for storing the input or obtained transposition rules are provided.
  • the decoding means 23 reads the transposition rule stored in the storage means in this way, and performs transposition processing (decoding processing) based on the transposition rule.
  • FIG. 6, which schematically shows the encryption process the decryption is a process of following a vertical line upward from each bit position of the ciphertext.
  • the above-mentioned encryption means 13 can be used also as the decryption means 23.
  • the assembling means 24 performs a process of assembling the plaintext divided into a plurality of blocks decrypted by the decrypting means 23 into a series of plaintexts.
  • the plaintext assembled in this way is output to an output means such as a monitor, or written to a storage means such as a hard disk and used for various purposes.
  • the exchange position to be transposed in the plaintext bit string changes continuously based on the pseudo-random number sequence. Therefore, features resulting from the transposition process are excluded from the sent and received encrypted text. Also, since the plaintext bit string is transposed and disturbed in bit units, high encryption strength can be obtained.
  • the exchange position is identified based on the pseudo-random number sequence and the bit value at the exchange position is exchanged, the encryption is performed by a simple process, so that the load on the encryption and decryption processes is small and the speed is high. Can be achieved.
  • the encryption means 13 and the decryption means 23 can be configured to perform the same transposition processing. Further, when a transmitting / receiving device that performs both transmission and reception is configured, one unit can be used as the encryption unit 13 and the decryption unit 23.
  • the bit positions other than the exchange position can be immediately written into the bit string of the cipher without storing in the buffer, and the processing load of the encryption means 13 and the decryption means 23 performing the transposition processing Can be reduced.
  • the pseudo-random number sequence of binary values is made to correspond one-to-one with the bit sequence of the plain text, and the exchange position is specified according to the pseudo-random number sequence. It is possible to manage. Therefore, the encrypted data can be transmitted to the receiving device 20 sequentially from the first bit. In addition, since the same applies to the decryption of encrypted text, high real-time performance can be obtained between the transmitting device 10 and the receiving device 20 by decrypting the received encrypted text in order from the first bit. it can.
  • the encryption means 13 performs the transposition process based on the transposition rule (1) a plurality of times (three times) on each block of the plaintext to perform the secret culture. .
  • the transposition processing in the above embodiment is schematically represented as the procedure of “Amidakuji” in FIG. 6, the encryption processing and the decryption processing in the second embodiment will be as shown in FIG.
  • the transposition process represented by the horizontal line is performed over multiple stages (three stages).
  • the pseudo-random number sequence is divided into blocks of a predetermined bit length (for example, 64 bit length) from the first bit, and each block is subjected to the first transposition of the first block. It may be used in order.
  • a plurality of blocks may be extracted from the pseudo random number sequence by shifting the leading bit position by n bits.
  • the transposition process can be easily performed on more bit positions in the bit string of the plain text.
  • the encryption means 13 performs a dark culture on each block of the plaintext by a transposition process based on the following transposition rule (2).
  • the pseudo-random number sequence is defined as a binary value sequence, and in the portion of the pseudo-random number sequence that changes from 0 to 1, the bit position corresponding to 0 and the bit position corresponding to 1 are specified as a pair of exchange positions. Exchange bit values with each other.
  • FIG. 12 is an explanatory diagram showing a specific example of the transposition process based on the transposition rule (2). If the pseudo-random number sequence shown in FIG. 12 is interpreted in order from the first bit based on the above transposition rule (2), it changes from 0 to 1 at bit positions 4 and 5. Therefore, bit position 4 and bit position 5 are specified as a set of exchange bits. And with the S 5 S 4 and bit position 5 of the bit positions of the plaintext 4 is replaced bit values of each other. Similarly, the bit values are exchanged in the pair of bit positions 6 and 7 and in the pair of bit positions 9 and 10 to create a ciphertext.
  • the encryption means 13 and the decryption means 23 can be configured to perform the same transposition processing.
  • the encryption means 13 performs a dark culture on each block of plaintext by a transposition process based on the following transposition rule (3).
  • the pseudo-random number sequence is converted into a binary value sequence, and the bit positions corresponding to consecutive 1s or 0s in the pseudo-random number sequence are respectively specified as a group of exchange positions, and adjacent exchange positions are exchanged in group units. .
  • FIG. 13 is an explanatory diagram showing a specific example of the transposition process based on the transposition rule (3). If the pseudo-random number sequence in FIG. 13 is interpreted in order from the first bit based on the transposition rule (3), bit positions 0 to 2 are consecutive. For this reason, bit positions 0 to 2 are specified as a group of exchange positions, as enclosed in FIG. Subsequently, 0s are consecutive in bit positions 3 and 4. Thus, bit positions 3 and 4 are also specified as a group of exchange positions. Then, have you a bit string of the plaintext, the S Q to S 2 of these bit positions 0 to 2, S 3, S 4 bit positions 3, 4 is exchanged bit group basis.
  • bit position 5 is specified as an exchange position with one bit.
  • bit position 6 is specified as an exchange position with one bit. Then, in the plaintext bit string, S 5 at bit position 5 and S 6 at bit position 6 are exchanged.
  • the exchange position in the plaintext bit string changes according to the pseudo-random number sequence, so that it is possible to obtain a ciphertext in which the characteristics resulting from the transposition processing are eliminated.
  • the bit length of each exchange position to be transposed changes according to the pseudo-random number, so that the transposition process can be diversified and the encryption strength can be further increased.
  • the encryption means 13 performs a dark culture on each block of plaintext by a transposition process based on the following transposition rule (4).
  • FIG. 14 is an explanatory diagram showing a specific example of the transposition process based on the transposition rule (4). If the pseudo-random number sequence shown in FIG. 14 is interpreted in order from the first bit based on the transposition rule (4), bit positions 0 to 2 are consecutive. For this reason, bit positions 0 to 2 are specified as a group of exchange positions, as enclosed in FIG. Subsequently, bit position 5 of the pseudo-random number sequence is 1. Thus, bit position 5 is specified as the next exchange position.
  • bit position 7 and bit position 10 are each specified as an exchange position.
  • the exchange position in the bit string of the plaintext changes according to the pseudo-random number sequence, so that it is possible to obtain a ciphertext in which the characteristics due to the transposition process are eliminated.
  • the bit length of each exchange position to be transposed changes according to the pseudorandom number, so that the transposition process can be diversified and the encryption strength can be further increased.
  • a sixth embodiment of the secret communication system according to the present invention will be described.
  • a dark culture is performed on each block of plain text by a transposition process based on the following transposition rule (5).
  • Each random value of the pseudo-random number sequence is an integer value including 0 that is less than the bit length of the plain-text bit sequence, and the bit positions corresponding to each of the two random numbers from the beginning of the pseudo-random number sequence are written in plain text. It is specified as a set of exchange positions in the bit sequence of, and the bit value of each exchange position is exchanged.
  • FIG. 15 is an explanatory diagram showing a specific example of a pseudo-random number sequence used for performing transposition processing according to the transposition rule (5).
  • the plaintext is treated as a block having a length of 64 bits at bit positions 0 to 63, and accordingly, each random value of the pseudo-random number sequence is one of integer values of 0 to 63.
  • Each random value of the pseudo-random number sequence Indicates the bit position of the exchange position in the plaintext bit string. Then, the bit positions indicated by each of the two random numbers from the beginning of the pseudo-random number sequence are used as a set of exchange positions, and the m-th random number value of the pseudo-random number sequence is used for transposing the first block of the plaintext.
  • FIG. 16 is an explanatory diagram showing a specific example of the transposition processing according to the transposition rule (5).
  • the exchange of the first set of exchange positions specified by the pseudo-random number sequence in FIG. ) Is shown. That is, in the pseudo-random number sequence shown in FIG. 15, since the first random value is 6 and the second random value is 18, bit position 6 and bit position 18 are specified as a pair of exchange positions. Therefore, in the plaintext bit string, the bit value of S 6 at bit position 6 and the bit value of S i 8 at bit position 18 are exchanged.
  • the second block may be sequentially encrypted in the same manner for the third and subsequent blocks using the m + 1 to 2m-th random numbers of the pseudo-random sequence.
  • the exchange position in the bit string of the plaintext changes according to the pseudo-random number sequence, so that it is possible to obtain a sentence in which the characteristics resulting from the transposition process are eliminated.
  • the transposition rule (5) it is easy to set bit positions apart from each other in the plaintext bit string as a set of exchange positions, so that the transposition process is diversified and the encryption strength is further increased. be able to.
  • the present invention has been described with reference to the embodiment.
  • the confidential communication system according to the present invention is not limited to the above embodiment, and may be configured as follows.
  • transposition rules (1) to (5) are described, but the transposition rule is not limited to these. That is, any transposition rule can be adopted as long as a plurality of exchange positions can be uniquely specified for a plaintext bit string based on a pseudo-random number sequence.
  • the plaintext is divided into blocks of a predetermined bit length before the encryption process is performed. However, such blocking is not necessarily performed, and starting from the first bit of the plaintext bit string. You may encrypt sequentially.
  • the key information the feedback specification coefficients A Q to A k and the random number initial value that specify the procedure for generating the M sequence are used.However, if the information can specify the pseudo-random number sequence, Any information can be used.
  • the pseudo random number sequence generating means 11 and 21 included in the transmitting device 10 and the receiving device 20 are devices having the same configuration, but based on the key information. As long as the same pseudorandom numbers can be generated, pseudorandom number generation means 11 and 21 having an arbitrary configuration can be used.
  • a transposition process is performed on a plaintext bit string according to a pseudo-random number sequence as a secret communication system that transmits and receives data over a network in a secret state.
  • a pseudo-random number sequence as a secret communication system that transmits and receives data over a network in a secret state.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Storage Device Security (AREA)

Abstract

Cette invention se rapporte à un système de communications cryptées pour permettre la communication de données à l'état crypté. On prévoit à cet effet un dispositif de transmission et un dispositif de réception pourvus d'un générateur de séquence de nombres pseudoaléatoires, destiné à produire la même séquence de nombres pseudoaléatoires sur la base d'informations de code. Le dispositif de transmission interprète une séquence de nombres pseudoaléatoires sur la base d'une règle de transposition préétablie, afin de spécifier plusieurs positions d'échange pour un train de bits dans un texte normal; un texte chiffré étant préparé par échange des valeurs individuelles entre ces positions d'échange. Une telle règle de transposition est conçue par exemple pour que, dans une partie d'une séquence de nombres pseudoaléatoires où 1 ou 0 couvre au moins deux bits, le bit de tête et le bit de queue de chaque partie continue sont spécifiés comme un groupe de positions d'échange permettant l'échange des valeurs de bits entre elles.
PCT/JP2000/002554 1999-04-19 2000-04-19 Systeme de communications cryptees WO2000064096A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP11/147007 1999-04-19
JP14700799 1999-04-19

Publications (1)

Publication Number Publication Date
WO2000064096A1 true WO2000064096A1 (fr) 2000-10-26

Family

ID=15420461

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2000/002554 WO2000064096A1 (fr) 1999-04-19 2000-04-19 Systeme de communications cryptees

Country Status (1)

Country Link
WO (1) WO2000064096A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1193666A1 (fr) * 1999-01-28 2002-04-03 Yutaka Yasukura Procede pour assurer la securite d'informations electroniques
WO2007032070A1 (fr) * 2005-09-14 2007-03-22 Future Technology Institute Corporation Procédé de traitement de la protection de données, son dispositif, dispositif de traitement de données et dispositif de circuit
CN117459322A (zh) * 2023-12-22 2024-01-26 济南工程职业技术学院 基于物联网的计算机软件数据加密方法

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0486135A (ja) * 1990-07-30 1992-03-18 Sharp Corp 秘話装置

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0486135A (ja) * 1990-07-30 1992-03-18 Sharp Corp 秘話装置

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
STINSON D R, KYORITSU SHUPPAN, XX, XX, 1 January 1996 (1996-01-01), XX, pages 21 - 24, XP002946680 *
STINSON D R, KYORITSU SHUPPAN, XX, XX, 1 January 1996 (1996-01-01), XX, pages 69 - 72, XP002946681 *
STINSON D R, SAKURAI K: "ANGO RIRON NO KISO", KYORITSU SHUPPAN, XX, XX, 1 January 1996 (1996-01-01), XX, pages 19/20, XP002946679 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1193666A1 (fr) * 1999-01-28 2002-04-03 Yutaka Yasukura Procede pour assurer la securite d'informations electroniques
EP1193666A4 (fr) * 1999-01-28 2004-03-10 Yutaka Yasukura Procede pour assurer la securite d'informations electroniques
US6957349B1 (en) 1999-01-28 2005-10-18 Yutaka Yasukura Method for securing safety of electronic information
WO2007032070A1 (fr) * 2005-09-14 2007-03-22 Future Technology Institute Corporation Procédé de traitement de la protection de données, son dispositif, dispositif de traitement de données et dispositif de circuit
CN117459322A (zh) * 2023-12-22 2024-01-26 济南工程职业技术学院 基于物联网的计算机软件数据加密方法
CN117459322B (zh) * 2023-12-22 2024-03-08 济南工程职业技术学院 基于物联网的计算机软件数据加密方法

Similar Documents

Publication Publication Date Title
JP5402632B2 (ja) 共通鍵ブロック暗号化装置、共通鍵ブロック暗号化方法及びプログラム
JP3188940B2 (ja) 暗号化システム
JP4735644B2 (ja) メッセージ認証装置、メッセージ認証方法、メッセージ認証プログラムとその記録媒体
KR100657062B1 (ko) 정보 암호화 방법 및 이 방법을 실현하는 장치
US7221756B2 (en) Constructions of variable input length cryptographic primitives for high efficiency and high security
EP2197144A1 (fr) Procédés et dispositifs pour un mode de cryptage en chaînes
JP5141558B2 (ja) 共通鍵ブロック暗号化装置、その方法、そのプログラム、及び記録媒体
AU2003273688B2 (en) Method of generating a stream cipher using multiple keys
JPH0863097A (ja) データを暗号化するための対称暗号化方法およびシステム
JP4860708B2 (ja) ストリーム暗号方法および暗号システム
US8122075B2 (en) Pseudorandom number generator and encryption device using the same
JP2000511755A (ja) バイナリーコード情報を暗号化する方法
Robshaw Block ciphers
CN102713994B (zh) 加密装置
US6301361B1 (en) Encoding and decoding information using randomization with an alphabet of high dimensionality
WO2000064096A1 (fr) Systeme de communications cryptees
JP3358954B2 (ja) 擬似ランダムビット列生成器及びそれを使用する暗号通信方法
JP3358953B2 (ja) 擬似ランダムビット列生成器及びそれを使用する暗号通信方法
JPH1117673A (ja) 共通鍵暗号通信方法及びその通信ネットワーク
JP3154991B2 (ja) 暗号処理装置、暗号処理方法、及び、暗号処理プログラムを記憶した記憶媒体
JP5293612B2 (ja) 暗号化装置、復号装置、暗号化方法、復号方法およびプログラム
Hassan et al. NETWORK SECURITY BY BLOCK CIPHERS
RU2701128C1 (ru) Способ шифрования двоичной информации
JP3748184B2 (ja) 秘話通信装置
Lambooij et al. Cryptanalysis of Simon et al.

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): JP US

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 09719707

Country of ref document: US

122 Ep: pct application non-entry in european phase