Perfect Gaussian Integer Sequence Pairs from Cyclic Difference Set Pairs

2018 ◽  
Vol E101.A (5) ◽  
pp. 855-858 ◽  
Author(s):  
Hongbin LIN ◽  
Xiuping PENG ◽  
Chao FENG ◽  
Qisheng TONG ◽  
Kai LIU
Keyword(s):  
Difference Set ◽  
Gaussian Integer ◽  
Integer Sequence ◽  
Cyclic Difference Set

Perfect Gaussian Integer Sequence Pairs

2014 ◽  
Vol E97.A (7) ◽  
pp. 1568-1575 ◽  
Author(s):  
Chengqian XU ◽  
Xiuping PENG ◽  
Kai LIU
Keyword(s):  
Gaussian Integer ◽  
Integer Sequence

Construction of Type-II QC LDPC Codes Based on Perfect Cyclic Difference Set

2015 ◽  
Vol 24 (1) ◽  
pp. 146-151 ◽  
Author(s):  
Lijun Zhang ◽  
Bing Li ◽  
Leelung Cheng
Keyword(s):  
Ldpc Codes ◽  
Difference Set ◽  
Type Ii ◽  
Cyclic Difference Set

scholarly journals Pseudo Random Binary Sequence Based on Cyclic Difference Set

Symmetry ◽  
2020 ◽  
Vol 12 (8) ◽  
pp. 1202
Author(s):  
Md. Selim Al Mamun ◽  
Fatema Akhter
Keyword(s):  
Linear Complexity ◽  
Statistical Tests ◽  
Binary Sequence ◽  
Difference Set ◽  
Quadratic Residue ◽  
Binary Sequences ◽  
Online Information ◽  
Security Applications ◽  
Cyclic Difference Set ◽  
Quadratic Nonresidue

With the increasing reliance on technology, it has become crucial to secure every aspect of online information where pseudo random binary sequences (PRBS) can play an important role in today’s world of Internet. PRBS work in the fundamental mathematics behind the security of different protocols and cryptographic applications. This paper proposes a new PRBS namely MK (Mamun, Kumu) sequence for security applications. Proposed sequence is generated by primitive polynomial, cyclic difference set in elements of the field and binarized by quadratic residue (QR) and quadratic nonresidue (QNR). Introduction of cyclic difference set makes a special contribution to randomness of proposed sequence while QR/QNR-based binarization ensures uniformity of zeros and ones in sequence. Besides, proposed sequence has maximum cycle length and high linear complexity which are required properties for sequences to be used in security applications. Several experiments are conducted to verify randomness and results are presented in support of robustness of the proposed MK sequence. The randomness of proposed sequence is evaluated by popular statistical test suite, i.e., NIST STS 800-22 package. The test results confirmed that the proposed sequence is not affected by approximations of any kind and successfully passed all statistical tests defined in NIST STS 800-22 suite. Finally, the efficiency of proposed MK sequence is verified by comparing with some popular sequences in terms of uniformity in bit pattern distribution and linear complexity for sequences of different length. The experimental results validate that the proposed sequence has superior cryptographic properties than existing ones.

scholarly journals Design of Interleaved Thinned Planar Arrays Using Cyclic Difference Set

2012 ◽  
Vol 23 (12) ◽  
pp. 1351-1358
Author(s):  
Gina Kwon ◽  
Keum Cheol Hwang ◽  
Joon-Young Park ◽  
Seon-Joo Kim ◽  
Dong-Hwan Kim
Keyword(s):  
Difference Set ◽  
Planar Arrays ◽  
Cyclic Difference Set

Study of Safe Elliptic Curve Cryptography over Gaussian Integer

2020 ◽  
Vol E103.A (12) ◽  
pp. 1624-1628
Author(s):  
Kazuki NAGANUMA ◽  
Takashi SUZUKI ◽  
Hiroyuki TSUJI ◽  
Tomoaki KIMURA
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Gaussian Integer
Sign in / Sign up

Export Citation Format

Share Document