Zobrazeno 1 - 10
of 43
pro vyhledávání: '"physical cryptography"'
Autor:
A. Yu. Shamyna, A. A. Ivaniuk
Publikováno v:
Informatika, Vol 19, Iss 4, Pp 27-41 (2022)
Objectives. The problem of constructing a new structure of paths of physically unclonable function of the arbiter type (APUF) on the FPGA is being solved, based on the full use of internal resources of LUT-blocks, which are functionally repeaters. Th
Externí odkaz:
https://doaj.org/article/e02f3daa780a4a6788c00e528aacad02
Autor:
A. Yu. Shamyna, A. A. Ivaniuk
Publikováno v:
Цифровая трансформация, Vol 28, Iss 1, Pp 27-38 (2022)
The possibility of using a ring oscillator circuit for measuring the propagation delays of signals through symmetrical APUF paths of various lengths implemented on an FPGA is considered. The creation of the experimental setup and the course of the ex
Externí odkaz:
https://doaj.org/article/7a2822f75b02423eb9379a3c949c42ad
Autor:
V. N. Yarmolik, A. A. Ivaniuk
Publikováno v:
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, Vol 20, Iss 4, Pp 71-79 (2022)
The methods of constructing physical unclonable functions (PUF), which are the basis of physical cryptography, are analyzed. The broad applicability of the Arbiter PUF, based on the analysis of the delays of the signal transmitted along two paths, is
Externí odkaz:
https://doaj.org/article/50574f59c71c4ceaba8af5c631acf3d3
Publikováno v:
Informatika, Vol 19, Iss 1, Pp 32-49 (2022)
O b j e c t i v e s. The problem of constructing a new class of physically uncloneable functions (PUF) based on controlling the signal propagation delay through the elements lying on the path of its propagation is being solved. The relevance of this
Externí odkaz:
https://doaj.org/article/c9218087b5934b79a93abf5d78c961c8
The exploration of leveraging physical attributes of hardware for cryptographic purposes has become a topic of research. Among these avenues, the utilization of Physical Unclonable Functions (PUFs) is one feature that is widely studied. PUFs provide
Externí odkaz:
https://hdl.handle.net/10919/119221
Publikováno v:
Proceedings of the National Academy of Sciences of the United States of America, 2018 Apr . 115(17), 4363-4368.
Externí odkaz:
https://www.jstor.org/stable/26508643
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, 2020, 839, pp.122-134. ⟨10.1016/j.tcs.2020.05.034⟩
Theoretical Computer Science, Elsevier, 2020, 839, pp.122-134. ⟨10.1016/j.tcs.2020.05.034⟩
Theoretical Computer Science, 2020, 839, pp.122-134. ⟨10.1016/j.tcs.2020.05.034⟩
Theoretical Computer Science, Elsevier, 2020, 839, pp.122-134. ⟨10.1016/j.tcs.2020.05.034⟩
International audience; In Conspiracy Santa, a variant of Secret Santa, a group of people offer each other Christmas gifts, where each member of the group receives a gift from the other members of the group. To that end, the members of the group form
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::813068561da32c48a1e26ae2495c78f5
https://hal.science/hal-02611751
https://hal.science/hal-02611751
Publikováno v:
FUN 2018-9th International Conference on Fun with Algorithms
FUN 2018-9th International Conference on Fun with Algorithms, Jun 2018, La Maddalena, Italy. pp.13:1--13:13, ⟨10.4230/LIPIcs.FUN.2018.13⟩
FUN 2018-9th International Conference on Fun with Algorithms, Jun 2018, La Maddalena, Italy. pp.13:1--13:13, ⟨10.4230/LIPIcs.FUN.2018.13⟩
International audience; In Conspiracy Santa, a variant of Secret Santa, a group of people offer each other Christmas gifts, where each member of the group receives a gift from the other members of the group. To that end, the members of the group form
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f62d0f5e3381a86f7b534774cf5646ae
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.