A CDMA scheme based on perfect Gaussian integer sequences

Chang, Hsin‐Chiu; Lin, Shieh-Chiang; Lee, Chong-Dao

doi:10.1016/j.aeue.2017.03.008

Cited by 17 publications

(12 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where the superscript * denotes the complex conjugate operation, and (•) N is the modulo N operation. Define Theorem 1: ( [18]) In addition to the N -tuple s = (a, 0, . .…”

Section: Preliminaries a Definitions Of Pgismentioning

confidence: 99%

“…m 1 = (20,5,13,16,5,18,1,20,21,18,5,27,9,19,27,20,23,5,14,20,25,27,4,5,7,18,5,5,19,27,20,15,4,1,25).…”

Section: Adaptation To Iot Applicationsmentioning

confidence: 99%

“…Even though the encryption key w ′ is with small period and has only five nonzero coefficients, it still achieves the goal of expanding differences between c and c 1 two ciphertexts. However, if PGIS s 35 , appeared in (18), is applied to encrypt these two messages, the entire contents of two ciphertexts,c 2 and c 3 , are extremely different.…”

Section: Adaptation To Iot Applicationsmentioning

confidence: 99%

“…PGISs were also adapted as the frequency-domain comb-spectrum (CS) codes for a novel CS-CDMA system [17]. Recently, Chang developed a CDMA scheme based on PGISs, called the PGIS-CDMA system [18]. This is the first study to apply PGISs to a data encryption and decryption scheme, where the operation of data encryption is made through circular convolution.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Novel Hybrid Public/Private Key Cryptography Based on Perfect Gaussian Integer Sequences

et al. 2021

View full text Add to dashboard Cite

This paper proposes a novel hybrid public/private key cryptography scheme based on perfect Gaussian integer sequences (PGISs) of period N = pq. First, a review study of construction degree-4 PGIS is addressed. We show that circular convolution over PGISs is a trapdoor one-way permutation function that enables simultaneous cipher encryption and digital signatures. To implement the proposed cipher encryption scheme, a private PGIS is assigned as the encryption key sequence for circular convolution with the plaintext to generate the ciphertext. The reverse decryption key sequence involves the time reflection and complex conjugation of the encryption sequence, which can be regenerated using a pair of public and private keys. The security level of the proposed scheme is the same as that of the Rivest-Shamir-Adleman (RSA) system; however, the capacity of a cryptosystem based on PGISs may outperform that of based on RSA, because the abundant PGISs are available. Simulation results show that the approximation error when finite digits are used to represent the irrational coefficients of a normalized PGIS can be relatively small compared with the noise. This contributes to the simplicity of this scheme's implementation. With the fast development of IoT (internet of things), the adaptation and applicability of the proposed scheme to IoT platforms are also addressed, where lightweight cryptographic functions are preferable due to the limited resources of IoT devices.

show abstract

“…where the superscript * denotes the complex conjugate operation, and (•) N is the modulo N operation. Define Theorem 1: ( [18]) In addition to the N -tuple s = (a, 0, . .…”

Section: Preliminaries a Definitions Of Pgismentioning

confidence: 99%

“…m 1 = (20,5,13,16,5,18,1,20,21,18,5,27,9,19,27,20,23,5,14,20,25,27,4,5,7,18,5,5,19,27,20,15,4,1,25).…”

Section: Adaptation To Iot Applicationsmentioning

confidence: 99%

Section: Adaptation To Iot Applicationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Novel Hybrid Public/Private Key Cryptography Based on Perfect Gaussian Integer Sequences

et al. 2021

View full text Add to dashboard Cite

show abstract

“…The unique structure of CDMA can be utilized by considering the signal design aspect. PAPR can be minimized through finding a suitable family of sequences [3], [4]. MC-CDMA encounters another problem, i.e.…”

Section: Introductionmentioning

confidence: 99%

Suitable Spreading Sequences for Asynchronous MC-CDMA Systems

Addad¹,

Djebbari²

2018

JTIT

View full text Add to dashboard Cite

In order to meet the demand of high data rate transmission with good quality maintained, the multi-carrier code division multiple access (MC-CDMA) technology is considered for the next generation wireless communication systems. However, their high crest factor (CF) is one of the major drawbacks of multi-carrier transmission systems. Thus, CF reduction is one of the most important research areas in MC-CDMA systems. In addition, asynchronous MC-CDMA suﬀers from the eﬀect of multiple access interference (MAI), caused by all users active in the system. Degradation of the system’s bit error rate (BER) caused by MAI must be taken into consideration as well. The aim of this paper is to provide a comparative study on the enhancement of performance of an MC-CDMA system. The spreading sequences used in CDMA play an important role in CF and interference reduction. Hence, spreading sequences should be selected to simultaneously ensure low CF and low BER values. Therefore, the eﬀect that correlation properties of sequences exert on CF values is investigated in this study. Furthermore, a numerical BER evaluation, as a function of the signal-to-noise ratio (SNR) and the number of users, is provided. The results obtained indicate that a trade-oﬀ between the two criteria is necessary to ensure good performance. It was concluded that zero correlation zone (ZCZ) sequences are the most suitable spreading sequences as far as the satisfaction of the above criteria is concerned.

show abstract

Generation of Random Sequences Based on Exponential Numbers

Chang

2019

Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery

View full text Add to dashboard Cite

A CDMA scheme based on perfect Gaussian integer sequences

Cited by 17 publications

References 31 publications

Novel Hybrid Public/Private Key Cryptography Based on Perfect Gaussian Integer Sequences

Novel Hybrid Public/Private Key Cryptography Based on Perfect Gaussian Integer Sequences

Suitable Spreading Sequences for Asynchronous MC-CDMA Systems

Generation of Random Sequences Based on Exponential Numbers

Contact Info

Product

Resources

About