Cryptographic Functions and Bit-Error-Rate Analysis with Almost $p$-ary Sequences

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

International Journal of Information Security Science
Volume:8 Issue:3
Cryptographic Functions and Bit-Error-Rate Analysis with Almost $p$-ary Sequences

Cryptographic Functions and Bit-Error-Rate Analysis with Almost $p$-ary Sequences

Authors : Busra OZDEN, Oguz YAYLA

Pages : 44-52

View : 39 | Download : 10

Publication Date : 2019-09-01

Article Type : Research Paper

Abstract :Sequences are used for achieving non-linearity in a cryptosystem, and they are important in Code Division Multiple Access CDMA to ensure a proper communication. In this study, we show a method for obtaining cryptographic functions from p-ary sequences with s consecutive zero-symbols of type γ1, γ2 . In fact, most of the cases we obtain functions with the highest non-linearity, i.e. generalized bent functions. In CDMA, instead of distributing time and frequency sources to users, each user is given a unique sequence to transmit data at the same frequency and time. In this study, we examined the bit-error-rate BER performance of p-ary sequences with s consecutive zero-symbols of type γ1, γ2 on CDMA.
Keywords : nearly perfect sequences, cryptographic functions, generalized bent function, CDMA, bit error rate

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.