activity
20162023
most citedTiming Attack Resilient Decoding Algorithms for Physical Unclonable Functions

3 citations · 10 across the 15 of their papers we have counts for

collaborators
Showing 2021Show all

10 papers · 1 filter

cs.IT2021

Analysis of Communication Channels Related to Physical Unclonable Functions

Georg Maringer, Marvin Xhemrishi, Sven Puchinger +6

Cryptographic algorithms rely on the secrecy of their corresponding keys. On embedded systems with standard CMOS chips, where secure permanent memory such as flash is not available…

cs.IT2021

Quadratic-Curve-Lifted Reed-Solomon Codes

Hedongliang Liu, Lukas Holzbaur, Nikita Polyanskii +2

Lifted codes are a class of evaluation codes attracting more attention due to good locality and intermediate availability. In this work we introduce and study quadratic-curve-lifte…

cs.IT2021

Maximum Sum-Rank Distance Codes over Finite Chain Rings

Umberto Martínez-Peñas, Sven Puchinger

In this work, maximum sum-rank distance (MSRD) codes and linearized Reed-Solomon codes are extended to finite chain rings. It is proven that linearized Reed-Solomon codes are MSRD…

cs.IT2021

Twisted Reed-Solomon Codes

Peter Beelen, Sven Puchinger, Johan Rosenkilde

In this article, we present a new construction of evaluation codes in the Hamming metric, which we call twisted Reed-Solomon codes. Whereas Reed-Solomon (RS) codes are MDS codes, t…

math.AG2021

Improved Power Decoding of Algebraic Geometry Codes

Sven Puchinger, Johan Rosenkilde, Grigory Solomatov

Power decoding is a partial decoding paradigm for arbitrary algebraic geometry codes for decoding beyond half the minimum distance, which usually returns the unique closest codewor…

cs.IT2021

Correctable Erasure Patterns in Product Topologies

Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi +1

Locality enables storage systems to recover failed nodes from small subsets of surviving nodes. The setting where nodes are partitioned into subsets, each allowing for local recove…