<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">inform</journal-id><journal-title-group><journal-title xml:lang="ru">Информатика</journal-title><trans-title-group xml:lang="en"><trans-title>Informatics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1816-0301</issn><issn pub-type="epub">2617-6963</issn><publisher><publisher-name>UIIP NASB</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.37661/1816-0301-2024-21-1-9-27</article-id><article-id custom-type="elpub" pub-id-type="custom">inform-1262</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ЗАЩИТА ИНФОРМАЦИИ И НАДЕЖНОСТЬ СИСТЕМ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>INFORMATION PROTECTION AND SYSTEM RELIABILITY</subject></subj-group></article-categories><title-group><article-title>Симметричные физически неклонируемые функции типа арбитр</article-title><trans-title-group xml:lang="en"><trans-title>Symmetric physically unclonable functions of the arbiter type</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Ярмолик</surname><given-names>В. Н.</given-names></name><name name-style="western" xml:lang="en"><surname>Yarmolik</surname><given-names>V. N.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Ярмолик Вячеслав Николаевич, доктор технических наук, профессор</p><p>ул. П. Бровки, 6, Минск, 220013 </p></bio><bio xml:lang="en"><p>Vyacheslav N. Yarmolik, D. Sc. (Eng.), Prof</p><p>st. P. Brovki, 6, Minsk, 220013 </p></bio><email xlink:type="simple">yarmolik10ru@yahoo.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Иванюк</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Ivaniuk</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Иванюк Александр Александрович, доктор технических наук, доцент, профессор кафедры информатики</p><p>ул. П. Бровки, 6, Минск, 220013 </p></bio><bio xml:lang="en"><p>Alexander A. Ivaniuk, D. Sc. (Eng.), Assoc. Prof., Prof. of Computer Science Department</p><p>st. P. Brovki, 6, Minsk, 220013 </p></bio><email xlink:type="simple">ivaniuk@bsuir.by</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белорусский государственный университет информатики и радиоэлектроники</institution></aff><aff xml:lang="en"><institution>Belarusian State University of Informatics and Radioelectronics</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2024</year></pub-date><pub-date pub-type="epub"><day>29</day><month>03</month><year>2024</year></pub-date><volume>21</volume><issue>1</issue><fpage>9</fpage><lpage>27</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Ярмолик В.Н., Иванюк А.А., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Ярмолик В.Н., Иванюк А.А.</copyright-holder><copyright-holder xml:lang="en">Yarmolik V.N., Ivaniuk A.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://inf.grid.by/jour/article/view/1262">https://inf.grid.by/jour/article/view/1262</self-uri><abstract><sec><title>Цели</title><p>Цели. Решается задача построения нового класса физически неклонируемых функций типа арбитр (АФНФ), объединяющих достоинства как классических, так и сбалансированных АФНФ. Актуальность такого исследования связана с активным развитием физической криптографии. В работе преследуются следующие цели: исследование и анализ классических АФНФ, построение новой математической модели АФНФ и разработка нового базового элемента АФНФ.</p></sec><sec><title>Методы</title><p>Методы. Используются методы синтеза и анализа цифровых устройств, в том числе на программируемых логических интегральных схемах, основы булевой алгебры и схемотехники.</p></sec><sec><title>Результаты</title><p>Результаты. Установлено, что в классических АФНФ применяется стандартный базовый элемент, выполняющий три функции, а именно функцию формирования двух случайных величин Generate, функцию выбора пары путей Select и функцию переключения путей Switch, которые задаются одним битом запроса. Показано, что совместное использование этих функций, с одной стороны, позволяет достичь высоких характеристик АФНФ, а с другой – приводит к формированию асимметричного поведения АФНФ. С целью анализа основных характеристик АФНФ и их идеального поведения была рассмотрена новая математическая модель АФНФ, аналогичная модели случайного подбрасывания монеты. Для реализации АФНФ, функционирующих согласно предложенной модели, был разработан новый базовый элемент. Показано, что применение предложенного базового элемента позволяет строить симметричные физически неклонируемые функции (С_АФНФ), отличающиеся от классических АФНФ тем, что функции Generate, Select и Switch базового элемента выполняются независимыми его компонентами и задаются разными битами запроса.</p></sec><sec><title>Заключение</title><p>Заключение. Предложенный подход к построению симметричных физически неклонируемых функций, основанный на реализации функций Generate, Select и Switch различными компонентами базового элемента, показал свои работоспособность и перспективность. Экспериментально подтвержден эффект улучшения характеристик подобных С_АФНФ, и в первую очередь заметного улучшения их вероятностных свойств, выраженных в равной вероятности ответов. Перспективным представляется дальнейшее развитие идей построения С_АФНФ, экспериментальное исследование их характеристик, а также анализ устойчивости к различного рода атакам, в том числе и с использованием машинного обучения.</p></sec></abstract><trans-abstract xml:lang="en"><sec><title>Objectives</title><p>Objectives. The problem of constructing a new class of physically unclonable functions of the arbiter type (APUF) that combines the advantages of both classical and balanced APUF is solved. The relevance of such a study is associated with the active development of physical cryptography. The following goals are pursued in the work: research and analysis of classical APUF, construction of a new mathematical model of APUF and development of a new basic element of APUF.</p></sec><sec><title>Methods</title><p>Methods. The methods of synthesis and analysis of digital devices are used, including those based on programmable logic integrated circuits, the basics of Boolean algebra and circuitry.</p></sec><sec><title>Results</title><p>Results. It has been established that classical APUF uses a standard basic element that performs three functions, namely, the function of generating two random variables Generate, the function of choosing a pair of paths Select and the function of switching paths Switch, which are specified by one bit of the challenge. It is shown that the joint use of these functions, on the one hand, makes it possible to achieve high characteristics of the APUF, and on the other hand, leads to the formation of an asymmetric behavior of the APUF. In order to analyze the main characteristics of APUF and their ideal behavior, a new mathematical model of APUF was considered, similar to the model of random coin toss. To implement APUF functioning according to the proposed model, a new basic element was developed. It is shown that the use of the proposed basic element allows to build symmetrical physically unclonable functions (C_APUF), which differ from the classical APUF in that the Generate, Select and Switch functions of the basic element are performed by their independent components and are specified by different bits of challenge.</p></sec><sec><title>Conclusion</title><p>Conclusion. The proposed approach to the construction of symmetrical physically unclonable functions, based on the implementation of the Generate, Select and Switch functions by various components of the base element, has shown its efficiency and promise. The effect of improving the characteristics of similar C_APUF has been experimentally confirmed, and, first of all, a noticeable improvement in their probabilistic properties expressed in equal probability of responses. It seems promising to further develop the ideas of building C_APUF, experimental study of their characteristics, as well as analysis of resistance to various types of attacks, including using machine learning.</p></sec></trans-abstract><kwd-group xml:lang="ru"><kwd>физическая криптография</kwd><kwd>физически неклонируемые функции</kwd><kwd>физические однонаправленные функции</kwd><kwd>физически неклонируемая функция типа арбитр</kwd></kwd-group><kwd-group xml:lang="en"><kwd>physical cryptography</kwd><kwd>physically unclonable functions</kwd><kwd>physical one-way functions</kwd><kwd>physically unclonable arbiter-type function</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Pappu, R. Physical One-Way Functions: PhD Thesis in Media Arts and Sciences / R. Pappu. – Cambridge : Massachusetts Institute of Technology, 2001. – 154 p.</mixed-citation><mixed-citation xml:lang="en">Pappu R. Physical One-Way Functions: PhD Thesis in Media Arts and Sciences. Cambridge, Massachusetts Institute of Technology, 2001, 154 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Silicon physical random functions / B. Gassend [et al.] // Proc. of the 9th Computer and Communications Security Conf. (CCS’02), Washington, DC USA, 18–22 Nov. 2002. – Washington, 2002. – P. 148–160.</mixed-citation><mixed-citation xml:lang="en">Gassend B., Clarke D., Dijk M. S., Devadas S. Silicon physical random functions. Proceedings of the 9th Computer and Communications Security Conference (CCS’02), Washington, DC USA, 18–22 November 2002. Washington, 2002, pp. 148–160.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Security with Noisy Data: On Private Biometrics, Secure Key Storage and Anti-Counterfeiting / eds.: P. Tuyls, B. Skoric. – N. Y., USA : Springer, 2007. – 339 p.</mixed-citation><mixed-citation xml:lang="en">Tuyls P., Skoric B. (eds.). Security with Noisy Data: On Private Biometrics, Secure Key Storage and Anti-Counterfeiting. New York, USA, Springer, 2007, 339 p.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">PUFKY: A fully functional PUF-based cryptographic key generator / R. Maes, A. Van Herrewege, I. Verbauwhede // Proc. of 14th Intern. Workshop on Cryptographic Hardware and Embedded Systems (CHES 2012), Leuven, Belgium, 9–12 Sept. 2012. – Leuven, 2012. – P. 302–319.</mixed-citation><mixed-citation xml:lang="en">Maes R., Van Herrewege A., Verbauwhede I. PUFKY: A fully functional PUF-based cryptographic key generator. Proceedings of 14th International Workshop on Cryptographic Hardware and Embedded Systems (CHES 2012), Leuven, Belgium, 9–12 September 2012. Leuven, 2012, pp. 302–319.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Robust key extraction from physical uncloneable functions / B. Skoric, P. Tuyls, W. Ophey // Proc. of Intern. Conf. Applied Cryptography and Network Security, N. Y., USA, 7–10 June 2005. – N. Y., 2005. – P. 407–422.</mixed-citation><mixed-citation xml:lang="en">Skoric B., Tuyls P., Ophey W. Robust key extraction from physical uncloneable functions. Proceedings of International Conference Applied Cryptography and Network Security, New York, USA, 7–10 June 2005. New York, 2005, pp. 407–422.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, В. Н. Физически неклонируемые функции / В. Н. Ярмолик, Ю. Г. Вашинко // Информатика. – 2011. – № 2(30). – С. 92–103.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N., Vashinko Y. G. Physical unclonable functions. Informatika [Informatics], 2011, no. 2(30), pp. 92–103 (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Suh, G. E. Physical unclonable functions for device authentication and secret key generation / G. E. Suh, S. Devadas // Proc. of Intern. Design Automation Conf., DAC 2007, San Diego, California, USA, 4–8 June 2007. – San Diego, 2007. – P. 9–14.</mixed-citation><mixed-citation xml:lang="en">Suh G. E., Devadas S. Physical unclonable functions for device authentication and secret key generation. Proceedings of International Design Automation Conference, DAC 2007, San Diego, California, USA, 4–8 June 2007. San Diego, 2007, pp. 9–14.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Böhm, C. Physical Unclonable Functions in Theory and Practice / C. Böhm, M. Hofer. – N. Y. : Springer Science + Business Media, 2013. – 270 p.</mixed-citation><mixed-citation xml:lang="en">Böhm C., Hofer M. Physical Unclonable Functions in Theory and Practice. New York, Springer Science + Business Media, 2013, 270 p.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Rührmair, U. Strong PUFs: models, constructions, and security proofs / U. Rührmair, H. Busch, S. Katzenbeisser // Towards Hardware-Intrinsic Security / eds.: A.-R. Sadeghi, D. Naccache. – Berlin, Heidelberg : Springer, 2010. – P. 79–96.</mixed-citation><mixed-citation xml:lang="en">Rührmair U., Busch H., Katzenbeisser S. Strong PUFs: models, constructions, and security proofs. Towards Hardware-Intrinsic Security. In A.-R. Sadeghi, D. Naccache (eds.). Berlin, Heidelberg, Springer, 2010, pp. 79–96.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">A technique to build a secret key in integrated circuits for identification and authentication applications / J. W. Lee [et al.] // Proc. of Intern. Symp. VLSI Circuits (VLSI’04), Honolulu, Hawaii, USA, 7–19 June 2004. – Honolulu, 2004. – P. 176–179.</mixed-citation><mixed-citation xml:lang="en">Lee J. W., Lim D., Gassend B., Suh G. E., Van Dijk M., Devadas S. A technique to build a secret key in integrated circuits for identification and authentication applications. Proceedings of International Symposium VLSI Circuits (VLSI’04), Honolulu, Hawaii, USA, 7–19 June 2004. Honolulu, 2004, pp. 176–179.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Extracting secret keys from integrated circuits / D. Lim [et al.] // IEEE Transactions on Very Large Scale Integration (VLSI) Systems. – 2005. – Vol. 13, no. 10. – P. 1200–1205.</mixed-citation><mixed-citation xml:lang="en">Lim D., Lee J. W., Gassend B., Suh G. E., Van Dijk M., Devadas S. Extracting secret keys from integrated circuits. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2005, vol. 13, no. 10, pp. 1200–1205.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Иванюк, А. А. Физическая криптография и защита цифровых устройств / А. А. Иванюк, С. С. Заливако // Доклады БГУИР. – 2019. – № 2(120). – С. 50–58.</mixed-citation><mixed-citation xml:lang="en">Ivaniuk A. A., Zalivaka S. S. Physical cryptography and security of digital devices. Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki [Reports of the Belarusian State University of Informatics and Radioelectronics], 2019, no. 2(120), pp. 50–58 (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, В. Н. Физически неклонируемые функции с управляемой задержкой распространения сигналов / В. Н. Ярмолик, А. А. Иванюк, Н. Н. Шинкевич // Информатика. – 2022. − Т. 19, № 1. – С. 32–49.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N., Ivaniuk A. A., Shynkevich N. N. Physically unclonable functions with controlled propagation delay. Informatika [Informatics], 2022, vol. 19, no. 1, pp. 32–49 (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Using statistical models to improve the reliability of delay-based PUFs / X. Xu, W. Burleson, D. E. Holcomb // Proc. of IEEE Computer Society Annual Symp. on VLSI, Pittsburgh, PA, USA, 11–13 July 2016. – Pittsburgh, 2016. – P. 547–552.</mixed-citation><mixed-citation xml:lang="en">Xu X., Burleson W., Holcomb D. E. Using statistical models to improve the reliability of delay-based PUFs. Proceedings of IEEE Computer Society Annual Symposium on VLSI, Pittsburgh, PA, USA, 11–13 July 2016. Pittsburgh, 2016, pp. 547–552.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">An analysis of delay based PUF implementations on FPGA / S. Morozov, A. Maiti, P. Schaumont // Proc. of Intern. Symp. on Applied Reconfigurable Computing: Tools and Applications (ARC 2010), Los Angeles, CA, US, 25–27 Mar. 2010. – Los Angeles, 2010. – P. 382–387.</mixed-citation><mixed-citation xml:lang="en">Morozov S., Maiti A., Schaumont P. An analysis of delay based PUF implementations on FPGA. Proceedings of International Symposium on Applied Reconfigurable Computing: Tools and Applications (ARC 2010), Los Angeles, CA, US, 25–27 March 2010. Los Angeles, 2010, pp. 382–387.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Клыбик, В. П. Метод увеличения стабильности физически неклонируемой функции типа «арбитр» / В. П. Клыбик, С. С. Заливако, А. А. Иванюк // Информатика. – 2017. − № 1(53). – С. 31–43.</mixed-citation><mixed-citation xml:lang="en">Klybik V. P., Zalivaka S. S., Ivaniuk A. A. Reliability enhancement method for "arbiter" physicaly unclonable function. Informatika [Informatics], 2017, no. 1(53), pp. 31–43 (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, В. Н. Физически неклонируемые функции типа арбитр с заведомо асимметричными парами путей / В. Н. Ярмолик, А. А. Иванюк // Доклады БГУИР. – 2022. – № 4(20). – С. 71–79.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N., Ivaniuk A. A. Arbiter physical unclonable functions with asymmetric pairs of paths. Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki [Reports of the Belarusian State University of Informatics and Radioelectronics], 2022, no. 4(20), pp. 71–79 (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Secure and reliable XOR arbiter PUF design: An experimental study based on 1 trillion challenge response pair measurements / C. Zhou, K. K. Parhi, C. H. Kim // Proc. of the 54th Annual Design Automation, Austin, TX, USA, 18 June 2017. – Austin, 2017. – P. 18–22.</mixed-citation><mixed-citation xml:lang="en">Zhou C., Parhi K. K., Kim C. H. Secure and reliable XOR arbiter PUF design: An experimental study based on 1 trillion challenge response pair measurements. Proceedings of the 54th Annual Design Automation, Austin, TX, USA, 18 June 2017. Austin, 2017, pp. 18–22.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Implementation of double arbiter PUF and its performance evaluation on FPGA / T. Machida [et al.] // Proc. of the 20th Asia and South Pacific Design Automation Conf., Chiba, Japan, 19 Jan. 2015. – Chiba, 2015. – P. 6–7.</mixed-citation><mixed-citation xml:lang="en">Machida T., Yamamoto D., Iwamoto M., Sakiyama K. Implementation of double arbiter PUF and its performance evaluation on FPGA. Proceedings of the 20th Asia and South Pacific Design Automation Conference, Chiba, Japan, 19 January 2015. Chiba, 2015, pp. 6–7.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Side channel modeling attacks on 65nm arbiter PUFs exploiting CMOS device noise / J. Delvaux, I. Verbauwhede // Proc. of IEEE Intern. Symp. on Hardware-Oriented Security and Trust (HOST), Austin, TX, USA, 2–3 June 2013. – Austin, 2013. – P. 137–142.</mixed-citation><mixed-citation xml:lang="en">Delvaux J., Verbauwhede I. Side channel modeling attacks on 65nm arbiter PUFs exploiting CMOS device noise. Proceedings of IEEE International Symposium on Hardware-Oriented Security and Trust (HOST), Austin, TX, USA, 2–3 June 2013. Austin, 2005, pp. 137–142.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">PUF modeling attacks on simulated and silicon data / U. Rührmair [et al.] // IEEE Transactions on Information Forensics and Security. – 2013. – Vol. 11, no. 8. – P. 1876–1891.</mixed-citation><mixed-citation xml:lang="en">Rührmair U., Sölter J., Sehnke F., Xu X., Mahmoud A., …, Devadas S. PUF modeling attacks on simulated and silicon data. IEEE Transactions on Information Forensics and Security, 2013, vol. 11, no. 8, pp. 1876–1891.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Шамына, А. Ю. Построение и балансировка путей физически неклонируемой функции типа арбитр на FPGA / А. Ю. Шамына, А. А. Иванюк // Информатика. – 2022. – Т. 19, № 4. – С. 27–41.</mixed-citation><mixed-citation xml:lang="en">Shamyna A. Yu., Ivaniuk A. A. Creating and balancing the paths of arbiter-based physically unclonable functions on FPGA. Informatika [Informatics], 2022, vol. 19, no. 4, pp. 27–41 (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, В. Н. Двухмерные физически неклонируемые функции типа арбитр / В. Н. Ярмолик, А. А. Иванюк // Информатика. – 2023. – Т. 20, № 1. – С. 7–26.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N., Ivaniuk A. A. 2D physically unclonable functions of the arbiter type. Informatika [Informatics], 2023, vol. 20, no. 1, pp. 7–26 (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, В. Н. Сбалансированные физически неклонируемые функции типа арбитр / В. Н. Ярмолик, А. А. Иванюк // Безопасность информационных технологий. – 2023. – № 1(30). – С. 92–107.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N., Ivaniuk A. A. Balanced arbiter physical uncloneable functions. Bezopasnost' informacionnyh tehnologij [IT Security], 2023, no. 1(30), pp. 92–107.</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, В. Н. Контроль и диагностика вычислительных систем / В. Н. Ярмолик. – Минск : Бестпринт, 2019. – 387 с.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V. N. Kontrol’ i diagnostika vuchislitel’nuh system. Monitoring and Diagnostics of Computer Systems. Minsk, Bestprint, 2019, 387 p. (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">Implementation of pseudo-linear feedback shift register-based physical unclonable functions on silicon and sufficient Challenge-Response pair acquisition using Built-In Self-Test before shipping / Y. Ogasahara [et al.] // Integration, the VLSI J. – 2020. – Vol. 71. – P. 144–153.</mixed-citation><mixed-citation xml:lang="en">Ogasahara Y., Hori Y., Katashita T., Iizuka T., Awano H., …, Koike H. Implementation of pseudo-linear feedback shift register-based physical unclonable functions on silicon and sufficient Challenge-Response pair acquisition using Built-In Self-Test before shipping. Integration, the VLSI Journal, 2020, vol. 71, pp. 144–153.</mixed-citation></citation-alternatives></ref><ref id="cit27"><label>27</label><citation-alternatives><mixed-citation xml:lang="ru">Evaluation of physical unclonable functions for 28-nm process field-programmable gate arrays / Y. Hori [et al.] // J. of Information Processing. – 2014. – Vol. 22, no. 2. – P. 344–356.</mixed-citation><mixed-citation xml:lang="en">Hori Y., Kang H., Katashita T., Satoh A., Kawamura S., Kobara K. Evaluation of physical unclonable functions for 28-nm process field-programmable gate arrays. Journal of Information Processing, 2014, vol. 22, no. 2, pp. 344–356.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
