Efficient Error Detection Architectures for Postquantum Signature Falcon’s Sampler and KEM SABER

Sarker, Ausmita; Kermani, Mehran Mozaffari; Azarderakhsh, Reza

doi:10.1109/tvlsi.2022.3156479

Cited by 30 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our design significantly outperforms their results, reducing clock cycles by at least 5.78× for FALCON-512 and up to 9.7× for FALCON-1024. In terms of HW implementations, previous efforts [32], [33] have focused on accelerating specific functions of the FALCON algorithm without supporting the entire…”

Section: A Performancementioning

confidence: 99%

An Efficient Hardware/Software Co-Design for FALCON on Low-End Embedded Systems

Lee,

Youn,

Nam

et al. 2024

IEEE Access

View full text Add to dashboard Cite

We propose in this paper an efficient FALCON accelerator called EFX based on a HW/SW co-design where FALCON is a post-quantum cryptographic (PQC) scheme tailored as a digital signature algorithm (DSA). Our findings reveal that FALCON exhibits unique characteristics and structures which distinguish it from other PQC-DSAs. A key finding is that, unlike its counterparts, FALCON doesn't prioritize a single, time-consuming task; instead, it processes a variety of tasks with comparable execution times. Consequently, the conventional methods focusing on accelerating dominant few tasks, which are generally effective for other algorithms, prove less efficient for FALCON, especially concerning the minimization of the silicon area used. To overcome this, we strategically focus on the granular optimization of lower-level operations rather than on broader functional segments, aiming to boost performance while conserving hardware space. Moreover, to mitigate the potential degradation due to limitation of hardware resources, we have implemented a pipelined execution strategy for the FALCON functions and refined the sampling function-a critical task that is challenging to accelerate due to inherent sequential algorithmenabling it to run concurrently on both software and hardware, thus reducing latency. Our hardware design, synthesized at 300M Hz using Samsung's 28nm and 45nm process technologies, demonstrates superior performance in generating FALCON signatures, with a 3.58× improvement in clock cycles over an existing hardware accelerator. EFX occupies 38K um 2 and 74K um 2 for 28nm and 45nm processes, respectively, comparatively small compared to other PQC accelerators.

show abstract

Section: A Performancementioning

confidence: 99%

An Efficient Hardware/Software Co-Design for FALCON on Low-End Embedded Systems

Lee,

Youn,

Nam

et al. 2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…This research focused on enhancing the security of signatures and key exchanges in a PQC environment. Efficient error-detection architectures played a key role in defending against quantum attacks, so this research was crucial for developing the PQC field and responding to threats [ 24 ].…”

Section: Introductionmentioning

confidence: 99%

Evaluation of physical education teaching effect using Random Forest model under artificial intelligence

Jiang,

Du,

Zheng

2024

Heliyon

View full text Add to dashboard Cite

“…This has raised increasing attention among researchers in developing post-quantum cryptography (PQC), [6] namely, cryptosystems that are resistant against the attack of quantum computers. In the upcoming era of quantum computing, PQC is essential for the security of numerous common applications in our daily lives, such as online DOI: 10.1002/qute.202300302 communication, implantable, or wearable devices [7][8][9][10] and the software industry. [11] Irreducible polynomials over finite fields, particularly primitive ones, play an essential role in PQC.…”

Section: Introductionmentioning

confidence: 99%

Quantum‐Accelerated Algorithms for Generating Random Primitive Polynomials Over Finite Fields

Huang,

Yin,

Chen

et al. 2023

Adv Quantum Tech

View full text Add to dashboard Cite

Primitive polynomials over finite fields are crucial resources with broad applications across various domains in computer science, including classical pseudo‐random number generation, coding theory, and post‐quantum cryptography. Nevertheless, the pursuit of an efficient classical algorithm for generating random primitive polynomials over finite fields remains an ongoing challenge. In this work, it shows how this problem can be solved efficiently with the help of quantum computers. Moreover, the designs of specific quantum circuits to implement them are also presented. The research paves the way for the rapid and real‐time generation of random primitive polynomials in diverse quantum communication and computation applications.

show abstract

Efficient Error Detection Architectures for Postquantum Signature Falcon’s Sampler and KEM SABER

Cited by 30 publications

References 19 publications

An Efficient Hardware/Software Co-Design for FALCON on Low-End Embedded Systems

An Efficient Hardware/Software Co-Design for FALCON on Low-End Embedded Systems

Evaluation of physical education teaching effect using Random Forest model under artificial intelligence

Quantum‐Accelerated Algorithms for Generating Random Primitive Polynomials Over Finite Fields

Contact Info

Product

Resources

About