Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Georg Maringer"'
Publikováno v:
IEEE Transactions on Information Forensics and Security
Maringer, G, Puchinger, S & Wachter-Zeh, A 2023, ' Information-and Coding-Theoretic Analysis of the RLWE/MLWE Channel ', IEEE Transactions on Information Forensics and Security, vol. 18, 9970295, pp. 549-564 . https://doi.org/10.1109/TIFS.2022.3226907
Maringer, G, Puchinger, S & Wachter-Zeh, A 2023, ' Information-and Coding-Theoretic Analysis of the RLWE/MLWE Channel ', IEEE Transactions on Information Forensics and Security, vol. 18, 9970295, pp. 549-564 . https://doi.org/10.1109/TIFS.2022.3226907
Several cryptosystems based on the Ring Learning with Errors (RLWE) problem have been proposed within the NIST post-quantum cryptography standardization process, e.g., NewHope. Furthermore, there are systems like Kyber which are based on the closely
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::114c3498260dfe8e55b3424263888ede
https://doi.org/10.1109/tifs.2022.3226907
https://doi.org/10.1109/tifs.2022.3226907
In this work, we consider $q$-ary signature codes of length $k$ and size $n$ for a noisy adder multiple access channel. A signature code in this model has the property that any subset of codewords can be uniquely reconstructed based on any vector tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c44578d22219c70691d55233cc9aa919
http://arxiv.org/abs/2206.10735
http://arxiv.org/abs/2206.10735
Publikováno v:
ISIT
In digital systems such as fiber optical communications, the ratio between probability of errors of type $1\to 0$ and $0 \to 1$ can be large. Practically, one can assume that only one type of error can occur. These errors arecalled asymmetric. Unidir
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5333b55cf2c6ed9c8e98b774b189678a
https://doi.org/10.1016/j.tcs.2020.11.049
https://doi.org/10.1016/j.tcs.2020.11.049
Publikováno v:
2020 IEEE Information Theory Workshop (ITW)
ITW
ITW
In this paper, a new problem of transmitting information over the adversarial insertion-deletion channel with feedback is introduced. Suppose that the encoder transmits $n$ binary symbols one-by-one over a channel, in which some symbols can be delete
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7927a2d69390b75507f60c02fd05e56
Publikováno v:
ACCT
We give an overview of applications of the rubber method. The rubber method is a coding algorithm that was developed in 2005 by Ahlswede, Deppe and Lebedev for channels with feedback. It was a big surprise that an encoding strategy that reserves one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02aaaec6d660000491471784827b4946
https://doi.org/10.1109/acct51235.2020.9383411
https://doi.org/10.1109/acct51235.2020.9383411
Publikováno v:
ACCT
2020 Algebraic and Combinatorial Coding Theory (ACCT)
2020 Algebraic and Combinatorial Coding Theory (ACCT)
This work compares the performance of software implementations of different Gabidulin decoders. The parameter sets used within the comparison stem from their applications in recently proposed cryptographic schemes. The complexity analysis of the deco
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::37722e077f0387d9085ee546fa188b6f
http://arxiv.org/abs/2009.09668
http://arxiv.org/abs/2009.09668
In this paper, we consider encoding strategies for the Z-channel with noiseless feedback. We analyze the combinatorial setting where the maximum number of errors inflicted by an adversary is proportional to the number of transmissions, which goes to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::45b365b7f39e4b4e5a77e2736e58c5f0
http://arxiv.org/abs/2007.04026
http://arxiv.org/abs/2007.04026
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030581497
COCOON
COCOON
In this paper, we consider encoding strategies for the Z-channel with noiseless feedback. We analyze the asymptotic case where the maximal number of errors is proportional to the blocklength, which goes to infinity. Without feedback, the asymptotic r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::262271f1fec01e2472e249e32a35e954
https://doi.org/10.1007/978-3-030-58150-3_8
https://doi.org/10.1007/978-3-030-58150-3_8
Publikováno v:
Information and Communications Security ISBN: 9783030610777
ICICS
ICICS
Learning with Errors (LWE) and Ring-LWE (RLWE) problems allow the construction of efficient key exchange and public-key encryption schemes. However, while improving the security through the use of error distributions with large standard deviations, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3204742d8a405e6db62b264e3aa4306
https://doi.org/10.1007/978-3-030-61078-4_19
https://doi.org/10.1007/978-3-030-61078-4_19
Autor:
Konstantin Braun, Thomas Schamberger, Georg Maringer, Christoph Frisch, Johanna Sepulveda, Tim Fritzmann
Publikováno v:
IFIP Advances in Information and Communication Technology
26th IFIP/IEEE International Conference on Very Large Scale Integration-System on a Chip (VLSI-SoC)
26th IFIP/IEEE International Conference on Very Large Scale Integration-System on a Chip (VLSI-SoC), Oct 2018, Verona, Italy. pp.257-280, ⟨10.1007/978-3-030-23425-6_13⟩
VLSI-SoC: Design and Engineering of Electronics Systems Based on New Computing Paradigms ISBN: 9783030234249
VLSI-SoC (Selected Papers)
26th IFIP/IEEE International Conference on Very Large Scale Integration-System on a Chip (VLSI-SoC)
26th IFIP/IEEE International Conference on Very Large Scale Integration-System on a Chip (VLSI-SoC), Oct 2018, Verona, Italy. pp.257-280, ⟨10.1007/978-3-030-23425-6_13⟩
VLSI-SoC: Design and Engineering of Electronics Systems Based on New Computing Paradigms ISBN: 9783030234249
VLSI-SoC (Selected Papers)
International audience; The fast development of quantum computers represents a risk for secure communications. Current traditional public-key cryptography will not withstand attacks performed on quantum computers. In order to prepare for such a quant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2fb20e21015a25a8e6643f15a1cf6d01
https://hal.inria.fr/hal-02321771
https://hal.inria.fr/hal-02321771