10 research outputs found
THE HARDWARE PERFORMANCE OF AUTHENTICATED ENCRYPTION MODES
Abstract Authenticated encryption has long been a vital operation in cryptography by its ability to provide confidentiality, integrity and authenticity at the same time. Its use has progressed in parallel with the worldwide use of Internet Protocol (IP), which has led to development of several new schemes as well as improved versions of existing ones. There have already been studies investigating software performance of various schemes. However, performance of authenticated encryption schemes on hardware has been left as an open question. We study the comprehensive evaluation of hardware performance of the most commonly used authenticated encryption modes CCM, GCM, OCB3 and EAX. These modes are block cipher based with additional authentication data (AAD). In order to make our evaluation fair, we have implemented each scheme with AES block cipher algorithm. In our evaluation, we targeted ASIC platforms and used 45 nm generic NANGATE Open Cell Library for syntheses. In each design, we have targeted minimizing the time-area product while maximizing the throughput. In the results, area, speed, time-area product, throughput, and power figures are presented for each scheme. Finally, we provide an unbiased discussion on the impact of the structure and complexity of each scheme on hardware implementation, together with recommendations on hardware-friendly authenticated encryption scheme design
Reviving the Idea of Incremental Cryptography for the Zettabyte era Use case: Incremental Hash Functions Based on SHA-3
One of the crucial factors for enabling fast and secure computations in the Zettabyte era is the use of incremental cryptographic primitives. For files ranging from several megabytes up to hundreds of gigabytes, incremental cryptographic primitives offer speedup factors measured in multiple orders of magnitude. In this paper we define two incremental hash functions iSHAKE128 and iSHAKE256 based on the recent NIST proposal for SHA-3 Extendable-Output Functions SHAKE128 and SHAKE256. We give two practical implementation aspects of a newly introduced hash functions and compare them with already known tree based hash scheme. We show the trends of efficiency gains as the amount of data increases in comparisons between our proposed hash functions and the standard tree based incremental schemes. Our proposals have the security levels against collision attacks of 128 and 256 bits
A 16-bit Reconfigurable encryption processor for Pi-Cipher
This paper presents an improved hardware implementation of a 16-bit ARX (Add, Rotate, and Xor) engine for one of the CAESAR second-round competition candidates, Pi-Cipher, implemented on an FPGA. Pi-Cipher is a nonce-based authenticated encryption cipher with associated data. The security of the Pi-Cipher relies on an ARX based permutation function, which is denoted as a Pi-function. The proposed ARX engine has been implemented in just 266 slices, which includes the buffers of the input and the output. It can be clocked at 347 MHz. Also, in this paper, a message processor based on the proposed ARX engine is introduced. The message processor has been implemented in 1114 slices and it can be clocked at 250 MHz. The functionality of the proposed ARX engine was verified on the Xilinx Virtex-7. The new design of the ARX engine allows for almost four times speedup in performance while consuming only 17% larger area than previously published work. We extend our message processor implementation by using parametrized reconfiguration technique after which an area reduction of 27 slices is observed
Application of Quasigroups in Cryptography and Data Communications
In the past decade, quasigroup theory has proven to be a fruitfull field for production of new cryptographic primitives and error-corecting codes. Examples include several finalists in the flagship competitions for new symmetric ciphers, as well as several assimetric proposals and cryptcodes. Since the importance of cryptography and coding theory for secure and reliable data communication can only grow within our modern society, investigating further the power of quasigroups in these fields is highly promising research direction.
Our team of researchers has defined several research objectives, which can be devided into four main groups:
1. Design of new cryptosystems or their building blocks based on quasigroups - we plan to make a classification of small quasigroups based on new criteria, as well as to identify new optimal 8βbit S-boxes produced by small quasigroups. The results will be used to design new stream and block ciphers.
2. Cryptanalysis of some cryptosystems based on quasigroups - we will modify and improve the existing automated tools for differential cryptanalysis, so that they can be used for prove the resistance to differential cryptanalysis of several existing ciphers based on quasigroups. This will increase the confidence in these ciphers.
3. Codes based on quasigroups - we will designs new and improve the existing error correcting codes based on combinatorial structures and quasigroups.
4. Algebraic curves over finite fields with their cryptographic applications - using some known and new tools, we will investigate the rational points on algebraic curves over finite fields, and explore the possibilities of applying the results in cryptography
A Survey on Authenticated Encryption -- ASIC Designer\u27s Perspective
Authenticated encryption (AE) has been a vital operation in cryptography due to its ability to provide confidentiality, integrity, and authenticity at the same time. Its use has soared in parallel with widespread use of the Internet and has led to several new schemes. There have been studies investigating software performance of various schemes. However, the same is yet to be done for hardware. We present a comprehensive survey of hardware (specifically ASIC) performance of the most commonly used AE schemes in the literature. These schemes include encrypt-then-MAC combination, block cipher based AE modes, and the recently-introduced permutation-based AE scheme. For completeness, we implemented each scheme with various standardized block ciphers and/or hash algorithms, and their lightweight versions. Our evaluation targets minimizing the time-area product while maximizing the throughput on an ASIC platform. We used 45nm NANGATE Open Cell Library for syntheses. We present area, speed, time-area product, throughput, and power figures for both standard and lightweight versions of each scheme. We also provide an unbiased discussion on the impact of the structure and complexity of each scheme on hardware implementation. Our results reveal 13-30% performance boost in permutation-based AE compared to conventional schemes and they can be used as a benchmark in the ongoing AE competition CAESAR
ΠΠ»Π³ΠΎΡΠΈΡΠΌΠΈ Π·Π° ΠΏΠΎΠ΄ΠΎΠ±ΡΡΠ²Π°ΡΠ΅ Π½Π° ΠΏΠΎΠ΄Π°ΡΠΎΡΠ½Π° ΠΊΠΎΠΌΡΠ½ΠΈΠΊΠ°ΡΠΈΡΠ° ΠΈ ΠΊΡΠΈΠΏΡΠΎΠ°Π½Π°Π»ΠΈΠ·Π° (AiDCC)
ΠΠ΄Π½Π° ΠΎΠ΄ ΡΠ΅Π»ΠΈΡΠ΅ Π½Π° ΠΎΠ²ΠΎΡ ΠΏΡΠΎΠ΅ΠΊΡ Π΅ Π΄Π΅ΡΠΈΠ½ΠΈΡΠ°ΡΠ΅ Π½Π° Π½ΠΎΠ²ΠΈ Π±ΡΠ·ΠΈ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΈ Π½Π° ΠΊΡΠΈΠΏΡΠΎΠΊΠΎΠ΄ΠΎΠ²ΠΈΡΠ΅ Π±Π°Π·ΠΈΡΠ°Π½ΠΈ Π½Π° ΠΊΠ²Π°Π·ΠΈΠ³ΡΡΠΏΠΈ Π·Π° ΠΏΡΠ΅Π½ΠΎΡ Π½Π° ΠΏΠΎΡΠ°ΠΊΠΈ ΠΈ ΡΠ»ΠΈΠΊΠΈ Π½ΠΈΠ· ΠΊΠ°Π½Π°Π» ΡΠΎ ΡΠ°ΡΠ°Π»Π½ΠΈ Π³ΡΠ΅ΡΠΊΠΈ ΠΈ ΠΈΡΠΏΠΈΡΡΠ²Π°ΡΠ΅ Π½Π° Π½ΠΈΠ²Π½ΠΈΡΠ΅ ΠΏΠ΅ΡΡΠΎΡΠΌΠ°Π½ΡΠΈ. ΠΠ΅ ΡΠ΅ Π½Π°ΠΏΡΠ°Π²ΠΈ ΠΎΠ±ΠΈΠ΄ Π΄Π° ΡΠ΅ ΠΏΠΎΠ΄ΠΎΠ±ΡΠ°Ρ Π΄Π΅Π» ΠΎΠ΄ ΠΏΠ΅ΡΡΠΎΡΠΌΠ°Π½ΡΠΈΡΠ΅ Π½Π° Π΅Π΄Π΅Π½ Π°Π»Π³ΠΎΡΠΈΡΠ°ΠΌ Π·Π° Π΄Π΅ΡΠ΅ΠΊΡΠΈΡΠ° Π½Π° Π³ΡΠ΅ΡΠΊΠΈ ΠΏΡΠΈ ΠΏΡΠ΅Π½ΠΎΡ Π½Π° ΠΏΠΎΠ΄Π°ΡΠΎΡΠΈ.
ΠΡΡΠΎ ΡΠ°ΠΊΠ°, ΡΠ΅ ΡΠ΅ ΡΠ°Π·Π³Π»Π΅Π΄Π° ΠΌΠΎΠΆΠ½ΠΎΡΡΠ° Π·Π° ΠΏΡΠΈΠΌΠ΅Π½Π° Π½Π° ΠΌΠ°ΡΠΈΠ½ΡΠΊΠΎ ΡΡΠ΅ΡΠ΅ Π²ΠΎ ΠΊΡΠΈΠΏΡΠΎΠ°Π½Π°Π»ΠΈΠ·Π°, ΠΏΠΎΡΠΎΡΠ½ΠΎ Π²ΠΎ ΠΊΡΠΈΠΏΡΠΎΠ½Π°Π½Π°Π»ΠΈΠ·Π° Π½Π° DES ΠΈ AES Π°Π»Π³ΠΎΡΠΈΡΠΌΠΈΡΠ΅. Π¦Π΅Π»ΡΠ° Π½Π° ΠΎΠ²Π° ΠΈΡΡΡΠ°ΠΆΡΠ²Π°ΡΠ΅ Π΅ Π΄Π° ΡΠ΅ ΠΈΠ·Π²ΡΡΠΈ Π½Π°ΠΏΠ°Π΄ (ΡΠΎ ΠΏΠΎΠ·Π½Π°Ρ ΡΠΈΡΡΠΈΡΠ°Π½ ΡΠ΅ΠΊΡΡ) ΡΠΎ ΠΊΠΎΡΠΈΡΡΠ΅ΡΠ΅ Π½Π° Π°Π»Π³ΠΎΡΠΈΡΠΌΠΈΡΠ΅ ΠΎΠ΄ ΠΌΠ°ΡΠΈΠ½ΡΠΊΠΎ ΡΡΠ΅ΡΠ΅, ΠΏΠΎΡΠΎΡΠ½ΠΎ ΡΠΎ ΠΊΠΎΡΠΈΡΡΠ΅ΡΠ΅ Π½Π° Π½Π΅Π²ΡΠΎΠ½ΡΠΊΠΈ ΠΌΡΠ΅ΠΆΠΈ.
ΠΠ΅ ΡΠ΅ Π½Π°ΠΏΡΠ°Π²ΠΈ Π°Π½Π°Π»ΠΈΠ·Π° Π½Π° ΡΠΈΡΡΠ΅ΠΌΠΎΡ Π·Π° online ΠΏΠ»Π°ΡΠ°ΡΠ΅ e-cash, ΠΊΠ°ΠΊΠΎ ΠΈ Π°Π½Π°Π»ΠΈΠ·Π° Π½Π° Π±Π΅Π·Π±Π΅Π΄Π½ΠΎΡΡΠ° Π½Π° ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΈΡΠ΅ ΠΈ ΡΠΏΡΠ°Π²ΡΠ²Π°ΡΠ΅ ΡΠΎ ΡΠΈΠ·ΠΈΡΠΈΡΠ΅ Π²ΠΎ ΠΠ’ ΠΊΠΎΠΌΠΏΠ°Π½ΠΈΠΈΡΠ΅. ΠΠ΅ Π±ΠΈΠ΄Π°Ρ Π°Π½Π°Π»ΠΈΠ·ΠΈΡΠ°Π½ΠΈ ΠΈ ΠΌΡΠ΅ΠΆΠ½ΠΈ ΠΏΡΠΎΡΠΎΠΊΠΎΠ»ΠΈ ΠΈ ΠΊΠΎΠ½ΡΠ΅ΡΠ½Π΅ΡΠΈ Π½Π° ΠΌΠ΅Π΄ΠΈΡΠΈΠ½ΡΠΊΠΈ ΡΠ»ΠΈΠΊΠΈ Π·Π° ΠΎΡΠΊΡΠΈΠ²Π°ΡΠ΅ Π½Π° Π½ΠΎΠ²ΠΈ ΡΠΊΡΠΈΠ΅Π½ΠΈ ΠΊΠ°Π½Π°Π»ΠΈ ΠΈ Π·Π°ΡΡΠΈΡΠ° ΠΎΠ΄ Π½ΠΈΠ².
ΠΠ΅ ΡΠ΅ Π½Π°ΠΏΡΠ°Π²Π°Ρ ΡΠΏΠΎΡΠ΅Π΄Π±Π΅Π½ΠΈ Π°Π½Π°Π»ΠΈΠ·ΠΈ Π½Π° ΡΠΈΠ³ΡΡΠ½ΠΎΡΡΠ° ΠΈ ΠΏΠ΅ΡΡΠΎΡΠΌΠ°Π½ΡΠΈΡΠ΅ Π½Π° ΠΊΠ°Π½Π΄ΠΈΠ΄Π°ΡΠΈΡΠ΅ ΠΎΠ΄ ΠΏΠΎΡΠ»Π΅Π΄Π½Π°ΡΠ° ΡΡΠ½Π΄Π° ΠΎΠ΄ ΠΏΡΠΎΡΠ΅ΡΠΎΡ Π·Π° ΡΡΠ°Π½Π΄Π°ΡΠ΄ΠΈΠ·Π°ΡΠΈΡΠ° Π½Π° Π»Π΅ΡΠ½Π° (lightweight) ΠΊΡΠΈΠΏΡΠΎΠ³ΡΠ°ΡΠΈΡΠ°. ΠΡΠΈΡΠΎΠ° ΠΏΠΎΡΠ΅Π±Π΅Π½ ΠΎΡΠ²ΡΡ ΡΠ΅ ΡΠ΅ Π΄Π°Π΄Π΅ Π½Π° ΠΌΠΎΠ΄ΠΎΠ²ΠΈΡΠ΅ Π·Π° Π°Π²ΡΠ΅Π½ΡΠΈΠΊΠ°ΡΠΈΡΠΊΠ° Π΅Π½ΠΊΡΠΈΠΏΡΠΈΡΠ°
Applications of Quasigroups in Cryptography and Coding Theory
This survey article discusses some applications of quasigroups in cryptography and coding theory. Here mainly results obtained by the authors of this article are considered and obtained in the last quarter of the century. Not all of their results are presented; emphasis is given to those that were interested for the wider community. Security of the modern world is dependent on the many cryptographic products like block ciphers, stream ciphers, digital signatures and encryption schemes, hash functions, pseudo-random number generators, ... These products are mainly produced by using associative structures (number theory, group and finite field theory, Boolean algebras, etc.) The development of quantum computers questioned security based on associative structures. So, nowadays, the use of quasigroups for building cryptographic products is becoming more important. This short survey presents how quasigroups can be exploited for building suitable cryptographic primitives. For that aim, we define some types of quasigroups that are suitable for that purpose, we give the definitions of several kinds of quasigroup transformations, and we explain the constructions of some types of cryptographic primitives obtained by quasigroup transformations. (We notice that cryptographic properties are not discussed in this survey. The efficiency and security of the crypto products based on quasigroups is an open research problem for cryptographers and cryptanalysts.) The quasigroups are also suitable algebraic structures for building error detecting and error correcting code. We give one type of error detecting code based on quasigroups. Error correcting codes resistant to an intruder attack, so called RCBQ (Random Codes Based on Quasigroups) are given in details, as well as some of their applications in processing images and audio signals
ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° Π½ΠΎΠ²ΠΈ ΠΌΠ΅ΡΠΎΠ΄ΠΈ Π·Π° ΠΏΠΎΠ΄ΠΎΠ±ΡΡΠ²Π°ΡΠ΅ Π½Π° Π±Π΅Π·Π±Π΅Π΄Π½ΠΎΡΡΠ° Π²ΠΎ ΠΏΠΎΠ΄Π°ΡΠΎΡΠ½Π°ΡΠ° ΠΊΠΎΠΌΡΠ½ΠΈΠΊΠ°ΡΠΈΡΠ°
- ΠΡΠΏΠΈΡΡΠ²Π°ΡΠ΅ Π½Π° ΠΏΠ΅ΡΡΠΎΡΠΌΠ°Π½ΡΠΈΡΠ΅ Π½Π° ΠΊΡΠΈΠΏΡΠΎ-ΠΊΠΎΠ΄ΠΎΠ²ΠΈΡΠ΅ Π±Π°Π·ΠΈΡΠ°Π½ΠΈ Π½Π° ΠΊΠ²Π°Π·ΠΈΠ³ΡΡΠΏΠΈ Π·Π° ΠΊΠΎΡΠ΅ΠΊΡΠΈΡΠ° Π½Π° burst Π³ΡΠ΅ΡΠΊΠΈ.
- ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° ΠΌΡΠ΅ΠΆΠ½ΠΈ ΠΏΡΠΎΡΠΎΠΊΠΎΠ»ΠΈ ΠΊΠΎΠΈ ΡΠ΅ ΠΊΠΎΡΠΈΡΡΠ°Ρ Π²ΠΎ IoT Π·Π° ΠΎΡΠΊΡΠΈΠ²Π°ΡΠ΅ Π½Π° Π½ΠΎΠ²ΠΈ ΡΠΊΡΠΈΠ΅Π½ΠΈ ΠΊΠ°Π½Π°Π»ΠΈ ΠΈ Π·Π°ΡΡΠΈΡΠ° ΠΎΠ΄ Π½ΠΈΠ².
- ΠΡΠ΅ΠΊΡ ΡΠΎΠΎΠ΄Π²Π΅ΡΠ½ΠΈ ΠΈΠ·ΠΌΠ΅Π½ΠΈ, ΡΠ΅ Π±ΠΈΠ΄Π΅ Π½Π°ΠΏΡΠ°Π²Π΅Π½ ΠΎΠ±ΠΈΠ΄ Π΄Π° ΡΠ΅ Π½Π°ΠΌΠ°Π»ΠΈ Π²Π΅ΡΠΎΡΠ°ΡΠ½ΠΎΡΡΠ° Π½Π° Π½Π΅ΠΎΡΠΊΡΠΈΠ΅Π½ΠΈ Π³ΡΠ΅ΡΠΊΠΈ Π½Π° Π΅Π΄Π΅Π½ ΠΊΠΎΠ΄ Π·Π° ΠΎΡΠΊΡΠΈΠ²Π°ΡΠ΅ Π½Π° Π³ΡΠ΅ΡΠΊΠΈ.
- ΠΡΠΏΠΈΡΡΠ²Π°ΡΠ΅ Π½Π° ΠΏΠ΅ΡΡΠΎΡΠΌΠ°Π½ΡΠΈΡΠ΅ Π½Π° ΠΊΡΠΈΠΏΡΠΎ ΠΊΠΎΠ΄ΠΎΠ²ΠΈΡΠ΅ Π±Π°Π·ΠΈΡΠ°Π½ΠΈ Π½Π° ΠΊΠ²Π°Π·ΠΈΠ³ΡΡΠΏΠΈ Π·Π° ΠΏΡΠ΅Π½ΠΎΡ Π½Π° ΡΠ»ΠΈΠΊΠΈ Π½ΠΈΠ· Gilbert-Elliot burst ΠΊΠ°Π½Π°Π»ΠΎΡ.
- ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° ΠΌΠΎΠΆΠ½ΠΎΡΡΠΈΡΠ΅ Π·Π° ΠΏΡΠΈΠΌΠ΅Π½Π° Π½Π° ΠΊΠ²Π°Π·ΠΈΠ³ΡΡΠΏΠ½ΠΈ ΡΡΠ°Π½ΡΡΠΎΡΠΌΠ°ΡΠΈΠΈ Π·Π° ΠΊΠΎΠ΄ΠΈΡΠ°ΡΠ΅ Π²ΠΎ peer to peer ΠΌΡΠ΅ΠΆΠΈ.
- ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° Π±Π΅Π·Π±Π΅Π΄Π½ΠΎΡΡΠ° ΠΏΡΠΈ ΡΠΏΡΠ°Π²ΡΠ²Π°ΡΠ΅ ΡΠΎ ΡΠΈΠ·ΠΈΡΠΈ.
- ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° ΠΏΡΠΈΠΌΠ΅ΡΠΈ Π½Π° Π±Π΅Π·Π±Π΅Π΄Π½ΠΎΡΠ½Π° Π΅Π²Π°Π»ΡΠ°ΡΠΈΡΠ° Π½Π° Π½Π΅ΠΊΠΎΠΈ Π΅Π½ΠΊΡΠΈΠΏΡΠΈΡΠΊΠΈ ΡΠ΅ΠΌΠΈ.
- ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° ΠΌΠΎΠΆΠ½ΠΎΡΡΠΈΡΠ΅ Π·Π° ΠΏΠΎΠ΄ΠΎΠ±ΡΡΠ²Π°ΡΠ΅ Π½Π° Blockchain ΡΠ΅Ρ
Π½ΠΎΠ»ΠΎΠ³ΠΈΡΠ°ΡΠ°.
- OΠΏΡΠ΅Π΄Π΅Π»ΡΠ²Π°ΡΠ΅ Π½Π° Π½Π΅ΠΊΠΎΠΈ ΡΠ΅ΡΡΡΠ΅ Π½Π΅ΠΈΡΠΏΠΈΡΠ°Π½ΠΈ ΠΎΡΠΎΠ±ΠΈΠ½ΠΈ Π½Π° eΠ΄Π΅Π½ ΠΊΠΎΠ΄ Π·Π° Π΄Π΅ΡΠ΅ΠΊΡΠΈΡΠ° Π½Π° Π³ΡΠ΅ΡΠΊΠΈ
ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° ΡΠ΅Ρ Π½ΠΈΠΊΠΈ Π·Π° ΡΠΎΡΠ½Π° ΠΈ Π±Π΅Π·Π±Π΅Π΄Π½Π° ΠΊΠΎΠΌΡΠ½ΠΈΠΊΠ°ΡΠΈΡΠ° (ATCSC)
ΠΠ΄Π½Π° ΠΎΠ΄ ΡΠ΅Π»ΠΈΡΠ΅ Π½Π° ΠΎΠ²ΠΎΡ ΠΏΡΠΎΠ΅ΠΊΡ ΡΠ΅ Π±ΠΈΠ΄Π΅ ΠΈΡΠΏΠΈΡΡΠ²Π°ΡΠ΅ Π½Π° ΠΏΠ΅ΡΡΠΎΡΠΌΠ°Π½ΡΠΈΡΠ΅ Π½Π° ΠΡΠ·ΠΈΡΠ΅ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΈ Π·Π° ΠΊΡΠΈΠΏΡΠΎ ΠΊΠΎΠ΄ΠΎΠ²ΠΈΡΠ΅ Π±Π°Π·ΠΈΡΠ°Π½ΠΈ Π½Π° ΠΊΠ²Π°Π·ΠΈΠ³ΡΡΠΏΠΈ, Π·Π° ΠΏΡΠ΅Π½ΠΎΡ Π½Π° ΡΠ»ΠΈΠΊΠΈ Π½ΠΈΠ· ΠΠ°ΡΡΠΎΠ² ΠΊΠ°Π½Π°Π» ΠΈ ΠΊΠ°Π½Π°Π» ΡΠΎ ΡΠ°ΡΠ°Π»Π½ΠΈ Π³ΡΠ΅ΡΠΊΠΈ.
ΠΠ΅ Π±ΠΈΠ΄Π°Ρ Π°Π½Π°Π»ΠΈΠ·ΠΈΡΠ°Π½ΠΈ Π½Π΅ΠΊΠΎΠΈ ΡΠ΅Ρ
Π½ΠΈΠΊΠΈ Π·Π° Π΄Π΅ΡΠ΅ΠΊΡΠΈΡΠ° Π½Π° Π³ΡΠ΅ΡΠΊΠΈ ΠΏΡΠΈ ΠΏΡΠ΅Π½ΠΎΡ Π½Π° ΠΏΠΎΠ΄Π°ΡΠΎΡΠΈ.
ΠΡΡΠ³Π° ΡΠ΅Π» Π½Π° ΠΏΡΠΎΠ΅ΠΊΡΠΎΡ Π΅ ΠΎΡΠΊΡΠΈΠ²Π°ΡΠ΅ Π½Π° Π½ΠΎΠ²ΠΈ ΡΠΊΡΠΈΠ΅Π½ΠΈ ΠΊΠ°Π½Π°Π»ΠΈ ΠΊΠ°Ρ DICOM ΡΡΠ°Π½Π΄Π°ΡΠ΄ΠΎΡ ΠΊΠΎΡ ΡΠ΅ ΠΊΠΎΡΠΈΡΡΠΈ Π·Π° ΠΏΡΠΎΡΠ΅ΡΠΈΡΠ°ΡΠ΅, ΠΏΡΠ΅Π½Π΅ΡΡΠ²Π°ΡΠ΅, ΡΠΊΠ»Π°Π΄ΠΈΡΠ°ΡΠ΅ ΠΈ ΠΏΡΠΈΠΊΠ°ΠΆΡΠ²Π°ΡΠ΅ Π½Π° ΠΏΠΎΠ΄Π°ΡΠΎΡΠΈ Π·Π° ΠΌΠ΅Π΄ΠΈΡΠΈΠ½ΡΠΊΠΈ ΡΠ»ΠΈΠΊΠΈ (ΠΎΡΠΊΡΠΈΠ²Π°ΡΠ΅ Π½Π° ΡΠΊΡΠΈΠ΅Π½ΠΈ ΠΊΠ°Π½Π°Π»ΠΈ ΠΊΠΎΠΈ ΡΠ΅ ΠΎΠ΄Π½Π΅ΡΡΠ²Π°Π°Ρ Π½Π° βDICOM Message Serviceβ ΠΈ βUpper Layer Serviceβ, Π΅ΠΊΡΠΏΠ΅ΡΠΈΠΌΠ΅Π½ΡΠ°Π»Π½Π° Π΅Π²Π°Π»ΡΠ°ΡΠΈΡΠ° Π½Π° Π½Π΅ΠΊΠΎΡ ΠΎΠ΄ ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ΠΈΡΠ΅ ΡΠΊΡΠΈΠ΅Π½ΠΈ ΠΊΠ°Π½Π°Π»ΠΈ, Π΄Π΅ΡΠ΅ΠΊΡΠΈΡΠ° Π±Π°Π·ΠΈΡΠ°Π½Π° Π½Π° Π΅Π½ΡΡΠΎΠΏΠΈΡΠ°, ΡΡΠ²ΡΠ΄ΡΠ²Π°ΡΠ΅ Π½Π° ΡΠΈΠ·ΠΈΡΠΈΡΠ΅ ΠΎΠ΄ ΠΊΡΠΈΠ΅ΡΠ΅ Π½Π° ΠΏΠΎΠ΄Π°ΡΠΎΡΠΈ Π²ΠΎ DICOM ΡΠΎ ΠΊΠΎΡΠΈΡΡΠ΅ΡΠ΅ Π½Π° Π½ΠΎΠ²ΠΈΡΠ΅ ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ΠΈ ΠΊΠ°Π½Π°Π»ΠΈ, ΠΏΡΠ΅Π΄Π»Π°Π³Π°ΡΠ΅ Π½Π° ΠΏΡΠΎΡΠΈΠ²ΠΌΠ΅ΡΠΊΠΈ Π·Π° ΡΠΊΡΠΈΠ΅Π½ΠΈΡΠ΅ ΠΊΠ°Π½Π°Π»ΠΈ).
ΠΡΡΠΎ ΡΠ°ΠΊΠ°, ΡΠ΅ Π±ΠΈΠ΄Π°Ρ Π½Π°ΠΏΡΠ°Π²Π΅Π½Π° Π°Π½Π°Π»ΠΈΠ·Π° Π½Π° ΠΏΡΠ΅Π΄ΠΈΠ·Π²ΠΈΡΠΈΡΠ΅, Π΅ΡΠ΅ΠΊΡΠΈΠ²Π½ΠΎΡΡΠ° ΠΈ ΠΏΠΎΡΠ»Π΅Π΄ΠΈΡΠΈΡΠ΅ ΠΎΠ΄ Π½Π΅ΡΠΎΠΎΠ΄Π²Π΅ΡΠ½Π° ΡΠΏΠΎΡΡΠ΅Π±Π° Π½Π° ΠΏΠΎΠ»ΠΈΡΠΈΡΠ΅ Π·Π° ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΡΠΊΠ° Π±Π΅Π·Π±Π΅Π΄Π½ΠΎΡΡ.
ΠΠ΅ Π±ΠΈΠ΄Π΅ ΡΠ°Π·Π³Π»Π΅Π΄Π°Π½Π° ΠΌΠΎΠΆΠ½Π° ΠΈΠΌΠΏΠ»Π΅ΠΌΠ΅Π½ΡΠ°ΡΠΈΡΠ° Π½Π° HOTP ΠΈ TOTP Π°Π²ΡΠ΅Π½ΡΠΈΠΊΠ°ΡΠΈΡΠΊΠΈΡΠ΅ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΈ ΠΈ Π½ΠΈΠ²Π½ΠΈΡΠ΅ ΠΏΡΠ΅Π΄Π½ΠΎΡΡΠΈ ΠΈ Π½Π΅Π΄ΠΎΡΡΠ°ΡΠΎΡΠΈ.
ΠΠ΅ Π±ΠΈΠ΄Π°Ρ Π°Π½Π°Π»ΠΈΠ·ΠΈΡΠ°Π½ΠΈ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΈ Π·Π° ΠΊΡΠΈΠΏΡΠΎΠ°Π½Π°Π»ΠΈΠ·Π° Π²ΠΎ BlockChain ΡΠ΅Ρ
Π½ΠΎΠ»ΠΎΠ³ΠΈΡΠ°