The interrupted-sampling repeater jamming(ISRJ)can cause false targets to the radio-frequency proximity sensors(RFPSs),resulting in a serious decline in the target detection capability of the RFPS.This article propose...The interrupted-sampling repeater jamming(ISRJ)can cause false targets to the radio-frequency proximity sensors(RFPSs),resulting in a serious decline in the target detection capability of the RFPS.This article proposes a recognition method for RFPSs to identify the false targets caused by ISRJ.The proposed method is realized by assigning a unique identity(ID)to each RFPS,and each ID is a periodically and chaotically encrypted in every pulse period.The processing technique of the received signal is divided into ranging and ID decryption.In the ranging part,a high-resolution range profile(HRRP)can be obtained by performing pulse compression with the binary chaotic sequences.To suppress the noise,the singular value decomposition(SVD)is applied in the preprocessing.Regarding ID decryption,targets and ISRJ can be recognized through the encryption and decryption processes,which are controlled by random keys.An adaptability analysis conducted in terms of the peak-to-side lobe ratio(PSLR)and bit error rate(BER)indicates that the proposed method performs well within a 70-k Hz Doppler shift.A simulation and experimental results show that the proposed method achieves extremely stable target and ISRJ recognition accuracies at different signal-to-noise ratios(SNRs)and jamming-to-signal ratios(JSRs).展开更多
In secure communications,lightweight encryption has become crucial,particularly for resource-constrained applications such as embedded devices,wireless sensor networks,and the Internet of Things(IoT).As these systems ...In secure communications,lightweight encryption has become crucial,particularly for resource-constrained applications such as embedded devices,wireless sensor networks,and the Internet of Things(IoT).As these systems proliferate,cryptographic approaches that provide robust security while minimizing computing overhead,energy consumption,and memory usage are becoming increasingly essential.This study examines lightweight encryption techniques utilizing chaotic maps to ensure secure data transmission.Two algorithms are proposed,both employing the Logistic map;the first approach utilizes two logistic chaotic maps,while the second algorithm employs a single logistic chaotic map.Algorithm 1,including a two-stage mechanism that uses chaotic maps for both transposition and key generation,is distinguished by its robustness,guaranteeing a secure encryption method.The second techniqueutilized a single logistic chaoticmapeliminating the secondchaoticmapdecreases computing complexity while maintaining security.The efficacy of both algorithms was evaluated by subjecting them to NIST randomness tests following testing on text files of varying sizes.The findings demonstrate that the double chaotic map method regularly achieves elevated unpredictability and resilience.Conversely,the singular chaotic algorithm markedly lowers the duration necessary for encryption and decryption.These data suggest that while both algorithms are effective,their choice may be contingent upon specific security and processing speed requirements in practical applications.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.61973037)and(Grant No.61871414)Postdoctoral Fundation of China(Grant No.2022M720419)。
文摘The interrupted-sampling repeater jamming(ISRJ)can cause false targets to the radio-frequency proximity sensors(RFPSs),resulting in a serious decline in the target detection capability of the RFPS.This article proposes a recognition method for RFPSs to identify the false targets caused by ISRJ.The proposed method is realized by assigning a unique identity(ID)to each RFPS,and each ID is a periodically and chaotically encrypted in every pulse period.The processing technique of the received signal is divided into ranging and ID decryption.In the ranging part,a high-resolution range profile(HRRP)can be obtained by performing pulse compression with the binary chaotic sequences.To suppress the noise,the singular value decomposition(SVD)is applied in the preprocessing.Regarding ID decryption,targets and ISRJ can be recognized through the encryption and decryption processes,which are controlled by random keys.An adaptability analysis conducted in terms of the peak-to-side lobe ratio(PSLR)and bit error rate(BER)indicates that the proposed method performs well within a 70-k Hz Doppler shift.A simulation and experimental results show that the proposed method achieves extremely stable target and ISRJ recognition accuracies at different signal-to-noise ratios(SNRs)and jamming-to-signal ratios(JSRs).
文摘In secure communications,lightweight encryption has become crucial,particularly for resource-constrained applications such as embedded devices,wireless sensor networks,and the Internet of Things(IoT).As these systems proliferate,cryptographic approaches that provide robust security while minimizing computing overhead,energy consumption,and memory usage are becoming increasingly essential.This study examines lightweight encryption techniques utilizing chaotic maps to ensure secure data transmission.Two algorithms are proposed,both employing the Logistic map;the first approach utilizes two logistic chaotic maps,while the second algorithm employs a single logistic chaotic map.Algorithm 1,including a two-stage mechanism that uses chaotic maps for both transposition and key generation,is distinguished by its robustness,guaranteeing a secure encryption method.The second techniqueutilized a single logistic chaoticmapeliminating the secondchaoticmapdecreases computing complexity while maintaining security.The efficacy of both algorithms was evaluated by subjecting them to NIST randomness tests following testing on text files of varying sizes.The findings demonstrate that the double chaotic map method regularly achieves elevated unpredictability and resilience.Conversely,the singular chaotic algorithm markedly lowers the duration necessary for encryption and decryption.These data suggest that while both algorithms are effective,their choice may be contingent upon specific security and processing speed requirements in practical applications.
