Area-Time Efficient Computation of Niederreiter Encryption on QC-MDPC Codes for Embedded Hardware

Hu, Jingwei; Cheung, Ray C. C.

doi:10.1109/tc.2017.2672984

Cited by 17 publications

(5 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When the maximum number of decoding iterations is set to a limited number, such as I max = 30, the FER of the row-layered decoder is also lower due to the faster convergence. Most previous MDPC decoder designs consider BF algorithms [6]- [12] due to their simplicity. For comparison, simulation results of the REMP-2 BF algorithm [6] with optimal parameter settings are included in Fig.…”

Section: Row-layered Scheduling Schemementioning

confidence: 99%

“…A spectrum of algorithms can be used to decode MDPC codes, with the bit-flipping (BF) algorithm and its variations being the simplest and having been explored in quite a few recent works [6]- [9]. The BF MDPC decoder implementations in [10]- [12] divide each column of the parity check matrix into L-bit segments, which are processed one by one to reduce the decoding latency. However, the parity check matrices of MDPC codes are still very sparse.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Low-Complexity Parallel Min-Sum Medium-Density Parity-Check Decoder for McEliece Cryptosystem

Cai,

Zhang

2023

IEEE Trans. Circuits Syst. I

View full text Add to dashboard Cite

The medium-density parity-check (MDPC) codebased McEliece cryptosystem remains a finalist of the postquantum cryptography standard. The Min-sum decoding algorithm achieves better performance-complexity tradeoff than other algorithms for MDPC codes. However, the prior Minsum MDPC decoder requires large memories, whose complexity dominates the overall complexity. Besides, its actual achievable parallelism is limited. This paper has four contributions: For the first time, the row-layered scheduling scheme is exploited to substantially reduce the memory requirement of MDPC decoders; A low-complexity scheme is developed to mitigate the performance loss caused by finite precision representation of the messages and high column weights of MDPC codes in row-layered decoding; Constraints are added to the parity check matrix construction to enable effective parallel processing with negligible impacts on the decoder performance and resilience towards attacks; A novel parity check matrix division scheme for highly efficient parallel processing is proposed and the corresponding parallel row-layered decoder architecture is designed. The number of clock cycles for each decoding iteration is reduced by a factor of L using the proposed L-parallel decoder with very small memory overhead. For an example 2-parallel decoder, the proposed design leads to 26% less memory requirement and 70% latency reduction compared to the prior decoder.

show abstract

Section: Row-layered Scheduling Schemementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Low-Complexity Parallel Min-Sum Medium-Density Parity-Check Decoder for McEliece Cryptosystem

Cai,

Zhang

2023

IEEE Trans. Circuits Syst. I

View full text Add to dashboard Cite

show abstract

“…Considering implementation work, Hu and Cheung presented a hardware implementation of QC‐MDPC codes partially based on QcBits implementation. Using a Xilinx Virtex‐6 FPGA, they achieved a 53% area‐time product gain comparing to the previous designs for QC‐MDPC codes.…”

Section: Related Workmentioning

confidence: 99%

Optimized implementation of QC‐MDPC code‐based cryptography

Guimarães

Aranha

Borin

2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary This paper presents a new enhanced version of the QcBits key encapsulation mechanism, which is a constant‐time implementation of the Niederreiter cryptosystem using QC‐MDPC codes. In this version, we updated the implementation parameters to meet the 128‐bit quantum security level, replaced some of the core algorithms to avoid using slower instructions, vectorized the entire code using the AVX‐512 instruction set extension, and applied several other techniques to achieve a competitive performance level. Our implementation takes 928, 259, and 5008 thousand Skylake cycles to perform batch key generation (cost per key), encryption, and uniform decryption, respectively. Comparing with the current state‐of‐the‐art implementation for QC‐MDPC codes, BIKE, our code is 1.9 times faster when decrypting messages.

show abstract

“…No effective countermeasure was proposed for this attack yet. Considering implementation work, Hu and Cheung [Hu and Cheung 2017] presented a hardware implementation of QC-MDPC codes partially based on QcBits implementation. Using a Xilinx Virtex-6 FPGA, they achieved a 53% area-time product gain comparing to the previous designs for QC-MDPC codes.…”

Section: Related Workmentioning

confidence: 99%

Optimizing the Decoding Process of a Post-Quantum Cryptographic Algorithm

Guimarães¹,

Aranha²,

Borin³

2017

Anais Do XVIII Simpósio Em Sistemas Computacionais De Alto Desempenho (SSCAD 2017)

View full text Add to dashboard Cite

QcBits is a state-of-the-art constant-time implementation of a code-based encryption scheme for post-quantum public key cryptography. This paper presents an optimized version of its decoding process, which is used for message decryption. Our implementation leverages SSE and AVX instructions extensions and performs 3.6 to 4.8 times faster than the original version, while preserving the 80-bit security level and constant time execution. We also provide experimental data that indicates a further 1.4-factor speedup supposing the existence of instructions for vectorial conditional moves and 256-bit register shifts. Finally, we implemented countermeasures for side-channel security and showed that they do not affect the overall performance.

show abstract

Area-Time Efficient Computation of Niederreiter Encryption on QC-MDPC Codes for Embedded Hardware

Cited by 17 publications

References 24 publications

Low-Complexity Parallel Min-Sum Medium-Density Parity-Check Decoder for McEliece Cryptosystem

Low-Complexity Parallel Min-Sum Medium-Density Parity-Check Decoder for McEliece Cryptosystem

Optimized implementation of QC‐MDPC code‐based cryptography

Optimizing the Decoding Process of a Post-Quantum Cryptographic Algorithm

Contact Info

Product

Resources

About