Results 1 
3 of
3
Feedback shift registers, 2adic span, and combiners with memory
 Journal of Cryptology
, 1997
"... Feedback shift registers with carry operation (FCSR’s) are described, implemented, and analyzed with respect to memory requirements, initial loading, period, and distributional properties of their output sequences. Many parallels with the theory of linear feedback shift registers (LFSR’s) are presen ..."
Abstract

Cited by 50 (7 self)
 Add to MetaCart
Feedback shift registers with carry operation (FCSR’s) are described, implemented, and analyzed with respect to memory requirements, initial loading, period, and distributional properties of their output sequences. Many parallels with the theory of linear feedback shift registers (LFSR’s) are presented, including a synthesis algorithm (analogous to the BerlekampMassey algorithm for LFSR’s) which, for any pseudorandom sequence, constructs the smallest FCSR which will generate the sequence. These techniques are used to attack the summation cipher. This analysis gives a unified approach to the study of pseudorandom sequences, arithmetic codes, combiners with memory, and the MarsagliaZaman random number generator. Possible variations on the FCSR architecture are indicated at the end. Index Terms – Binary sequence, shift register, stream cipher, combiner with memory, cryptanalysis, 2adic numbers, arithmetic code, 1/q sequence, linear span. 1
Symmetric hash functions for fingerprint minutiae
 in Lecture
, 2005
"... Abstract. The possibility that a database with biometric data is compromised is one of the main concerns in implementing biometric identification systems. In this paper we present a method of hashing fingerprint minutia information and performing fingerprint identification in a new space. Only hashe ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Abstract. The possibility that a database with biometric data is compromised is one of the main concerns in implementing biometric identification systems. In this paper we present a method of hashing fingerprint minutia information and performing fingerprint identification in a new space. Only hashed data is transmitted and stored in the server database, and it is not possible to restore fingerprint minutia locations using hashed data. We also present a performance analysis of the proposed algorithm. 1
A Free Energy Minimization Framework for Inference Problems in Modulo 2 Arithmetic
 Fast Software Encryption (Proceedings of 1994 K.U. Leuven Workshop on Cryptographic Algorithms), number 1008 in Lecture Notes in Computer Science
, 1994
"... . This paper studies the task of inferring a binary vector s given noisy observations of the binary vector t = Asmodulo 2, where A is an M \Theta N binary matrix. This task arises in correlation attack on a class of stream ciphers and in the decoding of error correcting codes. The unknown binary v ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
. This paper studies the task of inferring a binary vector s given noisy observations of the binary vector t = Asmodulo 2, where A is an M \Theta N binary matrix. This task arises in correlation attack on a class of stream ciphers and in the decoding of error correcting codes. The unknown binary vector is replaced by a real vector of probabilities that are optimized by variational free energy minimization. The derived algorithms converge in computational time of order between wA and NwA , where wA is the number of 1s in the matrix A, but convergence to the correct solution is not guaranteed. Applied to error correcting codes based on sparse matrices A, these algorithms give a system with empirical performance comparable to that of BCH and ReedMuller codes. Applied to the inference of the state of a linear feedback shift register given the noisy output sequence, the algorithms offer a principled version of Meier and Staffelbach's (1989) algorithm B, thereby resolving the open proble...