کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6871186 | 1440180 | 2018 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Investigating results and performance of search and construction algorithms for word-based LFSRs, Ï-LFSRs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Investigating results and performance of search and construction algorithms for word-based LFSRs, Ï-LFSRs Investigating results and performance of search and construction algorithms for word-based LFSRs, Ï-LFSRs](/preview/png/6871186.png)
چکیده انگلیسی
Linear feedback shift registers (LFSRs) play a significant role in communications security and we investigate design of a selected class of word-based LFSRs known as Ï-LFSRs. Both the search algorithm and the construction algorithm generate efficient primitive Ï-LFSRs. The search algorithm first constructs the Ï-polynomial and then checks the primitiveness of the Ï-polynomial, whereas the construction algorithm for the Ï-LFSR, first finds a primitive polynomial f(x) and then constructs the primitive Ï-LFSR from f(x). In this paper, we present some novel results pertaining to the search algorithm for primitive Ï-LFSR along with the exhaustive search space complexity of the search algorithm for Ï-LFSRs. Then we investigate and compare the performance of the construction algorithm with the search algorithm for the primitive Ï-LFSR. Finally, the number of Ï-LFSRs similar to the Ï-LFSRs generated by the construction algorithm is provided.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 243, 10 July 2018, Pages 90-98
Journal: Discrete Applied Mathematics - Volume 243, 10 July 2018, Pages 90-98
نویسندگان
Susil Kumar Bishoi, Vashek Matyas,