2020 1st. Information Technology to Enhance E-Learning and Other Application (IT-ELA 2020
DOI: 10.1109/it-ela50150.2020.9253074
|View full text |Cite
|
Sign up to set email alerts
|

A proposed Development of Clock Control Stream Cipher based on Suitable Attack

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 11 publications
0
4
0
Order By: Relevance
“…In our scheme, the internal state of the proposed cipher consists of LFSR α , LFSR β , LFSR γ , LFSR a , LFSR b , and LFSR c , and all of these LFSRs are six maximum-length LFSRs of lengths 31, 17, 13, 61, 89, and 107, respectively. The respective periods of LFSR α , LFSR β , LFSR γ , LFSR a , LFSR b , and LFSR c are denoted as P α , P β , P γ , P a , P b , and P c , respectively, and they are equal to 2 31 − 1, 2 17 − 1, 2 13 − 1, 2 61 − 1, 2 89 − 1, and 2 107 − 1, respectively. Notice that all of these periods are prime numbers.…”
Section: Periodmentioning
confidence: 99%
See 1 more Smart Citation
“…In our scheme, the internal state of the proposed cipher consists of LFSR α , LFSR β , LFSR γ , LFSR a , LFSR b , and LFSR c , and all of these LFSRs are six maximum-length LFSRs of lengths 31, 17, 13, 61, 89, and 107, respectively. The respective periods of LFSR α , LFSR β , LFSR γ , LFSR a , LFSR b , and LFSR c are denoted as P α , P β , P γ , P a , P b , and P c , respectively, and they are equal to 2 31 − 1, 2 17 − 1, 2 13 − 1, 2 61 − 1, 2 89 − 1, and 2 107 − 1, respectively. Notice that all of these periods are prime numbers.…”
Section: Periodmentioning
confidence: 99%
“…To resist this attack and spoil the linearity properties of LFSRs, there are three basic schemes that can be achieved, which include: a nonlinear combining function on the outputs of several LFSRs, a nonlinear filtering function on the contents of a single LFSR, and using the output of one (or more) LFSRs to control the clock of one or more other LFSRs, which are the clock-controlled LFSRs. All of these schemes require a nonlinear function to combine the outputs of LFSRs or control the input clock for clock-controlled LFSRs [10][11][12][13][14]. The clock-controlled based stream cipher A5/1 uses the nonlinear majority function as the nonlinear function to promote its security.…”
Section: Introductionmentioning
confidence: 99%
“…When the gates of the two LFSRs are p, q and gcd(p, q) = 1, the period of the output sequence is (2 p − 1)(2 q − 1). The clock-control generator uses the sequence generated by one LFSR to control the shift of another LFSR [26], with the maximum period being (2 p − 1)(2 q − 1). We show the clock-control generator in the Figure 3.…”
Section: Typical Nonlinear Sequence Generatorsmentioning
confidence: 99%
“…This means that m-sequences with low linear complexity are easy to recover; thus, nonlinear pseudorandom generators have become a new research direction [12][13][14][15]. Some classical nonlinear pseudorandom sequence generators are widely used and studied, such as the Geffe generator [16][17][18][19][20], JK flip-flop [21][22][23] and clock-control generator [24][25][26].…”
Section: Introductionmentioning
confidence: 99%