Benchmark Performance of a New Quantum-Safe Multivariate Polynomial Digital Signature Algorithm

Kuang, Randy; Perepechaenko, Maria; Toth, Ryan; Barbeau, Michel

doi:10.1109/qce53715.2022.00067

Cited by 8 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous work in this area mainly focused on the comparison between public key algorithms that are part of the NIST selection process [20,[38][39][40]. Such comparison needed to be made between algorithms that provide the same level of security, therefore, NIST has provided a collection of broad security strength categories as outlined in Table 3.…”

Section: ) Nist Security Level Definitionsmentioning

confidence: 99%

“…There have been several studies in the literature aimed at evaluating the performance of proposed PQC algorithms. For example, the work in [40] used the toolkit SUPERCOP 3 to test the performance of key generation, signing, and verifying procedures of various digital signature schemes including two of the NIST finalists Dilithium and Falcon. A 16-core Intel Core i7-10700 clocked at 2.9GHz was used to run this toolkit.…”

Section: ) Performance Comparisonmentioning

confidence: 99%

See 1 more Smart Citation

Evaluation of Performance, Energy, and Computation Costs of Quantum-Attack Resilient Encryption Algorithms for Embedded Devices

Halak,

Gibson,

Henley

et al. 2024

IEEE Access

View full text Add to dashboard Cite

The accelerated development of quantum computers poses a direct threat to all current standards of public key encryption, for example, the Shor algorithm exploits the superposition state of the qubits to solve the problem of integer factorization in polynomial time, rendering all systems whose security relies on this hard mathematical problem not secure. Public key encryption algorithms are used in a multitude of applications that from the core of the digital world (e.g., emails, banking, digital currency, defense, and communication.). The prospects of a quantum machine that can break such systems are too risky to ignore, even if such a computer still needs thirty years to build. This is because adversaries can be storing data now to decrypt later aka. SNLD attack, moreover, some systems have an operational lifetime that spans more than thirty years (e.g., defense, aviation industry). Consequently, the work has already started to develop quantumattack resilient security schemes. The number of Internet of Things (IoT) devices is expected to be around 29 billion in 2030, forming a significant portion of all computing machines. Most of these will be implemented as embedded systems with limited resources. Consequently, assessing the energy and computational overheads of the quantum-attack resilient security schemes is vital. This work presents a comprehensive study that evaluates the energy and performance costs of the proposed solutions in resource-constrained devices, in comparison with the existing schemes. This was achieved through the development of a testbed that emulates a client-server configuration, wherein both devices perform mutual authentication and then agree on a shared key using the TLS protocol. A Raspberry Pi 3b+ was used as a server, and a client in the first set of experiments. Raspberry Pi Pico W was the client in the second group of tests. The results of the evaluation have shown that Kyber1-Dilithuim-2 is the most resource-efficient solution, it outperforms all other PQC algorithms, including the current scheme that uses elliptic curve cryptography. Our study has also shown the digital signature scheme Sphinx+ is associated with significant latency and energy costs so may not be suitable for IoT-type devices.

show abstract

Section: ) Nist Security Level Definitionsmentioning

confidence: 99%

Section: ) Performance Comparisonmentioning

confidence: 99%

Evaluation of Performance, Energy, and Computation Costs of Quantum-Attack Resilient Encryption Algorithms for Embedded Devices

Halak,

Gibson,

Henley

et al. 2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Overall, the MPPK algorithm is a secure and efficient means of exchanging messages in a prime Galois field, relying on complex polynomial operations to ensure the confidentiality of communications [54].…”

Section: Multivariate Polynomial Public Key Digital Signature Schemementioning

confidence: 99%

“…Directly spoofing the signature These can be classified based on chosen-message, known-message, and key-only. There are two sub-categories in the chosen-message attack: direct-chosen and generic-chosen, depending on whether the adversary knows the public key [54]. If the adversary has access to the public key, they can use the direct-chosen technique to replace a message with the signer's signature with the one they prefer.…”

Section: Possible Security Attacks On Mppk/dsmentioning

confidence: 99%

A Comparative Study on Post-Quantum Cryptographic Digital Signature Algorithms: Network Performance, Key Robustness, and Energy Consumption.

Lakhan

View full text Add to dashboard Cite

The concept of Post Quantum Cryptography (PQC) gains profound importance considering the imminent arrival of quantum computers. PQC involves security techniques that can withstand attacks from both regular and quantum computers. This urgency arises due to the anticipated progress in quantum computing, which poses significant risks to traditional cryptographic methods. As a result, there is a pressing need to swiftly establish PQC solutions to address these potential vulnerabilities. This research delves into various Post Quantum Cryptography (PQC) digital signature algorithms, examining their robustness against brute force attacks, network performance, and energy consumption. Also, the study focuses on MPPK/DS (Multivariate polynomial public key digital signature) algorithm in generating the Python code and further utilizing true random numbers from a quantum computer, secure MPPK/DS key pairs are generated, and their robustness is measured through semi-covariance correlation analysis, revealing MPPK's superior resilience compared to RSA and SPHINCS+. The study further assesses latency performance on 5G, Wi-Fi, and local networks, highlighting efficacy for real-world use. Additionally, the research addresses the energy consumption of all the major PQC NIST (National Institute of Standards and Technology) selected digital signature algorithms, stressing the significance of cryptographic solutions that can work well in conjunction with resourceconstrained upcoming intelligent networks of devices. As we move towards a quantumsafe cryptographic landscape, this work's contributions provide valuable insights for securing the digital realm in the face of emerging quantum threats. The research outcomes and developments are shared openly with the research community to facilitate further comparisons and advancements in the field of PQC algorithms.

show abstract

A Classically Efficient Forgery of MPPK/DS Signatures

Maddison,

Nevins

2024

La Matematica

View full text Add to dashboard Cite

Benchmark Performance of a New Quantum-Safe Multivariate Polynomial Digital Signature Algorithm

Cited by 8 publications

References 13 publications

Evaluation of Performance, Energy, and Computation Costs of Quantum-Attack Resilient Encryption Algorithms for Embedded Devices

Evaluation of Performance, Energy, and Computation Costs of Quantum-Attack Resilient Encryption Algorithms for Embedded Devices

A Comparative Study on Post-Quantum Cryptographic Digital Signature Algorithms: Network Performance, Key Robustness, and Energy Consumption.

A Classically Efficient Forgery of MPPK/DS Signatures

Contact Info

Product

Resources

About