TY - GEN
T1 - Randomized Decoding of Linearized Reed-Solomon Codes Beyond the Unique Decoding Radius
AU - Jerkovits, Thomas
AU - Bartz, Hannes
AU - Wachter-Zeh, Antonia
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - In this paper we address the problem of decoding linearized Reed-Solomon (LRS) codes beyond their unique decoding radius. We analyze the complexity in order to evaluate if the considered problem is of cryptographic relevance, i.e., can be used to design cryptosystems that are computationally hard to break. We show that our proposed algorithm improves over other generic algorithms that do not take into account the underlying code structure.
AB - In this paper we address the problem of decoding linearized Reed-Solomon (LRS) codes beyond their unique decoding radius. We analyze the complexity in order to evaluate if the considered problem is of cryptographic relevance, i.e., can be used to design cryptosystems that are computationally hard to break. We show that our proposed algorithm improves over other generic algorithms that do not take into account the underlying code structure.
UR - http://www.scopus.com/inward/record.url?scp=85171442261&partnerID=8YFLogxK
U2 - 10.1109/ISIT54713.2023.10206957
DO - 10.1109/ISIT54713.2023.10206957
M3 - Conference contribution
AN - SCOPUS:85171442261
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 820
EP - 825
BT - 2023 IEEE International Symposium on Information Theory, ISIT 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 IEEE International Symposium on Information Theory, ISIT 2023
Y2 - 25 June 2023 through 30 June 2023
ER -