NIST PQC seminar # 22 (Tuesday 2025-January-07, 10am EST)
52 views
Skip to first unread message
Hamilton Silberg
Jan 3, 2025, 11:58:57 AM1/3/25
to pqc-seminars
Hello all, and Happy New Year!
The NIST PQC Seminar continues in 2025 with a talk next week,
Tuesday, January 7th, 2025 at 10am US EST (Washington D.C., UTC-5).
Please find the Zoom and talk details below, and please note that this meeting link is different than previous meetings.
Best,
Hamilton Silberg
NIST PQC Team
=================================
### Title ###
Error floor prediction with Markov models for QC-MDPC codes
### Abstract ###
Public-key cryptosystems based on low-density parity check (LDPC) and moderate-density parity check (MDPC) codes are popular due to their efficiency and are believed to be secure against quantum attacks. Quasi-cyclic MPDC (QC-MDPC) code-based encryption schemes under iterative decoders offer highly-competitive performance in the quantum-resistant space of cryptography, but the decoding-failure rate (DFR) of these algorithms are not well-understood. It is known that the DFR decreases extremely rapidly as the ratio of code-length to error-bits increases, then decreases much more slowly in regimes known as the waterfall and error-floor, respectively.
This work establishes three, successively more detailed probabilistic models of the behavior of iterative, hard-decision decoders for QC-MDPC codes: the simplified model, the refined model for perfect keys, and the refined model for all keys. The models are built upon a Markov model introduced by Sendrier and Vasseur (SV) that closely predicts decoding behavior in the waterfall region but does not capture the error floor behavior of those codes. The simplified model introduces a heuristic modification which captures the dominant contributor to error floor behavior which is convergence to near codewords belonging to the set N introduced by Vasseur in 2021. The refined models give more accurate predictions taking into account certain structural features of specific keys. The first refined model accounts for the structure of perfect keys while the second accounts for the measured properties of any key.
Our models are based on the step-by-step decoder, also used in the SV model, which is highly simplified and experimentally displays worse decoding performance than parallel decoders used in practice. Despite the use of the simplified decoder, we obtain a remarkably accurate prediction of the DFR in the error floor and demonstrate that the error floor behavior is indeed dominated by convergence to a near codeword during a failed decoding instance.
### Speakers and Affiliations ###
Dr. Sarah Arpin, Virginia Polytechnic Institute and State University, USA
Dr. Jean-Pierre Tillich, Inria, France
=================================
Join ZoomGov Meeting
https://nist.zoomgov.com/j/16056059946?pwd=mvrgAwFbjMktdBPVM75iLIPqqrXXb8.1&omn=1618503271
Meeting ID: 160 5605 9946
Passcode: 715855
---
One tap mobile
+16692545252,,16056059946#,,,,*715855# US (San Jose)
+16468287666,,16056059946#,,,,*715855# US (New York)
---
Dial by your location
• +1 669 254 5252 US (San Jose)
• +1 646 828 7666 US (New York)
• +1 646 964 1167 US (US Spanish Line)
• +1 415 449 4000 US (US Spanish Line)
• +1 551 285 1373 US (New Jersey)
• +1 669 216 1590 US (San Jose)
Meeting ID: 160 5605 9946
Passcode: 715855
Find your local number: https://nist.zoomgov.com/u/axfamGEPa
---
Join by SIP
• 16056...@sip.zoomgov.com
---
Join by H.323
• 161.199.138.10 (US West)
• 161.199.136.10 (US East)
Meeting ID: 160 5605 9946
Passcode: 715855
The NIST PQC Seminar continues in 2025 with a talk next week,
Tuesday, January 7th, 2025 at 10am US EST (Washington D.C., UTC-5).
Please find the Zoom and talk details below, and please note that this meeting link is different than previous meetings.
Best,
Hamilton Silberg
NIST PQC Team
=================================
### Title ###
Error floor prediction with Markov models for QC-MDPC codes
### Abstract ###
Public-key cryptosystems based on low-density parity check (LDPC) and moderate-density parity check (MDPC) codes are popular due to their efficiency and are believed to be secure against quantum attacks. Quasi-cyclic MPDC (QC-MDPC) code-based encryption schemes under iterative decoders offer highly-competitive performance in the quantum-resistant space of cryptography, but the decoding-failure rate (DFR) of these algorithms are not well-understood. It is known that the DFR decreases extremely rapidly as the ratio of code-length to error-bits increases, then decreases much more slowly in regimes known as the waterfall and error-floor, respectively.
This work establishes three, successively more detailed probabilistic models of the behavior of iterative, hard-decision decoders for QC-MDPC codes: the simplified model, the refined model for perfect keys, and the refined model for all keys. The models are built upon a Markov model introduced by Sendrier and Vasseur (SV) that closely predicts decoding behavior in the waterfall region but does not capture the error floor behavior of those codes. The simplified model introduces a heuristic modification which captures the dominant contributor to error floor behavior which is convergence to near codewords belonging to the set N introduced by Vasseur in 2021. The refined models give more accurate predictions taking into account certain structural features of specific keys. The first refined model accounts for the structure of perfect keys while the second accounts for the measured properties of any key.
Our models are based on the step-by-step decoder, also used in the SV model, which is highly simplified and experimentally displays worse decoding performance than parallel decoders used in practice. Despite the use of the simplified decoder, we obtain a remarkably accurate prediction of the DFR in the error floor and demonstrate that the error floor behavior is indeed dominated by convergence to a near codeword during a failed decoding instance.
### Speakers and Affiliations ###
Dr. Sarah Arpin, Virginia Polytechnic Institute and State University, USA
Dr. Jean-Pierre Tillich, Inria, France
=================================
Join ZoomGov Meeting
https://nist.zoomgov.com/j/16056059946?pwd=mvrgAwFbjMktdBPVM75iLIPqqrXXb8.1&omn=1618503271
Meeting ID: 160 5605 9946
Passcode: 715855
---
One tap mobile
+16692545252,,16056059946#,,,,*715855# US (San Jose)
+16468287666,,16056059946#,,,,*715855# US (New York)
---
Dial by your location
• +1 669 254 5252 US (San Jose)
• +1 646 828 7666 US (New York)
• +1 646 964 1167 US (US Spanish Line)
• +1 415 449 4000 US (US Spanish Line)
• +1 551 285 1373 US (New Jersey)
• +1 669 216 1590 US (San Jose)
Meeting ID: 160 5605 9946
Passcode: 715855
Find your local number: https://nist.zoomgov.com/u/axfamGEPa
---
Join by SIP
• 16056...@sip.zoomgov.com
---
Join by H.323
• 161.199.138.10 (US West)
• 161.199.136.10 (US East)
Meeting ID: 160 5605 9946
Passcode: 715855
Reply all
Reply to author
Forward
0 new messages