On the generation of multiple ℓ-sequences from single WFCSR automaton for cryptographic applications

Ganesh Akula, Vinod Naik, B. Umadevi
{"title":"On the generation of multiple ℓ-sequences from single WFCSR automaton for cryptographic applications","authors":"Ganesh Akula, Vinod Naik, B. Umadevi","doi":"10.1109/NGCT.2016.7877531","DOIUrl":null,"url":null,"abstract":"Feedback with carry shift registers (FCSRs) have been proposed as a promising alternate to the Linear feedback shift registers (LFSRs) in recent years. An approach based on traditional matrix representation has been proposed to design a Word oriented FCSR (WFCSR) automaton in [2], [3]. This automaton always generates a fixed ℓ-sequence, which is not desired for some cryptographic applications. In this paper, we present a new WFCSR automaton which enhances the traditional matrix representation by incorporating α-mask and/or β-mask operations on certain blocks (or words) of WFCSR automaton. By applying different α-mask and/or β-mask on certain blocks (or words) of WFCSR automaton, we can generate multiple ℓ-sequences without changing its structure. We can use the proposed approach to design WFCSR automaton in Fibonacci, Galois and Ring representations. The proposed WFCSR automaton can be adopted as a basic primitive to design any pseudo random number generator or stream cipher for cryptographic applications.","PeriodicalId":326018,"journal":{"name":"2016 2nd International Conference on Next Generation Computing Technologies (NGCT)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd International Conference on Next Generation Computing Technologies (NGCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGCT.2016.7877531","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Feedback with carry shift registers (FCSRs) have been proposed as a promising alternate to the Linear feedback shift registers (LFSRs) in recent years. An approach based on traditional matrix representation has been proposed to design a Word oriented FCSR (WFCSR) automaton in [2], [3]. This automaton always generates a fixed ℓ-sequence, which is not desired for some cryptographic applications. In this paper, we present a new WFCSR automaton which enhances the traditional matrix representation by incorporating α-mask and/or β-mask operations on certain blocks (or words) of WFCSR automaton. By applying different α-mask and/or β-mask on certain blocks (or words) of WFCSR automaton, we can generate multiple ℓ-sequences without changing its structure. We can use the proposed approach to design WFCSR automaton in Fibonacci, Galois and Ring representations. The proposed WFCSR automaton can be adopted as a basic primitive to design any pseudo random number generator or stream cipher for cryptographic applications.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于密码学应用的单个WFCSR自动机生成多个r -序列
近年来,带进位移位寄存器(FCSRs)的反馈被认为是线性反馈移位寄存器(LFSRs)的一种很有前途的替代方案。提出了一种基于传统矩阵表示的方法来设计b[2], b[3]中面向Word的FCSR (WFCSR)自动机。这个自动机总是生成一个固定的序列,这对于某些加密应用来说是不需要的。本文提出了一种新的WFCSR自动机,通过在WFCSR自动机的某些块(或词)上加入α-掩码和/或β-掩码运算,增强了传统的矩阵表示。通过在WFCSR自动机的特定块(或词)上施加不同的α-掩码和/或β-掩码,可以在不改变其结构的情况下生成多个α-序列。我们可以使用提出的方法在斐波那契、伽罗瓦和环表示中设计WFCSR自动机。所提出的WFCSR自动机可以作为设计任何伪随机数生成器或加密应用的流密码的基本原语。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
SCADA security issues and FPGA implementation of AES — A review Real-time analysis and visualization of online social media dynamics An advanced clustering scheme for wireless sensor networks using particle swarm optimization Physical telepresence: Growth trends of Tangible User Interface and its future Capital market forecasting by using sentimental analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1