Construction of Transition Matrices for Ternary Ring Feedback With Carry Shift Registers

Pei, Dong; Lin, Zhiqiang; Zhang, Xiaolei

doi:10.1109/tit.2015.2416712

Cited by 6 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We propose a word-based Ring FCSR [26], [27], [28]. The major aim of our approach is to develop an optimized software-based design using a transition matrix (A) [29]. Block matrix(A) is obtained from M n/w .…”

Section: Design Of Ring-filter-fcsr-32-bit (Rff32)mentioning

confidence: 99%

Design and Analysis of a new Stream Cipher based on Ring FCSR Automaton

Gundaram¹,

Tentu²,

Guntupalli³

et al. 2023

IJCDS

View full text Add to dashboard Cite

Feedback with Carry Shift Registers (FCSRs) are being most commonly used in the design of new stream ciphers. This is because the FCSRs have resistance to correlation and algebraic attacks because of their quadratic feedback [1], [2]. Two representations of FCSRs, namely, Galois and Fibonacci are quite popular. However, stream cipher designed using any of these representations is vulnerable to many attacks as proposed in [3], [4]. A new representation called the ring representation, which generalizes and avoids the weaknesses of both the representations of FCSRs has been proposed in [5]. Similar to other representations, the ring representations produce sequences that have high periods and entropy. The advantage of ring representation is that it results in faster diffusion and reduced implementation costs when compared to Galois and Fibonacci. This paper presents two designs of stream cipher based on ring representations. In both algorithms, the output is produced by linear filters that pass randomness tests. The ciphers proposed have undergone a thorough security analysis.

show abstract

Section: Design Of Ring-filter-fcsr-32-bit (Rff32)mentioning

confidence: 99%

Design and Analysis of a new Stream Cipher based on Ring FCSR Automaton

Gundaram¹,

Tentu²,

Guntupalli³

et al. 2023

IJCDS

View full text Add to dashboard Cite

show abstract

“…Integer encoding methods for signed-digit representation, which remove a stream of non-zero bits, include Booth encoding [1], a Fibonacci encoding [2] and Non-Adjacent Form (NAF). Compared to the other encoding methods, NAF has been used in diverse applications such as public key cryptography [3][4][5][6], packet filtering [7][8], constructing a ternary FCSRs [9][10] and analysis for medical predictive models [11]. In particular, NAF has been actively used in some exponentiation-based public-key cryptographic algorithms including RSA [12] and Elliptic Curve Cryptography (ECC) [13][14].…”

Section: Introductionmentioning

confidence: 99%

w-Bit Shifting Non-Adjacent Form Conversion

2018

KSII TIIS

View full text Add to dashboard Cite

As a unique form of signed-digit representation, non-adjacent form (NAF) minimizes Hamming weight by removing a stream of non-zero bits from the binary representation of positive integer. Thanks to this strong point, NAF has been used in various applications such as cryptography, packet filtering and so on. In this paper, to improve the NAF conversion speed of the algorithm, we propose a new NAF conversion algorithm, called-bit Shifting Non-Adjacent Form(), where is width of scanning window. By skipping some unnecessary bit comparisons, the proposed algorithm improves the NAF conversion speed of the algorithm. To verify the excellence of the algorithm, the algorithm and the algorithm are implemented in the 8-bit microprocessor ATmega128. By measuring CPU cycle counter for the NAF conversion under various input patterns, we show that the 2 algorithm not only increases the NAF conversion speed by 24% on average but also reduces deviation in the NAF conversion time for each input pattern by 36%, compared to the 2 algorithm. In addition, we show that algorithm is always faster than algorithm, regardless of the size of .

show abstract