{"id":2788,"date":"2022-08-03T08:15:30","date_gmt":"2022-08-03T08:15:30","guid":{"rendered":"https:\/\/akademperiodyka.org.ua\/uk\/?p=2788"},"modified":"2022-08-08T15:11:51","modified_gmt":"2022-08-08T15:11:51","slug":"chemerys","status":"publish","type":"post","link":"https:\/\/akademperiodyka.org.ua\/en\/books\/chemerys\/","title":{"rendered":"Reconfigurable signature-based information security tools of computer systems"},"content":{"rendered":"
\n
Authors:\u00a0Hilgurt S.Ya., Chemerys O.A.<\/strong><\/div>\n<\/div>\n
\n
Year: 2022<\/div>\n<\/div>\n
\n
Pages: 297<\/div>\n<\/div>\n
\n
ISBN: 978-966-360-458-9<\/div>\n<\/div>\n
\n
Publication Language: Ukrainian<\/div>\n<\/div>\n
\n
Publisher: PH \u201cAkademperiodyka\u201d<\/div>\n<\/div>\n
\n
Place Published: Kyiv<\/div>\n
Affiliation: National Academy of Sciences of Ukraine, G.E. Pukhov Institute for Modelling in Energy Engineering.<\/div>\n
<\/div>\n<\/div>\n
\n
doi:\u00a0 https:\/\/doi.org\/10.15407\/akademperiodyka.458.297<\/a><\/div>\n<\/div>\n
<\/div>\n
\n
\n

The book is devoted to the research and development of methods for combining computational structures for reconfigurable signature-based information protection tools for computer systems and networks in order to increase their efficiency. Network security tools based, among others, on such AI-based approaches as deep neural networking, despite the great progress shown in recent years, still suffer from nonzero recognition error probability. Even a low probability of such an error in a critical infrastructure can be disastrous. Therefore, signature-based recognition methods with their theoretically exact matching feature are still relevant when creating information security systems such as network intrusion detection systems, antivirus, anti-spam, and wormcontainment systems. The real time multi-pattern string matching task has been a major performance bottleneck in such systems. To speed up the recognition process, developers use a reconfigurable hardware platform based on FPGA devices. Such platform provides almost software flexibility and near-ASIC performance. The most important component of a signature-based information security system in terms of efficiency is the recognition module, in which the multipattern matching task is directly solved. It must not only check each byte of input data at speeds of tens and hundreds of gigabits\/sec against hundreds of thousand or even millions patterns of signature database, but also change its structure every time a new signature appears or the operating conditions of the protected system change. As a result of the analysis of numerous examples of the development of reconfigurable information security systems, three most promising approaches to the construction of hardware circuits of recognition modules were identified, namely, content-addressable memory based on digital comparators, Bloom filter and Aho\u2013Corasick finite automata. A method for fast quantification of components of recognition module and the entire system was proposed. The method makes it possible to exclude resource-intensive procedures for synthesizing digital circuits on FPGAs when building complex reconfigurable information security systems and their components. To improve the efficiency of the systems under study, structural-level combinational methods are proposed, which allow combining into single recognition device several matching schemes built on different approaches and their modifications, in such a way that their advantages are enhanced and disadvantages are eliminated. In order to achieve the maximum efficiency of combining methods, optimization methods are used. The methods of: parallel combining, sequential cascading and vertical junction have been formulated and investigated. The principle of multi-level combining of combining methods is also considered and researched. Algorithms for the implementation of the proposed combining methods have been developed. Software has been created that allows to conduct experiments with the developed methods and tools. Quantitative estimates are obtained for increasing the efficiency of constructing recognition modules as a result of using combination methods. The issue of optimization of reconfigurable devices presented in hardware description languages is considered. A modification of the method of affine transformations, which allows parallelizing such cycles that cannot be optimized by other methods, was presented. In order to facilitate the practical application of the developed methods and tools, a web service using high-performance computer technologies of grid and cloud computing was considered. The proposed methods to increase efficiency of matching procedure can also be used to solve important problems in other fields of science as data mining, analysis of DNA molecules, etc. Keywords: information security, signature, multi-pattern matching, FPGA, structural combining, efficiency, optimization, hardware description language.<\/p>\n<\/div>\n

 <\/p>\n

\n

References:<\/p>\n

 <\/p>\n

    \n
  1. S. Ya. Hil\u02b9hurt Analiz zastosuvannya aparatnoho pryskorennya informatsiynoho zakhystu v avtomatyzovanykh systemakh enerhetychnoyi haluzi \/\/ Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 83, ss. 154-164, 2018.<\/li>\n
  2. Y. Yang, H. Xu, L. Gao, Y. Yuan, K. McLaughlin ta S. Sezer, “Bahatomirna systema vyyavlennya vtorhnen\u02b9 dlya merezh SCADA na osnovi IEC 61850”, IEEE Transactions on Power Delivery, vol. 32, \u2116 2, stor. 1068-1078, 2017, doi: 10.1109\/TPWRD.2016.2603339.<\/li>\n
  3. V. A. Luzhets\u02b9kyy, A. d. Kozhukhivs\u02b9kyy, O. p. Voynovych, Osnovy informatsiynoyi bezpeky. Navchal\u02b9nyy posibnyk. Vinnytsya: VNTU, 2009.<\/li>\n
  4. E. H. Amorozo, Osnovy tekhnolohiyi komp\u02bayuternoyi bezpeky. NJ: Prentice Hall PTR, 1994, 404 s.<\/li>\n
  5. K. Kasperski, Tekhnika merezhevykh atak. M.: Solon-R, 2001.<\/li>\n
  6. H. F. Konakhovych, V. P. Klymchuk, S. M. Pauk, V. H. Potapov, Zakhyst informatsiyi v telekomunikatsiynykh systemakh. K.: \u00abMK-Press\u00bb, 2005.<\/li>\n
  7. A. H. Mykytyshyn, M. M. Mytnyk, P. D. Stukhlyak, Kompleksna bezpeka informatsiynykh merezhevykh system: navchal\u02b9nyy posibnyk. Ternopil\u02b9: Vyd-vo TNTU imeni Ivana Pulyuya, 2016, 256 s.<\/li>\n
  8. Yu. M. Korostyl\u02b9, A. N. Davydenko, S. Ya. Hil\u02b9hurt, M. M. Panchenko Analiz zahroz i nebezpek v komp’yuternykh systemakh na predmet zakhystu tsyfrovymy rekonfyhuryruemymy ustroystvamy \/\/ Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 56, cc. 10-17, 2010.<\/li>\n
  9. S. V. Sal\u02b9nyk, A. S. Storchak, A. YE. Krams\u02b9kyy, Analiz vrazlyvostey ta ataky na derzhavni informatsiyni resursy, shcho obroblyayut\u02b9sya v informatsiyno-telekomunikatsiynykh systemakh, Systemy obrobky informatsiyi, \u2116 2(157), cc. 121-128, 2019.<\/li>\n
  10. S. Anvar ta in., “Vid vyyavlennya vtorhnen\u02b9 do systemy reahuvannya na vtorhnennya: osnovy, vymohy ta maybutni napryamky”, Alhorytmy, ohlyad tom. 10, \u2116 2, stor. 24 chervnya 2017 r., st. 39, doi: 10.3390\/a10020039.<\/li>\n
  11. S. Ya. Hil\u02b9hurt, A. K. Heranova, Pro zastosuvannya rekonfyhuryruemykh vychyslyteley dlya vyrishennya zadach zakhystu informatsiyi, Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 46, cc. 93-99, 2008.<\/li>\n
  12. S. Ya. Hil\u02b9hurt, A. K. Heranova Pro zastosuvannya rekonfyhuryruemykh vychyslyteley dlya vyrishennya pytan\u02b9 zakhystu informatsiyi, peresylaemoy v hrid-serede \/\/ Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 51, cc. 65-72, 2009.<\/li>\n
  13. S. Ya. Hil\u02b9hurt, A. K. Haranova, Prohramno-aparatnyy zakhyst danykh u rozpodilenykh intelektual\u02b9nykh systemakh, Shtuchnyy intelekt, \u2116 3, cc. 706-711, 2010.<\/li>\n
  14. A. V. Lukatskyy, Obnaruzhenye atak. SPb.: BKHV-Peterburh, 2001, 624 s.<\/li>\n
  15. S. Ya. Hil\u02b9hurt, “Aparatne rozpiznavannya ryadka v intelektual\u02b9nykh systemakh zakhystu informatsiyi”, Tez. dokl. mizhnarodnoyi naukovo-tekhnichnoyi konferentsiyi \u00abYskusstvennyy yntellekt. Yntellektual\u02b9nye systemy II-2011\u00bb, 2011, vyp. 1: Donets\u02b9k: IPII \u00abNauka i osvita\u00bb, cc. 271-274.<\/li>\n
  16. V. Yevdokymov, A. Davydenko, S. Hil\u02b9hurt, Tsentralizovanyy syntez rekonfihurovanykh aparatnykh zasobiv informatsiynoyi bezpeky na vysokovyrobnychykh platformakh, Zakhyst informatsiyi, T. 20, \u2116 4, cc. 247-258, 2018, doi: 10.18372\/2410-7840.20.13426.<\/li>\n
  17. D. Stiawan, A. Y. I. Shakhatreh, M. Y. Idris, A. B. Kamarulnizam, and H. A. Abdul, “Intrusion protection system: A survey”, Journal of Theoretical and Applied Information Technology, vol. 40, vyp. 1, S. 44-54, 2012.<\/li>\n
  18. S. Kumar. “Ohlyad potochnykh metodiv vyyavlennya merezhevykh vtorhnen\u02b9”. https:\/\/www.cse.wustl.edu\/~jain\/cse571-07\/ids.htm (data dostupu: 15.09.2019).<\/li>\n
  19. U. A. Sandhu, S. Haider, S. Naseer, O. U. Ateeb i S. Z. A. Bhutto, “A Survey of Intrusion Detection & Prevention Techniques”, 2011 International Conference on Information Communication and Management, Singapore, 2011, vol. 16: IACSIT Press, stor. 66-71.<\/li>\n
  20. M. Bidzhon, “Opytuvannya shchodo bezpechnoyi merezhi: pidkhody do vyyavlennya ta zapobihannya vtorhnennyam”, Amerykans\u02b9kyy zhurnal informatsiynykh system, tom. 4, \u2116 3, S. 69-88, 2016.<\/li>\n
  21. S.V. Kazmirchuk, A.O. Korchenko, T.I. Parashchuk, “Analiz systemnoho vtorhnennya”, Zakhyst informatsiyi, T. 20, \u2116 4, cc. 259-276, 2018.<\/li>\n
  22. A. Korchenko, O. Zarits\u02b9kyy, T. Parashchuk, V. Bychkov Prohramne zabezpechennya formuvannya etaloniv parametriv \/\/ Zakhyst informatsiyi. 20, \u2116 3, cc. 133-148, 2018.<\/li>\n
  23. Yu. M. Korostyl\u02b9, S. Ya. Hil\u02b9hurt, Pryntsypy pobudovy merezhevykh system vyyavlennya vtorzhen\u02b9 na bazi PLIS, Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 57, cc. 87-94, 2010.<\/li>\n
  24. S.Ya. Hilhurt, “Zastosuvannya rekonfihurovanykh vychyslyteliv dlya aparatnoho pryskorennya syhnaturnoyi systemy zakhystu informatsiyi”, Tez. dop. Mizhnar. nauk.-tekhn. konf. \u00abModelyuvannya-2018\u00bb, Kyyiv, 2018: Instytut problem modelyuvannya v enerhetytsi im. H.YE. Pukhova NAN Ukrayiny, cc. 107-110.<\/li>\n
  25. Y.H. Cho ta W.H. Mangione-Smith, “Hlybokyy fil\u02b9tr paketiv iz spetsial\u02b9noyu lohikoyu ta pam’yattyu lyshe dlya chytannya”, 12-y shchorichnyy sympozium IEEE z prohramovanykh nalashtuvan\u02b9 obchyslyuval\u02b9nykh mashyn, materialy, materialy, stor. 125-134, 2004, doi: 10.1109 \/fccm.2004.25.<\/li>\n
  26. P. C. Lin, Y. D. Lin, T. H. Lee ta Y. C. Lai, “Vykorystannya zistavlennya ryadkiv dlya hlybokoyi perevirky paketiv”, Computer, Article vol. 41, vyp. 4, stor. 23-28, kviten\u02b9 2008 r., doi: 10.1109\/mc.2008.138.<\/li>\n
  27. Khil\u02b9khurt S. Yu. Zastosuvannya rekonfihurovanykh pryskoryuvachiv na osnovi PLIS dlya zavdan\u02b9 merezhevoyi bezpeky \/\/ Modelyuvannya ta informatsiyni tekhnolohiyi. Zbirnyk naukovykh prats\u02b9 PIME NAN Ukrayiny, vyp. 73, stor. 17-26, 2014.<\/li>\n
  28. S. Ya. Hil\u02b9hurt, “Porivnyal\u02b9nyy analiz mizhsetevykh ekraniv, systema vyyavlennya i peredovernennya vtorzhen\u02b9, kontrol\u02b9 tsilosti”, Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 60, cc. 116-120, 2011.<\/li>\n
  29. O.S. Potenko Analiz system zakhystu veb-dodatkiv vid khakers\u02b9kykh atak \/\/ Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 89, cc. 50-63, 2019.<\/li>\n
  30. “Zeek. Instrument monitorynhu bezpeky merezhi z vidkrytym vykhidnym kodom.” Versiya 3.0.0. https:\/\/zeek.org (data zvernennya: 15.10.2019).<\/li>\n
  31. \u00abLaskavo prosymo do Hogwash\u00bb. Versiya 0.5. http:\/\/hogwash.sourceforge.net\/oldindex.html (data zvernennya: 15.09.2018).<\/li>\n
  32. \u00abFORPANNYA\u00bb. Versiya 2.9.3.1. http:\/\/www.snort.org (data zvernennya: 15.09.2018).<\/li>\n
  33. “Suricata. IDS z vidkrytym kodom.” Versiya 4.1.0. http:\/\/suricata-ids.org (data zvernennya: 15.09.2018).<\/li>\n
  34. “Posibnyk korystuvacha SNORT. Proekt Snort.” Cisco. Versiya 2.9.16. http:\/\/manual-snort-org.s3-website-us-east-1.amazonaws.com\/node2.html (data zvernennya 17.08.2019).<\/li>\n
  35. A. N. Davydenko, S. Ya. Hil\u02b9hurt, V. Y. Sabat, “Aparatne pryskorennya alhorytmiv vyyavlennya syhnatury vtorzhen\u02b9 u vidkrytiy systemi informatsiynoyi bezpeky Snort”, Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, cc. 94-103, 2012.<\/li>\n
  36. Yu.M. Korostyl\u02b9, S.Ya. Hil\u02b9hurt, O.M. Nazarenko Analiz bazy danykh systemy informatsiynoyi bezpeky Snort i pytannya shvydkoyi diyi \/\/ Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE Pukhova NAN Ukrayiny, cc. 77-84, 2012.<\/li>\n
  37. A. Krasotkyn, “Krasotkyn A. Obnaruzhenye setevykh tak \u2013 Snort”, tom. Myr PK, \u2116. 6, 2003.<\/li>\n
  38. N. N. Bezrukov, Komp\u02b9yuternaya vyrusolohyya: Sprav. kerivnytstvo. Kyev: Ukr. sov. entsykl., 1991, 414 s.<\/li>\n
  39. F. Koen, “Pro naslidky komp’yuternykh virusiv i metody zakhystu”, C&S, tom. 7, \u2116 2, stor. 167-184, 1988.<\/li>\n
  40. M. Al\u02b9-Asli ta T. A. Haleb, \u00abOhlyad metodiv na osnovi syhnatur v antyvirusnykh produktakh\u00bb, u 2019 r. Mizhnarodna konferentsiya z komp\u02bayuternykh ta informatsiynykh nauk, ICCIS 2019 r., 2019 r.: Instytut inzheneriv z elektrotekhniky ta elektroniky Inc., doi: 10.1109 \/ICCISci.2019.8716381.<\/li>\n
  41. D. Pao, X. Wang, X. R. Wang, C. Cao ta Y. S. Zhu, “String Searching Engine for Virus Scanning”, IEEE Transactions on Computers, stattya tom. 60, vyp. 11, stor. 1596-1609, lystopad 2011, doi: 10.1109\/tc.2010.250.<\/li>\n
  42. Dzh. T. L. Kho ta H. H. F. Lem\u02baye, \u00abPERG: masshtabovana systema uz\u00b7hodzhennya shabloniv na osnovi PLIS iz konsolidovanymy fil\u02b9tramy Blum\u02bayera\u00bb, materialy Mizhnarodnoyi konferentsiyi 2008 roku z prohramovanykh tekhnolohiy, materialy dopovidey, stor. 73-80, 2008, doi: 10.1109\/fpt.2008.4762368.<\/li>\n
  43. \u00abClamAV \u2014 tse antyvirusnyy mekhanizm iz vidkrytym vykhidnym kodom dlya vyyavlennya troyaniv, virusiv, shkidlyvykh prohram ta inshykh zlovmysnykh zahroz\u00bb. Versiya 0.101.2. http:\/\/www.clamav.net (data zvernennya: 09.04.2019).<\/li>\n
  44. U. Savagaonkar, R. Sahita, G. Nagabhushan, P. Rajagopal, and D. Durham. (2005) Nezalezhna vid OS systema zakhystu vid khrobakiv na osnovi evrystyky. Zhurnal Technology@Intel. 1-8.<\/li>\n
  45. B. Madkhusudan i Dzh. V. Lokvud, “Aparatno-pryskorena systema dlya vyyavlennya khrobakiv u real\u02b9nomu chasi”, IEEE Micro, stattya; Proceedings Paper vol. 25, vyp. 1, stor. 60-69, sichen\u02b9-lyutyy 2005, doi: 10.1109\/mm.2005.1.<\/li>\n
  46. \u200b\u200bM. Faezipur, M. Nurani ta R. Panihrakhi, \u00abAparatna platforma dlya efektyvnoho vyyavlennya spalakhiv khrobakiv\u00bb, ACM Transactions on Design Automation of Electronic Systems, Article vol. 14, vyp. 4, stor. 29, serpen\u02b9 2009, st. 49, doi: 10.1145\/1562514.1562517.<\/li>\n
  47. S.Ya. Hil\u02b9hurt, Osoblyvosti zastosuvannya rekonfihurovanykh vychyslyteliv dlya aparatnoho zakhystu informatsiynykh system, Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 38, cc. 36-41, 2007.<\/li>\n
  48. S. Singh, C. Estan, G. Varghese, S. Savage ta Usenix, “Automated worm fingerprinting”, Usenix Association Proceedings of the Sixth Symposium on Operating Systems Design and Implementation (Osde ’04), Proceedings Paper stor. 45-60, 2004.<\/li>\n
  49. Y. Ashmanov, \u00abBor\u02b9ba so spamom tekhnycheskymy sredstvamy\u00bb, BYTE\/Roscyya, T. 65, \u2116 1, cc. 70-74, 2004.<\/li>\n
  50. M. Takesue, \u00abPersonalizovana fil\u02b9tratsiya polimorfnoyi elektronnoyi poshty, spamu\u00bb, 2009 r., Tretya mizhnarodna konferentsiya z novoyi informatsiyi, system i tekhnolohiy bezpeky, dopovid\u02b9, stor. 249-254, 2009 r., doi: 10.1109\/securware.2009.45.<\/li>\n
  51. Dzh. Yan i P. L. Cho, \u00abPokrashchennya spil\u02b9noho vyyavlennya spamu za dopomohoyu fil\u02b9triv Blum\u00bb, na 22-y shchorichniy konferentsiyi iz zastosuvannya komp\u02bayuternoyi bezpeky, Mayami-Bich, shtat Floryda, 11-15 hrudnya 2006 r., LOS-ALAMITOS: Ieee Computer Soc, na shchorichniy konferentsiyi iz zastosuvannya komp\u02bayuternoyi bezpeky. Konferentsiya \u2013 Materialy, 2006, stor. 414-+, doi: 10.1109\/acsac.2006.26.<\/li>\n
  52. D. Hasfild, Alhorytmy na ryadkakh, derevakh i poslidovnostyakh: informatyka ta obchyslyuval\u02b9na biolohiYa. Kembrydzh: Cambridge University Press, 1997.<\/li>\n
  53. D. Hasfild, Hasfild D. Stroky, derev\u02b9ya y posledovatel\u02b9nosty v alhorytmakh: Ynformatyka y vychyslytel\u02b9naya byolohyYa. SPb.: Nevskyy Dyalekt; BKHV-Peterburh, 2003, 654 s.<\/li>\n
  54. T. AbuHmed, A. Mohaisen i D. Nyang, “Deep Packet Inspection for Intrusion Detection Systems: A Survey”, Computer Networks, vol. 57, vyp. 18, stor. 4047-4064, 2012.<\/li>\n
  55. W. Jiang, Y. H. E. Yang i V. K. Prasanna, \u00abMashtabovana bahatokonveyerna arkhitektura dlya vysokoproduktyvnoyi vidpovidnosti ryadkiv z kil\u02b9koma shablonamy\u00bb, na 24-mu mizhnarodnomu sympoziumi z paralel\u02b9noyi ta rozpodilenoyi obrobky IEEE, IPDPS 2010, Atlanta, Dzhordzhiya, 2010, doi: 10.1109\/IPDPS.2010.5470374.<\/li>\n
  56. J. Lunteren, “High-performance pattern-matching for intrusion detection”, 25th International Conference on Computer Communications, tomy 1-7, Proceedings IEEE Infocom 2006, Proceedings Paper stor. 1409-1421, 2006.<\/li>\n
  57. D. E. Knut, Dzh. KH. Morris i V. R. Pratt, “Shvydke zistavlennya shabloniv u ryadkakh”, SIAM J. COMPUT., tom. 6, \u2116 2, 1977.<\/li>\n
  58. R. S. Boyer i Dzh. S. Mur, “Shvydkyy alhorytm poshuku ryadkiv”, Komunikatsiyi ACM, tom. 20, \u2116 10, stor. 762-772, 1977, doi: 10.1145\/359842.359859.<\/li>\n
  59. R. M. Karp i M. O. Rabin, “Efektyvni randomizovani alhorytmy zistavlennya shabloniv”, IBM Journal of Research and Development, stattya tom. 31, vyp. 2, stor. 249-260, berezen\u02b9 1987 r., doi: 10.1147\/rd.312.0249.<\/li>\n
  60. B. Smit, Shablony obchyslen\u02b9 u ryadkakh. Esseks: Pearson Addison Wesley, 2003.<\/li>\n
  61. B. Smyt, Metody y alhorytmy vychyslenyy na strokakh. Teoretycheskye osnovy rehulyarnykh vychyslenyy. M.: Vil\u02b9yams (Per. s anhl.), 2006.<\/li>\n
  62. S. Ya. Hil\u02b9hurt, “Zadacha mnozhynnoho rozpiznavannya strok v intensyvnomu potoki danykh i metody yiyi aparatnoho pryskorennya”, Tez. dop. Mizhnar. nauk.-tekhn. konf. \u00abModelyuvannya-2016\u00bb, 2016: K.: Instytut problem modelyuvannya v enerhetytsi im. H.YE. Pukhova NAN Ukrayiny, cc. 166-169.<\/li>\n
  63. A. V. Aho ta M. J. Corasick, “Efficient String Matching: An Aid to Bibliographic Search”, Communications of the ACM, vol. 18, vyp. 6, stor. 333-340, 1975, doi: 10.1145\/360825.360855.<\/li>\n
  64. B. Commentz-Walter, “A string matching algorithm fast on the Middle”, in Konspekty lektsiy z informatyky (vklyuchayuchy pidseriyi Konspekty lektsiy zi shtuchnoho intelektu ta Konspekty lektsiy z bioinformatyky), tom. 71 LNCS, red., 1979, stor. 118-132.<\/li>\n
  65. S. Vu ta U. Manber, “Shvydkyy alhorytm poshuku za kil\u02b9koma shablonamy”, Universytet Arizony, 1994 r.<\/li>\n
  66. B. Dom\u00eblky, “Alhorytmy dlya rozpiznavannya vlastyvostey poslidovnostey symvoliv”, Zhurnal vychyslytel\u02b9noy matematyky i matematycheskoy fizyky, T. 5, \u2116 1, cc. 77-97, 1965.<\/li>\n
  67. B. D\u00f6m\u00f6lki, “Universal\u02b9na systema kompilyatora, zasnovana na pravylakh vyrobnytstva”, BIT Numerical Mathematics, vol. 8, \u2116 4, stor. 262-275, 1968, doi: 10.1007\/BF01933436.<\/li>\n
  68. M. Fisk i H. Varheze, “Zastosuvannya shvydkoho zistavlennya ryadkiv dlya vyyavlennya vtorhnen\u02b9”, Kaliforniys\u02b9kyy universytet, San-Diyeho, 2002.<\/li>\n
  69. P. C. Lin, Z. X. Li, Y. D. Lin, Y. C. Lai ta F. C. Lin, “Profilyuvannya ta pryskorennya alhorytmiv zistavlennya ryadkiv u tr\u02b9okh prohramakh bezpeky merezhevoho vmistu”, IEEE Communications Surveys and Tutorials, Article vol. 8, \u2116 2, stor. 24-36, 2006, doi: 10.1109\/comst.2006.315851.<\/li>\n
  70. Z. Khan, R. K. Pateriya ta M. Azad, “Multiple Pattern String Matching Methodologies: A Comparative Analysis”, International Journal of Scientific and Research Publications, vol. 2, \u2116 7, S. 1-7, 2012.<\/li>\n
  71. S. Yusuf, W. Luk, M. Sloman, N. Dulay, E. C. Lupu ta G. Brown, “Reconfigurable architecture for network flow analysis”, IEEE Transactions on Very Large Scale Integration (Vlsi) Systems, stattya; Proceedings Paper vol. 16, vyp. 1, stor. 57-65, sichen\u02b9 2008 r., doi: 10.1109\/tvlsi.2007.912115.<\/li>\n
  72. H. V. Royzenzon, “Vybir chyslovykh klasteriv na osnovi analizu kil\u02b9kisnoyi ta yakisnoyi informatsiyi”, Yskusstvennyy yntelekt, \u2116 2, cc. 73-79, 2004.<\/li>\n
  73. S. Ya. Hil\u02b9hurt, “Analiz zastosuvannya unifikovanykh vychyslyteliv v intelektual\u02b9nykh systemakh”, Shtuchnyy intelekt, \u2116 1, cc. 144-148, 2009.<\/li>\n
  74. S. Hil\u02b9hurt, “Rekonfihurovani vychyslyteli. Analitychnyy ohlyad”, Elektronne modelyuvannya, 2013.<\/li>\n
  75. KH. Bos i K. Khuanh, \u00abSystema vyyavlennya merezhevykh instruktsiy na merezhevykh protsesorakh IXP1200 iz pidtrymkoyu velykykh naboriv pravyl\u00bb, 2004 r.<\/li>\n
  76. M. Aldwairi, T. Conte ta P. Franzon, “Aparatne zabezpechennya dlya zistavlennya ryadkiv, shcho nastroyuyet\u02b9sya dlya pryskorennya vyyavlennya vtorhnen\u02b9”, ACM SIGARCH Computer Architecture News, tom. 33, vyp. 1, stor. 99-107, 2005.<\/li>\n
  77. Markatos, “An active splitter architecture for intrusion detection and preventing”, IEEE Transactions on Dependable and Secure Computing, Article vol. 3, \u2116 1, stor. 31-44, sichen\u02b9-berezen\u02b9 2006 r., doi: 10.1109\/tdsc.2006.6.<\/li>\n
  78. P. Piyachon i Y. Luo, “Efektyvne vykorystannya pam’yati na merezhevykh protsesorakh dlya hlybokoyi perevirky paketiv”, u 2-mu sympoziumi ACM\/IEEE z arkhitektur merezhevykh i komunikatsiynykh system, ANCS 2006, San-Khose, Kaliforniya, 2006, stor. 71 -80, doi: 10.1145\/1185347.1185358.<\/li>\n
  79. J. Ni, C. Lin, Z. Chen i P. Ungsunan, \u00abShvydkyy alhorytm zistavlennya kil\u02b9kokh shabloniv dlya hlybokoyi perevirky paketiv na merezhevomu protsesori\u00bb, na 36-y shchorichniy mizhnarodniy konferentsiyi z paralel\u02b9noyi obrobky (ICPP 2007), Xian, PEOPLES R CHINA, 10 lypnya-14 veresnya 2007 r., N\u02b9YU-YORK: Ieee, Mizhnarodna konferentsiya z seminariv paralel\u02b9noyi obrobky, 2007 r., stor. 131-138.<\/li>\n
  80. Y. N. Lin, Y. C. Chang, Y. D. Lin i Y. C. Lai, “Rozpodil resursiv u merezhevykh protsesorakh dlya merezhevykh system zapobihannya vtorhnennyam”, Journal of Systems and Software, Article vol. 80, vyp. 7, stor. 1030-1036, lypen\u02b9 2007 r., doi: 10.1016\/j.jss.2007.01.032.<\/li>\n
  81. F. Yu, R. KH. Kats i T. V. Lakshman, “Zistavlennya shabloniv paketiv hihabitnoyi shvydkosti z vykorystannyam TCAM”, 12-ta mizhnarodna konferentsiya IEEE z merezhevykh protokoliv \u2013 materialy, materialy, stor. 174-183, 2004, doi: 10.1109\/icnp. 2004.1348108.<\/li>\n
  82. Dzh. S. Sunh, S. M. Kanh, Yu. Li, T. H. Kvon i B. T. Kim, \u00abAlhorytm hlybokoyi perevirky paketiv iz mul\u02b9tyhihabitnoyu shvydkistyu z vykorystannyam TCAM\u00bb, na Hlobal\u02b9niy telekomunikatsiyniy konferentsiyi IEEE (GLOBECOM 05), Sent-Luyis, Myssuri, 28 lystopada – 2 hrudnya 2005 r., N\u02b9YU-YORK: Ieee, na Vsesvitniy telekomunikatsiyniy konferentsiyi IEEE (Globecom), 2005 r., stor. 453-457.<\/li>\n
  83. Dzh. Moskola, Dzh. Lokvud, R. P. Luyi ta M. Pachos, \u00abVprovadzhennya modulya skanuvannya vmistu dlya brandmauera Internetu\u00bb, Fccm 2003: 11-y shchorichnyy sympozium Ieee z prohramovanykh nalashtuvan\u02b9 obchyslyuval\u02b9nykh mashyn, materialy, materialy Stattya S. 31-38, 2003.<\/li>\n
  84. J. S. Sung, S. M. Kang i T. G. Kwon, “Shvydkyy alhorytm zistavlennya shabloniv dlya systemy vyyavlennya vtorhnen\u02b9 u merezhu”, Networking 2006: Networking Technologies, Services, and Protocols; Produktyvnist\u02b9 komp’yuternykh i komunikatsiynykh merezh; Systemy mobil\u02b9noho ta bezdrotovoho zv’yazku, st.; Proceedings Paper vol. 3976, stor. 1157-1162, 2006.<\/li>\n
  85. C.C.Xu, S.H.Chen, J.S.Su, S.M.Yiu ta L.C.K. Hui, “A Survey on Regular Expression Matching for Deep Packet Inspection: Applications, Algorithms, and Hardware Platforms”, IEEE Communications Surveys and Tutorials, Article vol. 18, vyp. 4, stor. 2991-3029, 2016, doi: 10.1109\/comst.2016.2566669.<\/li>\n
  86. “Pidtrymka. Protsesory Intel Xeon Phi.” Intel. https:\/\/www.intel.com\/content\/www\/us\/en\/support\/products\/75557\/processors\/intel-xeon-phi-processors.html (data dostupu: 04.09.2019).<\/li>\n
  87. D. P. Scarpazza, O. Villa, and F. Petrini, “High-speed string searching against large dictionaries on the Cell\/BE processor”, 2008 IEEE International Symposium on Parallel & Distributed Processing, Vols 1-8, Proceedings Paper pp. 1729-+, 2008.<\/li>\n<\/ol>\n

    88 Y. H. E. Yang i V. K. Prasanna, \u00abOptymizatsiya zistavlennya rehulyarnykh vyraziv za dopomohoyu SR-NFA na bahatoyadernykh systemakh\u00bb, u Parallel Architectures and Compilation Techniques \u2013 Conference Proceedings, PACT, 2011, stor. 424-433, doi: 10.1109\/PACT. 2011.73.<\/p>\n

      \n
    1. J. D. Owens ta in., “Ohlyad zahal\u02b9noho pryznachennya obchyslen\u02b9 na hrafichnomu obladnanni”, Computer Graphics Forum, Review vol. 26, vyp. 1, stor. 80-113, 2007, doi: 10.1111\/j.1467-8659.2007.01012.x.<\/li>\n
    2. A. V. Boreskov A. A. Kharlamov, Osnovy roboty z tekhnolohiyeyu CUDA. M.: DMK Pres, 2010, 232 s.<\/li>\n
    3. A. V. Palahyn V. N. Opanasenko, Rekonfyhuryruemye vychyslytel\u02b9nye systemy: Osnovy y prylozhenyYa. K.: \u00abProsvita\u00bb, 2006, 280 s.<\/li>\n
    4. A. O. Mel\u02b9nyk, V. A. Mel\u02b9nyk, Personal\u02b9ni superkomp\u02bayutery. L\u02b9viv: Vydavnytstvo Natsional\u02b9noho universytetu \u00abL\u02b9vivs\u02b9ka politekhnika\u00bb, 2012, 600 s.<\/li>\n
    5. \u00abPlaty ta systemy FPGA\u00bb. http:\/\/www.fpga-faq.com\/FPGA_Boards.shtml (data dostupu: 15.09.2019).<\/li>\n
    6. Yevdokymov V. F., Davydenko A. M., Hil\u02b9hurt S. YU., Yarema O. R. Aparatna platforma rekonfihurovanykh zasobiv zakhystu informatsiyi \/\/ Modelyuvannya ta informatsiyni tekhnolohiyi. Zbirnyk naukovykh prats\u02b9 PIME NAN Ukrayiny, vyp. 86, stor. 3-11, 2019, doi: 10.5281\/zenodo.3610626.<\/li>\n
    7. R. Abdulkhammed, M. Faezipur i K. M. Elliti, \u00abVyyavlennya vtorhnen\u02b9 u merezhu za dopomohoyu aparatnykh zasobiv: ohlyad\u00bb, 2016 IEEE Long Island Systems, Applications and Technology Conference (Lisat), Proceedings Paper p. 7, 2016.<\/li>\n
    8. H. Vasyliadis, S. Antonatos, M. Polikhronakis, E. P. Markatos ta S. Ioannidis, “Gnort: vysokoefektyvne vyyavlennya vtorhnen\u02b9 u merezhu za dopomohoyu hrafichnykh protsesoriv”, Ostanni dosyahnennya u vyyavlenni vtorhnen\u02b9, Raid 2008, Proceedings Paper vol. 5230, stor. 116-134, 2008.<\/li>\n
    9. T. Song, W. Zhang, D. S. Wang ta Y. B. Xue, “Efektyvna arkhitektura mnozhynnoyi vidpovidnosti shabloniv dlya bezpeky merezhi”, 27-a konferentsiya IEEE z komp\u02bayuternykh komunikatsiy (Infocom), Tomy 1-5, Materialy dopovidey, stor. 673 -681, 2008 rik.<\/li>\n
    10. KH. Dzh. Yunh, Z. K. Beyker i V. K. Prasanna, “Produktyvnist\u02b9 realizatsiyi FPGA arkhitektury z rozdilennyam bitiv dlya system vyyavlennya vtorhnen\u02b9”, na 20-mu mizhnarodnomu sympoziumi paralel\u02b9noyi ta rozpodilenoyi obrobky IEEE, IPDPS 2006, 2006, tom. 2006: IEEE Computer Society, doi: 10.1109\/IPDPS.2006.1639434.<\/li>\n
    11. Y. H. E. Yang i V. K. Prasanna, \u00abKonveyerna arkhitektura z efektyvnym vykorystannyam pam\u02bayati dlya velykomasshtabnoho zistavlennya ryadkiv\u00bb, materialy 17-ho sympoziumu IEEE 2009 roku z prohramovanykh nalashtuvan\u02b9 obchyslyuval\u02b9nykh mashyn, materialy dopovidey, stor. 104-111, 2009, doi: 10.1109\/ FCCM.2009.17.<\/li>\n
    12. T. Huffmire ta in., \u00abProektuvannya zakhyshchenykh system na rekonfihurovanomu obladnanni\u00bb, Acm Transactions on Design Automation of Electronic Systems, stattya; Proceedings Paper vol. 13, \u2116 3, stor. 24, lypen\u02b9 2008, st. 44, doi: 10.1145\/1367045.1367053.<\/li>\n
    13. H. Vasyliadis, M. Polikhronakis, S. Antonatos, E. P. Markatos i S. Ioannidis, \u00abZistavlennya rehulyarnykh vyraziv na hrafichnomu obladnanni dlya vyyavlennya vtorhnen\u02b9\u00bb, Ostanni dosyahnennya u vyyavlenni vtorhnen\u02b9, materialy, publikatsiya tomiv. 5758, stor. 265-283, 2009.<\/li>\n
    14. Y. Kaneta, S. Minato, and H. Arimura, “Fast Bit-Parallel Matching for Network and Regular Expressions”, String Processing and Information Retrieval, Proceedings Paper vol. 6393, stor. 372-384, 2010.<\/li>\n
    15. H. Chen, Y. Chen i D. H. Summerville, “A Survey on the Application of FPGAs for Network Infrastructure Security”, IEEE Communications Surveys and Tutorials, Article vol. 13, \u2116 4, stor. 541-561, 2011, doi: 10.1109\/surv.2011.072210.00075.<\/li>\n
    16. U. Yuichiro, M. Inagi, S. Wakabayashi ta S. Nagayama, “Realizatsiya GPGPU nablyzhenoho zistavlennya ryadkiv z operatoramy rehulyarnoho vyrazu ta porivnyannya z yoho FPGA Realizatsiya\u00bb, u Mizhnarodniy konferentsiyi z paralel\u02b9nykh i rozpodilenykh metodiv i dodatkiv obrobky 2012 (PDPTA\u02ba12), 2012, stor. 115-120.<\/li>\n
    17. R. Nekhemiya, K. Lim, M. Halinium ta A. R. Vidianto, \u00abRealizatsiya bahatoshablonnoho zistavlennya ryadkiv, pryskorenoho za dopomohoyu hrafichnoho protsesora dlya systemy vyyavlennya vtorhnen\u02b9\u00bb, na 3-y Mizhnarodniy konferentsiyi IAES z elektrotekhniky, komp\u02bayuternykh nauk ta informatyky (EECSI), Univ Islam Sultan Agung, Semaranh, INDONEZIYA, 23-25 \u200b\u200blystopada 2016 r., tom. 190, BRISTOL: Iop Publishing Ltd, seriya konferentsiy IOP \u2013 Materialoznavstvo ta inzheneriya, 2017, doi: 10.1088\/1757-899x\/190\/1\/012023.<\/li>\n
    18. V. Dzhioti, S. K. Addepalli ta R. Karri, “DPFEE: vysokoproduktyvnyy masshtabovanyy poperedniy protsesor dlya system merezhevoyi bezpeky”, Tranzaktsiyi IEEE shchodo bahatomasshtabnykh obchyslyuval\u02b9nykh system, tom statti. 4, \u2116 1, stor. 55-68, sichen\u02b9-berezen\u02b9 2018 r., doi: 10.1109\/tmscs.2017.2765324.<\/li>\n
    19. S. N. Shypulin, D. A. Hubanov, V. B. Steshenko, V. Yu. Khrapov, “Tendentsiyi rozvytku PLIS ta yikh zastosuvannya dlya tsyfrovoyi obrobky syhnaliv”, Elektronni komponenty, \u2116 5, cc. 42-45, 1999.<\/li>\n
    20. S. Ya. Hil\u02b9hurt, “Analiz zastosovanykh prohramovanykh IS dlya vyrishennya zavdan\u02b9 vychyslyuval\u02b9noyi tekhniky”, Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 19, cc. 79-85, 2003.<\/li>\n
    21. “Xilinx”. Xilinx. http:\/\/www.xilinx.com (data zvernennya 15.09.2019).<\/li>\n
    22. \u00abPLIS ta prohramovani prystroyi Intel\u00bb. https:\/\/www.intel.com\/ content\/www\/us\/en\/products\/programmable.html (data dostupu: 15.09.2019).<\/li>\n
    23. V.Yu. Zotov, Proektuvannya tsyfrovykh prystroyiv na osnovi PLIS firmy XILINX v SAPR WebPACK ISE. M.: Horyachaya lynyya-Telekom, 2003, 624 s<\/li>\n
    24. V.B. Steshenko, PLIS firmy Al\u02b9tera: elementnaya baza, systema proektyrovanyya y yazyk opysanyya apparatury. M.: Vydavnychyy dim “Dodeka-XXI”, 2002, 576 s.<\/li>\n
    25. V V. Solovyov, A. H. Vasyl\u02b9ev, Prohrammyruemye lohycheskye yntehral\u02b9nye skhemy y ykh prymenenye. Mynsk: Belaruskaya nauka, 1998, 270 s.<\/li>\n
    26. S.N. Shypulin, V. Yu. Khrapov, Osnovni tendentsiyi rozvytku PLIS, Elektronni komponenty, \u2116 3-4, vv. 26-27, 1996.<\/li>\n
    27. S.Ya. Hil\u02b9hurt, “Ohlyad mozhlyvostey rekonfihurovanykh prystroyiv dlya zastosuvannya v komp’yuterniy bezpetsi”, Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 55, cc. 117-124, 2010.<\/li>\n
    28. V. F. Huzyk, Y. A. Kalyaev, Y. Y. Levyn, Rekonfyhuryruemye vychyslytel\u02b9nye systemy: uchebnoe posobye. Rostov-na-Donu: Yuzhnyy federal\u02b9nyy unyversytet, Moskovskyy hosudarstvennyy unyversytet<\/li>\n<\/ol>\n

      ymeny M. V. Lomonosova, 2016, 472 s.<\/p>\n

        \n
      1. D. S. Potekhyn, Y. E. Tarasov, Rozrobka systemy tsyfrovoyi obrobky syhnaliv na bazi PLIS. M.: Horyachaya lynyya \u2013 Telekom, 2007, 248 s.<\/li>\n
      2. V. N. Opanasenko, “Vysokoproyzvodytel\u02b9nye rekonfyhuryruemye komp\u02b9yutery na baze FPGA,” Problemy informatyzatsiyi ta upravlinnYa. \u2013 K.: NAU, T. 27, \u2116 3, cc. 114-118, 2009.<\/li>\n
      3. R. Y. Hrushvytskyy, A. Kh. Mursaev, E. P. Uhryumov, Proektuvannya system na mikroskhemakh prohramovanoyi lohiky. SPb.: BKHV-Peterburh, 2002, 608 s.<\/li>\n
      4. YE. A. Suvorova, YU. E. Sheynyn, Proektuvannya tsyfrovykh system na VHDL. SPb.: BKHV-Peterburh, 2003, 576 s.<\/li>\n
      5. A. M. Serhiyenko, VHDL dlya proektuvannya vychyslyl\u02b9nykh prystroyiv. K.: PP \u00abKorneychuk\u00bb, TOV \u00abTYD \u00abDS\u00bb, 2003, 208 s.<\/li>\n
      6. A. M. Serhiyenko, V. Y. Korneychuk, Mikroprotsesorni prystroyi na prohramovanykh lohichnykh IS. K.: \u00abKorniychuk\u00bb, 2005, 108 s.<\/li>\n
      7. K. Maksfild, Proektuvannya na PLIS. Kurs molodoho boytsa. M.: Vydavnychyy dim \u00abDodeka-KHKHI\u00bb, 2007, 408 s.<\/li>\n
      8. Y. A. Kalyaev, Y. Y. Levyn, E. A. Semernykov, V. Y. Shmoylov, Rekonfyhuryruemye mul\u02b9tykonveyernye vychyslytel\u02b9nye struktury. Rostov-na-Donu: Yzdatel\u02b9stvo YUNTS RAN, 2008, 393 s.<\/li>\n
      9. I. Sourdis i D. Pnevmatikatos, “Poperedn\u02b9o dekodovani CAMs dlya efektyvnoho ta vysokoshvydkisnoho uz\u00b7hodzhennya shabloniv NIDS”, 12-y shchorichnyy sympozium IEEE z prohramovanykh korystuval\u02b9nyts\u02b9kykh obchyslyuval\u02b9nykh mashyn, materialy, dopovid\u02b9, stor. 258-267, 2004, doi: 10.1109\/fccm.2004.46.<\/li>\n
      10. V. Yu. Zotov, Osoblyvosti arkhitektury novoho pokolinnya PLIS z arkhitekturoyu FPGA firmy Xilinx, Komponenty ta tekhnolohiyi, \u2116. 12, 2010.<\/li>\n
      11. S. Ya. Hyl\u02b9hurt, \u00abPrymenenye typovykh ustroystv na baze prohrammyruemoy lohyky dlya reshenyya vychyslytel\u02b9nykh zadach\u00bb, Trudy II Mezhdunar. konf.\u00abParallel\u02b9nye vychyslenyya y zadachy upravlenyya\u00bb PACO\u02ba2004 pam\u02bayati E.H. Sukhova, 2004: Instytut problem upravlinnya im. V.A. Trapeznykova RAN, cc. 514-530.<\/li>\n
      12. S. Ya. Hil\u02b9hurt, Analiz typovykh rezhymiv obminu danymy z rekonfihurovanymy vychyslytelyamy, Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 59, cc. 113-121, 2011.<\/li>\n
      13. S. Ya. Hil\u02b9hurt Ohlyad suchasnykh rekonfyhuryruemykh unifikovanykh vychyslyteley \/\/ Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 49, cc. 17-24, 2008.<\/li>\n
      14. \u00abBitware. Kompaniya Molex\u00bb. https:\/\/www.bittware.com (data zvernennya: 15.09.2019).<\/li>\n
      15. YU . M. Korostyl\u02b9, S. Ya. Hyl\u02b9hurt Perspektyvy razvytyya rekonfyhuryruemykh vychyslyteley dlya vypolnenyya resursoemkykh raschetov \/\/ Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 68, cc. 84-91, 2013.<\/li>\n
      16. V. F. Yevdokymov, A. N. Davydenko, S. Ya. Hilhurt Tsentralizovanyy syntez vychyslyuval\u02b9nykh struktur rekonfyhuryruemykh uskoryteley zadach informatsiynoyi bezpeky \/\/ Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 82, cc. 3-11, 2018.<\/li>\n
      17. T. Katashita, Y. Yamaguchi, A. Maeda, and K. Toda, “FPGA-based detection intrusion system for 10 Gigabit Ethernet,” Ieice Transactions on Information and Systems, Article vol. E90D, \u2116 12, stor. 1923-1931, hruden\u02b9 2007, doi: 10.1093\/ietisy\/e90-d.12.1923.<\/li>\n
      18. Y. H. Cho, S. Navab i W. H. Mangione-Smith, “Spetsializovane obladnannya dlya hlybokoyi merezhevoyi fil\u02b9tratsiyi paketiv”, Field-Programmable Logic and Applications, Proceedings: Reconfigurable Computing Is Going Mainstream, stattya; Proceedings Paper vol. 2438, stor. 452-461, 2002.<\/li>\n
      19. I. Sourdis i D. Pnevmatikatos, “Shvydke, velykomasshtabne zbih ryadkiv dlya systemy vyyavlennya vtorhnen\u02b9 na osnovi 10 Hbit\/s FPGA”, Prohramovana lohika ta prohramy, materialy, stattya; Proceedings Paper vol. 2778, stor. 880-889, 2003.<\/li>\n
      20. S. Antonatos, K. H. Anahnostakis ta E. P. Markatos, “Stvorennya realistychnykh robochykh navantazhen\u02b9 dlya system vyyavlennya merezhevykh vtorhnen\u02b9”, Materialy Chetvertoho mizhnarodnoho seminaru z prohramnoho zabezpechennya ta produktyvnosti, WOSP’04, 2004, stor. 207-215, doi: 10.1145 \/974043.974078.<\/li>\n
      21. V. Paxson, “Bro: systema dlya vyyavlennya merezhevykh zlovmysnykiv u rezhymi real\u02b9noho chasu”, Computer Networks-The International Journal of Computer and Telecommunications Networking, Article vol. 31, vyp. 23-24, stor. 2435-2463, hruden\u02b9 1999, doi: 10.1016\/s1389-1286(99)00112-7.<\/li>\n
      22. G. S. Shenoy, J. Tubella ta A. Gonzalez, “Mekhanizmy aparatnoho\/prohramnoho zabezpechennya dlya zakhystu IDS vid atak alhorytmichnoyi skladnosti”, 2012 Ieee 26th International Parallel and Distributed Processing Symposium Workshops & Phd Forum (Ipdpsw), Proceedings Paper stor. 1190-1196, 2012, doi: 10.1109\/ipdpsw.2012.145.<\/li>\n
      23. S. Hil\u02b9hurt, B. Durnyak, YU. Korostyl\u02b9, Protyvodeystvye atakam alhorytmycheskoy slozhnosty na systemy obnaruzhenyya vtorzhenyy, Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 71, cc. 3-12, 2014.<\/li>\n
      24. L. Tan i T. Shervud, \u00abVysokoproduktyvna arkhitektura zistavlennya ryadkiv dlya vyyavlennya ta zapobihannya vtorhnen\u02b9\u00bb, na 32-mu Mizhnarodnomu sympoziumi z komp\u02bayuternoyi arkhitektury, Medison, Viskonsyn, 04-08 chervnya 2005 r., LOS-ALAMITOS: Ieee Computer Soc, v Materialy konferentsiyi Shchorichnyy mizhnarodnyy sympozium z komp’yuternoyi arkhitektury, 2005, stor. 112-122.<\/li>\n
      25. S. Hil\u02b9hurt Pobudova skinchennykh avtomativ rekonfihurovanymy zasobamy dlya vyrishennya zavdan\u02b9 informatsiynoyi bezpeky \/\/ Zakhyst informatsiyi. 21, \u2116 2, cc. 111-120, 2019, doi: 10.18372\/2410-7840.21.13768.<\/li>\n
      26. S. Dkharmapurikar i Dzh. Lokvud, \u00abShvydke ta masshtabovane zistavlennya shabloniv dlya fil\u02b9tratsiyi vmistu\u00bb, u 2005 rotsi Sympozium z arkhitektur merezhevykh i komunikatsiynykh system (ANCS), Prinston, N\u02b9yu-Dzhersi, SSHA, 26-28 zhovtnya 2005 r. 2005: IEEE , stor. 183-192, doi: 10.1145\/1095890.1095916.<\/li>\n
      27. Dzh. Lunteren i T. Enhbersen, “Shvydka ta masshtabovana klasyfikatsiya paketiv”, Ieee Journal on Selected Areas in Communications, stattya; Proceedings Paper vol. 21, vyp. 4, stor. 560-571, traven\u02b9 2003 r., doi: 10.1109\/jsac.2003.810527.<\/li>\n
      28. S. Ya. Hyl\u02b9hurt, “Prymenenye rekonfyhuryruemykh vychyslenyy dlya reshenyya zadach raspoznavanyya”, Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 16, cc. 41-47, 2002.<\/li>\n
      29. R. Sidkhu ta V.K. Prasanna, \u00abShvydke zistavlennya rehulyarnykh vyraziv z vykorystannyam PLIS\u00bb, u 9-mu shchorichnomu sympoziumi IEEE z korystuvats\u02b9kykh prohramovanykh obchyslyuval\u02b9nykh mashyn, FCCM 2001, 2001: Instytut inzheneriv z elektrotekhniky ta elektroniky, stor. 227-238 .<\/li>\n
      30. F. Yu., Z. Chen, YU. Diao, T. V. Lakshman i R. Kh. Kats, \u00abShvydkyy i efektyvnyy z vykorystannyam pam\u02bayati zbih rehulyarnykh vyraziv dlya hlybokoyi perevirky paketiv\u00bb, u 2-mu sympoziumi ACM\/IEEE z arkhitektury merezhevykh i komunikatsiynykh system, ANCS 2006, San-Khose, Kaliforniya, 2006, stor. 93-102, doi: 10.1145\/1185347.1185360.<\/li>\n
      31. J. Bispo, L. Sourdis, J. M. P. Cardoso, and S. Vassiliadis, “Regular express matching for reconfigurable packet inspection”, 2006 IEEE International Conference on Field Programmable Technology, Proceedings, Proceedings Paper stor. 119-126, 2006, doi : 10.1109\/fpt.2006.270302.<\/li>\n
      32. Dzh. Kim i Dzh. Park, “Efektyvnyy zsuv i alhorytm na osnovi FPGA dlya zistavlennya rehulyarnykh vyraziv. Konspekty lektsiy z informatyky (vklyuchayuchy pidseriyi Konspekty lektsiy zi shtuchnoho intelektu ta Konspekty lektsiy z bioinformatyky)”, na 14-mu Mizhnarodnomu sympoziumi on Applied Reconfigurable Computing, ARC 2018 tom. 10824 LNCS, N. Voros, G. Keramidas, C. Antonopoulos, M. Huebner, P. C. Diniz, and D. Goehringer, Eds., ed: Springer Verlag, 2018, pp. 132-141.<\/li>\n
      33. S. Priti ta S. Sumati, “Ohlyad ostannikh metodiv stysnennya DFA dlya hlybokoyi perevirky paketiv u systemi vyyavlennya vtorhnen\u02b9 u merezhu”, Zhurnal elektrotekhniky, 2014.<\/li>\n
      34. A. N. Davydenko, S. Ya. Hil\u02b9hurt, Alhorytmy rozpiznavannya strok v systemakh vyyavlennya vtorzhen\u02b9 na PLIS, Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 58, cc. 103-109, 2010.<\/li>\n
      35. S. Ya. Hil\u02b9hurt Pobudova asotsiatyvnoyi pam’yati na tsyfrovykh komparatorakh rekonfihurovanymy zasobamy dlya vyrishennya zavdan\u02b9 informatsiynoyi bezpeky \/\/ Elektronne modelyuvannYa. 41, \u2116 3, cc. 59-80, 2019, doi: 10.15407\/emodel .41.03.059.<\/li>\n
      36. S. Hilhurt, Pobudova fil\u02b9triv Bluma rekonfihurovanymy zasobamy dlya vyrishennya zavdan\u02b9 informatsiynoyi bezpeky, Bezpeka informatsiyi, tom. 35, vyp. 1, stor. 53-58, 2019, doi: 10.18372\/2225-5036.25.13594.<\/li>\n
      37. A. H. Khenlon, “Opytuvannya system adresnoyi ta asotsiatyvnoyi pam’yati”, IEEE Transactions on Electronic Computers, tom. EK-15, \u2116 4, stor. 509-521, 1966, doi: 10.1109\/PGEC.1966.264358.<\/li>\n
      38. I. N. Robinson, “Pam’yat\u02b9 z adresatsiyeyu za shablonom”, IEEE Micro, stattya tom. 12, \u2116 3, stor. 20-30, cherven\u02b9 1992 r., doi: 10.1109\/40.141600.<\/li>\n
      39. K. Pagiamtzis ta A. Sheikholeslami, “Content-addressable memory (CAM) architectures and architectures: A tutorial and survey”, IEEE Journal of Solid-State Circuits, Article vol. 41, vyp. 3, stor. 712-727, berezen\u02b9 2006 r., doi: 10.1109\/jssc.2005.864128.<\/li>\n
      40. T. Kohonen, Content-Addresable Memories, 2 ed. (Springer Series in Information Sciences, \u2116 1). N\u02b9yu-York: Springer-Verlag Berlin Heidelberg, 1987.<\/li>\n
      41. R. Nil, \u00abChy pam’yat\u02b9 z adresatsiyeyu vmistu (CAM) ye klyuchem do uspikhu merezhi?\u00bb, Elektronna inzheneriya, Redaktsiynyy material tom. 71, vyp. 865, stor. 9-12, lyutyy 1999.<\/li>\n
      42. “Net Logic Microsystems”. http:\/\/www.netlogicmicro.com (data dostupu: 03.05.2009).<\/li>\n
      43. \u00abMuzyka-ITS\u00bb. https:\/\/music-ic.com (data zvernennya: 15.09.2019).<\/li>\n
      44. S. A. Guccione, D. Levi i D. Downs, “A reconfigurable content addressable memory”, Parallel and Distributed Processing, Proceedings, Article; Proceedings Paper vol. 1800, stor. 882-889, 2000.<\/li>\n
      45. M. Iliopulos i T. Antonakopulos, “Rekonfihurovani merezhevi protsesory na osnovi intehral\u02b9nykh skhem systemnoho rivnya prohramovanoho polya”, na 10-y Mizhnarodniy konferentsiyi z prohramovanoyi lohiky ta dodatkiv, FPL 2000 tom. 1896, H. Grunbacher i R. W. Hartenstein, red., red.: Springer Verlag, 2000, stor. 39-47.<\/li>\n
      46. K. Ksinidis, K. H. Anahnostakis ta E. P. Markatos, \u00abRozrobka ta realizatsiya vysokoproduktyvnoyi systemy zapobihannya vtorhnen\u02b9 u merezhu\u00bb, u 20-y Mizhnarodniy konferentsiyi z informatsiynoyi bezpeky IFIP TC11, IFIP\/SEC2005 tom. 181, vyd. Chiba, 2005, stor. 359-374.<\/li>\n
      47. J. Huang, Z. K. Yang, X. Du, and W. Liu, “FPGA based high speed and low area cost pattern matching”, na konferentsiyi IEEE Region 10 (TENCON 2005), Mel\u02b9burn, AVSTRALIYA, 21-24 lystopada 2005 r. , N\u02b9YU-YORK: Ieee, u materialakh konferentsiyi TENCON IEEE Region 10, 2006, stor. 2693-2697.<\/li>\n
      48. I. Sourdis, D. N. Pnevmatikatos, and S. Vassiliadis, “Scalable multigigabit pattern matching for packet inspection”, IEEE Transactions on Very Large Scale Integration (Vlsi) Systems, Article vol. 16, vyp. 2, stor. 156-166, lyutyy 2008 r., doi: 10.1109\/tvls1.2007.912036.<\/li>\n
      49. M. Gokhale, D. Dubois, A. Dubois, M. Boorman, S. Poole ta V. Hogsett, “Granidt: Towards gigabit rate network intrusion technology detection”, Field-Programmable Logic and Applications, Proceedings: Reconfigurable Computing Chy staye meynstrimom, stattya; Proceedings Paper vol. 2438, stor. 404-413, 2002.<\/li>\n
      50. \u00abPosibnyk korystuvacha konfihurovanoho lohichnoho bloku Spartan-6 FPGA\u00bb, v UG384, 1.0 ed: Xilinx, 2009, 50 stor.<\/li>\n
      51. \u00abPosibnyk korystuvacha konfihurovanoho lohichnoho bloku FPGA 7 Series\u00bb, v UG474, 1.8 ed: Xilinx, 2016, 74 stor.<\/li>\n
      52. C. R. Clark and D. E. Schimmel, “Scalable pattern matching for high speed networks”, 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, Proceedings, Proceedings Paper stor. 249-257, 2004, doi: 10.1109\/fccm.2004.50.<\/li>\n
      53. S. Yusuf i V. Luk, “Pobitovo optymizovana kamera dlya system vyyavlennya merezhevykh vtorhnen\u02b9”, 2005 Mizhnarodna konferentsiya z prohramovanoyi lohiky ta dodatkiv, FPL, Tampere, 2005, tom. 2005, stor. 444-449, doi: 10.1109\/FPL.2005.1515762.<\/li>\n
      54. D. \u00c9. Knut, Yskusstvo prohrammyrovanyya, tom 4, A. Kombinatornye alhorytmy. Moskva: OOO “Y.D. Vyl\u02b9yamts”, 2013, 960 s.<\/li>\n
      55. S. Kheyzelkherst, A. Fatti ta A. Khenvud, “Dviykovi diahramy pryynyattya rishen\u02b9 dlya spyskiv dostupu brandmauera ta marshrutyzatora”, Yohannesburh, Pivdenna Afryka, 1998.<\/li>\n
      56. S. A. Guccione i D. Levi, “XBI: interfeys na osnovi Java dlya aparatnoho zabezpechennya FPGA”, na Konferentsiyi z konfihurovanykh obchyslen\u02b9 \u2013 Tekhnolohiyi ta prohramy, Boston, Massachuset\u00b7s, 2-3 lystopada 1998 r., tom. 3526, BELLINGHAM: Spie-Int Soc Optical Engineering, u materialakh Tovarystva inzheneriv fotooptychnykh pryladiv (Spie), 1998, stor. 97-102, doi: 10.1117\/12.327023.<\/li>\n
      57. B. H. Bloom, “Space\/Time Tradeoffs in Hash Coding with Allowable Errors”, Communications of the ACM, Article vol. 13, \u2116 7, stor. 422-426, 1970, doi: 10.1145\/362686.362692.<\/li>\n
      58. D. V. Pryor, M. R. Thistle i N. Shirazi, “Tekstovyy poshuk u Splash 2”, u IEEE Workshop on FPGAs for Custom Computing Machines, kviten\u02b9 1993 1993, 1993, stor. 172-177.<\/li>\n
      59. A. Broder i M. Mittsenmakher, “Merezhevi zastosuvannya fil\u02b9triv Bluma: opytuvannya”, Internet-matematyka, tom. 1, \u2116 4, stor. 485-509, 2004, doi: 10.1080\/15427951.2004.10129096.<\/li>\n
      60. S. Dzheravand i M. Akhmadi, “Prohramy fil\u02b9triv Bluma v bezpetsi merezhi: suchasne doslidzhennya”, Komp’yuterni merezhi, stattya tom. 57, vyp. 18, stor. 4047-4064, hruden\u02b9 2013 r., doi: 10.1016\/j.comnet.2013.09.003.<\/li>\n
      61. J. Harwayne-Gidansky, D. Stefan, and I. Dalal, “SoC na osnovi FPGA dlya vyyavlennya vtorhnen\u02b9 u merezhu v real\u02b9nomu chasi z vykorystannyam pidrakhunku fil\u02b9triv Bluma”, predstavleno na Proceedings of IEEE Southeastcon 2009, Technical Proceedings, 2009, Zbirnyk materialiv.<\/li>\n
      62. S. Dkharmapurikar, P. Krishnamurti, T. S. Spraul i Dzh. V. Lokvud, \u00abHlyboka perevirka paketiv za dopomohoyu paralel\u02b9nykh fil\u02b9triv Blyum\u00bb, IEEE Micro, stattya; Proceedings Paper vol. 24, vyp. 1, stor. 52-61, sichen\u02b9-lyutyy 2004, doi: 10.1109\/mm.2004.1268997.<\/li>\n
      63. S. Dkharmapurikar, M. Attih i Dzh. Lokvud, \u00abRozrobka ta realizatsiya systemy zistavlennya ryadkiv dlya vyyavlennya vtorhnen\u02b9 u merezhu z vykorystannyam fil\u02b9triv Bluma na osnovi FPGA\u00bb, u \u00abUsi doslidzhennya komp\u02bayuternykh nauk ta inzheneriyi\u00bb, Vashynhtons\u02b9kyy universytet u Sent Luyis, WUCSE-2004-12, 2004-03-25 2004.<\/li>\n
      64. Y. Chen, A. Kumar i J. Xu, “Novyy dyzayn fil\u02b9tra Blyum dlya pryskorennya perevirky paketiv”, na Vsesvitniy telekomunikatsiyniy konferentsiyi IEEE (GLOBECOM 07), Vashynhton, okruh Kolumbiya, 26-30 lystopada 2007 r., N\u02b9YU-YORK : Ieee, u IEEE Global Telecommunications Conference (Globecom), 2007, stor. 1-5.<\/li>\n
      65. L. Karter i M. Vehman, “Universal\u02b9ni klasy khesh-funktsiy”, Komp’yuterni ta systemni nauky, tom. 18, vyp. 2, stor. 143-154, 1979.<\/li>\n
      66. M. Ramakrishna, E. Fu ta E. Bakhchekapili, “Doslidzhennya produktyvnosti funktsiy kheshuvannya dlya aparatnykh dodatkiv”, u 6-y mizhnarodniy konf. Obchyslyuval\u02b9na tekhnika ta informatsiya ICCI\u02ba94, 1994, stor. 1621-1636.<\/li>\n
      67. M. V. Ramakrishna, E. Fu ta E. Bahcekapili, “Efektyvni aparatni khesh-funktsiyi dlya vysokoproduktyvnykh komp’yuteriv”, Ieee Transactions on Computers, stattya tom. 46, vyp. 12, stor. 1378-1381, hruden\u02b9 1997 r., doi: 10.1109\/12.641938.<\/li>\n
      68. S. Tarkoma, C. E. Rothenberg, and E. Lagerspetz, “Theory and Practice of Bloom Filters for Distributed Systems”, IEEE Communications Surveys and Tutorials, Article vol. 14, vyp. 1, stor. 131-155, 2012, doi: 10.1109\/surv.2011.031611.00024.<\/li>\n
      69. M. Breternitz, Y. Wu, P. G. Sassone, J. P. Rupley, W. Attrot, and B. Black, “Efficient Bloom filter,” USA Patent US2008147714 (A1) Patent Appl. 11\/643314, 19.06.2008, 2008.<\/li>\n
      70. S. Dkharmapurikar, P. Krishnamurti, T. Sproul i Dzh. Lokvud, \u00abMetod i prystriy dlya vyyavlennya poperedn\u02b9o vyznachenykh syhnatur u korysnomu navantazhenni paketiv za dopomohoyu fil\u02b9triv Bluma\u00bb, Patent SSHA US2005086520 (A1) Zayavka na patent. 10\/640,513, 21.04.2005, 2005.<\/li>\n
      71. T. Kocak ta I. Kaya, “Arkhitektura fil\u02b9tra nyz\u02b9koyi potuzhnosti dlya hlybokoyi perevirky paketiv”, IEEE Communications Letters, stattya tom. 10, \u2116 3, stor. 210-212, berezen\u02b9 2006 r., doi: 10.1109\/lcomm.2006.1603387.<\/li>\n
      72. H. Kaya ta T. Kocak, “A low power lookup method for multi-hashing network applications”, IEEE Computer Society Annual Symposium on Vlsi, Proceedings: Emerging Vlsi Technologies and Architectures, Proceedings Paper stor. 179-+, 2006.<\/li>\n
      73. N. S. Artan, K. Sinkar, J. Patel i H. J. Chao, “Ahrehovani fil\u02b9try blyumu dlya aparatnoho zabezpechennya vyyavlennya ta zapobihannya vtorhnennyam”, na Vsesvitniy telekomunikatsiyniy konferentsiyi IEEE (GLOBECOM 07), Vashynhton, okruh Kolumbiya, 26-30 lystopada 2007 r., NOVYY YORK: Ieee, u IEEE Global Telecommunications Conference (Globecom), 2007, stor. 349-354.<\/li>\n
      74. L. Fan, P. Cao, J. Almeida ta A. Z. Broder, “Summary cache: A scalable global-area Web cache sharing protocol”, IEEE ACM Transactions on Networking, Article vol. 8, \u2116 3, stor. 281-293, cherven\u02b9 2000 r., doi: 10.1109\/90.851975.<\/li>\n
      75. K. H. Samofalov, A. M. Romlynkevych, V. N. Valuyskyy, YU. S. Kanevskyy, M. M. Pynevych, Prykladnaya teoryya tsyfrovykh avtomatov. Kyyiv: Vyshcha shk. Holovne vyd-vo, 1987.<\/li>\n
      76. YU . H. Karpov, Teoriya avtomativ. SPb.: Pyter, 2002, 206 s.<\/li>\n
      77. H. R. L\u02b9yuyis i K. KH. Papadimitriu, Elementy teoriyi obchyslen\u02b9, 2-e vyd. Prentice-Hall 1998.<\/li>\n
      78. R. M. Keller, Komp\u02bayuterni nauky: abstraktsiya do realizatsiyi. Koledzh Kharvi Madda, 2001.<\/li>\n
      79. C. H. Lin, Y. T. Tai ta S. C. Chang, \u00abOptymizatsiya alhorytmu zistavlennya shabloniv dlya arkhitektury na osnovi pam\u02bayati\u00bb, u 3-mu sympoziumi ACM\/IEEE z arkhitektury merezhevykh i komunikatsiynykh system, ANCS 2007, Orlando, Floryda, SSHA, 2007, 1323551 : ACM, stor. 11-16, doi: 10.1145\/1323548.1323551.<\/li>\n
      80. C. H. Lin i S. C. Chang, “Efektyvnyy alhorytm zistavlennya shabloniv dlya arkhitektury pam’yati”, Tranzaktsiyi IEEE u systemakh duzhe velykoyi intehratsiyi (VlSI), stattya tom. 19, \u2116 1, stor. 33-41, sichen\u02b9 2011, doi: 10.1109\/tvlsi.2009.2028346.<\/li>\n
      81. Q. B. Wang i V. K. Prasanna, \u00abBahatoyaderna arkhitektura na FPGA dlya zistavlennya velykykh slovnykovykh ryadkiv\u00bb, materialy 17-ho sympoziumu IEEE 2009 roku z prohramovanykh korystuval\u02b9nyts\u02b9kykh obchyslyuval\u02b9nykh mashyn, dopovid\u02b9, stor. 96-103, 2009, doi: 10.1109\/ FCCM.2009.43.<\/li>\n
      82. K. Huang i D. F. Zhang, “A Byte-Filtered String Matching Algorithm for Fast Deep Packet Inspection”, Proceedings of the 9th International Conference for Young Computer Scientists, Vols 1-5, Proceedings Paper pp. 2073-2078, 2008.<\/li>\n
      83. D. Pao, W. Lin i B. Liu, “Konveyerna arkhitektura dlya bahatoryadkovoyi vidpovidnosti”, IEEE Computer Architecture Letters, tom. 7, \u2116 2, stor. 33-36, 2008, doi: 10.1109\/L-CA.2008.5.<\/li>\n
      84. H. Lu, K. Zheng, B. Liu, X. Zhang, and Y. H. Liu, “A memory-efficient paralelle string matching architecture for high-speed intrusion detection”, IEEE Journal on Selected Areas in Communications, Article vol. 24, vyp. 10, stor. 1793-1804, zhovten\u02b9 2006 r., doi: 10.1109\/jsac.2006.877221.<\/li>\n
      85. “16 Hbayt pam’yati HBM v PLYS Virtex\u00ae UltraScale+\u2122 vid Xilinx (24.09.2019 15:15) \u2013 Novosty.” Makrohrupp. https:\/\/www.macrogroup.ru\/news\/2019\/16-gbayt-pamyati-hbm-v-plis-virtexr-ultrascaletm-ot-xilinx (data zvernennya 24.09.2019).<\/li>\n
      86. \u00abPosibnyk korystuvacha rishen\u02b9 interfeysu pam\u02bayati\u00bb, v UG086, 3.6 ed: Xilinx, 2010, 598 stor.<\/li>\n
      87. G. Papadopoulos and D. Pnevmatikatos, “Hashing + Memory = low cost, exact pattern matching,” in Proceedings \u2013 2005 International Conference on Field Programmable Logic and Applications, FPL, 2005, vol. 2005, stor. 39-44, doi: 10.1109\/FPL.2005.1515696.<\/li>\n
      88. I. Sourdis, D. Pnevmatikatos, S. Wong i S. Vassiliadis, “Rekonfihurovana skhema ideal\u02b9noho kheshuvannya dlya perevirky paketiv”, u materialakh \u2013 2005 Mizhnarodna konferentsiya z prohramovanoyi lohiky ta dodatkiv, FPL, 2005, tom. 2005, stor. 644-647, doi: 10.1109\/FPL.2005.1515804.<\/li>\n
      89. Z. K. Beyker i V. K. Prasanna, \u00abMetodolohiya dlya syntezu efektyvnykh system vyyavlennya vtorhnen\u02b9 na PLIS\u00bb, 12-y shchorichnyy sympozium IEEE z korystuval\u02b9nyts\u02b9kykh obchyslyuval\u02b9nykh mashyn, shcho prohramuyut\u02b9sya v pol\u02b9ovykh umovakh, materialy, materialy dopovidey, stor. 135-144, 2004, doi: 10.1109\/ FCCM.2004.6.<\/li>\n
      90. Y. H. Cho ta W. H. Mangione-Smith, “Fast reconfiguring deep packet filter for 1+gigabit network,” FCCM 2005: 13th Annual Ieee Symposium on Field-Programmable Custom Computing Machines, Proceedings, Proceedings Paper stor. 215-224, 2005.<\/li>\n
      91. Y. H. Cho ta W. H. Mangione-Smith, “Deep network packet filter design for reconfigurable devices”, Acm Transactions on Embedded Computing Systems, stattya; Proceedings Paper vol. 7, \u2116 2, stor. 26, 2008, st. 21, doi: 10.1145\/1331331.1331345.<\/li>\n
      92. V. Opanasenko, S. Kryvyy, S. Zav\u02b9yalov, \u00abFormalizatsiya protsesu proektuvannya problemno-oriyentovanykh prystroyiv na bazi FPGA,\u00bb International Journal \u00abInformation Technologies & Knowledge, vol. 13, no. 1, pp. 3-16.<\/li>\n
      93. A. V. Palahyn, V. N. Opanasenko, \u00abProektyrovanye rekonfyhuryruemykh system na PLYS\u00bb, Tekhnolohiya i konstruyuvannya v elektronnomu aparaturi, \u2116 3, cc. 15-19, 2007.<\/li>\n
      94. S. Hil\u02b9hurt Metody pobudovy optymal\u02b9nykh skhem rozpiznavannya dlya rekonfihuratsiynykh zasobiv informatsiynoyi bezpeky \/\/ Bezpeka informatsiyi. 25, \u2116 2, cc. 74-81, 2019, doi: 10.18372\/2225-5036.25. 13824.<\/li>\n
      95. O. Erdem, H. Le ta V. K. Prasanna, \u00abKlasteryzovana iyerarkhichna struktura poshuku dlya klasyfikatsiyi velykomasshtabnykh paketiv na FPGA\u00bb, u materialakh \u2013 21-sha Mizhnarodna konferentsiya z prohramovanoyi lohiky ta dodatkiv, FPL 2011, 2011, stor. 201. -206, doi: 10.1109\/FPL.2011.44.<\/li>\n
      96. M. J. Ye, K. Xu, J. P. Wu ta Y. Cui, “Vysokoproduktyvna ta masshtabovana arkhitektura zistavlennya shabloniv paketiv”, 2008 Mizhnarodna konferentsiya z informatsiynykh merezh, dopovid\u02b9, stor. 425-429, 2008.<\/li>\n
      97. S. H. Zhang, Z. Qin, Y. Zhao ta X. L. Peng, “A Cascade Hash Design of Bloom Filter for Signature Detection”, 2009 International Forum on Information Technology and Applications, Vol 2, Proceedings, Proceedings Paper stor. 559- +, 2009, doi: 10.1109\/ifita.2009.129.<\/li>\n
      98. M. Peynter i T. Kochak, “Povnistyu konveyerna arkhitektura fil\u02b9tra Bluma”, lysty IEEE Communications, stattya tom. 12, \u2116 11, stor. 855-857, lystopad 2008 r., doi: 10.1109\/lcomm.2008.081176.<\/li>\n
      99. M. Arun, A. Krishnan i S. Periasami, \u00abRozrobka ta realizatsiya systemy zistavlennya ryadkiv dlya vyyavlennya vtorhnen\u02b9 u merezhu z vykorystannyam fil\u02b9triv Bluma maloyi potuzhnosti z kil\u02b9koma kheshuvannyamy na osnovi FPGA\u00bb, Mizhnarodnyy zhurnal komp\u02bayuternykh nauk ta zastosuvan\u02b9, tom . 1, \u2116 3, stor. 186-189, 2008.<\/li>\n
      100. S. Dkharmapurikar i Dzh. V. Lokvud, \u00abShvydke ta masshtabovane zistavlennya shabloniv dlya system vyyavlennya merezhevykh vtorhnen\u02b9\u00bb, Ieee Journal on Selected Areas in Communications, stattya tom. 24, vyp. 10, stor. 1781-1792, zhovten\u02b9 2006 r., doi: 10.1109\/jsac.2006.877131.<\/li>\n
      101. V. Dimopoulos, I. Papaefstathiou, and D. Pnevmatikatos, “A memory-efficient reconfigurable Aho-Corasick FSM implementation for intrusion detection implement,” Ic-Samos: 2007 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation, Dopovidi, dopovid\u02b9, stor. 186-193, 2007.<\/li>\n
      102. Y. H. Cho ta W. H. Mangione-Smith, “A pattern matching co-processor for network security,” in 42nd Design Automation Conference, Anaheim, CA, Jun 13-17 2005, LOS ALAMITOS: Ieee Computer Soc, in Design Automation Conference DAC , 2005, S. 234-239.<\/li>\n
      103. M. Alicherri, M. Mutuprasanna ta V. Kumar, “Vysokoshvydkisne zistavlennya shabloniv dlya merezhi IDS\/IPS”, Materialy Mizhnarodnoyi konferentsiyi IEEE 2006 z merezhevykh protokoliv, Dopovid\u02b9, stor. 187-196, 2006.<\/li>\n
      104. C. L. Hayes i Y. Luo, “DPICO: vysokoshvydkisnyy mekhanizm hlybokoyi perevirky paketiv iz vykorystannyam kompaktnykh kintsevykh avtomativ”, u 3-mu sympoziumi ACM\/IEEE z arkhitektur merezhevykh i komunikatsiynykh system, ANCS 2007, Orlando, Floryda, 2007, stor. 195-203, doi: 10.1145\/1323548.1323579.<\/li>\n
      105. \u00a0P. Piyachon i Y. Luo, “Dyzayn vysokoproduktyvnoho mekhanizmu uz\u00b7hodzhennya shabloniv cherez kompaktni determinovani skinchenni avtomaty”, na 45-y konferentsiyi ACM\/IEEE Design Automation, Anakhaym, Kaliforniya, 08-13 chervnya 2008 r., N\u02b9YU-YORK: IEEE, v Konferentsiya z avtomatyzatsiyi proektuvannya, 2008, stor. 852-857.<\/li>\n
      106. K. Huang, D. F. Zhang i Z. Qin, “Pryskorennya alhorytmu uz\u00b7hodzhennya ryadka z rozdilennyam bitiv za dopomohoyu fil\u02b9triv Bluma”, Computer Communications, Article vol. 33, vyp. 15, stor. 1785-1794, veresen\u02b9 2010 r., doi: 10.1016\/j.comcom. 2010.04.043.<\/li>\n
      107. S. Ya. Hilhurt Orhanizatsiya vychyslyuval\u02b9noho protsesu syntezu fayliv konfihuratsiy dlya aparatnykh uskoryteliv pry vyrishenni zadach informatsiynoyi bezpeky \/\/ Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 74, cc. 29-33, 2015.<\/li>\n
      108. A. Mitra, W. Najjar i L. Bhuyan, “Compiling PCRE to FPGA for accelerating SNORT IDS,” in 3rd ACM\/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2007, Orlando, FL, 2007, pp 127-135, doi: 10.1145\/1323548.1323571.<\/li>\n
      109. V. F. Yevdokymov, A. N. Davydenko, S. Ya. Hil\u02b9hurt Dodatkovi etapy protsedury operatyvnoyi rekonfyhuratsyy apparatnykh uskoryteley zadach ynformatsyonnoy bezopasnosty \/\/ Modelyuvannya ta informatsiyni tekhnolohiyi. Zb. nauk. pr. IPME im. H.YE. Pukhova NAN Ukrayiny, \u2116 85, cc. 3-11, 2018.<\/li>\n
      110. V. F. Yevdokymov, A. M. Davydenko, S. Ya. Hil\u02b9hurt, “Stvorennya na bazi hrid-saytu IPME im. H.YE. Pukhova NANU systemy tsentralizovanoho syntezu aparatnykh pryskoryuvachiv dlya vyrishennya zavdan\u02b9 informatsiynoyi bezpeky v enerhetychniy haluzi,” Modelyuvannya ta informatsiyni tekhnolohiyi, \u2116 79, cc. 3-8, 2017.<\/li>\n
      111. A. A. Sal\u02b9nykov, V. V. Vyshnevs\u02b9kyy, A. F. Boretskyy, \u00abPlatforma yak servis\u00bb v hridi dlya interaktyvnoho analizu medychnykh danykh,\u00bb Matematychni mashyny i systemy, \u2116 1, cc. 53-64, 2015.<\/li>\n
      112. A. V. Akho, S. L. Monika, S. Ravy, D. U. Dzheffri Kompilyatory: pryntsypy, tekhnolohiyi ta instrumentariy, 2-e yzd. Moskva: Y.D. Vil\u02b9yams, 2008, 1176 s, hl. 11.<\/li>\n
      113. P. Bule, A. Darte, H. Zil\u02b9ber, F. Viv\u02bayen. \u00abAlhorytmy rozparalelyuvannya tsyklu: vid vyyavlennya paralelizmu do heneratsiyi kodu\u00bb, Zvit pro doslidzhennya \u2116 97-17, Frantsiya: cherven\u02b9 1997 r.<\/li>\n
      114. Yu. Horunova, A. Chemerys, “Metod rasparallelyvanyya tsykliv na osnovi afinnykh peretvoren\u02b9”, Tez. dop. Mizhnar. nauk.-tekhn. konf. \u00abModelyuvannya-2010\u00bb, 2010: K.: Instytut problem modelyuvannya v enerhetytsi im. H.YE. Pukhova NAN Ukrayiny, ss. 287-293.<\/li>\n
      115. V. Kelli, V. P\u02bayu, E. Rosser, T. Shpeysman, \u00abTranzytyvne zamykannya neskinchennykh hrafiv ta yoho zastosuvannya\u00bb, tekhnichnyy zvit CS-TR-3457, Instytut peredovykh komp\u02bayuternykh doslidzhen\u02b9 Universytetu Merilenda~Kafedra. informatyky, un-t. shtat Merilend, kviten\u02b9 1994 r.<\/li>\n
      116. A. Bruk, D. Kendryk, A. Meeraus, R. Roman Rukovodstvo po GAMS (russkaya versyya), Tsentral\u02b9noazyat\u00b7skaya myssyya Ahent\u00b7stva SSHA po mezhdunarodnomu razvytyyu, 1999, 1<\/li>\n<\/ol>\n

         <\/p>\n

         <\/p>\n","protected":false},"excerpt":{"rendered":"

        Authors:\u00a0Hilgurt S.Ya., Chemerys O.A. Year: 2022 Pages: 297 ISBN: 978-966-360-458-9 Publication Language: Ukrainian Publisher: PH \u201cAkademperiodyka\u201d Place Published: Kyiv Affiliation: National Academy of Sciences of Ukraine, G.E. Pukhov Institute for Modelling in Energy Engineering. doi:\u00a0 https:\/\/doi.org\/10.15407\/akademperiodyka.458.297 The book is devoted to the research and development of methods for combining computational structures for reconfigurable signature-based information […]<\/p>\n","protected":false},"author":1,"featured_media":2787,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4,21],"tags":[],"class_list":["post-2788","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-books","category-scientific_monographs"],"_links":{"self":[{"href":"https:\/\/akademperiodyka.org.ua\/en\/wp-json\/wp\/v2\/posts\/2788","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/akademperiodyka.org.ua\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/akademperiodyka.org.ua\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/akademperiodyka.org.ua\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/akademperiodyka.org.ua\/en\/wp-json\/wp\/v2\/comments?post=2788"}],"version-history":[{"count":6,"href":"https:\/\/akademperiodyka.org.ua\/en\/wp-json\/wp\/v2\/posts\/2788\/revisions"}],"predecessor-version":[{"id":2817,"href":"https:\/\/akademperiodyka.org.ua\/en\/wp-json\/wp\/v2\/posts\/2788\/revisions\/2817"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/akademperiodyka.org.ua\/en\/wp-json\/wp\/v2\/media\/2787"}],"wp:attachment":[{"href":"https:\/\/akademperiodyka.org.ua\/en\/wp-json\/wp\/v2\/media?parent=2788"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/akademperiodyka.org.ua\/en\/wp-json\/wp\/v2\/categories?post=2788"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/akademperiodyka.org.ua\/en\/wp-json\/wp\/v2\/tags?post=2788"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}