Elliptic Curve Modulation (ECM) for Extremely Robust Physical Layer Encryption
This paper introduces Elliptic Curve Modulation (ECM), a novel modulation scheme that can be leveraged to effectively shuffle transmitted data while maintaining symbol error probability (SEP) performance equivalent to unencrypted systems. By utilizing the well-distributed elliptic curve points over the field of large primes, ECM enhances symbol obfuscation, making it a powerful foundation for physical-layer encryption (PLE). Each symbol is mapped from a predefined key while preserving a minimum Euclidean distance constraint, ensuring strong security against adversarial inference without compromising error performance. Building on ECM's strong obfuscation capabilities, we propose ECM with dynamic rotation (ECM-DR) as a practical PLE scheme that achieves near-maximal obfuscation while balancing precomputation complexity. By leveraging a reduced subset of precomputed elliptic curve points and key-based dynamic constellation rotation, ECM-DR ensures that each transmission remains unpredictable, significantly enhancing security compared to traditional PLE schemes without additional computational cost. Security analysis confirms ECM's resilience to brute-force attacks, while numerical results demonstrate its strong obfuscation capabilities. Furthermore, ECM-DR achieves near-maximum information entropy while preserving the SEP performance of unencrypted quadrature amplitude modulation (QAM), offering an extremely robust solution for secure wireless communications.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Murmurations of elliptic curves
We investigate the average value of the Frobenius trace at p over elliptic curves in a fixed conductor range with given rank. Plotting this average as p varies over the primes yields a striking oscillating pattern, the d…
Comparing AI Algorithms for Optimizing Elliptic Curve Cryptography Parameters in e-Commerce Integrations: A Pre-Quantum Analysis
This paper presents a comparative analysis between the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), two vital artificial intelligence algorithms, focusing on optimizing Elliptic Curve Cryptography (ECC) …
A Novel Demodulation and Estimation Algorithm for Blackout Communication: Extract Principal Components with Deep Learning
For reentry or near space communication, owing to the influence of the time-varying plasma sheath channel environment, the received IQ baseband signals are severely rotated on the constellation. Researches have shown tha…
Machine-Learning the Sato--Tate Conjecture
We apply some of the latest techniques from machine-learning to the arithmetic of hyperelliptic curves. More precisely we show that, with impressive accuracy and confidence (between 99 and 100 percent precision), and in …
BIG-bench Machine LearningMurmurations, Mestre--Nagao sums, and Convolutional Neural Networks for elliptic curves
We apply one-dimensional convolutional neural networks to the Frobenius traces of elliptic curves over $\mathbb{Q}$ and evaluate and interpret their predictive capacity. In keeping with similar experiments by Kazalicki--…