Abstract

In this paper, we propose a new synchronous stream cipher called SSCQF whose secret-key is Ks=(z1,...zn) where zi is a positive integer. Let d1, d2,..., dN be N positive integers in {0,1,...2m -1} such that di=zi mod2m with m and m>=8. Our purpose is to combine a linear feedback shift registers LFSRs, the arithmetic of quadratic fields: more precisely the unit group of quadratic fields, and Boolean functions [14]. Encryption and decryption are done by XRO`ing the output pseudorandom number generator with the plaintext and ciphertext respectively. The basic ingredients of this proposal stream generator SSCQF rely on the three following processes: In process I , we constructed the initial vectors IV={X1,...,Xn} from the secret-key Ks=(z1,...zn) by using the fundamental unit of Q( Nvdi) if di is a square free integer otherwise by splitting di, and in process II, we regenerate, from the vectors Xi, the vectors Yi having the same length L, that is divisible by 8 (equations (2) and (3) ). In process III , for each Yi , we assign L/8 linear feedback shift registers, each of length eight. We then obtain N x L/8 linear feedback shift registers that are initialized by the binary sequence regenerated by process II , filtered by primitive polynomials, and the combine the binary sequence output with L/8 Boolean functions. The keystream generator, denoted K , is a concatenation of the output binary sequences of all Boolean functions.

Highlights

  • The proposed stream cipher SSCQF is a binary addition stream cipher [14]

  • We propose a new synchronous stream cipher called SSCQF whose secret-key is KS z1,..., zN where zi are positive integers, based upon the combination of a linear feedback shift registers LFSRs [14], the congruence modulo 2m with m N and m 8, the arithmetic of quadratic fields: more precisely the unit group of quadratic fields, and the L / 8 combining functions

  • The vectors Yi for all i 1,..., N generated in the process II, are of the same length L divisible by eight. We subdivide it into L / 8 binary sequences of length eight; each initializes a linear feedback shift register filtered by the primitive polynomial of degree eight

Read more

Summary

INTRODUCTION

The proposed stream cipher SSCQF is a binary addition stream cipher [14]. In a binary addition stream cipher, the plaintext is given as a string m1, m2 ,... of elements of the finite field k 2 0,1. We propose a new synchronous stream cipher called SSCQF whose secret-key is KS z1,..., zN where zi are positive integers, based upon the combination of a linear feedback shift registers LFSRs [14], the congruence modulo 2m with m N and m 8 , the arithmetic of quadratic fields: more precisely the unit group of quadratic fields, and the L / 8 combining functions. N L / 8 linear feedback shift registers that are initialized by the binary sequence regenerated by process II. We combine the output binary sequence of all linear feedback www.ijacsa.thesai.org (IJACSA) International Journal of Advanced Computer Science and Applications, Vol 6, No 12, 2015 shift registers, namely, LFSR ij with L / 8 Booleans functions R1, ..., R L / 8. The keystream generator denoted K , is a concatenation of the output binary sequences of all Boolean functions R j. : Set of natural numbers. : Square root. : Length of ith binary sequence. : Half-length of ith binary sequence

PRELIMINARY
A BRIEF DESCRIPTION OF SSCQF ALGORITHM
Process III
BEHAVIORAL STUDY
Correlation and normalized distance of periodic binary strings
Impact of the lengths on the output binary sequences of all Boolean functions
Impact of Minimal Perturbations
IMPLEMENTATION
Implementation of process I
Implementation of process II
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.