A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs

Dubrova, Elena

doi:10.1109/tit.2012.2214204

Cited by 47 publications

(31 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It is known how to make design choices for the size of internal state and the output function (number and position of inputs, nonlinearity, resiliency, algebraic degree, etc) so that the resulting filter generator is resistant to known attacks with a sufficient security margin [21][22][23]. Techniques that can guarantee long FSR period are also known [24,25]. Examples of stream ciphers based on the idea behind filter generators include Grain [3] and Trivium [4].…”

Section: Previous Workmentioning

confidence: 99%

See 1 more Smart Citation

Espresso: A stream cipher for 5G wireless communication systems

Dubrova

Hell

2015

Cryptogr. Commun.

Self Cite

View full text Add to dashboard Cite

Abstract. The demand for more efficient ciphers is a likely to sharpen with new generation of products and applications. Previous cipher designs typically focused on optimizing only one of the two parameters -hardware size or speed, for a given security level. In this paper, we present a methodology for designing a class of stream ciphers which takes into account both parameters simultaneously. We combine the advantage of the Galois configuration of NLFSRs, short propagation delay, with the advantage of the Fibonacci configuration of NLFSRs, which can be analyzed formally. According to our analysis, the presented stream cipher Espresso is the fastest among the ciphers below 1500 GE, including Grain-128 and Trivium.

show abstract

Section: Previous Workmentioning

confidence: 99%

“…It is known that NLFSRs constructed in this way have the period 2 n − 1 where n is the size of the state [24]. The equivalence of G and F can be shown by applying the Fibonacci-toGalois transformation [6].…”

Section: Design Detailsmentioning

confidence: 99%

Espresso: A stream cipher for 5G wireless communication systems

Dubrova

Hell

2015

Cryptogr. Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Recently, maximum period NLFSRs of order up to n = 64 have been constructed in the paper of Mandal and Gong [9], but these NLFSRs have very complicated algebraic normal form (ANF ). Dubrova [3] has given an example of a Galois shift register of order n = 100 generating a sequence with maximum period but this sequence does not have the de Bruijn property; i.e., some patterns of n-bits appear more than once in the sequence.…”

Section: Introductionmentioning

confidence: 99%

Searching for nonlinear feedback shift registers with parallel computing

Dbrowski

Labuzek

Rachwalik

et al. 2014

Information Processing Letters

View full text Add to dashboard Cite

Abstract. Nonlinear feedback shift registers (NLFSRs) are used to construct pseudorandom generators for stream ciphers. Their theory is not so complete as that of linear feedback shift registers (LFSRs). In general, it is not known how to construct all NLFSRs with maximum period. The direct method is to search for such registers with suitable properties. Advanced technology of parallel computing has been applied both in software and hardware to search for maximum period NLFSRs having a fairly simple algebraic normal form.

show abstract

“…At the same time, large size NLFSR generation with a guaranteed period remains an unsolved problem [13]. Only some special cases were considered in [14].…”

Section: Overview Of the Problem And Formulation Of Research Problemsmentioning

confidence: 99%

Development of the Search Method for Non-Linear Shift Registers Using Hardware, Implemented on Field Programmable Gate Arrays

Poluyanenko

2017

EUREKA: Physics and Engineering

View full text Add to dashboard Cite

The nonlinear feedback shift registers of the second order inare considered, because based on them it can be developed a generator of stream ciphers with enhanced cryptographic strength. Feasibility of nonlinear feedback shift register search is analyzed. These registers form a maximal length sequence, using programmable logic devices. Performance evaluation of programmable logic devices in the generation of pseudo-random sequence by nonlinear feedback shift registers is given. Recommendations to increase this performance are given. The dependence of the maximum generation rate (clock frequency), programmable logic devices on the number of concurrent nonlinear registers is analyzed. A comparison of the generation rate of the sequences that are generated by nonlinear feedback shift registers is done using hardware and software. The author suggests, describes and explores the search method of nonlinear feedback shift registers, generating a sequence with a maximum period. As the main result are found non-linear 26, 27, 28 and 29 degrees polynomials.

show abstract

A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs

Cited by 47 publications

References 24 publications

Espresso: A stream cipher for 5G wireless communication systems

Espresso: A stream cipher for 5G wireless communication systems

Searching for nonlinear feedback shift registers with parallel computing

Development of the Search Method for Non-Linear Shift Registers Using Hardware, Implemented on Field Programmable Gate Arrays

Contact Info

Product

Resources

About