The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The Generation of Pseudo-Random Numbers on a Decimal Calculator
Journal of the ACM (JACM)
Empirical Tests of an Additive Random Number Generator
Journal of the ACM (JACM)
Serial Correlation in the Generation of Pseudo-Random Numbers
Journal of the ACM (JACM)
Uniform Random Number Generators
Journal of the ACM (JACM)
Fourier Analysis of Uniform Random Number Generators
Journal of the ACM (JACM)
The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number Generators
Journal of the ACM (JACM)
Generalized Feedback Shift Register Pseudorandom Number Algorithm
Journal of the ACM (JACM)
An Asymptotically Random Tausworthe Sequence
Journal of the ACM (JACM)
Information-Theoretic Limitations of Formal Systems
Journal of the ACM (JACM)
A comparison of the correlational behavior of random number generators for the IBM 360
Communications of the ACM
Security, Accuracy, and Privacy in Computer Systems
Security, Accuracy, and Privacy in Computer Systems
Fast "infinite-key" privacy transformation for resource-sharing systems
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
A consideration of the application of cryptographic techniques to data processing
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
ACM Computing Surveys (CSUR)
Privacy and Security Issues in Information Systems
IEEE Transactions on Computers
Hi-index | 0.00 |
Protection of information within a computer/communication system can be provided through reversible cryptographic transformation of the information itself into a form that can be returned to usable form only through use of control information known as "key." It is not necessary, in order to achieve access control, that the encryption algorithms, random number generator, or system organization be kept secret; in fact, a basic requirement of modern cryptographic technology is that it must be effective although a would-be penetrator is assumed to have full access to all of that information and the facilities and competence to apply it. Only the key can be assumed to be, and must be, physically secure. The building-block approach outlined makes use of pre-programmed software elements for providing all specialized algorithms, including the Proposed Federal Data Encryption Standard (DES), together with necessary nonnumeric generalized support routines for use with application programs written in conventional procedural higher languages (FORTRAN, COBOL, etc.). Both Strong Algorithm and Long Key methods can be used as required by security-level-vs-cost tradeoff considerations. This method is useful in conjunction with specialized hardware; for testing of programs and hardware; in some cases instead of hardware; and can support multiple-level security applications. The entire scheme, including the Tausworthe-Lewis-Payne bitwise linear recurrence modulo 2 quasirandom number generator, is based irrespective of hardware type on a standardized 64-bit data element.