Add to ORKGStatistical data is presented on the distribution of FORTRAN identifiers as a function of length and initial character. The performance of two hash coding algorithms is tested with random probing on a pool of actual FORT
Randomness studies of bit sequences, created either by a ciphering algorithm or by a pseudorandom bi...
This paper is a sequel to Brands and Gill (1995), which contained an introduction to the cryptograph...
Source code for the Camfort toolThis work was supported by the EPSRC [grant number EP/M026124/1]
Random sequences and random numbers constitute a necessary part of cryptography. Many cryptographic ...
The article systematizes the basic scientific principles about statistical testing of random and pse...
The output of cryptographic functions, be it encryption routines or hash functions, should be statis...
Given a set of root mean squares obtained from the analysis of a factorial ex periment one method o...
The purpose of this brief note is to bring to the attention of readers a collection of Fortran routi...
The amplitude-encoding case of the double random phase encoding technique is examined by defining a ...
The amplitude-encoding case of the double random phase encoding technique is examined by defining a c...
Consider the problem of designing a code via which to encode data samples from a finite set, where t...
Many data acquisition systems incorporate high-speed scanners to convert analog signals into digital...
One of the most basic properties expected from block ciphers and hash functions is passing statistic...
The topic of this thesis was first introduced as a part of a research concerning the application of ...
The content of this thesis is the design and statistical tests of two dierent hardware random number...
Randomness studies of bit sequences, created either by a ciphering algorithm or by a pseudorandom bi...
This paper is a sequel to Brands and Gill (1995), which contained an introduction to the cryptograph...
Source code for the Camfort toolThis work was supported by the EPSRC [grant number EP/M026124/1]
Random sequences and random numbers constitute a necessary part of cryptography. Many cryptographic ...
The article systematizes the basic scientific principles about statistical testing of random and pse...
The output of cryptographic functions, be it encryption routines or hash functions, should be statis...
Given a set of root mean squares obtained from the analysis of a factorial ex periment one method o...
The purpose of this brief note is to bring to the attention of readers a collection of Fortran routi...
The amplitude-encoding case of the double random phase encoding technique is examined by defining a ...
The amplitude-encoding case of the double random phase encoding technique is examined by defining a c...
Consider the problem of designing a code via which to encode data samples from a finite set, where t...
Many data acquisition systems incorporate high-speed scanners to convert analog signals into digital...
One of the most basic properties expected from block ciphers and hash functions is passing statistic...
The topic of this thesis was first introduced as a part of a research concerning the application of ...
The content of this thesis is the design and statistical tests of two dierent hardware random number...
Randomness studies of bit sequences, created either by a ciphering algorithm or by a pseudorandom bi...
This paper is a sequel to Brands and Gill (1995), which contained an introduction to the cryptograph...
Source code for the Camfort toolThis work was supported by the EPSRC [grant number EP/M026124/1]