WO2005073842A1 - 擬似乱数生成装置および擬似乱数生成プログラム - Google Patents
擬似乱数生成装置および擬似乱数生成プログラム Download PDFInfo
- Publication number
- WO2005073842A1 WO2005073842A1 PCT/JP2005/001211 JP2005001211W WO2005073842A1 WO 2005073842 A1 WO2005073842 A1 WO 2005073842A1 JP 2005001211 W JP2005001211 W JP 2005001211W WO 2005073842 A1 WO2005073842 A1 WO 2005073842A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- shift register
- feedback shift
- linear feedback
- polynomial
- primitive polynomial
- Prior art date
Links
- 238000000034 method Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 7
- 239000000284 extract Substances 0.000 description 3
- 239000000470 constituent Substances 0.000 description 2
- 230000007704 transition Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
- G06F7/582—Pseudo-random number generators
- G06F7/584—Pseudo-random number generators using finite field arithmetic, e.g. using a linear feedback shift register
Definitions
- the present invention relates to a pseudo-random number generation device and a pseudo-random number generation program for generating a pseudo random number used for cryptographic communication.
- Such encryption schemes include a common key encryption scheme and a public key encryption scheme, and are selected in accordance with the conditions of utilizing each feature. In either case, the security of the data transmitted by the encryption key is guaranteed, and the encryption key cannot be easily guessed.
- RU public key encryption scheme
- a pseudo-random number sequence having a long data length can be generated from a relatively short initial value for random number generation.
- a pseudorandom number generation device in which it is difficult to predict a generated pseudorandom number can be realized by combining a plurality of linear feedback shift registers each having a primitive polynomial satisfying a specific condition as a characteristic polynomial. I have. Further, even if the initial values are not shared, it is possible to generate the same pseudo-random number sequence by sharing the selection information of a plurality of linear feedback shift registers (for example, Japanese Patent Application Laid-Open No. H10-91066). reference).
- pseudo-random numbers are generated by a specific algorithm, and pseudo-random numbers that are subsequently generated may be inferred from initial values or a part of the generated pseudo-random number sequence. was there.
- the present invention provides a pseudo-random number generation device and a pseudo-random number generator suitable for cryptographic communication in which it is difficult to estimate a pseudo-random number sequence to be generated after observation of a generated pseudo-random number sequence and data to be transmitted and received.
- the purpose is to provide the program.
- an invention that generates a pseudorandom number sequence having a predetermined bit length, comprising: a m-stage shift register; A first linear feedback shift register that outputs a bit string having a bit length; a second linear feedback shift register having an n-stage shift register and outputs a bit string having a predetermined bit length; Generating an initial value of each of the shift registers constituting the first linear feedback shift register and the second linear feedback shift register, and converting the respective initial values to the first linear feedback shift register and the second linear feedback shift.
- An initial value generator for supplying a register, and the second linear feedback shift according to predetermined conditions.
- a polynomial coefficient generator for generating a coefficient of a characteristic polynomial of a register and supplying the coefficient to the second linear feedback shift register; a primitive polynomial as the characteristic polynomial of the first linear feedback shift register; and specifying the primitive polynomial.
- a primitive polynomial storage section for storing a plurality of pieces together with identification information, and one primitive polynomial stored in the primitive polynomial storage section is selected according to a predetermined condition, and the primitive polynomial is selected.
- a primitive polynomial selector for supplying a coefficient of a polynomial as a coefficient of a characteristic polynomial to the first linear feedback shift register; a bit string output from the first linear feedback shift register; and a second linear feedback shift register And a pseudo-random number output unit that generates and outputs a pseudo-random number sequence having a predetermined bit length from a logical operation of each bit based on the bit sequence output from.
- the pseudorandom number generation device includes identification information of the primitive polynomial selected by the primitive polynomial selector, Initial values of the shift registers constituting the first linear feedback shift register and the second linear feedback shift register generated by the generation unit, and the initial values of the coefficients of the characteristic polynomial generated by the polynomial coefficient generation unit
- the initial data is generated, the initial data is transmitted to another pseudo-random number generating device, and when the initial data is received from another pseudo-random number generating device, the initial data is generated from the initial data.
- the initial values of the feedback shift register and the second feedback shift register are extracted to obtain the first line.
- a feedback shift register and the second linear feedback shift register are supplied with the initial data, the coefficient of the characteristic polynomial is extracted and supplied to the second linear feedback shift register, and the primitive polynomial is extracted from the initial data.
- a communication unit that extracts identification information and supplies the identification information to the primitive polynomial selection unit, wherein the primitive polynomial selection unit is stored in the primitive polynomial storage unit based on the identification information extracted by the communication unit. The point is that one primitive polynomial is selected and the coefficients of the primitive polynomial are supplied to the first linear feedback shift register.
- an invention according to a third aspect is a pseudorandom number generation program executed by a computer for generating a pseudorandom number sequence having a predetermined bit length.
- the generation program includes a first linear feedback shift register having an m-stage shift register and outputting a bit sequence having a predetermined bit length, and an n-stage shift register having a shift register having an m-stage. And a second linear feedback shift register that outputs the first linear feedback shift register and the second linear feedback shift register that form the second linear feedback shift register according to predetermined conditions.
- Initial value generating means for generating an initial value and supplying each of the initial values to the first linear feedback shift register and the second linear feedback shift register; and A polynomial coefficient generating means for generating a coefficient of a characteristic polynomial of the shift register and supplying the coefficient to the second linear feedback shift register; a primitive polynomial as a characteristic polynomial of the first linear feedback shift register; A primitive polynomial storage means for storing a plurality of pieces together with identification information to be specified, and one primitive polynomial stored in the primitive polynomial storage means according to a predetermined condition, and a coefficient of the primitive polynomial as a coefficient of a characteristic polynomial.
- Primitive polynomial selection means for supplying to the first linear feedback shift register; Based on a bit string output from the first linear feedback shift register and a bit string output from the second linear feedback shift register, a pseudo-random number of a predetermined bit length is obtained from a logical operation of each bit.
- the gist is a pseudorandom number generation program that functions as a pseudorandom number output unit that generates and outputs a sequence.
- the pseudo random number generation program stores the identification information of the primitive polynomial selected by the primitive polynomial selecting means, An initial value of each shift register included in the first linear feedback shift register and the second linear feedback shift register generated by the value generation unit, and a coefficient of the characteristic polynomial generated by the polynomial coefficient generation unit. If the initial data is transmitted to another pseudorandom number generator and the initial data is received from another pseudorandom number generator, the first feedback is generated from the initial data. Each of a shift register and the second feedback shift register.
- An initial value is extracted and supplied to the first linear feedback shift register and the second linear feedback shift register, and the coefficient of the characteristic polynomial is extracted from the initial data to obtain the second linear feedback shift register.
- One of the primitive polynomials stored in the primitive polynomial storage means is selected based on the identification information.
- the gist is that the coefficients of the primitive polynomial are supplied to the first linear feedback shift register.
- FIG. 1 is a diagram illustrating a functional configuration of a pseudo-random number generation device according to a first embodiment.
- FIG. 2 is a diagram showing a circuit configuration of a first linear feedback shift register.
- FIG. 3 is a diagram showing a circuit configuration of a second linear feedback shift register.
- FIG. 4 is a flowchart showing a pseudo random number generation process according to the first embodiment.
- FIG. 5 is a diagram showing transition of values of a first linear feedback shift register and a second linear feedback shift register.
- FIG. 6 is a diagram showing a functional configuration of a pseudo-random number generation device according to a second embodiment.
- FIG. 7 is a flowchart showing a pseudo random number generation process according to the second embodiment.
- FIG. 8 is a diagram showing a functional configuration of a pseudorandom number generation device according to a third embodiment.
- FIG. 9 is a flowchart showing a pseudo random number generation process according to the third embodiment.
- bit length of the pseudo-random number generated by the pseudo-random number generation device 1 is h + 1.
- a pseudo-random number generator 1A includes a first linear feedback shift register 2, a second linear feedback shift register 3, an initial value generator 4, a polynomial coefficient generator 5, And a pseudo random number output unit 6.
- the first linear feedback shift register 2 is an m-th order linear feedback shift register, and has m flip-flop circuits (details will be described later). Also, the second linear (The details will be described later).
- the initial value generation unit 4 obtains using initial information input from the outside or predetermined conditions such as constantly changing information such as date and time information and physical phenomena such as thermal noise.
- the first linear feedback shift register 2 generates an initial value ia (ia, ia, ⁇ , ia, ia) of each flip-flop that composes the first linear feedback shift
- the polynomial coefficient generating unit 5 uses initial information input from the outside or predetermined conditions such as constantly changing information such as date and time information and physical phenomena such as thermal noise. S (s, s, s, s, s) of the characteristic polynomial of the second linear feedback shift register 3 in accordance with the condition obtained by the second linear feedback shift register 3.
- the pseudo-random number output unit 6 includes a bit string ra (ra, ra,..., Ra, ra) sequentially output from the first linear feedback shift register 2, and a second linear feedback shift register.
- the first linear feedback shift register 2 includes m flip-flop circuits, an AND circuit, and an X ⁇ R circuit.
- the characteristic polynomial of the first linear feedback shift register 2 is a predetermined primitive polynomial ax m + ax " 1 + ax m — 2 +
- the coefficient a (a, ⁇ ⁇ ⁇ , a) of the equation is set.
- the second linear feedback shift register 3 includes n flip-flop circuits, an AND circuit, and an X ⁇ R circuit. If the characteristic polynomial of the second linear feedback shift register 3 is bx n + bx " 1 + bx n — 2 +... + bx 2 + bx + b, A n n-1 n-2 2 1 0
- the initial value generation unit 1A When the pseudorandom number generation device 1A starts the pseudorandom number generation process, first, the initial value generation unit
- the polynomial coefficient generation unit 5 calculates the coefficients s (s, s, s, , S, s) (step S02), and the second linear feedback shift register nl n-2 2 1
- initial values ia ia, ia,
- FB,..., FB, FB are set to the initial ib (ib, ib,..., ib, ib), and each AND circuit Is set to the coefficient s (s, s,..., S, s) of the characteristic polynomial. Note that the second linear
- step S 04 when a clock signal is input to the first linear feedback shift register 2 (step S 04), the first linear feedback shift register 2 performs an operation and outputs a bit ra (step S 04).
- step S05 when a clock signal is input to the second linear feedback shift register 3 (step S06), the second linear feedback shift register 3 performs an operation and outputs bit rb.
- the first linear feedback shift register 2 and the second linear feedback shift register 3 increment the value of the counter k by one (k ⁇ k + l) (Step S09), and the value of the counter k Is determined (step S10). If the value of the counter k is equal to or smaller than h, the first linear feedback shift register 2 returns to step S04 and outputs bit ra, and the k + 1 second linear feedback shift register 3 returns to step S06 and outputs bit rb. Then pseudo k + 1
- the pseudo random number output unit 6 generates a bit r.
- the pseudorandom number generation device 1 ends the pseudorandom number generation process, and the bit r generated so far
- R, r are pseudorandom numbers r (r, r
- step S I 1 It is output as h-1 h (step S I 1).
- an 8-bit pseudorandom number r is output
- the primitive polynomial of the first linear feedback shift register 2 is x 7 + x 3 + l
- the flip-flop circuit of the first linear feedback shift register 2 is 7
- the initial value ib (ib, ib, ..., ib, ib) (1, 1, 1, 1, 0, 0, 0, 0)
- the first linear feedback shift register 2 In the bits shift to FA ⁇ FA, FA ⁇ FA, ⁇ , FA ⁇ FA (FA, FA, FA), FA
- the feedback shift register 2 outputs "0" as ra.
- the second linear feedback shift register 3 bit-counts FB ⁇ FB, FB ⁇ FB,... FB ⁇ FB (FB ⁇ FB). , FB, FB,
- Rb, rb, rb (1, 1, 1, 1, 1, 0, 0, 1) and outputs (ra, ra, ..., ra
- a pseudorandom number r (r, r, ⁇ ⁇ ⁇ , r, r) (l, 1, 1, 1, 0, 0, 1, 0) is output from the other logical sum.
- a pseudorandom number generator 1B includes a first linear feedback shift register 2, a second linear feedback shift register 3, an initial value generator 4, a polynomial coefficient generator 5, It has a pseudo-random number output unit 6, a primitive polynomial selection unit 7, and a primitive polynomial storage unit 8.
- the same components as those in the first embodiment are denoted by the same reference numerals, and detailed description thereof will be omitted.
- the primitive polynomial selection unit 7 selects one primitive polynomial stored in the primitive polynomial storage unit 8 according to initial information input from the outside, and as a characteristic polynomial, a coefficient a (a, ⁇ ⁇ , &) Are supplied to the first linear feedback shift register 2.
- the primitive polynomial storage unit 8 stores a plurality of primitive polynomials for setting each AND circuit of the first linear feedback shift register 2 together with identification information.
- a number can be used as identification information for specifying a primitive polynomial.
- it is referred to as an identification number.
- this identification number it is possible to set each AND circuit with a smaller amount of information than the coefficients of the primitive polynomial.
- the primitive polynomial storage unit 8 Identification number ⁇ . "00 ⁇ 7 + ⁇ 3 +1, identification number ⁇ .” 0 ⁇ ⁇ 7 + ⁇ 3 + ⁇ 2 + ⁇ + 1, identification number No.
- the primitive polynomial selection unit 7 selects one primitive polynomial from the primitive polynomial storage unit 8 according to initial information input from the outside. Select (step S21), and supply the selected coefficients of the primitive polynomial to the first linear feedback shift register 2 as the coefficients a (a,..., A) of the characteristic polynomial.
- the initial value generation unit 4 generates an initial value ia (ia, ia,..., Ia, ia) and an initial value ib (ib) in accordance with initial information input from the outside or predetermined conditions. , ib,
- Step S22 (Step S22), and supplies the respective initial values to the first linear feedback shift register 2 and the second linear feedback shift register 3.
- the polynomial coefficient generating unit 5 calculates the coefficients s (s, s, s, s, s, s, ⁇ ⁇ ⁇ , s, s) (Step S23) and supplies it to the second linear feedback shift register 3.
- the first linear feedback shift register 2 and the second linear feedback shift register 3 include a primitive polynomial selection unit 7, an initial value generation unit 4, and a polynomial coefficient generation unit 5.
- the initial value ia (ia, ia, ⁇ ⁇ ⁇ , ia, ia) is set to 0, and the primitive polynomial
- the coefficient a (a,..., A) of the characteristic polynomial supplied from the selection unit 7 is set. Also, the second line
- n-l n-2 10 is set to the initial value ib (ib, ib, ⁇ ⁇ ⁇ ,-, ib), and each AND circuit has a characteristic polynomial
- the coefficient s (s, s, ⁇ ⁇ ⁇ , s, s) is set. Note that the second linear feedback shift shift n-l n-2 2 1 in FIG.
- step S04 step S11
- step S25 step S25, step S32
- the coefficients of the characteristic polynomial in two pseudo-random number generators for example, the pseudo-random number generator 1 provided on the transmitting device side and the pseudo random number generating device 1 provided on the receiving device side
- the pseudo-random number generation device 1 C includes a first linear feedback shift register 2, a second linear feedback shift register 3, an initial value generation unit 4, a polynomial coefficient generation It has a unit 5, a pseudo-random number output unit 6, a primitive polynomial selection unit 7, a primitive polynomial storage unit 8, and a communication unit 9.
- the same components as those in the first embodiment and the second embodiment are denoted by the same reference numerals, and detailed description thereof will be omitted.
- the letter “t” is attached to the constituent elements of the pseudorandom number generator 1 on the initial data transmitting side, and the letter “r” is added to the constituent elements of the pseudorandom number generator 1 on the initial data receiving side. .
- the communication unit 9 includes an identification number of the primitive polynomial selected by the primitive polynomial selector 7, an initial value ia (ia, ia, ..., ia, ia) generated by the initial value generator 4, and an initial value ib (ib , ib, ⁇ ⁇ ⁇ , 3 ⁇ 4,
- nl n-2 2 1 contains the identification number of the primitive polynomial, the initial value of the coefficient of the characteristic polynomial, and that of each initial value. It has a function of generating initial data composed of each bit string, and a function of transmitting and receiving the initial data to and from another pseudo-random number generator 1.
- the initial value ib (ib, ib,..., Ib, ib) and the coefficient s (s, s,%) Of the characteristic polynomial are obtained from the initial data.
- the primitive polynomial selection unit 7t selects one primitive polynomial from the primitive polynomial storage unit 8t in accordance with externally input initial information.
- the coefficients of the selected primitive polynomial are supplied to the first linear feedback shift register 2t as the coefficients a (a, ..., a) of the characteristic polynomial and
- the initial value generation unit 4t generates an initial value ia (ia, ia, ..., ia, ia) and an initial value ib (ib) in accordance with initial information input from the outside or a predetermined condition. , ib,
- step S42 each initial value is stored in the first linear feedback shift register.
- the polynomial coefficient generation unit 5t calculates the coefficient s (s, s,%) Of the characteristic polynomial of the second linear feedback shift register 3t according to the initial information input from the outside or a predetermined condition. ⁇ ⁇ , s, s) (step S43), and the second linear feedback shift register n-1 n-2 2 1
- the coefficient a (a,..., A) of the characteristic polynomial supplied from the starting polynomial selector 7t is set.
- FB, FB are set to the initial ib (ib, ib,..., ib, ib), and each AND circuit is
- the coefficient s (s, s, ⁇ ⁇ ⁇ , s, s) of the characteristic polynomial is set. Note that the second linear feed shown in Fig. 3
- an arbitrary value may be set similarly to the other coefficients.
- the communication unit 9t generates initial data including the identification number of the primitive polynomial, the coefficient of the characteristic polynomial, and the bit value of each initial value, and transmits the initial data to the pseudorandom number generator lCr (step S45). .
- the communication unit 9t may encrypt and transmit the initial data by a predetermined encoding method.
- the identification number of the primitive polynomial is 2 bits ("10")
- the initial value ia is 7 bits (“1010101")
- the initial value ib is 8 bits ("11110000")
- the coefficient s of the characteristic polynomial is 7 If it is a bit (“0111011")
- the initial data is a 24-bit data system IK identification number I Initial value ia I Initial value ib
- the pseudorandom number generation device ICt operates according to the first embodiment (step S04,
- step S46 step S46
- the communication unit 9r of the pseudo-random number generator lCr receives the initial values ib (ib, ib,%) From the initial data.
- the initial value ia (ia, ia, ..., ia, ia) m-1 m-2 10 is extracted from the initial data, and supplied to the first linear feedback shift register 2r.
- the identification number of the primitive polynomial is extracted from, and supplied to the primitive polynomial selector 7r. If the received initial data is encoded, the communication unit 9 decodes the initial data to obtain the initial data.
- the primitive polynomial selection unit 7r selects one primitive polynomial corresponding to the identification number from the primitive polynomial storage unit 8r (step S53).
- the coefficient of the selected primitive polynomial is used as the characteristic polynomial coefficient a (a,
- the pseudorandom number generation device lCr outputs the pseudorandom number r (r, r,..., R, r) by performing the same processing as in the first embodiment (step S04 and step S11) (step S55).
- the pseudorandom number generation device 1 may be realized by causing a general-purpose computer to execute a pseudorandom number generation program describing the above functions.
- This pseudorandom number generation program may be read from a recording medium and executed by a general-purpose computer, or may be transmitted from the outside via a network and executed by a general-purpose computer.
- the present invention it is possible to always generate a pseudo-random number sequence having a period longer than a predetermined M sequence, and it is possible to arbitrarily set coefficients of a characteristic polynomial that is not limited to only initial values. Even if a random number sequence is observed, it is difficult to guess the pseudo-random number system IJ that will be generated thereafter, and the security of the generated pseudo-random number sequence can be ensured, and the security of the transmitted data is guaranteed. You. Unless the correspondence between the identification information and the primitive polynomial is weak, it is difficult to decipher the transmitted data.
- the selection of the primitive polynomial set as the characteristic polynomial of the first linear feedback shift register uses the identification information, so that a smaller amount of data is required than when the coefficient is transmitted and received. That is, if the identification information is smaller than the primitive polynomial, the information amount can be reduced.
Abstract
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2005517513A JPWO2005073842A1 (ja) | 2004-01-30 | 2005-01-28 | 擬似乱数生成装置および擬似乱数生成プログラム |
US10/587,753 US20070174374A1 (en) | 2004-01-30 | 2005-01-28 | Pseudorandom number generator and pseudorandom number generation program |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2004023335 | 2004-01-30 | ||
JP2004-023335 | 2004-01-30 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2005073842A1 true WO2005073842A1 (ja) | 2005-08-11 |
Family
ID=34823869
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2005/001211 WO2005073842A1 (ja) | 2004-01-30 | 2005-01-28 | 擬似乱数生成装置および擬似乱数生成プログラム |
Country Status (4)
Country | Link |
---|---|
US (1) | US20070174374A1 (ja) |
JP (1) | JPWO2005073842A1 (ja) |
CN (1) | CN100472430C (ja) |
WO (1) | WO2005073842A1 (ja) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010263776A (ja) * | 2009-04-10 | 2010-11-18 | Denso Corp | 車載モータの駆動制御方法 |
CN102565665A (zh) * | 2010-12-17 | 2012-07-11 | 炬力集成电路设计有限公司 | 一种电路检测装置及方法 |
JP2013243656A (ja) * | 2012-05-19 | 2013-12-05 | Freescale Semiconductor Inc | セキュアモジュールのための改ざん検出器 |
US9600237B2 (en) | 2014-04-16 | 2017-03-21 | Panasonic Intellectual Property Management Co., Ltd. | Random number processing apparatus and random number processing method |
WO2017150672A1 (ja) * | 2016-03-03 | 2017-09-08 | 国立大学法人京都大学 | 乱数発生装置、乱数発生方法及びコンピュータプログラム |
Families Citing this family (27)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4734089B2 (ja) * | 2005-10-27 | 2011-07-27 | 日立オートモティブシステムズ株式会社 | 車載端末 |
CN101127575B (zh) * | 2007-09-12 | 2010-09-01 | 中兴通讯股份有限公司 | 一种均匀分布随机数发生器及均匀分布随机数产生方法 |
JP5191727B2 (ja) * | 2007-12-21 | 2013-05-08 | 株式会社ジャパンディスプレイイースト | 表示装置 |
US8788552B2 (en) * | 2008-01-25 | 2014-07-22 | Tata Consultancy Services Ltd. | Deterministic random number generator for cryptography and digital watermarking |
KR101685173B1 (ko) * | 2009-07-13 | 2016-12-12 | 주식회사 팬택 | 무선통신 시스템에서의 시퀀스 생성 방법 및 그 장치 |
CN102025389B (zh) * | 2009-09-09 | 2014-06-11 | 中兴通讯股份有限公司 | 一种伪随机序列的生成方法及装置 |
US10635062B2 (en) * | 2010-06-29 | 2020-04-28 | International Business Machines Corporation | Systems and methods for highly parallel processing of parameterized simulations |
CN102707923A (zh) * | 2011-04-25 | 2012-10-03 | 中国电子科技集团公司第三十八研究所 | 一种伪随机数生成电路及伪随机数产生方法 |
US8832167B2 (en) * | 2011-07-21 | 2014-09-09 | Vixs Systems, Inc. | Random number generator |
CN102314332B (zh) * | 2011-07-27 | 2014-04-09 | 中国科学院计算机网络信息中心 | 伪随机数生成装置和方法 |
CN102495717A (zh) * | 2011-11-24 | 2012-06-13 | 安徽建筑工业学院 | 第一类非线性m子序列发生器 |
JP2014164342A (ja) * | 2013-02-21 | 2014-09-08 | Fujitsu Semiconductor Ltd | 擬似乱数生成回路および擬似乱数生成方法 |
US9201629B2 (en) | 2013-03-14 | 2015-12-01 | International Business Machines Corporation | Instruction for performing a pseudorandom number seed operation |
US8873750B2 (en) * | 2013-03-14 | 2014-10-28 | International Business Machines Corporation | Instruction for performing a pseudorandom number generate operation |
CN104579630A (zh) * | 2013-10-25 | 2015-04-29 | 上海华力创通半导体有限公司 | 系统随机数生成方法 |
CN104636115B (zh) * | 2013-11-14 | 2017-12-15 | 国家电网公司 | 一种真随机数后处理装置及方法 |
CN103645882A (zh) * | 2013-12-09 | 2014-03-19 | 中颖电子股份有限公司 | 基于单片机的批量乱序随机数的生成方法 |
CN105183428A (zh) * | 2015-08-12 | 2015-12-23 | 中国电子科技集团公司第四十一研究所 | 一种伪随机信号产生方法 |
CN105045561A (zh) * | 2015-08-12 | 2015-11-11 | 中国电子科技集团公司第四十一研究所 | 一种伪随机数产生方法 |
CN105138306A (zh) * | 2015-08-12 | 2015-12-09 | 中国电子科技集团公司第四十一研究所 | 一种数据位数可选的伪随机信号发生方法 |
CN105159652A (zh) * | 2015-08-12 | 2015-12-16 | 中国电子科技集团公司第四十一研究所 | 一种多通道伪随机信号发生方法 |
US10599796B2 (en) * | 2017-04-28 | 2020-03-24 | Taiwan Semiconductor Manufacturing Co., Ltd. | Metastable flip-flop based true random number generator (TRNG) structure and compiler for same |
WO2020218954A1 (en) * | 2019-04-23 | 2020-10-29 | Telefonaktiebolaget Lm Ericsson (Publ) | Network entities, methods, appartuses and communications networks for authenticating an event |
CN111262686A (zh) * | 2020-01-17 | 2020-06-09 | 通号万全信号设备有限公司 | 一种rssp-i安全通信的安全校验方法 |
CN111813374A (zh) * | 2020-07-01 | 2020-10-23 | 浙江三维利普维网络有限公司 | 基于dsp的伪随机序列的生成方法和装置、存储介质 |
CN115424391B (zh) * | 2022-07-20 | 2024-05-07 | 兰州大学 | 一种基于fpga的随机小数发生器及其生成方法 |
CN116382634B (zh) * | 2023-05-29 | 2023-08-08 | 牛芯半导体(深圳)有限公司 | 伪随机码生成电路、方法 |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS61141231A (ja) * | 1984-12-13 | 1986-06-28 | Sony Corp | 送信方式 |
JPH09179726A (ja) * | 1995-12-25 | 1997-07-11 | Nec Corp | 擬似乱数発生装置 |
JPH11234096A (ja) * | 1998-02-18 | 1999-08-27 | Fujitsu Ltd | 擬似雑音発生装置 |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4032764A (en) * | 1975-12-01 | 1977-06-28 | Savage John E | Means and method for generating permutations of a square |
US5258936A (en) * | 1992-08-05 | 1993-11-02 | Motorola, Inc. | Method and apparatus for generating pseudo-random numbers |
US5974443A (en) * | 1997-09-26 | 1999-10-26 | Intervoice Limited Partnership | Combined internet and data access system |
US6188714B1 (en) * | 1998-12-29 | 2001-02-13 | Texas Instruments Incorporated | Parallel M-sequence generator circuit |
US6353842B1 (en) * | 1999-11-23 | 2002-03-05 | Janusz Rajski | Method for synthesizing linear finite state machines |
-
2005
- 2005-01-28 WO PCT/JP2005/001211 patent/WO2005073842A1/ja active Application Filing
- 2005-01-28 US US10/587,753 patent/US20070174374A1/en not_active Abandoned
- 2005-01-28 JP JP2005517513A patent/JPWO2005073842A1/ja active Pending
- 2005-01-28 CN CNB2005800035315A patent/CN100472430C/zh not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS61141231A (ja) * | 1984-12-13 | 1986-06-28 | Sony Corp | 送信方式 |
JPH09179726A (ja) * | 1995-12-25 | 1997-07-11 | Nec Corp | 擬似乱数発生装置 |
JPH11234096A (ja) * | 1998-02-18 | 1999-08-27 | Fujitsu Ltd | 擬似雑音発生装置 |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2010263776A (ja) * | 2009-04-10 | 2010-11-18 | Denso Corp | 車載モータの駆動制御方法 |
CN102565665A (zh) * | 2010-12-17 | 2012-07-11 | 炬力集成电路设计有限公司 | 一种电路检测装置及方法 |
JP2013243656A (ja) * | 2012-05-19 | 2013-12-05 | Freescale Semiconductor Inc | セキュアモジュールのための改ざん検出器 |
US9600237B2 (en) | 2014-04-16 | 2017-03-21 | Panasonic Intellectual Property Management Co., Ltd. | Random number processing apparatus and random number processing method |
WO2017150672A1 (ja) * | 2016-03-03 | 2017-09-08 | 国立大学法人京都大学 | 乱数発生装置、乱数発生方法及びコンピュータプログラム |
JPWO2017150672A1 (ja) * | 2016-03-03 | 2018-12-27 | 国立大学法人京都大学 | 乱数発生装置、乱数発生方法及びコンピュータプログラム |
Also Published As
Publication number | Publication date |
---|---|
JPWO2005073842A1 (ja) | 2007-09-13 |
CN100472430C (zh) | 2009-03-25 |
CN1914590A (zh) | 2007-02-14 |
US20070174374A1 (en) | 2007-07-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2005073842A1 (ja) | 擬似乱数生成装置および擬似乱数生成プログラム | |
JP4905000B2 (ja) | 暗号処理装置、および暗号処理方法、並びにコンピュータ・プログラム | |
JP4828068B2 (ja) | コンピュータで効率的な線形フィードバック・シフト・レジスタ | |
JP5822970B2 (ja) | 擬似ランダム生成、データ暗号化、およびメッセージ暗号化ハッシングのための暗号化デバイス | |
JP4052480B2 (ja) | 疑似乱数発生方法、疑似乱数発生器、及び疑似乱数発生プログラム | |
EP0839418B1 (en) | Cryptographic method and apparatus for non-linearly merging a data block and a key | |
EP1225507B1 (en) | Pseudorandom number generating apparatus or encryption or decryption apparatus using the same | |
JP6406350B2 (ja) | 暗号処理装置、および暗号処理方法、並びにプログラム | |
JP2002366029A (ja) | Dpaに対して安全な暗号化 | |
JPH1153173A (ja) | 擬似乱数発生方法及び装置 | |
Lamba | Design and analysis of stream cipher for network security | |
US8122075B2 (en) | Pseudorandom number generator and encryption device using the same | |
JPH10240500A (ja) | 乱数生成装置及び方法、暗号化装置及び方法、復号装置及び方法、並びにストリーム暗号システム | |
Ghazi et al. | Robust and Efficient Dynamic Stream Cipher Cryptosystem | |
JP4470135B2 (ja) | 擬似乱数生成システム | |
JP4857230B2 (ja) | 疑似乱数生成装置及びそれを用いた暗号化処理装置 | |
JP3358953B2 (ja) | 擬似ランダムビット列生成器及びそれを使用する暗号通信方法 | |
JP3358954B2 (ja) | 擬似ランダムビット列生成器及びそれを使用する暗号通信方法 | |
JPH1117673A (ja) | 共通鍵暗号通信方法及びその通信ネットワーク | |
KR101076747B1 (ko) | 스트림 모듈의 계층적 트리 구조를 통한 무작위 접근이 가능한 암호화/복호화 방법 및 장치 | |
WO2009104827A1 (en) | Method and apparatus for generating key stream for stream cipher, s-box for block cipher and method for substituting input vector using the s-box | |
Bajaj et al. | Enhancement of RC5 for image encryption | |
KR100497130B1 (ko) | 이진코드정보의암호화방법 | |
KR100226867B1 (ko) | 무선 통신의 스트림 암호 시스템 | |
RU2239290C2 (ru) | Способ поточного шифрования данных |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DPEN | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed from 20040101) | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2007174374 Country of ref document: US Ref document number: 200580003531.5 Country of ref document: CN Ref document number: 2005517513 Country of ref document: JP Ref document number: 10587753 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWW | Wipo information: withdrawn in national office |
Country of ref document: DE |
|
122 | Ep: pct application non-entry in european phase | ||
WWP | Wipo information: published in national office |
Ref document number: 10587753 Country of ref document: US |