+

WO2018016015A1 - Dispositif de génération de code d'étalement, programme de génération de code d'étalement et procédé de génération de code d'étalement - Google Patents

Dispositif de génération de code d'étalement, programme de génération de code d'étalement et procédé de génération de code d'étalement Download PDF

Info

Publication number
WO2018016015A1
WO2018016015A1 PCT/JP2016/071203 JP2016071203W WO2018016015A1 WO 2018016015 A1 WO2018016015 A1 WO 2018016015A1 JP 2016071203 W JP2016071203 W JP 2016071203W WO 2018016015 A1 WO2018016015 A1 WO 2018016015A1
Authority
WO
WIPO (PCT)
Prior art keywords
spreading code
ctr
unit
increment
code generation
Prior art date
Application number
PCT/JP2016/071203
Other languages
English (en)
Japanese (ja)
Inventor
亨 反町
Original Assignee
三菱電機株式会社
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 三菱電機株式会社 filed Critical 三菱電機株式会社
Priority to JP2016569864A priority Critical patent/JPWO2018016015A1/ja
Priority to PCT/JP2016/071203 priority patent/WO2018016015A1/fr
Publication of WO2018016015A1 publication Critical patent/WO2018016015A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09C—CIPHERING OR DECIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHER PURPOSES INVOLVING THE NEED FOR SECRECY
    • G09C1/00—Apparatus or methods whereby a given sequence of signs, e.g. an intelligible text, is transformed into an unintelligible sequence of signs by transposing the signs or groups of signs or by replacing them by others according to a predetermined system
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/10—Code generation

Definitions

  • the present invention relates to a spread code generation device, a spread code generation program, and a spread code generation method.
  • the direct spreading method by using a code sequence, it can be expected that the signal to be transmitted has a characteristic such that it spreads over a wide band and looks like noise. This characteristic makes it difficult to intercept a signal to be transmitted, improves jamming resistance, and prevents interference with narrowband signals. Therefore, the direct spreading code plays an important role in order to realize reliable and safe transmission that does not cause interference with other signals.
  • Patent Document 1 discloses a method using a chaotic sequence as a means for improving confidentiality.
  • Patent Document 1 proposes a method of generating a chaotic spreading code having autocorrelation characteristics and cross-correlation characteristics suitable for satellite navigation systems and CDMA (Code Division Multiple Access) communication systems.
  • Patent Document 1 states that confidentiality is improved as compared with a conventional spreading code.
  • confidentiality is improved as compared with a conventional spreading code.
  • the secrecy of the spreading code based on the chaotic sequence randomness indicating pseudo-randomness is shown, but strict security using an analysis technique of a general encryption technique is not shown.
  • Patent Document 1 does not show effective means for establishing synchronization.
  • Patent Documents 2 to 7 disclose a method for improving confidentiality using a chaotic sequence, but no effective means for establishing synchronization of the chaotic sequence is shown.
  • An object of the present invention is to provide a spreading code generation method that does not require a dedicated calculation function and a derivation time for deriving a spreading code sequence after a certain period of time.
  • the spreading code generator of the present invention In a spread code generation device that generates a spread code used for communication, A counter unit that generates a plurality of increment values in which the initial value is incremented by incrementing the initial value as a counter multiple times; And an encryption unit that generates a spreading code from each increment value by encrypting each increment value with an encryption algorithm using a secret key.
  • the spread code generation apparatus of the present invention includes the initial value calculation unit and the spread code generation unit, a spread code that does not require a dedicated calculation function for deriving a spread code sequence after a lapse of a fixed time and a derivation time.
  • a generation device can be provided.
  • FIG. 3 is a diagram of the first embodiment, showing a configuration of a spread code generating apparatus 100.
  • FIG. 3 is a diagram for explaining spreading code 15 in the first embodiment.
  • FIG. 3 is a flowchart for explaining the operation outline of the spread code generating apparatus 100 in the first embodiment.
  • the figure of Embodiment 1 is a figure explaining the initial value after time t.
  • the figure of Embodiment 1 is a figure which shows the structure with which the spreading code production
  • FIG. 3 is a diagram illustrating the general CTR mode in the first embodiment.
  • FIG. 6 is a diagram of the first embodiment, showing a spreading code system of a comparative example with respect to FIG.
  • the figure of Embodiment 1 is a figure which shows the modification 1.
  • FIG. The figure of Embodiment 1 is a figure which shows the modification 2.
  • FIG. FIG. 9 is a diagram of the first embodiment and illustrates a third modification.
  • FIG. 1 is a diagram illustrating the configuration of the spread code generating apparatus 100.
  • the spread code generating apparatus 100 is a computer.
  • the spread code generating apparatus 100 includes hardware such as a processor 910, a storage device 920, and an input interface 930 (hereinafter referred to as an input IF 930).
  • the storage device 920 includes an auxiliary storage device 921 and a memory 922.
  • the spreading code generation device 100 includes, as functional configurations, an initial value calculation unit 10 that is a counter unit 91, a spreading code generation unit 20 that is an encryption unit 92, an acquisition unit 30, and an output unit 40.
  • the functions of the initial value calculation unit 10, the spread code generation unit 20, the acquisition unit 30, and the output unit 40 in the spread code generation apparatus 100 are referred to as “part functions” of the spread code generation apparatus 100.
  • the “function of unit” of the spread code generating apparatus 100 is realized by software.
  • the auxiliary storage device 921 stores a program 14 for realizing the “function of part”.
  • the program 14 is loaded into the memory 922, read into the processor 910, and executed by the processor 910.
  • the auxiliary storage device 921 also stores an OS (Operating System). At least a part of the OS is loaded into the memory 922, and the processor 910 executes a program that realizes the “function of the unit” while executing the OS.
  • OS Operating System
  • the input IF 930 is a port through which data is input.
  • the input IF 930 may be a port connected to an input device such as a mouse, a keyboard, or a touch panel.
  • the input IF 930 is a USB (Universal / Serial / Bus) terminal.
  • the input IF 930 may be a port connected to a LAN (Local / Area / Network).
  • FIG. 2 is a diagram for explaining the spread code 15.
  • FIG. 2A shows data that is spread by the direct spreading method.
  • FIG. 2B shows the spread code 15.
  • (C) of FIG. 2 is an XOR (exclusive or) of the data of (a) and the spread code 15 of (b).
  • the data is spread to a wide frequency by XOR with the spread code 15.
  • FIG. 3 is a flowchart showing an outline of the operation of the spread code generating apparatus 100.
  • the input IF 930 receives as input data an initial value 11 for generating the spread code 15, a communication start time 12, and a secret key 13 that is secret information. Detailed description of the initial value 11 and the like will be described later.
  • the acquisition unit 30 of the processor 910 stores the initial value 11 and the like input to the input IF 930 in the auxiliary storage device 921.
  • step S02 the acquisition unit 30 loads the initial value 11, the start time 12, and the secret key 13 stored in the auxiliary storage device 921 into the memory 922.
  • the acquisition unit 30 reads the initial value 11 and the like from the memory 922, transmits the initial value 11 and the start time 12 to the initial value calculation unit 10, and transmits the secret key 13 to the spreading code generation unit 20.
  • step S03 the initial value calculation unit 10 generates an “initial value after time t” from the received initial value 11.
  • the “initial value after time t” will be described below.
  • the initial value calculation unit 10 generates a plurality of increment values obtained by incrementing the initial value 11 by incrementing the initial value 11 a plurality of times using the initial value 11 as a counter.
  • the increment value is CTR + i described later.
  • FIG. 4 is a diagram for explaining the “initial value after time t”.
  • simple numerical values are used for explanation.
  • the horizontal axis is time.
  • the start time 12 indicates the communication start time.
  • the time zone for communication is 1 second.
  • the time ⁇ t is a partial time zone of 1 second, which is a communication time zone.
  • the partial time zone is a time zone in which the communication time zone is divided. An “initial value” is required for each ⁇ t.
  • the first ⁇ t is CTR + 1
  • the second ⁇ t is CTR + 2
  • ... 10 4 ⁇ 1 is CTR + (10 4 ⁇ 1)
  • 10 4th is CTR + 10 4
  • t Becomes the “initial value after time t”.
  • CTR + 1 is an initial value after zero microseconds from the start time of 12
  • CTR + 2 is the initial value after 100 ⁇ s from the start time of 12
  • CTR + (10 4 ⁇ 1) is an initial value after “1 second ⁇ 200 ⁇ sec”
  • CTR + 10 4 is the initial value after "1 seconds -100 ⁇ second”.
  • the spread code generation unit 20 can generate the spread code 15 from the initial value (CTR + i) after each t time.
  • each increment value (CTR + i) of the plurality of increment values corresponds to a plurality of different partial time zones included in the time zone in which communication is performed.
  • the spread code generation unit 20 receives the CTR + i that is the initial value after time t from the initial value calculation unit 10 and generates the spread code 15 using the CTR + i.
  • FIG. 5 shows a configuration in which the spread code generation unit 20 includes a CTR mode unit 21A that uses the CTR mode of the nbit block cipher algorithm.
  • FIG. 6 shows a general CTR mode.
  • the CTR mode of the present embodiment corresponds to a portion indicated by a broken line frame 6 in FIG. That CTR mode portion 21A, which will be described later CTR mode portion 21B-j, CTR mode portion 21C-j, CTR mode unit 21D performs the encryption process E K frame 6.
  • the encrypted data E K (CTR + i) corresponds to the spread code 15 and the plaintext block Mi corresponds to the data to be spread.
  • an nbit random data string can be generated by inputting an initial value as a counter (CTR) to a block cipher algorithm and inputting secret information as a secret key. Then, when CTR + 1 obtained by incrementing CTR by 1 bit is input to the block cipher algorithm, random data of the next different n bits can be generated.
  • CTR counter
  • the CTR that is the initial value 11 is nbit.
  • the CTR mode unit 21A generates nbit random data by block encryption algorithm using CTR + i as input data.
  • the n-bit spread code 15 is represented as ⁇ SCn>.
  • An arrow from “CTR + 1” to ⁇ SCn> indicates that ⁇ SCn> is generated from CTR + 1.
  • CTR + 2 n is the same.
  • the CTR mode unit 21A can generate the first ⁇ SCn> from CTR + 1, and similarly can generate ⁇ SCn> corresponding to CTR + 2n from CTR + 2. Therefore,“ nbit. ⁇ 2 n ”random data can be used as the spreading code 15.
  • the CTR mode unit 21A encrypts each increment value with an encryption algorithm that uses a secret key, thereby generating a spread code from each increment value.
  • the output unit 40 acquires the spread code 15 generated by the spread code generation unit 20, and outputs it as the spread code 15 for performing direct spreading in the communication system.
  • the cycle (number of bits) of the spreading code depends on the block size of the block cipher algorithm employed in the CTR mode unit 21A of the spreading code generation unit 20. It is determined. That is, the number of bits of the spread code 15 obtained from one CTR + i is determined by the block size of the block cipher algorithm employed in the CTR mode unit 21A.
  • FIG. 7 is a diagram showing a spreading code system of a comparative example with respect to FIG.
  • a dedicated arithmetic function for generating “initial value after time t” is necessary. Since this dedicated calculation function uses a dedicated derivation logic, it has been necessary to spend considerable derivation time to generate the “initial value after time t”.
  • the initial value calculation unit 10 in order to derive the “initial value after time t”, the initial value calculation unit 10 only needs to increment the CTR, so a dedicated calculation function is unnecessary. Furthermore, a synchronization acquisition function for acquiring synchronization and a pilot sequence for acquisition are unnecessary.
  • the transmission apparatus may transmit communication start information indicating the communication start time to the reception apparatus.
  • the start time 12 is an example of communication start information.
  • the spreading code generation apparatus 100 in FIG. 5 does not require the following (a), (b), and (c) that are required in the spreading code system of the comparative example in FIG. (A) Dedicated calculation function for calculating “initial value after time t”; (B) synchronization acquisition function; (C) Pilot code sequence Even if the spreading code generation apparatus 100 does not include (a), (b), and (c), the safety of the entire system can be ensured.
  • Modifications 1 to 3 described below are configurations of the spread code generation unit 20 when it is desired to further increase the period of the spread code 15 (when it is desired to increase the number of bits of the spread code 15).
  • FIG. 8 is a diagram illustrating a configuration of the spread code generation unit 20B of the first modification.
  • the configuration of the initial value calculation unit 10 is the same as that in FIG.
  • the mbit spread code 15 is represented as ⁇ SCm>.
  • CTR mode unit 21B-1 to CTR mode unit 21B-J generate ⁇ SCm> 1 to ⁇ SCm> J, which are mbit spread codes 15, respectively.
  • An arrow pointing from CTR + 1 to a frame surrounding ⁇ SCm> 1 to ⁇ SCm> J indicates that ⁇ SCm> 1 to ⁇ SCm> J are generated from CTR + 1.
  • CTR + 2 m the connecting part 23 connects ⁇ SCm> 1 to ⁇ SCm> J, so that it is possible to generate the spread code 15 in which mbit ⁇ J are connected.
  • CTR mode unit 21B-1 to CTR mode unit 21B-J generate the following different ⁇ SCm> 1 to ⁇ SCm> J.
  • Modification 1 is advantageous in terms of processing performance because J block cipher algorithms can be processed in parallel.
  • the CTR mode unit 21B-1 to CTR mode unit 21B-J are all sub-encryption units. As described above, each of the CTR mode unit 21B-1 to CTR mode unit 21B-J is an encryption algorithm using a secret key different from the secret key used in the other sub cipher unit, and other sub cipher units. A spreading code is generated from the same increment value by encrypting the same increment value.
  • FIG. 9 is a diagram illustrating a configuration of a spread code generation unit 20C according to the second modification.
  • the configuration of the initial value calculation unit 10 is the same as that in FIG.
  • the CTR mode unit 21C-1 performs an mbit block cipher algorithm calculation using the secret key K1 with CTR + 1 transmitted by the initial value calculation unit 10 as input data.
  • the calculation result of the CTR mode unit 21C-1 is input to the CTR mode unit 21C-2.
  • the CTR mode unit 21C-2 performs an mbit block cipher algorithm calculation using the secret key K2.
  • the CTR mode unit 21C-j 3,..., J) receives the calculation result of the preceding CTR mode unit 21C- (j ⁇ 1), and the CTR mode unit 21C-j
  • the mbit block cipher algorithm is calculated using the secret key Kj.
  • CTR mode unit 21C-1 to CTR mode unit 21C-J generate ⁇ SCm> 1 to ⁇ SCm> J, which are mbit spread codes 15, respectively.
  • An arrow pointing from CTR + 1 to a frame surrounding ⁇ SCm> 1 to ⁇ SCm> J indicates that ⁇ SCm> 1 to ⁇ SCm> J are generated from CTR + 1.
  • CTR + 2 m When the connecting portion 23 connects ⁇ SCm> 1 to ⁇ SCm> J, it is possible to generate a spread code 15 in which mbit ⁇ J are connected. The same applies to CTR + 2 and later.
  • the CTR mode unit 21C-1 to CTR mode unit 21C-J are all sub-encryption units. As described above, each of the CTR mode unit 21C-1 to CTR mode unit 21C-J is an encryption algorithm that uses a secret key different from the secret key used in other sub-encryption units when data is acquired. Then, by encrypting the acquired data, a spreading code is generated from the data.
  • the CTR mode unit 21C-1 is a first sub-encryption unit 93 having the first connection order among the plurality of sub-encryption units.
  • the CTR mode unit 21C-1 which is the first sub-encryption unit 93, acquires an increment value as data, encrypts the increment value, and generates a spread code 15 from the increment value.
  • the sub cipher units (CTR mode units 21C-2, 21C-3... 21C-J) whose connection order is higher than that of the first sub cipher unit 93 are the sub cipher units immediately preceding the higher connection order as data. Is obtained, and the obtained spreading code is encrypted to generate a spreading code different from the obtained spreading code.
  • Modification 2 is a case where the block encryption algorithm is used in series.
  • J block cipher algorithms cannot be processed in parallel.
  • the data input to each block cipher algorithm is affected by the calculation result of the previous block cipher algorithm. Therefore, the modification 2 is a structure advantageous to safety.
  • each of CTR mode unit 21C-1 to CTR mode unit 21C-J uses a different secret key, but the same secret key may be used. That is, it is most preferable that each CTR mode unit 21C-j uses a different secret key, but there may be a CTR mode unit 21C that uses the same secret key in the CTR mode unit 21C-j.
  • FIG. 10 is a diagram illustrating a configuration of the spread code generation unit 20D of the third modification.
  • the configuration of the initial value calculation unit 10 is the same as that in FIG.
  • the spreading code generation unit 20 includes a CTR mode unit 21D and a key increment unit 22D.
  • the CTR mode unit 21D has the same function as the CTR mode unit 21A.
  • the spread code generation unit 20D inputs the secret key K as secret information.
  • the CTR mode unit 21D uses the secret key K to perform an mbit block encryption algorithm. As shown in FIG. 10, similarly to the CTR mode portion 21A of FIG. 5, CTR mode unit 21D uses the secret key K, from CTR + 1 ⁇ CTR + 2 m , a spreading code 15 of mbit, the 2 m pieces ⁇ SCm> is generated. The arrow from CTR + 1 to ⁇ SCm> 1 indicates that ⁇ SCm> 1 was generated from CTR + 1. The same applies to CTR + 2 m .
  • the key increment unit 22D increments the secret key K by 1 bit to generate a secret key K + 1.
  • the initial value calculation unit 10 again inputs CTR + 1 to CTR + 2 m to the CTR mode unit 21D.
  • the CTR mode unit 21D uses the secret key K + 1 to generate 2 m ⁇ SCm>, which are mbit spread codes 15, from CTR + 1 to CTR + 2 m .
  • 2 m ⁇ SCm> can be generated for each secret key. Therefore, 2 m ⁇ SCm> can be generated.
  • Modified example 3 is a case where the value of the secret key K is counted up when the CTR uses all the cycles of the block cipher algorithm.
  • the modification 3 is a structure advantageous as a mounting size.
  • the CTR mode unit 21D encrypts each increment value (CTR + i) encrypted using the secret key K for the encryption algorithm by using an increment key such as the secret key K + 1 for the encryption algorithm.
  • a spreading code is generated from each increment value.
  • the spread code generating apparatus 100 includes an initial value calculation unit 10 that is a counter unit 91.
  • the initial value calculation unit 10 increments CTR in order to derive CTR + i, which is an initial value after time t. That is, the initial value after time t is calculated by incrementing CTR. Therefore, the “dedicated calculation function for calculating the initial value after t time” which requires a lot of processing is unnecessary, and this time is shortened to the extent that the time required for calculating the “initial value after t time” is unnecessary.
  • the transmission source device communicates communication start information such as a start start time such as 10 minutes later or a start start time such as 13:14:15 to the transmission destination device.
  • Communication can be synchronized. Thus, synchronization can be achieved with simple processing.
  • the spreading code generation apparatus 100 includes the initial value calculation unit 10 and the spreading code generation unit 20, a pilot code sequence is unnecessary.
  • the long-period spread code 15 can be generated by the initial value calculation unit 10 and the spread code generation unit 20, and the encryption algorithm that has been confirmed to be safe can be used. High spreading codes can be generated.
  • FIG. 11 is a diagram showing the processing circuit 99.
  • the “part function” of the spreading code generation apparatus 100 is realized by software, but as a modification, the spreading code generation apparatus 100 “function of part” may be realized by hardware. That is, the processing circuit 99 implements the “function of the unit” of the spreading code generation device 100 shown as the processor 910 and the function of the storage device 920. The processing circuit 99 is connected to the signal line 99a.
  • the processing circuit 99 is a dedicated electronic circuit that realizes the “function of the unit” of the spreading code generation apparatus 100 and the function of the storage device 920.
  • the processing circuit 99 includes a single circuit, a composite circuit, a programmed processor, a processor programmed in parallel, a logic IC, a GA (Gate Array), an ASIC (Application Specific Integrated Circuit), or FPGA (Field-Programmable / Gate / Array).
  • the spreading code generation apparatus 100 may include a plurality of processing circuits that replace the processing circuit 99. By these plural processing circuits, the “function of unit” of the spread code generating apparatus 100 is realized as a whole.
  • Each processing circuit like the processing circuit 99, is a dedicated electronic circuit.
  • the function of the spread code generating apparatus 100 may be realized by a combination of software and hardware.
  • some functions of the spread code generating apparatus 100 may be realized by dedicated hardware, and the remaining functions may be realized by software.
  • the processor 910, the storage device 920, and the processing circuit 99 are collectively referred to as a “processing circuit”. That is, the “unit function” and the storage device 920 of the spread code generating apparatus 100 are realized by a processing circuit.
  • Part may be read as “Process”, “Procedure” or “Process”. Further, the function of “unit” may be realized by firmware. That is, the operation of the spread code generation apparatus 100 can be grasped as a spread code generation program and a spread code generation method. Further, the “function of part” can also be realized as a recording medium and a program product for storing a spread code generation program.
  • the spread code is generated from 2 n increment values CTR + 1 to CTR + 2n obtained from 2 n increments.
  • CTR + 2 n returns to the value of CTR.
  • CTR initial value
  • Embodiment 1 of this invention was demonstrated, the content demonstrated in Embodiment 1 may be implemented partially, or may be implemented in combination. In addition, this invention is not limited to Embodiment 1, A various change is possible as needed.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Storage Device Security (AREA)

Abstract

L'invention concerne un dispositif de génération de code d'étalement (100) qui génère un code d'étalement (15) utilisé dans des communications. Une unité arithmétique de valeur par défaut (10) qui sert d'unité compteur (91) génère une pluralité de valeurs d'incrément par incrémentation de la valeur par défaut (11) une pluralité de fois en tant que compteur. Une unité de génération de code d'étalement (20) qui sert d'unité de chiffrement (92) génère le code d'étalement (15) à partir de chaque valeur d'incrément par chiffrement de chaque valeur d'incrément à l'aide d'un algorithme de chiffrement qui utilise une clé secrète (13).
PCT/JP2016/071203 2016-07-20 2016-07-20 Dispositif de génération de code d'étalement, programme de génération de code d'étalement et procédé de génération de code d'étalement WO2018016015A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2016569864A JPWO2018016015A1 (ja) 2016-07-20 2016-07-20 拡散符号生成装置、拡散符号生成プログラム及び拡散符号生成方法
PCT/JP2016/071203 WO2018016015A1 (fr) 2016-07-20 2016-07-20 Dispositif de génération de code d'étalement, programme de génération de code d'étalement et procédé de génération de code d'étalement

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2016/071203 WO2018016015A1 (fr) 2016-07-20 2016-07-20 Dispositif de génération de code d'étalement, programme de génération de code d'étalement et procédé de génération de code d'étalement

Publications (1)

Publication Number Publication Date
WO2018016015A1 true WO2018016015A1 (fr) 2018-01-25

Family

ID=60992356

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2016/071203 WO2018016015A1 (fr) 2016-07-20 2016-07-20 Dispositif de génération de code d'étalement, programme de génération de code d'étalement et procédé de génération de code d'étalement

Country Status (2)

Country Link
JP (1) JPWO2018016015A1 (fr)
WO (1) WO2018016015A1 (fr)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH1022994A (ja) * 1996-07-04 1998-01-23 Hitachi Ltd 暗号化装置および復号化装置、暗号化方法および復号化方法、ならびにそれらを用いた通信システム
JP2012151805A (ja) * 2011-01-21 2012-08-09 Sharp Corp データ暗号化装置、及び、メモリカード

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH1022994A (ja) * 1996-07-04 1998-01-23 Hitachi Ltd 暗号化装置および復号化装置、暗号化方法および復号化方法、ならびにそれらを用いた通信システム
JP2012151805A (ja) * 2011-01-21 2012-08-09 Sharp Corp データ暗号化装置、及び、メモリカード

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
HENRI GILBERT: "The Security of ''One-Block-to-Many"", MODES OF OPERATION , LNCS, FAST SOFTWARE ENCRYPTION, vol. 2887, 24 February 2003 (2003-02-24), pages 376 - 395, XP055602412 *
SATO, MOTOKI ET AL.: "Study on the Parallel Chaotic Cipher", IEICE TECHNICAL REPORT, vol. 110, no. 387, 17 January 2011 (2011-01-17), pages 205 - 210 *

Also Published As

Publication number Publication date
JPWO2018016015A1 (ja) 2018-07-19

Similar Documents

Publication Publication Date Title
US5048086A (en) Encryption system based on chaos theory
EP1873671B1 (fr) Procédé de protection de cartes à puce contre les attaques d'analyse de puissance
JP6557727B2 (ja) メッセージを暗号化／復号化するためのブロック暗号方法及びこの方法を実施するための暗号装置
KR100296958B1 (ko) 블록 데이터 암호화 장치
JP2002366029A (ja) Ｄｐａに対して安全な暗号化
Bogdanov Attacks on the KeeLoq block cipher and authentication systems
JPH04234083A (ja) 擬似ランダム信号の保護方法
KR102169369B1 (ko) 경량 블록 암호화에 대한 1차 부채널 공격에 대응하는 방법 및 이를 이용한 장치
EP3667647B1 (fr) Dispositif de chiffrement, procédé de chiffrement, dispositif de déchiffrement et procédé de déchiffrement
JP2017187724A (ja) 暗号化装置、暗号化方法、復号化装置、及び復号化方法
JP2000511755A (ja) バイナリーコード情報を暗号化する方法
KR20050022623A (ko) 자체 오류 감지 기능을 강화한 상호 의존적 병렬 연산방식의 하드웨어 암호화 장치 및 그 하드웨어 암호화 방법
JP6287785B2 (ja) 暗号処理装置、および暗号処理方法、並びにプログラム
Dutta et al. Lightweight polymorphic encryption for the data associated with constrained internet of things devices
US11269993B2 (en) Encryption device, encryption method, decryption device, and decryption method
Pandian et al. Dynamic Hash key‐based stream cipher for secure transmission of real time ECG signal
Alshammari Comparison of a chaotic cryptosystem with other cryptography systems
Chernenko et al. Encryption Method for Systems with Limited Computing Resources
KR20060011999A (ko) Ｄｅｓ 알고리즘에 의거한 암호화 기법
WO2018016015A1 (fr) Dispositif de génération de code d'étalement, programme de génération de code d'étalement et procédé de génération de code d'étalement
JP2006025366A (ja) 暗号化装置及び半導体集積回路
EP3618344B1 (fr) Dispositif de génération de code, procédé de génération de code et programme de génération de code
Wang Using secret spreading codes to enhance physical layer security in wireless communication
RU2186467C2 (ru) Способ блочного итеративного шифрования
CN214175074U (zh) 一种并行真随机数发生器及其载体

Legal Events

Date Code Title Description
ENP Entry into the national phase

Ref document number: 2016569864

Country of ref document: JP

Kind code of ref document: A

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16909490

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16909490

Country of ref document: EP

Kind code of ref document: A1

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载