Premium
The Boolean (k, m, p 1 ,…, p m )‐Shift‐Registers I
Author(s) -
Grodzki Zdzislaw
Publication year - 1976
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19760220161
Subject(s) - computer science , citation , information retrieval , arithmetic , combinatorics , discrete mathematics , mathematics , library science
The use of such registers is in a secure communication system. We shall explain shortly this usage. Let us suppose that a message must be sent from point A to point B. This message is coded into &-element sequences of 0’s and 1’s and simultaneousIy a Boolean controlled shift-register which “generates ” this information is constructed. The receiver knows all parameters of this register and therefore decodes this information eady . With respect to difficult nature of this register the unfriendly eavesdropper is not able (or is able with the great difficulty) to decode this information.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom