Post-Quantum and Code-Based Cryptography—Some Prospective Research Directions

Balamurugan, Chithralekha; Singh, Kalpana; Ganesan, Ganeshvani; Rajarajan, Muttukrishnan

doi:10.3390/cryptography5040038

Cited by 26 publications

(7 citation statements)

References 68 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The various PQC primitive-based algorithms shortlisted by the NIST in their third round of competitions are presented in Table 13. 125,[155][156][157] In Table 14, we also…”

Section: • Various Communication Protocolsmentioning

confidence: 99%

“…In this section, we are also exploring other PQC‐based primitives in Table 12 124 with NIST shortlisted schemes shown in Figure 8B. The various PQC primitive‐based algorithms shortlisted by the NIST in their third round of competitions are presented in Table 13 125,155‐157 . In Table 14, we also discussed several open‐source tools and packages for PQC.…”

Section: Exploring Further Scopes and Vision In The Pqc For The Sgnmentioning

confidence: 99%

See 1 more Smart Citation

A survey on lattice‐based security and authentication schemes for smart‐grid networks in the post‐quantum era

Shekhawat,

Gupta

2024

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThe present scenario witnesses “the second quantum revolution,” which has enabled the development of revolutionary novel quantum tools. Quantum computing endeavors to establish higher computing standards that can potentially solve complex structures. Post‐quantum cryptography (PQC) has emerged as one of the new domains of cryptography, which is resilient to quantum attacks owing to the revolution in quantum computing. To ensure quantum security, the lattice‐based cryptosystem (LB‐cryptosystem) is one of the promising tools of PQC to address quantum‐based threats. The traditional security algorithms, such as RSA and Diffie–Hellman (DH), are strong enough to resist present security threats. However, it has been predicted that quantum technologies have the capability to break the security of most traditional algorithms whose security is based on prime factorization and DH‐type hard problems. Therefore, research is currently focused on addressing the security and privacy threats by using LB‐cryptosystems to secure various applications, organizations' data, and information infrastructure in the quantum era. The purpose of this article is to investigate recent advances in LB‐cryptosystems that may allow the design of secure models for smart‐grid networks (SGNs) against existing and future quantum attacks. SGNs have been explored as the bi‐directional assimilation of communication in terms of electricity generation, transmission, allocation, and utilization. This survey provides a comprehensive overview of LB‐cryptosystems, as well as their potential applications in securing SGNs. Lastly, the article summarizes the various PQC primitives, NIST selected algorithms, open‐source tools along with their packages, and various PQC industrial initiatives, and also compares traditional cryptographic schemes with other PQC.

show abstract

“…The various PQC primitive-based algorithms shortlisted by the NIST in their third round of competitions are presented in Table 13. 125,[155][156][157] In Table 14, we also…”

Section: • Various Communication Protocolsmentioning

confidence: 99%

Section: Exploring Further Scopes and Vision In The Pqc For The Sgnmentioning

confidence: 99%

A survey on lattice‐based security and authentication schemes for smart‐grid networks in the post‐quantum era

Shekhawat,

Gupta

2024

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…However, their security is no longer guaranteed, as effective attack techniques have been disclosed against most variants. On the other hand, the McEliece cryptosystem based on the binary Goppa codes is still considered secure, as efficient attack techniques against it have yet to be disclosed [10].…”

Section: Introductionmentioning

confidence: 99%

An Efficient Implementation Scheme for Lattice Reduction in the List-Decoding Algorithm for the Binary Goppa Codes

Yu,

Lim

2024

IEEE Access

View full text Add to dashboard Cite

This paper presents a scheme that is designed for the effective implementation of lattice reduction for polynomial matrices within the list-decoding algorithm that is applied to the binary Goppa codes. The reduced form of a polynomial matrix is obtained by transforming the given polynomial matrix into a matrix in the weak Popov form. To achieve efficient lattice reduction within the list-decoding algorithm, the proposed scheme reorganizes the polynomial matrix by leveraging its inherent properties and converts it into the weak Popov form. When using the proposed implementation technique to convert the reorganized polynomial matrix into the weak Popov form, the number of simple transformations of the first kind that had to be performed was reduced by about 15% compared to the technique used to convert the original matrix to the weak Popov form. As a result, the execution time of lattice reduction was also decreased. INDEX TERMS binaryGoppa codes, McEliece cryptosystem, list-decoing algorithm, weak Popov form, polynomial matrix, lttice reduction.

show abstract

“…These algorithms are secure and efficient in the classical computing environment, but they are not safe in the quantum computing environment. Therefore, it is urgent to explore anti-quantum algorithms, such as lattice cryptography [13,14], hash cryptography [15], and code-based cryptography [16]. The BCCLS also needs a more secure signature algorithm to resist quantum attacks empowered by the quantum computer.…”

Section: Introductionmentioning

confidence: 99%

Quantum Secure Undeniable Signature for Blockchain-Enabled Cold-Chain Logistics System

Li¹,

Shen²,

Shi³

et al. 2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Data security and user privacy are two main security concerns in the cold-chain logistics system (CCLS). Many security issues exist in traditional CCLS, destroying data security and user privacy. The digital signature can provide data verification and identity authentication based on the mathematical difficulty problem for logistics data sharing in CCLS. This paper first established a blockchain-enabled cold-chain logistics system (BCCLS) based on union blockchain technology, which can provide secure data sharing among different logistics nodes and guarantee logistics data security with the untampered blockchain ledger. Meanwhile, a lattice-based undeniable signature scheme is designed to strengthen the security of logistics data and user privacy against quantum attacks. This scheme is based on the lattice assumption, which can provide anti-quantum security for BCCLS in the future quantum computer age. It also establishes the undeniable mechanism that guarantees that the actual signer cannot deny a valid signature. Then, security proof shows that this undeniable signature scheme is correct and safe, and an efficiency comparison shows that it is more efficient than other schemes in similar literature. The performance evaluations of transaction throughput and latency show that the proposed BCCLS is efficient and practical. This work can improve the security and efficiency of logistics data management and promote the reform and development of the logistics industry.

show abstract

Post-Quantum and Code-Based Cryptography—Some Prospective Research Directions

Cited by 26 publications

References 68 publications

A survey on lattice‐based security and authentication schemes for smart‐grid networks in the post‐quantum era

A survey on lattice‐based security and authentication schemes for smart‐grid networks in the post‐quantum era

An Efficient Implementation Scheme for Lattice Reduction in the List-Decoding Algorithm for the Binary Goppa Codes

Quantum Secure Undeniable Signature for Blockchain-Enabled Cold-Chain Logistics System

Contact Info

Product

Resources

About