Results 11  20
of
44
Investigation of FCSRbased pseudorandom sequence generators for stream ciphers
 In Proceedings of the 3rd. International Conference on Networking
, 2004
"... Abstract — In this paper, feedback with carry shift registers (FCSRs) are analyzed with main focus on the general case of FCSRs with arbitrary connection integer and on maximumperiod FCSRs. Moreover, a keystream generator that employs the structure of the linear feedback shift register (LFSR)based ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract — In this paper, feedback with carry shift registers (FCSRs) are analyzed with main focus on the general case of FCSRs with arbitrary connection integer and on maximumperiod FCSRs. Moreover, a keystream generator that employs the structure of the linear feedback shift register (LFSR)based Geffegenerator is studied in connection with FCSRs as a special nonlinear combining generator. The considered generators are investigated by means of analysis and simulation with respect to period, pattern distribution, and in particular concerning the important property of the linear complexity. The results are a first basis to design and analyze FCSRbased stream ciphers. Keywords — Feedback with carry shift register (FCSR), binary pseudorandom sequences, stream ciphers, nonlinear keystream generator. I.
SOFTWARE IMPLEMENTATION OF P−ADIC SELF−SHRINKING GENERATOR FOR AEROSPACE CRYPTOGRAPHIC SYSTEMS
, 2005
"... Abstract: To be suitable for use in aerospace cryptographic systems softwareoriented stream ciphers must be fast, uniform, scalable, consistent and unpredictable. With regard in the paper the software implementation of a fast stream cipher, named Self−Shrinking p−adic Generator which produces 8 bit ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract: To be suitable for use in aerospace cryptographic systems softwareoriented stream ciphers must be fast, uniform, scalable, consistent and unpredictable. With regard in the paper the software implementation of a fast stream cipher, named Self−Shrinking p−adic Generator which produces 8 bits (SSPG8) in one clock cycle, is proposed. The theoretical base of SelfShrinking padic Generator is recalled. The software implementation of padic Self−Shrinking Generator is described. Analysis of more than 300 aerospace images is presented. The results from statistical analysis show that the sequence, generated by padic SSPG8, is appropriate for a particular aerospace cryptographic application.
ON THE DISTINCTNESS OF MODULAR REDUCTIONS OF MAXIMAL LENGTH SEQUENCES MODULO ODD
"... Abstract. We discuss the distinctness problem of the reductions modulo M of maximal length sequences modulo powers of an odd prime p, where the integer M has a prime factor different from p. For any two different maximal length sequences generated by the same polynomial, we prove that their reductio ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We discuss the distinctness problem of the reductions modulo M of maximal length sequences modulo powers of an odd prime p, where the integer M has a prime factor different from p. For any two different maximal length sequences generated by the same polynomial, we prove that their reductions modulo M are distinct. In other words, the reduction modulo M of a maximal length sequence is proved to contain all the information of the original sequence. 1.
A new approach for FCSRs
"... Abstract. The Feedback with Carry Shift Registers (FCSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for the design of stream ciphers. FCSRs have good statistical properties and they provide a builtin nonlinearity. However, two attacks have shown that the curre ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. The Feedback with Carry Shift Registers (FCSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for the design of stream ciphers. FCSRs have good statistical properties and they provide a builtin nonlinearity. However, two attacks have shown that the current representations of FCSRs can introduce weaknesses in the cipher. We propose a new “ring ” representation of FCSRs based upon matrix definition which generalizes the Galois and Fibonacci representations. Our approach preserves the statistical properties and circumvents the weaknesses of the Fibonacci and Galois representations. Moreover, the ring representation leads to automata with a quicker diffusion characteristic and better implementation results. As an application, we describe a new version of FFCSR stream ciphers. Keywords: Stream cipher, FCSRs, ℓsequence, ring FCSRs. 1
XFCSR – A New Software Oriented Stream Cipher Based Upon FCSRs
 INDOCRYPT 2007
, 2007
"... Feedback with Carry Shift Registers (FCSRs) are a promising alternative to LFSRs in the design of stream ciphers. The previous constructions based on FCSRs were dedicated to hardware applications [3]. In this paper, we will describe XFCSR a family of software oriented stream ciphers using FCSRs. T ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Feedback with Carry Shift Registers (FCSRs) are a promising alternative to LFSRs in the design of stream ciphers. The previous constructions based on FCSRs were dedicated to hardware applications [3]. In this paper, we will describe XFCSR a family of software oriented stream ciphers using FCSRs. The core of the system is composed of two 256bits FCSRs. We propose two versions: XFCSR128 and XFCSR256 which output respectively 128 and 256 bits at each iteration. We study the resistance of our design against several cryptanalyses. These stream ciphers achieve a high throughput and are suitable for software applications (6.3 cycles/byte).
Research Summary
"... models for answering questions on the existence of secure families of sequence generators. 5. Design and analysis of families of sequences for secure spreadspectrum communications. These sequences include geometric sequences and dform sequences (the latter invented by me). ..."
Abstract
 Add to MetaCart
models for answering questions on the existence of secure families of sequence generators. 5. Design and analysis of families of sequences for secure spreadspectrum communications. These sequences include geometric sequences and dform sequences (the latter invented by me).
The Statistical Evaluation of the NESSIE Submission NUSH
, 2001
"... The purpose of this document is to give a statistical evaluation of the NESSIE submission NUSH. For this evaluation, we follow the recommendations of the NESSIE statistical evaluation process for blockcipher submissions as described in [Sch01a]. 1 Overview The NESSIE submission NUSH is a block cip ..."
Abstract
 Add to MetaCart
The purpose of this document is to give a statistical evaluation of the NESSIE submission NUSH. For this evaluation, we follow the recommendations of the NESSIE statistical evaluation process for blockcipher submissions as described in [Sch01a]. 1 Overview The NESSIE submission NUSH is a block cipher with several block sizes: 64, 128, or 256 bits and key sizes of 128, 192 or 256 bits. NUSH was submitted to the NESSIE project by LAN Crypto, Int., Russia. NUSH iterates 9 rounds for 64bit blocks, 17 rounds for 128bit blocks and 33 rounds for 256bit blocks. Each round of NUSH consists of four iterations. In such an iteration two out of four variables are updated using a subkey and the other two variables in a nonlinear manner. There are two di#erent kinds of iterations, one using bitwise OR, the other using bitwise AND. The cipher also has a prewhitening step and a postwhitening step where a subkey is added.
The Statistical Evaluation of the NESSIE Submission RC6
, 2001
"... The purpose of this document is to give a statistical evaluation of the NESSIE submission RC6. For this evaluation, we follow the recommendations of the NESSIE statistical evaluation process for blockcipher submissions as described in [Sch01a]. 1 Overview The NESSIE submission RC6 is a fully param ..."
Abstract
 Add to MetaCart
The purpose of this document is to give a statistical evaluation of the NESSIE submission RC6. For this evaluation, we follow the recommendations of the NESSIE statistical evaluation process for blockcipher submissions as described in [Sch01a]. 1 Overview The NESSIE submission RC6 is a fully parameterized family of encryption algorithms. A version of RC6 is more accurately specified as RC6w/r/b, where the word size is w bits, encryption consists of a nonnegative number of r rounds, and b denotes the length of the encryption key in bytes. For a 128bit block size, w = 32 and r = 20 are recommended values and RC6 is a shorthand to refer to such versions. The key length can vary between 0 and 256 bytes, though the most useful values mght be versions with 16, 24 and 32byte keys (128, 192 or 256 bits). RC6 was designed by Ronald L. Rivest, Matthew J. B.Robshaw, Ray Sidney, and Yiqun L. Yin. The plaintext is stored in four wbit registers (A, B, C, D), and B and D are added, modulo 2 w with two subkeys. In a cipher round the B and D registers are individually input into a quadratic function f(X) = (X # (2X + 1)) # lgw. The A and C registers are combined by exclusiveor and leftrotation by the output of f(B) and f(C) and subsequently combined with the round subkeys. The last operation in a round is left rotation of the register (A, B, C, D) into (B, C, D,A).
The Statistical Evaluation of the NESSIE Submission SAFER++
, 2001
"... The purpose of this document is to give a statistical evaluation of the NESSIE submission SAFER++. For this evaluation, we follow the recommendations of the NESSIE statistical evaluation process for blockcipher submissions as described in [Sch01a]. ..."
Abstract
 Add to MetaCart
The purpose of this document is to give a statistical evaluation of the NESSIE submission SAFER++. For this evaluation, we follow the recommendations of the NESSIE statistical evaluation process for blockcipher submissions as described in [Sch01a].
The Statistical Evaluation of the NESSIE Submission SHACAL
, 2001
"... The purpose of this document is to give a statistical evaluation of the NESSIE submission SHACAL. For this evaluation, we follow the recommendations of the NESSIE statistical evaluation process for blockcipher submissions as described in [Sch01a]. 1 Overview The NESSIE submission SHACAL is a 168b ..."
Abstract
 Add to MetaCart
The purpose of this document is to give a statistical evaluation of the NESSIE submission SHACAL. For this evaluation, we follow the recommendations of the NESSIE statistical evaluation process for blockcipher submissions as described in [Sch01a]. 1 Overview The NESSIE submission SHACAL is a 168bit block cipher with 512bit key (or shorter, but at least 128bit), designed by Helena Handschuh and David Naccache (Gemplus, France). The cipher is an encryption mode of the hash function SHA1, where the key is inserted as the message and the plaintest as the initial value. It uses four rounds, each consisting of 20 steps. In a step, one of five variables is updated using a word of the expanded key and the other four variables in a nonlinear manner (the di#erent rounds use di#erent nonlinear functions). In each stepd there is also a rotation of one of these other variables. Note that all five variables get updated four times in each round.