Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Sven Müelich"'
Autor:
Robert F. H. Fischer, Sven Muelich
Publikováno v:
IEEE Access, Vol 10, Pp 99178-99194 (2022)
In this paper, a coded modulation scheme employing signal shaping is proposed and designed for use in multi-valued physical unclonable functions (PUFs). In the literature, usually binary PUFs are considered, where less than one bit of entropy is extr
Externí odkaz:
https://doaj.org/article/19204a49638b4f1fa7ed65119085e9a0
Autor:
Robert F. H. Fischer, Sven Muelich
Publikováno v:
IEEE Access, Vol 10, Pp 12644-12653 (2022)
Physical unclonable functions (PUFs) exploit randomness in the hardware for the derivation of cryptographic keys. In the literature, usually the readout is two-level quantized and hard-decision channel decoding is used to stabilize the extracted key.
Externí odkaz:
https://doaj.org/article/05ec1457bb6a44f78dcc451ec69fdcf7
Publikováno v:
IEEE Transactions on Information Forensics and Security. 16:3814-3827
Physical unclonable functions (PUFs) produce responses by exploiting randomness that intrinsically occurs in integrated circuits due to uncontrollable variations in the manufacturing process of physical items. It is common practice that PUFs generate
Autor:
Robert F. H. Fischer, Sven Müelich, Joachim Becker, Maurits Ortmanns, Holger Mandry, Andreas Herkle
Publikováno v:
IEEE Transactions on Circuits and Systems II: Express Briefs. 67:3372-3376
Physical Unclonable Functions (PUFs) offer the possibility for on-chip generation of unique fingerprints for integrated circuits. Ring-oscillator (RO) PUFs are small and easy to configure on Field Programmable Gate Arrays (FPGAs) and thus received gr
Publikováno v:
ISCAS
A well-known problem when using Physical Unclonable Functions for secret key generation and storage, is the instability of PUF responses due to environmental conditions like temperature variations. Using Ring Oscillator PUFs (RO-PUFs), a response bit
Autor:
Sven Müelich, Chirag Sudarshan, Christian Weis, Martin Bossert, Robert F. H. Fischer, Norbert Wehn
Publikováno v:
MEMSYS
Physical unclonable functions (PUF) are hardware primitives that are very attractive for cryptographic applications to generate and store secure keys. Dynamic random access memory (DRAM) has recently become a promising technology for the construction
Autor:
Chirag Sudarshan, Christian Weis, Martin Bossert, Sebastian Bitzer, Norbert Wehn, Robert F. H. Fischer, Sven Müelich
Publikováno v:
2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY).
Physical Unclonable Functions (PUFs) are hardware primitives, which exploit intrinsic randomness occurring from variations in manufacturing processes, to generate random binary sequences (responses) that can be used for secure generation and storage
Autor:
Andreas Herkle, Holger Mandry, Maurits Ortmanns, Ludwig Kürzinger, Joachim Becker, Robert F. H. Fischer, Sven Müelich
Publikováno v:
ISCAS
Physical Unclonable Functions (PUFs) offer the possibility to produce unique fingerprints for integrated circuits. As raw PUF responses are affected by noise, some post-processing steps are necessary. We present a coding chain test framework for PUFs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::431b707259c6dcf3a4121c961f9d9a71
Publikováno v:
Applications of Computer Algebra ISBN: 9783319569307
The security of public-key cryptosystems is mostly based on number-theoretic problems like factorization and the discrete logarithm. There exists an algorithm which solves these problems in polynomial time using a quantum computer. Hence, these crypt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76934b58e5041b382e57fd8cdd2dc3ca
https://doi.org/10.1007/978-3-319-56932-1_26
https://doi.org/10.1007/978-3-319-56932-1_26
Publikováno v:
ISIT
Gabidulin codes, originally defined over finite fields, are an important class of rank metric codes with various applications. Recently, their definition was generalized to certain fields of characteristic zero and a Welch--Berlekamp like algorithm w