Serial Polar Automorphism Ensemble Decoders for Physical Unclonable Functions
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912640872218624 |
|---|---|
| author | Rübenacke, Marvin Cammerer, Sebastian Sullivan, Michael Keller, Alexander |
| author_facet | Rübenacke, Marvin Cammerer, Sebastian Sullivan, Michael Keller, Alexander |
| contents | Physical unclonable functions (PUFs) involve challenging practical applications of error-correcting codes (ECCs), requiring extremely low failure rates on the order of $10^{-6}$ and below despite raw input bit error rates as high as 22%. These requirements call for an efficient ultra-low rate code design. In this work, we propose a novel coding scheme tailored for PUFs based on Polar codes and a low-complexity version of automorphism ensemble decoding (AED). Notably, our serial AED scheme reuses a single successive cancellation (SC) decoder across multiple decoding attempts. By introducing cascaded and recursive interleavers, we efficiently scale the number of AED candidates without requiring expensive large multiplexers. An aggressive quantization strategy of only 3 bits per message further reduces the area requirements of the underlying SC decoder. The resulting coding scheme achieves the same block error rate of $10^{-6}$ as our baseline based on Bose-Ray-Chaudhuri-Hocquenghem (BCH) codes while requiring 1.75x fewer codeword bits to encode the same K = 312 payload bits. This reduction translates directly into 1.75x less helper data storage and, consequently, a smaller overall chip area. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_09220 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Serial Polar Automorphism Ensemble Decoders for Physical Unclonable Functions Rübenacke, Marvin Cammerer, Sebastian Sullivan, Michael Keller, Alexander Information Theory Signal Processing Physical unclonable functions (PUFs) involve challenging practical applications of error-correcting codes (ECCs), requiring extremely low failure rates on the order of $10^{-6}$ and below despite raw input bit error rates as high as 22%. These requirements call for an efficient ultra-low rate code design. In this work, we propose a novel coding scheme tailored for PUFs based on Polar codes and a low-complexity version of automorphism ensemble decoding (AED). Notably, our serial AED scheme reuses a single successive cancellation (SC) decoder across multiple decoding attempts. By introducing cascaded and recursive interleavers, we efficiently scale the number of AED candidates without requiring expensive large multiplexers. An aggressive quantization strategy of only 3 bits per message further reduces the area requirements of the underlying SC decoder. The resulting coding scheme achieves the same block error rate of $10^{-6}$ as our baseline based on Bose-Ray-Chaudhuri-Hocquenghem (BCH) codes while requiring 1.75x fewer codeword bits to encode the same K = 312 payload bits. This reduction translates directly into 1.75x less helper data storage and, consequently, a smaller overall chip area. |
| title | Serial Polar Automorphism Ensemble Decoders for Physical Unclonable Functions |
| topic | Information Theory Signal Processing |
| url | https://arxiv.org/abs/2510.09220 |