EP0097997A2 - Procédé de génération d'une séquence pseudo-aléatoire de signes avec une grande longueur de séquence - Google Patents

Procédé de génération d'une séquence pseudo-aléatoire de signes avec une grande longueur de séquence Download PDF

Info

Publication number
EP0097997A2
EP0097997A2 EP83200895A EP83200895A EP0097997A2 EP 0097997 A2 EP0097997 A2 EP 0097997A2 EP 83200895 A EP83200895 A EP 83200895A EP 83200895 A EP83200895 A EP 83200895A EP 0097997 A2 EP0097997 A2 EP 0097997A2
Authority
EP
European Patent Office
Prior art keywords
random
sequence
pseudo
signs
generating
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP83200895A
Other languages
German (de)
English (en)
Other versions
EP0097997A3 (en
EP0097997B1 (fr
Inventor
Antonius Cornelis Johannes Van Den Ende
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Koninklijke Philips NV
Original Assignee
Philips Gloeilampenfabrieken NV
Koninklijke Philips Electronics NV
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 Philips Gloeilampenfabrieken NV, Koninklijke Philips Electronics NV filed Critical Philips Gloeilampenfabrieken NV
Publication of EP0097997A2 publication Critical patent/EP0097997A2/fr
Publication of EP0097997A3 publication Critical patent/EP0097997A3/en
Application granted granted Critical
Publication of EP0097997B1 publication Critical patent/EP0097997B1/fr
Expired legal-status Critical Current

Links

Images

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
    • 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/586—Pseudo-random number generators using an integer algorithm, e.g. using linear congruential method
    • 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
    • H04L9/0662—Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher with particular pseudorandom sequence generator

Definitions

  • the invention relates to a method of generating a pseudo-random sequence of signs of a large sequence length.
  • Pseudo-random sequences of signs are inter alia used in the field of encrypting information. These sequences may alternatively be used as message keys. It is important for these pseudo-random sequences to have a very long repetition period to guarantee that in the event of long messages the pseudo-random sequence is not predictable or, when used as a message key, does not repeat itself.
  • the invention has for its object to provide a method of generating a pseudo-random sequence of signs of a large sequence length which can both be programmed in a simple way on a computer and be realized with few technical means in the form of a specific separate arrangement.
  • the method of generating a pseudo.-random sequence of signs is characterized in that the method comprises the following steps:
  • pseudo-random sequence the sub-sequences, the prime numbers, and the random characters to contain binary signs, the X sub-sequences, the prime numbers, and the random characters each containing N binary signs and the pseudo-random sequence containing XN binary signs.
  • the memory 10 has a number of memory locations for storing pseudo-random characters and memory 11 has the same number of memory locations for storing prime numbers.
  • each memory 10, 11 has six locations and that each location can contain 8- bit words.
  • the counter As a modulo-6 counter. It will be obvious that if the number of memory locations is chosen greater or smaller than 6 the modulo number of the counter is adapted thereto.
  • the arrangement comprises an arithmetical circuit 15 connected to an output of the memory 10 and an output of memory 11 for performing the operation: PRB(j) + a.PRN(j)
  • T(j) The result of this operation is T(j).
  • j denotes the instantaenous counting position (1 ⁇ j ⁇ 6 in the example chosen);
  • PRB(j) is the content of the j th lo - cation of the random character memory 10
  • PRN(j) is the content of the j th location of the prime number memory 11 and a may have the value of a first or a second factor.
  • the value of the factor a depends on the value of the result T(j-1) of the operation, performed by the arithmetical circuit 15 at the preceding counting position (j-1). If that result exceeds a predetermined value then a obtains (or keeps) the value of the second factor.
  • the predetermined value is 255, i,e. the largest number a 8-bit memory location can contain.
  • An advantageous value for the first factor is 1, for the second factor 2.
  • T(j) The result of the operation at the th counting position (T(j)) is applied to a threshold element 16. If, T(j) ⁇ 256 then a is made equal to 2 and otherwise a is made equal to 1. In both cases the desired value of a is transferred to the arithmetical circuit 15 via an output of threshold element 16. In addition, the result T(j) is written (modulo-256) in the pseudo-random character memory 10 at address i, the preceding pseudo-random character just used being overwritten. For that purpose an output of arithmetical circuit 15 is connected to an input of memory 10.
  • T(j) The result of the operation at the j th counting position (T(j)) is finally (also modulo-256) written in the j th position of a register 17 via address decoder 18.
  • This result T(j) forms the j th sub-sequence in the register 16.
  • a signal is applied to an input of counter 14 via an output of register 17 for incrementing the counting position by one.
  • register 17 will contain a pseudo-random sequence of signs, which sequence is assembled from 6 sub-sequences each having 8 bits. Thereafter this random sequence of signs can be employed as a message key for encoding messages.
  • a new pseudo-random sequence can be generated by repeating the above-described method.
  • Fig. 1 The arrangement shown in Fig. 1 is initiated by writing the required prime numbers into memory 11 and writing pseudo-random characters into memory 10.
  • This pseudo-random character may alternatively be obtained on the basis of the random bit patterns produced in memory 10, after this memory 10 has been activated.
  • the bit patterns, generated in this known manner are known as "memory garbage". It has further been found that prime numbers located in the area from 1/4 to 1/2 of the maximum number that can be stored in the memory locations must be preferred for cryptographical reasons.
  • the threshold element 16 may be of such an implementation that it is determined whether during the operation T(j) a carry has occurred or not occurred in the most significant bit. If so, then the value of the second factor must be assigned to a, if not then the value of the first factor is assigned to a.
  • counter 14 will have N counting positions (modulo.N-counter), the memories 10, 11 will each have N locations of M bits and the predetermined value will preferably be 2 M .
  • the arrangement shown in Fig. 1 has the advantage that the logic and arithmetical operations are effected in parallel, that is to say simultaneously on a number of bits, so that a pseudo-random sequence having a long sequence length is generated in a simple and efficient way.
  • Fig. 2 shows a flow chart of a further embodiment of the method according to the invention.
  • the following explanatory texts are associated with the instruction codes of the geometric Figures which describe the time- sequential functions and states of the method of generating a pseudo-random sequence. It should be noted that such a time-sequence of functions and associated states of the method of generating a pseudo-random sequence can be realized in universal, sequential, programmable logic circuits such as commercially available microprocessors with associated memories and peripheral equipment.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • General Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computer Security & Cryptography (AREA)
  • Test And Diagnosis Of Digital Computers (AREA)
  • Mobile Radio Communication Systems (AREA)
EP83200895A 1982-06-23 1983-06-20 Procédé de génération d'une séquence pseudo-aléatoire de signes avec une grande longueur de séquence Expired EP0097997B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
NL8202547 1982-06-23
NL8202547A NL8202547A (nl) 1982-06-23 1982-06-23 Werkwijze voor het opwekken van een pseudo-random reeks van tekens met grote reekslengte.

Publications (3)

Publication Number Publication Date
EP0097997A2 true EP0097997A2 (fr) 1984-01-11
EP0097997A3 EP0097997A3 (en) 1985-01-30
EP0097997B1 EP0097997B1 (fr) 1987-03-11

Family

ID=19839931

Family Applications (1)

Application Number Title Priority Date Filing Date
EP83200895A Expired EP0097997B1 (fr) 1982-06-23 1983-06-20 Procédé de génération d'une séquence pseudo-aléatoire de signes avec une grande longueur de séquence

Country Status (4)

Country Link
US (1) US4780840A (fr)
EP (1) EP0097997B1 (fr)
DE (1) DE3370263D1 (fr)
NL (1) NL8202547A (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1991013400A1 (fr) * 1990-02-22 1991-09-05 Enfranchise Sixty Limited Generateurs de sequences pseudo-aleatoires
WO1995034971A1 (fr) * 1994-06-15 1995-12-21 Inria Institut National De Recherche En Informatique Et En Automatique Generateur de code quasi-aleatoire, notamment carte a circuit integre
WO1999009471A1 (fr) * 1997-08-18 1999-02-25 Picturetel Corporation Configuration efficace dans du materiel de generateur de nombres pseudo-aleatoires efficace dans un logiciel

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5258936A (en) * 1992-08-05 1993-11-02 Motorola, Inc. Method and apparatus for generating pseudo-random numbers
US5416783A (en) * 1993-08-09 1995-05-16 Motorola, Inc. Method and apparatus for generating pseudorandom numbers or for performing data compression in a data processor
AU6502896A (en) * 1995-07-20 1997-02-18 Dallas Semiconductor Corporation Single chip microprocessor, math co-processor, random number generator, real-time clock and ram having a one-wire interface
US6285761B1 (en) * 1998-03-04 2001-09-04 Lucent Technologies, Inc. Method for generating pseudo-random numbers
US6452959B1 (en) * 1999-05-28 2002-09-17 Dot Wireless, Inc. Method of and apparatus for generating data sequences for use in communications
US6748006B1 (en) 1999-05-28 2004-06-08 Texas Instruments Incorporated Method and apparatus for controlling system timing with use of a master timer
WO2003104969A2 (fr) * 2002-06-06 2003-12-18 Cryptico A/S Procedes permettant d'ameliorer l'imprevisibilite d'une sortie de generateurs de nombres pseudo aleatoires
US20040086117A1 (en) * 2002-06-06 2004-05-06 Petersen Mette Vesterager Methods for improving unpredictability of output of pseudo-random number generators
US6718536B2 (en) * 2002-06-21 2004-04-06 Atmel Corporation Computer-implemented method for fast generation and testing of probable prime numbers for cryptographic applications
US7379955B1 (en) * 2004-03-16 2008-05-27 The United States Of America As Represented By The Director, National Security Agency Device for and method of generating pseudo-random sequence uniformly distributed over any range
CN113901003B (zh) * 2021-10-11 2023-05-30 智慧足迹数据科技有限公司 摘要压缩方法及相关装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3838259A (en) * 1972-04-07 1974-09-24 Nsm Apparatebau Gmbh Kg Circuit arrangement for generating pseudo random numbers
DE978059C (de) * 1959-08-03 1977-10-06 Bundesrep Deutschland Verfahren und Anordnung zur reproduzierbaren Erzeugung einer Schluesselimpulsfolge
DE2547937A1 (de) * 1975-10-25 1978-10-26 Licentia Gmbh Verfahren zum erzeugen zufallsaehnlicher zeichenfolgen

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE2124320C1 (de) * 1971-05-17 1978-04-27 Siemens Ag, 1000 Berlin Und 8000 Muenchen Elektrische Schaltung zur Erzeugung einer Vielzahl verschiedener Codes
US3808536A (en) * 1972-04-12 1974-04-30 Gen Electric Co Ltd Communication scrambler system
SE380696B (sv) * 1974-03-20 1975-11-10 Philips Svenska Ab Sett att alstra en pseudoslumpbitfoljd och anordning for utforande av settet.
SE385644B (sv) * 1974-10-17 1976-07-12 Ericsson Telefon Ab L M Anordning vid kryptering och dekryptering av meddelanden
US4133974A (en) * 1976-11-05 1979-01-09 Datotek, Inc. System for locally enciphering prime data
SE7714587L (sv) * 1977-12-21 1979-06-22 Brendstrom Hugo System for meddelanden
US4375579A (en) * 1980-01-30 1983-03-01 Wisconsin Alumni Research Foundation Database encryption and decryption circuit and method using subkeys
US4351982A (en) * 1980-12-15 1982-09-28 Racal-Milgo, Inc. RSA Public-key data encryption system having large random prime number generating microprocessor or the like
US4471164A (en) * 1981-10-13 1984-09-11 At&T Bell Laboratories Stream cipher operation using public key cryptosystem

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE978059C (de) * 1959-08-03 1977-10-06 Bundesrep Deutschland Verfahren und Anordnung zur reproduzierbaren Erzeugung einer Schluesselimpulsfolge
US3838259A (en) * 1972-04-07 1974-09-24 Nsm Apparatebau Gmbh Kg Circuit arrangement for generating pseudo random numbers
DE2547937A1 (de) * 1975-10-25 1978-10-26 Licentia Gmbh Verfahren zum erzeugen zufallsaehnlicher zeichenfolgen

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
IBM TECHNICAL DISCLOSURE BULLETIN, vol. 14, no. 10, March 1972, pages 2978-2979, New York, USA; R.O. SKATRUD: "Random-key generator for ciphering system" *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1991013400A1 (fr) * 1990-02-22 1991-09-05 Enfranchise Sixty Limited Generateurs de sequences pseudo-aleatoires
US5323338A (en) * 1990-02-22 1994-06-21 Enfranchise Sixty Limited Pseudo-random sequence generators
WO1995034971A1 (fr) * 1994-06-15 1995-12-21 Inria Institut National De Recherche En Informatique Et En Automatique Generateur de code quasi-aleatoire, notamment carte a circuit integre
FR2721414A1 (fr) * 1994-06-15 1995-12-22 Inst Nat Rech Inf Automat Générateur de code quasi-aléatoire.
WO1999009471A1 (fr) * 1997-08-18 1999-02-25 Picturetel Corporation Configuration efficace dans du materiel de generateur de nombres pseudo-aleatoires efficace dans un logiciel

Also Published As

Publication number Publication date
EP0097997A3 (en) 1985-01-30
EP0097997B1 (fr) 1987-03-11
US4780840A (en) 1988-10-25
DE3370263D1 (en) 1987-04-16
NL8202547A (nl) 1984-01-16

Similar Documents

Publication Publication Date Title
EP0913040B1 (fr) Brouillage en spirale
EP0097997A2 (fr) Procédé de génération d'une séquence pseudo-aléatoire de signes avec une grande longueur de séquence
EP0342832A2 (fr) Dispositif de réaction dynamique pour générateur de séquence de clé d'un brouilleur
US3984668A (en) Method for generating pseudo-random bit sequence words and a device for carrying out the method
JP3324001B2 (ja) 半導体プログラマブル論理回路用データ機密保護装置
US6014446A (en) Apparatus for providing improved encryption protection in a communication system
US6125182A (en) Cryptographic engine using logic and base conversions
US4047008A (en) Pseudo-random number sequence generator
EP0246714A1 (fr) Générateurs de séquences binaires pseudo-aléatoires
JPH0723984B2 (ja) 再帰的キー目録暗号化装置
CN111694545A (zh) 随机数产生器
HU227781B1 (hu) Szimmetrikus kulcsú kriptográfiai berendezés és eljárás információk titkosítására és visszafejtésére
EP2002330B1 (fr) Procédé et appareil destinés à générer des nombres aléatoires
EP0041549B1 (fr) Dispositif et procede d'adressage de donnees de cle d'acces
US3548174A (en) Random number generator
JPS60140981A (ja) 符号語システムのデジタル符号語を復号する方法および装置
KR940004464A (ko) 의사-난수 발생 장치 및 방법
JP4160150B2 (ja) 遊技機用乱数装置
CN105931661B (zh) 扰码装置、电子设备及信息处理方法
KR102285940B1 (ko) 데이터 처리 회로, 데이터 처리 회로를 포함하는 데이터 저장 장치 및 그것의 동작 방법
US20230161560A1 (en) Apparatus for generating random data and a method thereof
JP2762485B2 (ja) 演算回路
SU951318A2 (ru) Имитатор дискретного канала св зи
RU2099890C1 (ru) Способ шифрования двоичной информации и устройство для осуществления способа - "албер"
EP1179243A1 (fr) Moteur cryptographique utilisant la conversion de base de numeration, des operations logiques et un generateur de nombres pseudo-aleatoires pour des matrices de donnees de fa on a augmenter la dispersion dans le texte chiffre

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Designated state(s): CH DE GB IT LI NL SE

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Designated state(s): CH DE GB IT LI NL SE

17P Request for examination filed

Effective date: 19850703

17Q First examination report despatched

Effective date: 19860422

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): CH DE GB IT LI NL SE

REF Corresponds to:

Ref document number: 3370263

Country of ref document: DE

Date of ref document: 19870416

ITF It: translation for a ep patent filed

Owner name: ING. C. GREGORJ S.P.A.

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: SE

Payment date: 19920629

Year of fee payment: 10

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 19920630

Year of fee payment: 10

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Effective date: 19930621

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Effective date: 19940101

NLV4 Nl: lapsed or anulled due to non-payment of the annual fee
PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 19940527

Year of fee payment: 12

ITTA It: last paid annual fee
PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 19940826

Year of fee payment: 12

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: CH

Payment date: 19940922

Year of fee payment: 12

EUG Se: european patent has lapsed

Ref document number: 83200895.7

Effective date: 19940110

ITPR It: changes in ownership of a european patent

Owner name: CAMBIO RAGIONE SOCIALE;PHILIPS ELECTRONICS N.V.

REG Reference to a national code

Ref country code: CH

Ref legal event code: PFA

Free format text: PHILIPS ELECTRONICS N.V.

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Effective date: 19950620

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Effective date: 19950630

Ref country code: CH

Effective date: 19950630

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 19950620

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Effective date: 19960301