Patent
Method system and device for generation of a pseudo-random data sequence
| العنوان: | Method system and device for generation of a pseudo-random data sequence |
|---|---|
| Patent Number: | 8,260,834 |
| تاريخ النشر: | September 04, 2012 |
| Appl. No: | 11/884435 |
| Application Filed: | February 13, 2006 |
| مستخلص: | A method and a generator for generating a pseudo-random data sequence (3), including combining means for combining data belonging to a plurality of initial data sequences (9a, 9b, 9c) using a procedure for searching for at least one search pattern. |
| Inventors: | Gouget, Aline (Paris, FR); Sibert, Hervé (Paris, FR) |
| Assignees: | France Telecom (Paris, FR) |
| Claim: | 1. A method of generating a pseudorandom data sequence (3) comprising a succession of output patterns (25), wherein the output patterns (25) are obtained by the steps of: selecting at least one search pattern; searching for said at least one search pattern in at least one initial data sequence that is one of a plurality of initial data sequences (9 a , 9 b , 9 c); determining an output pattern (25) according to an application that depends on said search and on the content of at least two initial data sequences from said plurality of initial data sequences (9 a , 9 b , 9 c); and reassigning the selection of and the search for at least one search pattern within said plurality of initial data sequences (9 a , 9 b , 9 c). |
| Claim: | 2. The method according to claim 1 , wherein said reassignment is effected as a function of said search and/or the content of at least one initial data sequence that is one of said plurality of initial data sequences (9 a , 9 b , 9 c). |
| Claim: | 3. The method according to claim 1 , wherein said steps are effected by a series of rules including: a first set of rules for defining at least one shift mode for shifting at least one window (19 a , 19 b , 19 c) over each initial data sequence of said plurality of initial data sequences (9 a , 9 b , 9 c), there being a plurality of windows (19 a , 19 b , 19 c) because each window is associated with an initial data sequence; a second set of rules that manages selecting said at least one search pattern and/or updating said output pattern (25) and/or reassigning the operations by means of a plurality of pointers manipulating said plurality of windows (19 a , 19 b , 19 c); and a third set of rules that determine modes of shifting said plurality of windows. |
| Claim: | 4. The method according to claim 3 , wherein said plurality of initial data sequences include at least two initial data sequences and the windows (19 a , 19 b , 19 c) are of size 1 so that said at least two initial data sequences can be read continuously bit by bit to determine an output pattern (25) of 1 bit. |
| Claim: | 5. The method according to claim 1 , wherein each bit of said pseudorandom data sequence (3) is combined with a corresponding bit from a data sequence of a message to be encrypted by modulo 2 addition to form an encrypted data sequence. |
| Claim: | 6. A generator of a pseudorandom data sequence (3), characterized in that it includes combining means (5) for combining data belonging to a plurality of initial data sequences (9 a , 9 b , 9 c) according to a procedure of searching for at least one search pattern wherein the combining means (5) include: a plurality of pointers (20 a , 20 b , 20 c) in corresponding relationship to a plurality of windows (19 a , 19 b , 19 c) that are adapted to be shifted over the plurality of initial data sequences (9 a , 9 b , 9 c); selection means (21 a) for operating on the plurality of pointers (20 a , 20 b , 20 c) manipulating the plurality of windows (19 a , 19 b , 19 c) to select said at least one search pattern in at least one initial data sequence; detection means (21 b) for operating on the plurality of pointers (20 a , 20 b , 20 c) to search for said at least one search pattern in at least one initial data sequence; production means (27) for determining an output pattern (25) according to an application that depends on said search and on the content of at least two initial data sequences from said plurality of initial data sequences (9 a , 9 b , 9 c); assignment means (16) for reassigning the correspondences between the plurality of pointers (20 a , 20 b , 20 c) and the plurality of windows (19 a , 19 b , 19 c) and for reassigning the operations of selecting and searching for at least one search pattern within said plurality of initial data sequences (9 a , 9 b , 9 c); and repetition means (17) for generating the pseudorandom data sequence (3) from a succession of output patterns (25). |
| Claim: | 7. An encryption/decryption device (39 a , 39 b) including an exclusive-OR logic gate (43), further comprising a generator (1) according to claim 6 . |
| Claim: | 8. A secure system (30) including at least two entities (33 a , 33 b) connected via a network (35), wherein each of said at least two entities includes an encryption/decryption device (39 a , 39 b) according to claim 7 . |
| Current U.S. Class: | 708/250 |
| Patent References Cited: | 5844925 December 1998 Dent et al. 1302497 July 2001 0 619 659 October 1994 10-190523 July 1998 |
| Other References: | C. K. Chan et al., “Design of keystream generator”, Electronics Letters, vol. 34, No. 12, pp. 1206-1207, Jun. 11, 1998. cited by other |
| Primary Examiner: | Mai, Tan V. |
| Attorney, Agent or Firm: | Conzen O'Connor |
| رقم الانضمام: | edspgr.08260834 |
| قاعدة البيانات: | USPTO Patent Grants |
| الوصف غير متاح. |