Cryptographic Functions and Bit-Error-Rate Analysis with Almost $p$-ary Sequences
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
References
- P. V. Kumar, R. A. Scholtz, and L. R. Welch. ”Generalized bent functions and their properties.” Journal of Combinatorial Theory, Series A 40.1 (1985): 90-107.
- S. Kurt, and O. Yayla. ”Near Butson-Hadamard Matrices and Nonlinear Boolean Functions.” International Conference on Number-Theoretic Methods in Cryptology. Springer, Cham, 2017.
- B. ¨Ozden, and O. Yayla. ”Almost p-ary Sequences.” arXiv preprint arXiv:1807.11412 (2018).
- D. Jungnickel, and A. Pott. Perfect and Almost Perfect Se- quences. Discrete Applied Mathematics 95 (1999): 331-359.
- K.-U Schmidt. Quaternary Constant-Amplitude Codes for Mul- ticode CDMA. IEEE Transactions on Information Theory 55 (2007): 1824-1832.
- C.-L I, and R. D. Gitlin, Multi-code CDMA wireless per- sonal communications networks, Proc. IEEE ICC’95, Vol. 2, pp10601064, June 1995.
- J. Hollon, M. Rangaswamy, and P. Setlur. ”New families of optimal high-energy ternary sequences having good correlation properties.” Journal of Algebraic Combinatorics (2018): 1-38.
- S. W. Golomb, and G. Gong. Signal design for good correlation: for wireless communication, cryptography, and radar. Cambridge University Press, 2005.
Details
Primary Language
English
Subjects
-
Journal Section
-
Publication Date
September 1, 2019
Submission Date
-
Acceptance Date
-
Published in Issue
Year 2019 Volume: 8 Number: 3
APA
Ozden, B., & Yayla, O. (2019). Cryptographic Functions and Bit-Error-Rate Analysis with Almost $p$-ary Sequences. International Journal of Information Security Science, 8(3), 44-52. https://izlik.org/JA23RD97HP
AMA
1.Ozden B, Yayla O. Cryptographic Functions and Bit-Error-Rate Analysis with Almost $p$-ary Sequences. IJISS. 2019;8(3):44-52. https://izlik.org/JA23RD97HP
Chicago
Ozden, Busra, and Oguz Yayla. 2019. “Cryptographic Functions and Bit-Error-Rate Analysis With Almost $p$-Ary Sequences”. International Journal of Information Security Science 8 (3): 44-52. https://izlik.org/JA23RD97HP.
EndNote
Ozden B, Yayla O (September 1, 2019) Cryptographic Functions and Bit-Error-Rate Analysis with Almost $p$-ary Sequences. International Journal of Information Security Science 8 3 44–52.
IEEE
[1]B. Ozden and O. Yayla, “Cryptographic Functions and Bit-Error-Rate Analysis with Almost $p$-ary Sequences”, IJISS, vol. 8, no. 3, pp. 44–52, Sept. 2019, [Online]. Available: https://izlik.org/JA23RD97HP
ISNAD
Ozden, Busra - Yayla, Oguz. “Cryptographic Functions and Bit-Error-Rate Analysis With Almost $p$-Ary Sequences”. International Journal of Information Security Science 8/3 (September 1, 2019): 44-52. https://izlik.org/JA23RD97HP.
JAMA
1.Ozden B, Yayla O. Cryptographic Functions and Bit-Error-Rate Analysis with Almost $p$-ary Sequences. IJISS. 2019;8:44–52.
MLA
Ozden, Busra, and Oguz Yayla. “Cryptographic Functions and Bit-Error-Rate Analysis With Almost $p$-Ary Sequences”. International Journal of Information Security Science, vol. 8, no. 3, Sept. 2019, pp. 44-52, https://izlik.org/JA23RD97HP.
Vancouver
1.Busra Ozden, Oguz Yayla. Cryptographic Functions and Bit-Error-Rate Analysis with Almost $p$-ary Sequences. IJISS [Internet]. 2019 Sep. 1;8(3):44-52. Available from: https://izlik.org/JA23RD97HP