Systems of Signals Generating and Processing in the Field of on Board Communications
Estimation of the Power of Algebraic Geometric Codes Designed to Construct a Post-Quantum Algorithm for Ensuring Information Security of On-board Systems
Konstantin Nikolaevich Pankov, Михаил Михайлович Глухов
This paper continues the study of a post-quantum algorithm built on the basis of algebro-geometric codes, begun in previous works, in the interests of ensuring the information security of the Internet of things systems and on-board communication systems under the conditions of a quantum threat. The paper presents similar codes, the power of which lies above the Gilbert–Varshamov bound, and which can withstand known attacks on algorithms built on the basis of error-correcting codes.
This paper continues the study of a post-quantum algorithm built on the basis of algebro-geometric codes, begun in previous works, in the interests of ensuring the information security of the Internet of things systems and on-board communication systems under the conditions of a quantum threat. The paper presents similar codes, the power of which lies above the Gilbert–Varshamov bound, and which can withstand known attacks on algorithms built on the basis of error-correcting codes.
This paper discusses ways to ensure the information security of unmanned vehicles and Internet of Things systems under the conditions of a quantum threat. For this, it is proposed to use post-quantum algorithms, a review of the methods for constructing which and works devoted to their application to the considered sphere are given. The construction of a post-quantum algorithm with the help of linear error-correcting codes is considered in detail, for which it is proposed to use algebraic geometry codes with characteristics suitable for implementation in conditions of systems with limited resources. A theorem is proved that makes it possible to guarantee that the automorphism group of some algebro-geometric codes does not allow applying the Sidelnikov-Shestakov attack to them.
The increasing ubiquity of Internet of Things (IoT) devices has necessitated robust security measures, especially with the impending threat of quantum computing to conventional cryptographic protocols.In this study, we address the imperative of selecting an optimized post-quantum cryptographic algorithm tailored for implementation on resource-constrained IoT devices while ensuring compliance with stringent security standards.This research employs a comprehensive evaluation framework that considers the unique constraints of IoT devices, including limited computational capabilities and memory resources.Furthermore, our assessment accounts for the diverse security requirements stipulated by prevailing standards to guarantee resilience against both classical and quantum threats.Through a systematic analysis of various post-quantum cryptographic algorithms, encompassing factors such as computational efficiency and resistance to quantum attacks, this study identifies a select set of algorithms that exhibit promising suitability for IoT device deployment.The evaluation considers renowned standards, including NIST's Post-Quantum Cryptography Standardization initiative to align with industry best practices and interoperability.The findings presented in this study offer guidance to IoT device manufacturers, system architects, and security practitioners in making informed decisions regarding the adoption of post-quantum cryptographic algorithms.The selected algorithms not only demonstrate adeptness in mitigating quantum threats but also address resource constraints inherent in IoT environments, ensuring a secure foundation for the rapidly expanding ecosystem of interconnected devices.
The rapid advancement of quantum computing introduces a critical threat to established cryptographic systems, such as RSA and ECC, by enabling quantum attacks those classical systems cannot withstand. This evolving threat creates a necessity for post-quantum cryptographic (PQC) algorithms to ensure secure data transmission in the quantum era. PQC encompasses diverse approaches, including lattice-based, hash-based, code-based, and multivariate polynomial cryptography. Each category offers distinct advantages and challenges: lattice-based algorithms provide robust security but may require substantial computational resources, while hash-based approaches are easier to implement but limited in flexibility. Code-based algorithms deliver strong security with significant computational demand, and multivariate polynomial approaches boast efficiency, though they face scrutiny over quantum resilience. This paper evaluates these PQC algorithms in terms of their security, performance, and feasibility, identifying optimal methods to secure data transmission in a future where quantum threats are prevalent.
The emergence of quantum computing poses a serious threat to traditional communication systems, endangering the security of digital communications and critical infrastructure. Although existing cryptographic algorithms (such as RSA and ECC) rely on the inefficiency of computing large numbers or solving logarithm inequality problems, quantum algorithms (especially Shor's algorithm) can solve these problems efficiently. To mitigate this threat, the field of post-quantum cryptography (PQC) has emerged and focuses on developing cryptographic systems that are resilient to quantum attacks. The main techniques in PQC include lattice-based, hash-based, code-based, and multivariate polynomial cryptography. Lattice-based cryptography is the leading contender, providing high security and supporting good properties such as fully homomorphic encryption, but facing issues related to size and computational efficiency. Hash-based encryption enables strong digital signatures but has limitations. Code-based encryption based on error-correcting codes provides proof of security but requires small size. Multivariate polynomial cryptography has good performance but has drawbacks in some applications. While standardization efforts led by organizations such as NIST continue, PQC is at the forefront of protecting the digital future from the impact of quantum computing, ensuring the integrity and confidentiality of information in the post-quantum era.
The explosive growth of Industrial Internet of Things (IIoT) technologies has been reshaping manufacturing, energy, transportation and infrastructure with real-time monitoring and automation supported by predictive analytics. The more interconnected machines are, the more vulnerable they become to advanced cyberattacks. RSA and ECC are two of the dominant cryptographic algorithms that 60% of the IIoT communications today. They are still susceptible to quantum computing attacks, especially from Shor, which can easily break public-key encryption. This new risk, and the threat it represents, calls for a monitoring of the quantum situation by adding Post Quantum Cryptography (PQC) to guarantee data privacy and resilient systems. This work studies the quantum-empowered security approach to IIoT environment and considers lattice-based, hash-based and code-based cryptography techniques immune to quantum attacks. This paper investigates the industrial system design demands, identifies some of these weaknesses, and presents a secure communication architecture including post-quantum cryptography for device authentication, secure firmware updates and data encryption. Studies show that due to constraints in resources, triage for IIoT devices is difficult, especially because of limitations of processors, among others; latency and scalability are two issues. The approach proposed showcases a means for industrial cybersecurity to benefit from post-quantum cryptography without losing efficiency.
The rapid proliferation of Internet of Things (IoT) devices has heightened concerns regarding their security and privacy. Conventional cryptographic methods underpinning IoT security are increasingly threatened by the emergence of quantum computing, which promises to break widely used encryption algorithms such as RSA and ECC. This paper explores post-quantum cryptographic (PQC) algorithms tailored to the resource-constrained nature of IoT environments. It analyzes lattice-based, hash-based, code-based, and multivariate polynomial cryptographic schemes as promising candidates for securing IoT communications against quantum attacks. The paper further discusses implementation challenges, performance considerations, and potential pathways for integrating PQC within existing IoT architectures. Empirical data on computational efficiency and security strength are also presented to guide future deployment.