WO1981001758A1 - Apparatus and method for hashing key data - Google Patents
Apparatus and method for hashing key data Download PDFInfo
- Publication number
- WO1981001758A1 WO1981001758A1 PCT/US1980/001597 US8001597W WO8101758A1 WO 1981001758 A1 WO1981001758 A1 WO 1981001758A1 US 8001597 W US8001597 W US 8001597W WO 8101758 A1 WO8101758 A1 WO 8101758A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- key data
- pseudo
- signal
- output
- count
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9014—Indexing; Data structures therefor; Storage structures hash tables
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Error Detection And Correction (AREA)
- Storage Device Security (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Hashing of a key data signal is accomplished by utilizing a pseudo-random number signal generator (22, 24, 26, 28 and 30) for generating a randomized signal in response to shift signals and the key data signals and an output register (32) for serially receiving the generated pseudo-random signal and for providing segments of the serially-received signal at its output. A counting circuit (36, 56) responsive to a preselected number of shift signals provides an output valid signal when the preselected number of shift signals has occurred and further shifts the pseudo-random number signal generator an amount corresponding to the preselected number of shift signals. The pseudo-random number signal generator includes a pair of cross-coupled shift registers (26, 28). The method of hashing the key data utilizes the steps of presetting the pseudo-random number generator and the counting circuit to an initialized state. The counting circuit is then loaded with a predetermined count whereupon key data is entered into the pseudo-random number generator so as to randomize the key data. A valid signal is provided when a block of key data has been hashed and the steps of entering the key data and providing a valid signal upon the occurrence of each block of key data is repeated until all key data blocks have been hashed.
Description
APPARATUS AND METHOD FOR HASHING KEY DATA
Technical Field
This invention relates to apparatus for hash- ing key data. The invention also relates to a method for hashing key data.
Background Art
In computerized processing of data, it is common practice to store like data items as multiple entries within a named data file. A portion of each record, referred to as the key, is used to reference a specific record. The keys are assumed to be unique throughout the file. Fundamental to the processing of the data file is the search for a data record associated with a specific key. A number of techniques have been developed which perform this particular function. A class of these techniques is referred to as hashing access methods.
A hashing access method is commonly used when the number of actual keys is a small percentage of the total number of possible keys. This generally occurs when the key data is represented as ASCII character codes. An example is* a 6-digit part number ranging from 000000 to 999999, which requires a 6-byte field (48 bits) with only ten valid values for each byte out of a possible 256 unique values. Another example is the use of a person's name as the key. In this case a fixed length field (say 20 bytes) is allocated for key data. Since all names do not contain 20 characters and certain combinations of letters do not realistically represent a name, a high percentage of possible bit configurations will never be used as valid keys.
A distinguishing property of hashing methods is that they do not uniquely map keys to record storage locations. Instead, they provide for more than one key
OMPI
to map to a specific table entry which contains the location of one or more records. The object of effective hashing methods is to arrive at a uniform distribution of the number of keys which map to a specific starting pointer thus minimizing the search time for any randomly selected key.
Hashing techniques are known from the publi¬ cation by D. E. Knuth "The Art of Computer Programming", Volume 3, pages 506-549 (Addison- esley Publishing Company, 1973). The techniques disclosed in said pub¬ lication are software methods based on algorithms. Such methods are tailored to specific sets of properties possessed by the keys, that is, alpha keys, alpha¬ numeric keys, numeric keys, closeness of adjacent keys, number of repeated characters in the keys, etc. Thus these known hashing techniques have the disadvantage that different hashing methods are needed to effectively hash different types of key data.
Disclosure of the Invention It is an object of the present invention to provide apparatus and a method for hashing key data which is of general application.
It is a further object of the invention to provide a hardware implementation for hashing key data. Therefore, according to the present invention there is provided apparatus for hashing key data, char¬ acterized by pseudo-random bit generating means respon¬ sive to key data signals applied thereto to generate a randomized output signal, output register means adapted to receive said randomized output signal and control means adapted to provide an output valid signal indica¬ tive of valid hashed key data being available at an output of said output register means.
According to another aspect of the present in- vention, there is provided a method for hashing key data, characterized by the steps of: (a) presetting pseudo¬ random bit generating means and a counting device to an
initialized state; (b) setting a predetermined load count into said counting device; (c) applying key data to said pseudo-random bit generating means; and (d) generating a randomized output signal by applying shift signals to said pseudo-random bit generating means in accordance with the loaded count.
An advantage of the present invention is that the hashed key data produced is such that all the orig¬ inal properties of closeness, adjacency and orderliness are removed, regardless of the nature of the original key data.
A further advantage is that the hashed key data has a high degree of complexity, that is, a large number of permutations have to be tried before the hashed data can be decoded. Thus a high degree of security against unauthorized access to data is provided.
Brief Description of the Drawings
One embodiment of the present invention will now be described by way of example with reference to the accompanying drawings, wherein like characters in¬ dicate like parts, and in which:
Fig. 1 is a block schematic of the preferred apparatus of the present invention.
Fig. 2 is a logic schematic of a first gener- ator which may be used in the preferred apparatus of Fig. 1.
Fig. 3 is a logic schematic of a second gener¬ ator which may be used in conjunction with the first generator of Fig. 2. Fig. 4 is a logic schematic of a register which may be used in the preferred apparatus of Fig. 1.
Fig. 5 is a timing diagram useful in under¬ standing the operation of the preferred apparatus em¬ bodiment of the present invention.
Mode for Carrying Out the Invention
Referring to Fig. 1; the AND gate 20 receives
two inputs; a LOAD DATA input and a DATA IN input. The output of AND gate 20 is directed to inputs of Exclusive OR gates 22 and 24. The outputs of Exclusive OR gates 22 and 24 are directed to the inputs of pseudo-random number generators 26 and 28, respectively. The gener¬ ator inputs are labeled D. Each generator has a clocking input, labeled C for receiving a SHIFT CLOCK signal, and a preset input, labeled R, for receiving a PRESET signal. A clocking signal applied to input C causes the gener- ators, which are in the preferred embodiment shift registers, to shift the contents through the register. The PRESET signal initializes the generators to a start¬ ing condition. The output of generator 26 is directed to an input of an Exclusive OR gate 30 and to the input of Exclusive OR gate 24. The output from generator 28 is directed to the other input of Exclusive OR gate 30 and to an input of Exclusive OR gate 22. The output of Exclusive OR gate 30 is directed to the D input of an output register 32. The clocking input C of output register 32 is adapted to receive the SHIFT CLOCK signal. The output register 32 in the preferred embodiment of the invention is a serial-in, parallel-out shift register of sixteen stages with each of the output stages labeled from 1-16. A more detailed description of cross-coupled pseudo-random number generators is contained in inter¬ national (PCT) publication No. 080102349 in the name of the present Applicant.
A serial-in, parallel-out count register 36 is adapted to receive the DATA IN signal on its D input. A LOAD COUNT signal is addressed to an input of an AND gate 34 and gated by a CLOCK signal applied to the other input of AND gate 34 to the clock input, labeled C of count register 36. A Down counter 38 receives the PRESET signal on its PE labeled input and a COUNT signal on its C labeled input. The PRESET signal is inverted by an inverter 40 to provide a PRESET signal and the CLOCK signal is inverted by an inverter 42 to provide a
CLOCK signal. The output of the down counter 38 which output is the terminal count TC is directed to an inver¬ ter 44. The output of inverter 44 is connected to an input of AND gate 46. The output of AND gate 46 is connected to the J and K inputs of a JK flip-flop 50.
The LOAD DATA signal is directed to an inverting ampli¬ fier 48, the output of which is connected to the set input, labeled S, of flip-flop 50, and to an input of an AND gate 54. The Q output of flip-flop 50 is connected as an input to AND gate 52 and to AND gate 46.. The
PRESET signal is applied to the R labeled input of flip- flop 50, and the CLOCK signal is applied to the C labeled input. The CLOCK signal is applied to the other input of AND gate 52. The output of AND gate 52 is the SHIFT CLOCK signal which also is applied to the other input of AND gate 54 and to the C labeled inputs of generators 26 and 28. The output of AND gate 54 is the COUNT signal. The Q output of flip-flop 50 is directed to the C labeled input of a J-K flip-flop 56. A voltage V is applied to the J and the K labeled inputs to flip-flop 56. The
PRESET signal is applied to the' R labeled input of flip- flop 56. The output of flip-flop 56 is taken from the Q labeled output. The output signal is designated OUTPUT VALID. A pseudo random number generator suitable for use as generator 26 is disclosed in Fig. 2. A string of sixteen D-type flip-flops are connected in serial fashion with the Q output of each flip-flop being connected to the D input of the following flip-flop. Each of the D-type flip-flops labeled 1-16 is clocked by the CLOCK signal applied to the C labeled inputs. The PRESET signal is applied to each of the R labeled inputs of the sixteen flip-flops to reset the register to an initial condition. In the preferred embodiment of this invention generator 26 was designed to generate a random number polynomial x16 + x12 + x11 + x9 + x8 + x4 + x3 + χ2 + 1.
This was accomplished by Exclusive ORIng each of the first shift register outputs which correspond in number to the exponent of the to be simulated polynomial, for which, x 16 is simulated by taking the Q output from the D flip-flop numbered 16 and by providing it as an input to an Exclusive OR gate 74. In a like manner, the output of flip-flop 12 is directed to the other input of Exclusive OR gate 74 to simulate the terms x 16 + x12
Correspondingly, the output from flip-flop 11 is com- bined in Exclusive OR gate 72 with the output from
Exclusive OR gate 74 and the output of flip-flop 9 is combined in Exclusive OR gate 70 with the output from Exclusive OR gate 72. Exclusive OR gates 68, 66, 64 and 62, in a like manner, simulate the x + x + x + x elements of the polynomial. The output of the Exclusive OR gate 62 is then directed back to the input of an Exclusive OR gate 60 to provide a closed loop path. The last remaining term is derived from the Q output of flip-flop 1, which output is labeled Gl and is the output of the pseudo generator 26. The Exclusive OR gate 60 receives as its other input the D signal which data signal is combined on a bit by bit basis with the bits received from the output of Exclusive OR gate 62. Referring now to Fig. 3, the pseudo random number generator 28 is shown comprised of sixteen serial¬ ly connected D-type flip-flops labeled 1 through 16. The Q output of each flip-flop is connected to the D input of the succeeding flip-flop. In the preferred embodiment of the invention, pseudo random number gener- ator 26 was designed to implement the polynomial x + x 12 + x3 + x + 1. The reset input to each flip-flop is labeled R. The D signal which is received from the Exclusive OR gate 24 is directed to one input of Exclu¬ sive OR gate 60. The output of each flip-flop is labeled according to the flip-flop's position in the serial string and corresponds to a bit position in a sixteen bit signal.
Referring to Fig. 4, the output register 32 is illustrated comprised of 16 D-type flip-flops serially connected with the Q output of each flip-flop connected to the D input of the succeeding flip-flop. The CLOCK and PRESET signals are applied to the C and D labeled inputs on each of the 16 flip-flops. The output from output register 32 is taken from the Q output of each of the flip-flops and corresponds to 16 bits of a block of hashed key data. The hardware implementation of the preferred embodiment of the invention has been set forth above. In operation, the purpose of the apparatus is to random¬ ize (hash) blocks of key data consisting of N bits to a table address space consisting of 2 entries where K is much less than N. This process is accomplished by utilizing the presettable pseudo-random number generator and the counting circuit in the following steps:
1. Presetting the pseudo-random number generator and the counting circuit to an initialized state.
2. Loading a predetermined count into the counting circuit.
3. Entering key data into the pseudo-random number generator to randomize the key data. 4. Complete the key data randomizing and provide an output valid signal in accordance with the count in the counting circuit.
5. Repeating steps 2, 3 and 4 until all desired key data has been hashed.
Referring to Fig. 1 in conjunction with Figs.
5A-5I, the apparatus is initialized by the PRESET signal (Fig. 5C) being applied to the various preset terminals to set the OUTPUT VALID signal low and to inhibit inter¬ nal clocks. The constant value K is loaded into the count register 36 by raising the LOAD COUNT signal (Fig. 5D) to a high level and presenting the DATA IN signal
(Fig. 5B) representing the constant value K, bit by bit, on the DATA IN input terminal. This data is then clocked (Fig. 5A) serially into the count register 36 during the LOAD COUNT CYCLE. The value of the constant should be equal to the number of bits in the output register 32 that are used for the hash address. In the preferred embodiment of the invention, K was limited to Hex FF and the number of outputs of the output register 32 were therefore limited to sixteen. After the count register 36 is loaded, activating the PRESET signal (Fig. 5C) again will transfer this value into the down counter 38 and will initialize the pseudo random number generators 26 and 28. A block of key data may then be loaded bit by bit onto the DATA INPUT line to AND gate 20 and count register 36. Activating the LOAD DATA signal (Fig. 5E) enables the key data to be directed to the cross-coupled pseudo random number generators 26 and 28. The LOAD DATA signal going true enables the SHIFT CLOCK signal (Fig. 5F) for the generators 26 and 28 and the serial- to-parallel output register 32. The LOAD DATA going false enables the COUNT signal (Fig. 5G) to the down counter 38. The SHIFT CLOCK signal and the COUNT signal will continue until the terminal count TC (Fig. 5H) is reached in the down counter 38. The terminal count signal will disable the SHIFT CLOCK and the COUNT signal and set the output of flip-flop 56 to indicate an OUTPUT VALID signal. On receipt of the OUTPUT VALID signal, the outputs present on the terminals 1-16 of the output register 32 will be valid hashed data. In the preferred embodiment of the invention, the outputs from each of the pseudo random number gener¬ ators is cross-coupled to the input of the other pseudo random generator so as to further scramble (or encode) a DATA IN signal. Exclusive ORing of the output from each of the pseudo random number generators insures a high degree of randomness to the DATA IN signal. The random¬ ized signal is then applied to the output register which
OM
register accumulates a selected number of data transi¬ tions or data bits, in this case, sixteen bits of data and outputs the data in blocks of sixteen.
From the aforementioned description of the' preferred embodiment of the invention, it can be seen that there is an advantage in that a uniform distribution of key mappings into the table address space as the number of keys becomes large relative to the size of the table address space is provided and that the apparatus removes any properties which the original keys may have, such as determinate relationship to each other. In addition, the apparatus is independent of the key length.
"BUREATT-
OMPI
' iPO ,
Claims
1. Apparatus for hashing key data, charac¬ terized by pseudo-random bit generating means (22, 24, 26, 28, 30) responsive to key data signals applied thereto to generate a randomized output signal, output register means (32) adapted to receive said randomized output signal and control means (36-56) adapted to pro¬ vide an output valid signal indicative of valid hashed key data being available at an output of said output register means (32).
2. Apparatus according to claim 1, charac¬ terized in that said pseudo-random bit generating means (22, 24, 26, 28, 30) is responsive to shift signals and in that said control means is responsive to the pro¬ vision of a predetermined number of said shift signals to control the production of said output valid signal.
3. Apparatus according to claim 2, charac¬ terized in that said pseudo-random bit generating means includes first and second pseudo-random generators (26, 28) and combining means (22, 24) adapted to combine said key data signals with each of first and second output signals of said first and second pseudo-random generators and to apply the resulting first and second combined signals to the second and first pseudo-random generators (28, 26) respectively.
4. Apparatus according to claim 2, charac¬ terized in that said control means includes: a counter device (38) settable to a load count dependent on the number of elements included in said hashed key data, said counter device (38) being responsive to the appli¬ cation of selected ones of said shift signals to provide a terminal count signal; and logic means (44-56) respon¬ sive to said terminal count signal to provide said output valid signal.
5. Apparatus according to claim 4, charac¬ terized in that said control means includes a count register (36) arranged to be supplied with signals representing said load count, said count register being coupled to said counter device (38) and adapted to transfer said load count thereto in response to a control signal (PRESET).
6. Apparatus according to claim 3, charac¬ terized in that said first and second pseudo-random generators (26, 28) include respective first and second shift registers operable in response to said shift sig- nals.
7. A method for hashing key data, character¬ ized by the steps of: (a) presetting pseudo-random bit generating means (22, 24, 26, 28, 30) and a counting device (38) to an initialized state;' (b) setting a pre- determined load count into said counting device (38); (c) applying key data to said pseudo-random bit gener¬ ating means (22, 24, 26, 28, 30); and (d) generating a randomized output signal by applying shift signals to said pseudo-random bit generating means in accordance with the loaded count.
8. A method according to claim 7, charac¬ terized by the steps of repeating steps (b) , (c) and (d) until all desired key data has been hashed.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE8181900124T DE3072073D1 (en) | 1979-12-07 | 1980-11-26 | Apparatus and method for hashing key data |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US06/101,319 US4418275A (en) | 1979-12-07 | 1979-12-07 | Data hashing method and apparatus |
US101319 | 1979-12-07 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO1981001758A1 true WO1981001758A1 (en) | 1981-06-25 |
Family
ID=22284028
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US1980/001597 WO1981001758A1 (en) | 1979-12-07 | 1980-11-26 | Apparatus and method for hashing key data |
Country Status (6)
Country | Link |
---|---|
US (1) | US4418275A (en) |
EP (1) | EP0041549B1 (en) |
JP (1) | JPS6360415B2 (en) |
CA (1) | CA1146281A (en) |
DE (1) | DE3072073D1 (en) |
WO (1) | WO1981001758A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0295426A2 (en) * | 1987-06-15 | 1988-12-21 | International Business Machines Corporation | Method and apparatus for generating alert messages in a communication network |
Families Citing this family (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4578531A (en) * | 1982-06-09 | 1986-03-25 | At&T Bell Laboratories | Encryption system key distribution method and apparatus |
US4780816A (en) * | 1986-05-16 | 1988-10-25 | The United States Of America As Represented By The Secretary Of The Army | Key-to-address transformations |
US4922417A (en) * | 1986-10-24 | 1990-05-01 | American Telephone And Telegraph Company | Method and apparatus for data hashing using selection from a table of random numbers in combination with folding and bit manipulation of the selected random numbers |
DE3636426A1 (en) * | 1986-10-25 | 1988-05-05 | Standard Elektrik Lorenz Ag | METHOD FOR ENTERING OPERATING COMMANDS IN A COMPUTER-CONTROLLED ACTUATOR |
US4771463A (en) * | 1986-12-05 | 1988-09-13 | Siemens Transmission Systems, Inc. | Digital scrambling without error multiplication |
US5113444A (en) * | 1990-09-05 | 1992-05-12 | Arnold Vobach | Random choice cipher system and method |
EP0483424A1 (en) * | 1990-10-30 | 1992-05-06 | International Business Machines Corporation | Key hashing in data processors |
US5307412A (en) * | 1992-09-30 | 1994-04-26 | Vobach Arnold R | Random coding cipher system and method |
US5335280A (en) * | 1993-01-28 | 1994-08-02 | Vobach Arnold R | Random sum cipher system and method |
US5412721A (en) * | 1993-03-26 | 1995-05-02 | Motorola, Inc. | Method for loading and utilizing a key in a secure transmission device |
US5363448A (en) * | 1993-06-30 | 1994-11-08 | United Technologies Automotive, Inc. | Pseudorandom number generation and cryptographic authentication |
US5377270A (en) * | 1993-06-30 | 1994-12-27 | United Technologies Automotive, Inc. | Cryptographic authentication of transmitted messages using pseudorandom numbers |
US5680131A (en) * | 1993-10-29 | 1997-10-21 | National Semiconductor Corporation | Security system having randomized synchronization code after power up |
GB9909539D0 (en) * | 1999-04-27 | 1999-06-23 | Ncipher Corp Limited | Data storage and retrieval |
JP2001016196A (en) * | 1999-04-28 | 2001-01-19 | Fuji Soft Abc Inc | Enciphering/deciphering method using multiple affine key, authenticating method and each device using the same |
US20050289520A1 (en) * | 2004-06-29 | 2005-12-29 | Redvers Consulting, Ltd. | Unidirectional cloaking device for source code |
US8595273B2 (en) * | 2007-01-24 | 2013-11-26 | International Business Machines Corporation | Hash algorithm using randomization function |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3691472A (en) * | 1967-06-26 | 1972-09-12 | Ericsson Telefon Ab L M | Arrangement for the generation of pulses appearing as pseudo-random numbers |
US3784743A (en) * | 1972-08-23 | 1974-01-08 | Bell Telephone Labor Inc | Parallel data scrambler |
US4112487A (en) * | 1975-11-21 | 1978-09-05 | Ferranti Limited | Apparatus for writing data in unique order into and retrieving same from memory |
US4115657A (en) * | 1976-11-11 | 1978-09-19 | Datotek, Inc. | Random digital code generator |
US4157454A (en) * | 1976-12-22 | 1979-06-05 | International Business Machines Corporation | Method and system for machine enciphering and deciphering |
Family Cites Families (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3651483A (en) * | 1969-01-03 | 1972-03-21 | Ibm | Method and means for searching a compressed index |
GB1382048A (en) * | 1971-09-15 | 1975-01-29 | Int Computers Ltd | Randomnumber generators |
US4086628A (en) * | 1971-11-10 | 1978-04-25 | International Business Machines Corporation | Directory generation system having efficiency increase with sorted input |
US3742460A (en) * | 1971-12-20 | 1973-06-26 | Sperry Rand Corp | Search memory |
FR111574A (en) * | 1973-12-13 | 1900-01-01 | ||
GB1492260A (en) * | 1974-10-29 | 1977-11-16 | Int Computers Ltd | Data processing systems |
DE2451794C3 (en) * | 1974-10-31 | 1980-07-17 | Licentia Patent-Verwaltungs-Gmbh, 6000 Frankfurt | Method for testing digital communication links with random binary character strings |
US4042913A (en) * | 1976-04-30 | 1977-08-16 | International Business Machines Corporation | Address key register load/store instruction system |
US4099242A (en) * | 1976-11-03 | 1978-07-04 | Houston George B | One-pass general associative search processor |
GB1564563A (en) * | 1977-05-25 | 1980-04-10 | Int Computers Ltd | Data sotrage apparatus |
US4309750A (en) * | 1978-01-23 | 1982-01-05 | Mitsubishi Denki Kabushiki Kaisha | Inverter device |
US4290105A (en) * | 1979-04-02 | 1981-09-15 | American Newspaper Publishers Association | Method and apparatus for testing membership in a set through hash coding with allowable errors |
US4264781A (en) * | 1979-04-16 | 1981-04-28 | Ncr Corporation | Apparatus for encoding and decoding data signals |
-
1979
- 1979-12-07 US US06/101,319 patent/US4418275A/en not_active Expired - Lifetime
-
1980
- 1980-11-26 DE DE8181900124T patent/DE3072073D1/en not_active Expired
- 1980-11-26 EP EP81900124A patent/EP0041549B1/en not_active Expired
- 1980-11-26 JP JP56500262A patent/JPS6360415B2/ja not_active Expired
- 1980-11-26 WO PCT/US1980/001597 patent/WO1981001758A1/en active IP Right Grant
- 1980-12-05 CA CA000366189A patent/CA1146281A/en not_active Expired
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3691472A (en) * | 1967-06-26 | 1972-09-12 | Ericsson Telefon Ab L M | Arrangement for the generation of pulses appearing as pseudo-random numbers |
US3784743A (en) * | 1972-08-23 | 1974-01-08 | Bell Telephone Labor Inc | Parallel data scrambler |
US4112487A (en) * | 1975-11-21 | 1978-09-05 | Ferranti Limited | Apparatus for writing data in unique order into and retrieving same from memory |
US4115657A (en) * | 1976-11-11 | 1978-09-19 | Datotek, Inc. | Random digital code generator |
US4157454A (en) * | 1976-12-22 | 1979-06-05 | International Business Machines Corporation | Method and system for machine enciphering and deciphering |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0295426A2 (en) * | 1987-06-15 | 1988-12-21 | International Business Machines Corporation | Method and apparatus for generating alert messages in a communication network |
EP0295426A3 (en) * | 1987-06-15 | 1990-05-16 | International Business Machines Corporation | Method for identifying alerts in a communication network |
Also Published As
Publication number | Publication date |
---|---|
CA1146281A (en) | 1983-05-10 |
JPS6360415B2 (en) | 1988-11-24 |
EP0041549B1 (en) | 1988-02-03 |
DE3072073D1 (en) | 1988-03-10 |
JPS56501695A (en) | 1981-11-19 |
US4418275A (en) | 1983-11-29 |
EP0041549A1 (en) | 1981-12-16 |
EP0041549A4 (en) | 1985-04-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO1981001758A1 (en) | Apparatus and method for hashing key data | |
Wheeler et al. | Supercomputer investigations of a chaotic encryption algorithm | |
Pearson | Fast hashing of variable-length text strings | |
CA1287183C (en) | Method and apparatus for data hashing | |
AU608439B2 (en) | Dynamic feedback arrangement scrambling technique keystream generator | |
JPS60121486A (en) | Inductive key table cryptographer | |
EP0443752A2 (en) | Block-cipher cryptographic device based upon a pseudorandom nonlinear sequence generator | |
EP0240546B1 (en) | Random sequence generators | |
US3811038A (en) | Pseudo-random number generators | |
Dabal et al. | A chaos-based pseudo-random bit generator implemented in FPGA device | |
GB1501073A (en) | Data enciphering apparatus | |
Bright et al. | Quasi-random number sequences from a long-period TLP generator with remarks on application to cryptography | |
EP0097997A2 (en) | Method of generating a pseudo-random sequence of signs of a large sequence length | |
CN111262686A (en) | Security verification method for RSSP-I secure communication | |
Westlake | A uniform random number generator based on the combination of two congruential generators | |
Yakut et al. | Secure and efficient hybrid random number generator based on sponge constructions for cryptographic applications | |
GB2377514A (en) | Document encryption permitting indexing by a search engine | |
Certaine | On sequences of pseudo-random numbers of maximal length | |
Yadav | Design and analysis of digital true random number generator | |
Cantu et al. | Finding hash collisions using MPI on HPC clusters | |
RU2246129C2 (en) | Random numbers generation method | |
US6691142B2 (en) | Pseudo random address generator for 0.75M cache | |
CN111324908A (en) | Batch data desensitization method | |
El Den et al. | An Enhanced Pseudorandom Number Generator Based Differential Lorenz system by using Runge-Kutta method | |
KR890015511A (en) | Logic circuit with self-raising select addition circuit |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Designated state(s): JP |
|
AL | Designated countries for regional patents |
Designated state(s): CH DE FR GB |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1981900124 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1981900124 Country of ref document: EP |
|
WWG | Wipo information: grant in national office |
Ref document number: 1981900124 Country of ref document: EP |