Encryption Mode Research Articles

Enhanced luminescence encryption via Mn4+ activation with organic acid surface modification

Mn4+-activated luminescent materials exhibit high color purity red light emission, but their limited water resistance hinders practical applications. In this study, citric and oxalic acids are innovatively employed for surface modification, resulting in luminescent materials with enhanced water resistance while preserving their luminescent intensity. This enhancement provides a prerequisite for their application in anti-counterfeiting films and aqueous fluorescent inks. Furthermore, the potential for optical information storage is successfully demonstrated by utilizing the photochromic fluorescent properties of polyvinyl alcohol films deposited on oxalic acid-modified K2SiF6:Mn4+. Exploiting the 3 ms day time difference between equivalently and non-equivalently doped Mn4+ fluoride, a millisecond information encryption mode is proposed by combining oxalic acid-modified K2SiF6:Mn4+ (long decay time, τ = 8.99 ms) and K3AlF6:Mn4+ (short decay time, τ = 5.31 ms). This mode can be effectively decoded using digital cameras and editing software, achieving high-level anti-counterfeiting capabilities. This work advances the application of highly efficient Mn4+-activated red phosphors in the realm of information security.

Advanced multicolor dynamic fluorescence anti-counterfeiting and encryption strategy based on light-induced reversible perovskite lattice distortion

Time-dynamic fluorescence encryption and anti-counterfeiting technology have garnered significant attention in the high-end information security field. However, developing tunable multicolor solid-state photoluminescent systems that are low-cost, easy to manufacture, scalable, and convenient to verify remains a considerable challenge. In this study, we finely tuned the luminescence behavior of CsCdCl3 all-inorganic perovskite crystals using a halogen doping strategy, resulting in reversible lattice distortion under UV light and endowing them with photoactivated luminescence properties to produce dynamic fluorescence. Upon the introduction of Br-, the optical properties of CsCdCl3 changed significantly, with the fluorescence emission color shifting from orange to white-green under UV irradiation. By adjusting the Br- doping ratio and UV irradiation intensity, the fluorescence color change time of CsCdCl3 can be controlled. Multiple cycle light exposure tests demonstrated that the luminescence properties of CsCdCl3 remained identical to the initial state, indicating high stability in response to UV stimulation. Consequently, we successfully realized advanced anti-counterfeiting and 4D code encryption modes based on dynamic fluorescence. The introduction of a time variable imparts extremely high security to these strategies. This work provides an exciting approach for designing information encryption materials with higher security requirements and offers a promising high-sensitivity UV detection material.

Advance in Applied Cryptography Theory: Survey and New Results. Part 1. Key Cryptography

In the current paper, consisting from two parts, are presented both results already published before (but hard for access) and new once. Actuality of this work is firstly in a fact that recently has been obtained a number of new results in area of applied cryptography that are needed both in a clarification and be put into practice. This is namely the main goal of the current paper. The setting problem in the first paper part concerns to a complexity of symmetric cipher breaking while in the second part of the paper is discussed, so called, keyless cryptography, namely: wiretap channel concept, execution of communication channels which allow to provide information security without of key exchange procedure between legal correspondences. In the part widely used methods of applied mathematics, namely: algebra, number, probability and information theories. Computer simulation also used there. A novelty of the first part of work consists in the following: first of all it is clarified the sense of a key lifetime limitation for different symmetric cipher modes, secondly, it is explained an approach of cipher breaking by the use of quantum computers, finely, the key authentication for the Diffie ‒ Hellman protocol based on the mobile device pairing technology is investigated in detail. In the second part of the current paper has been presented a vulnerability of Dean ‒ Goldsmith cryptosystem under some extension of attacks. The main results of this paper are: estimation of the key lifetime of single key for symmetric cipher in CBC mode, clarifying of Grover’s algorithm breaking of symmetric ciphers by brute force attack, development of a method for authentication of Diffie ‒ Hellman values based on pre-distributed sequences, selection of ciphers which allow to execute with Shamir’s protocol without any key sharing in advance, breaking of Dean ‒ Goldsmith protocol under some conclusions, proof the fact regarding of a possible breakability of the key sharing protocol over noiseless communication channels. Practical application of paper results consists in the fact of stimulation the correct choice of ciphers and their parameters in order to provide their resistance to different attacks and more attention to algorithms of keyless cryptography.

A Long Tweak Goes a Long Way: High Multi-user Security Authenticated Encryption from Tweakable Block Ciphers

We analyze the multi-user (mu) security of a family of nonce-based authentication encryption (nAE) schemes based on a tweakable block cipher (TBC). The starting point of our work is an analysis of the mu security of the SCT-II mode which underlies the nAE scheme Deoxys-II, winner of the CAESAR competition for the defense-in-depth category. We extend this analysis in two directions, as we detail now. First, we investigate the mu security of several TBC-based variants of the counter encryption mode (including CTRT, the encryption mode used within SCT-II) that differ by the way a nonce, a random value, and a counter are combined as tweak and plaintext inputs to the TBC to produce the keystream blocks that will mask the plaintext blocks. Then, we consider the authentication part of SCT-II and study the mu security of the nonce-based MAC Nonce-as-Tweak (NaT) built from a TBC and an almost universal (AU) hash function. We also observe that the standard construction of an AU hash function from a (T)BC can be proven secure under the assumption that the underlying TBC is unpredictable rather than pseudorandom, allowing much better conjectures on the concrete AU advantage. This allows us to derive the mu security of the family of nAE modes obtained by combining these encryption/MAC building blocks through the NSIV composition method. Some of these modes require an underlying TBC with a larger tweak length than what is usually available for existing ones. We then show the practicality of our modes by instantiating them with two new TBC constructions, Deoxys-TBC-512 and Deoxys-TBC-640, which can be seen as natural extensions of the Deoxys-TBC family to larger tweak input sizes. Designing such TBCs with unusually large tweaks is prone to pitfalls: Indeed, we show that a large-tweak proposal for SKINNY published at EUROCRYPT 2020 presents an inherent construction flaw. We therefore provide a sound design strategy to construct large-tweak TBCs within the Superposition Tweakey (STK) framework, leading to new Deoxys-TBC and SKINNY variants. We provide software benchmarks indicating that while ensuring a very high security level, the performances of our proposals remain very competitive.

Multiplex: TBC-Based Authenticated Encryption with Sponge-Like Rate

Authenticated Encryption (AE) modes of operation based on Tweakable Block Ciphers (TBC) usually measure efficiency in the number of calls to the underlying primitive per message block. On the one hand, many existing solutions reach a primitive-rate of 1, meaning that each n-bit block of message asymptotically needs a single call to the TBC with output length n. On the other hand, while these modes look optimal in a blackbox setting, they become less attractive when leakage comes into play, since all these calls must then be equally well protected to maintain security. Leakage-resistant modes improve this situation, by generating ephemeral keys every constant number of calls. However, rekeying is inherently suboptimal in primitive-rate, since a TBC call can only be used either to refresh a key or to encrypt a block. Even worse, existing solutions achieving almost n bits of security for n-bit secret keys have at most a primitive-rate 2/3. Hence the question: Can we design a highly-secure TBC-based rekeying mode with “nearly optimal” primitive-rate? We answer this question positively with Multiplex, a new mode that has primitive-rate d/(d + 1) given a TBC with a dn-bit tweak. Multiplex achieves n − log2(dn) bits of security for both (i) misuse-resilience CCA confidentiality security in the blackbox setting and (ii) Ciphertext Integrity with Misuse-resistant and unbounded Leakage in encryption and decryption (CIML2). It also provides (iii) confidentiality with leakage up to the birthday bound. Furthermore, Multiplex can run d + 1 calls in parallel in each iteration. The combination of these features gives a mode of operation that inherits most of the good implementation features and flexibility of a sponge construction – therefore paving the way towards sound comparisons between TBC-based and permutation-based AE.

Development of Stable Water-Soluble Supratomic Silver Clusters Utilizing A Polyoxoniobate-Protected Strategy: Giant Core-Shell-Type Ag8@Nb162 Fluorescent Nanocluster.

Atomically precise low-nuclearity (n<10) silver nanoclusters (AgNCs) have garnered significant interest due to their size-dependent optical properties and diverse applications. However, their synthesis has remained challenging, primarily due to their inherent instability. The present study introduces a new feasible approach for clustering silver ions utilizing highly negative and redox-inert polyoxoniobates (PONbs) as all-inorganic ligands. This strategy not only enables the creation of novel Ag-PONb composite nanoclusters but also facilitates the synthesis of stable low-nuclearity AgNCs. Using this method, we have successfully synthesized a small octanuclear rhombic [Ag8]6+ AgNC stabilized by six highly negative [LiNb27O75]14- polyoxoanions. This marks the first PONb-protected superatomic AgNC, designated as {Ag8@(LiNb27O75)6} (Ag8@Nb162), with an aesthetically spherical core-shell structure. The crystalline Ag8@Nb162 is stable under ambient conditions, What's more, it is water-soluble and able to maintain its molecular cluster structure intact in water. Further, the stable small [Ag8]6+ AgNC has interesting temperature- and pH-dependent reversible fluorescence response, based on which a multiple optical encryption mode for anti-counterfeit technology was demonstrated. This work offers a promising avenue for the synthesis of fascinating and stable PONb-protected AgNCs and sheds light on the development of new-type optical functional materials.

Development of Stable Water‐Soluble Supratomic Silver Clusters Utilizing A Polyoxoniobate‐Protected Strategy: Giant Core‐Shell‐Type Ag8@Nb162 Fluorescent Nanocluster

AbstractAtomically precise low‐nuclearity (n&lt;10) silver nanoclusters (AgNCs) have garnered significant interest due to their size‐dependent optical properties and diverse applications. However, their synthesis has remained challenging, primarily due to their inherent instability. The present study introduces a new feasible approach for clustering silver ions utilizing highly negative and redox‐inert polyoxoniobates (PONbs) as all‐inorganic ligands. This strategy not only enables the creation of novel Ag‐PONb composite nanoclusters but also facilitates the synthesis of stable low‐nuclearity AgNCs. Using this method, we have successfully synthesized a small octanuclear rhombic [Ag8]6+ AgNC stabilized by six highly negative [LiNb27O75]14− polyoxoanions. This marks the first PONb‐protected superatomic AgNC, designated as {Ag8@(LiNb27O75)6} (Ag8@Nb162), with an aesthetically spherical core–shell structure. The crystalline Ag8@Nb162 is stable under ambient conditions, What's more, it is water‐soluble and able to maintain its molecular cluster structure intact in water. Further, the stable small [Ag8]6+ AgNC has interesting temperature‐ and pH‐dependent reversible fluorescence response, based on which a multiple optical encryption mode for anti‐counterfeit technology was demonstrated. This work offers a promising avenue for the synthesis of fascinating and stable PONb‐protected AgNCs and sheds light on the development of new‐type optical functional materials.

Uncovering Cybersecurity Vulnerabilities: A Kali Linux Investigative Exploration Perspective

Abstract This research exploration presents a comprehensive methodology for conducting penetration testing for networking security protocols and vulnerabilities on the Wi-Fi networks using Kali Linux, an open-source penetration testing platform. The methodology also encompasses four main stages which are Preparation, Information Gathering, Simulated Attack, Reporting. In the Preparation Stage, the scope of the penetration test is defined, authorization is obtained, and within the testing environment the experimentation is prepared. The Information Gathering Stage involves scanning for associated nearby wireless access points (APs), identifying encryption modes, and assessing network coverage. The Simulated Attack Phase verifies the types of vulnerabilities through password cracking, infrastructure penetration tests, and client-side attacks. Finally, the Reporting Phase entails compiling of a very detailed test report with results visualized, findings and recommendations with directions. Experimental results validate the overall effectiveness of the methodology in identifying and mitigating Wi-Fi network vulnerabilities. Through systematic testing and analysis, Kali Linux facilitates proactive security measures to enhance Wi-Fi network defenses.

Frequency-domain image encryption based on IWT and 3D S-box

Most of the existing spatial domain image encryption techniques suffer from the difficulty of resisting cryptographic attacks. For this reason, this paper proposes a frequency-domain based digital image encryption scheme by combining Integer Wavelet Transform (IWT), three-dimensional S-box and chaotic system. First, the plaintext image is decomposed into different frequency subbands by IWT to map the digital image from spatial domain to frequency domain. Second, the plaintext hash value is selected as the dynamic key, and dynamic chaotic pseudo-random sequences with associations are generated, which are used for the encryption of each module respectively. Then, a three-dimensional S-box is designed to encrypt the information-rich low-frequency information using ‘bit-permutation three-dimensional S-box replace ciphertext interleaved diffusion’, while the high-frequency information is encrypted using a lightweight ‘XOR-row column permutation’ operation. Finally, the secure ciphertext for public channel transmission is obtained by the reconstruction method. The scheme of this paper, the frequency domain transformation is implemented through IWT, which enhances the ability to resist attacks. In addition, the diffusion encryption modules employ the introduction of ciphertext interleaved diffusion and parallel encryption mechanisms, thus the algorithm has the ability to resist plaintext attacks. Theoretical analysis and empirical results show that the algorithm has excellent numerical statistical analysis results, which corroborate that it has good confusion, diffusion and avalanche effects, and is able to resist various common cryptographic attacks. The frequency domain image encryption scheme proposed in this paper is a preferred high-security digital image privacy protection technique, so it has good application prospects.

Privacy Preserving Image Retrieval Using Multi-Key Random Projection Encryption and Machine Learning Decryption

Homomorphic Encryption (HE), Multiparty Computation (MPC), Differential Privacy (DP) and Random Projection (RP) have been used in privacy preserving computing. The main benefit of the random projection approach is the lighter time and space complexity compared to the other available techniques. However, RP is typically used in a symmetric encryption mode, with one random projection matrix single key, making it vulnerable to attacks. An enhanced multi-key RP approach is proposed in this paper where a set of N random matrices are used as projection keys. Moreover, a randomly chosen one is used for each new query. Machine learning models are trained to perform specific vector operations on the randomly projected vectors and produce another randomly projected results vector. Another machine learning model is trained to decrypt the final result at the user’s side. The proposed system is shown to offer privacy against known plaintext and cipher-only attacks while preserving Euclidean distance calculations accuracy in the randomly projected domain which are demonstrated on the COREL 1K image retrieval task. Results show that the cyphertext space took sixteen times less than the ciphertext done with homomorphic encryption, and the computation of distance using random projection was 8 times faster than homomorphic encryption distance calculation.

Evaluations of Crypto-System AES Using Multiple Bloc Ciphering Mode

Cryptography, a scientific field that has existed even before the beginning of computer science. This article looks at the development symmetric crypto-system, which falls within the framework of image security, by Advanced Encryption Standard (AES- Advanced Encryption Standard) algorithms. AES algorithm is not integrity protected. Cryptanalysis could use modified encrypted image of each ciphered bloc for generating oracle and getting the key. A new crypto-system uses hash function named AES-GCM (Advanced Encryption Standard-) for solving this problem. Using Galois Counter Mode (GCM) combined with Secure Hash Algorithm 256 bits (SHA-256) or BLAKE2s hash function, the old mode of ciphering like: Cipher FeedBack (CFB), Output FeedBack (OFB), Cipher Block Chaining (CBC), Electronic Codebook Block (ECB) and CounTeR (CTR) mode encryption, will increase the security level at confidentiality and integrity. In this article, robustness of the crypto-system will be evaluated by multiple criteria, indeed the statistical analysis, sensitivity measurement and performance measurement. For the statistical analysis, the histogram is flat and the correlation between adjacent pixel is not linear for the encrypted image. The relation between clear image and encrypted image doesn’t exist. For the sensitivity analysis, Number of Pixel Changing Rate (NPCR) and Unified Averaged Changed Intensity (UACI) permit to avoid differential attack of the crypto-system. The two values are respectively near 99% and 30%. For performance measurement, the similarity of the decrypted image and original image will be tested. The Peak Signal to Noise Ratio (PSNR) and Mean Square Error (MSE) are equals of infinity and zero. The decrypted image and original image are the same. The integrity of the image on the crypto-system will be evaluated by modifying one bit of the encrypted image. The decryption process doesn’t give decrypted image and show that the tag value is incorrect.

Designing a Secure and Scalable Service Agent for IoT Transmission through Blockchain and MQTT Fusion

With the rapid development of the Internet of Things (IoT) in recent years, many IoT devices use communication systems to transmit data. Data packets are inevitably at risk of tampering during data transmission, which can lead to information errors and damage during communication. Since IoT terminals are often operated under human supervision, it is essential to improve and ensure the transmission of information, avoid data tampering, and ensure the accuracy of packet transmission. This research successfully improves the message transmission method of IoT communication and the communication model by combining it with blockchain architecture. Combining communication protocols with blockchain serial connections eliminates the need to control operating and managing processes. By replacing message transmission with coverage, the reliability of data transmission in the IoT communication system is improved, and the flexibility of the data transmission process is enhanced. Through practical verification through experimentation, the study successfully improved the incapability of effectively constructing a cross-coded message transmission mode in the Message Queuing Telemetry Transport (MQTT) communication protocol, removed a single layer of encryption rule, and created an encryption mode capable of providing complex arrangement organization.

A Flexibly Function‐Oriented Assembly Mechanical Metamaterial

AbstractBased on the snap‐through instability, the pursuit for mechanical metamaterials with flexible functional applications and the ability to combine with information has been the Holy Grail for structural scientists. Here, the function/application‐oriented bistable unit motifs (UMs) are developed by an elaborately architectural design inspired by the hind leg of the frog in jumping, and a corresponding assembled strategy is proposed. Three functional applications derived from their progressive evolutions. The first is the construction of on‐demand assemblable mechanical curves, including multi‐stage vibration isolation, recoverable energy absorption, and energy dissipation along with integrated vibration isolation and energy dissipation characteristics. The second is the development of mechanic and temperature double pattern encryption strategy using bistability and shape memory programmability, resulting in 4n encryption and decryption modes for n‐bit encryption devices. Finally, five non‐volatile basic mechanical logic gates and a universal combinatorial half‐adder are built, affording guidance to unconventional computing devices with logic functions.

Small Stretch Problem of the DCT Scheme and How to Fix It

DCT is a beyond-birthday-bound (BBB) deterministic authenticated encryption (DAE) mode proposed by Forler et al. in ACISP 2016, ensuring integrity by redundancy. The instantiation of DCT employs the BRW polynomial, which is more efficient than the usual polynomial in GCM by reducing half of the multiplication operations. However, we show that DCT suffers from a small stretch problem similar to GCM. When the stretch length τ is small, choosing a special m-block message, we can reduce the number of queries required by a successful forgery to O(2τ/m). We emphasize that this attack efficiently balances space and time complexity but does not contradict the security bounds of DCT. Finally, we propose an improved scheme named Robust DCT (RDCT) with a minor change to DCT, which improves the security when τ is small and makes it resist the above attack.

Building PRFs from TPRPs: Beyond the Block and the Tweak Length Bounds

A secure n-bit tweakable block cipher (TBC) using t-bit tweaks can be modeled as a tweakable uniform random permutation, where each tweak defines an independent random n-bit permutation. When an input to this tweakable permutation is fixed, it can be viewed as a perfectly secure t-bit random function. On the other hand, when a tweak is fixed, it can be viewed as a perfectly secure n-bit random permutation, and it is well known that the sum of two random permutations is pseudorandom up to 2n queries.A natural question is whether one can construct a pseudorandom function (PRF) beyond the block and the tweak length bounds using a small number of calls to the underlying tweakable permutations. A straightforward way of constructing a PRF from tweakable permutations is to xor the outputs from two tweakable permutations with c bits of the input to each permutation fixed. Using the multi-user security of the sum of two permutations, one can prove that the (t + n − c)-to-n bit PRF is secure up to 2n+c queries.In this paper, we propose a family of PRF constructions based on tweakable permutations, dubbed XoTPc, achieving stronger security than the straightforward construction. XoTPc is parameterized by c, giving a (t + n − c)-to-n bit PRF. When t &lt; 3n and c = t/3 , XoTPt/3 becomes an (n + 2t/3 )-to-n bit pseudorandom function, which is secure up to 2n+2t/3 queries. It provides security beyond the block and the tweak length bounds, making two calls to the underlying tweakable permutations. In order to prove the security of XoTPc, we extend Mirror theory to q ≫ 2n, where q is the number of equations. From a practical point of view, our construction can be used to construct TBC-based MAC finalization functions and CTR-type encryption modes with stronger provable security compared to existing schemes.

Data Interactive Control System Based on Heterogeneous Database of Information Fusion and Internet of Things

Abstract To improve the data interaction control effect of a heterogeneous database and reduce packet loss rate and response time, a new heterogeneous database data interaction control system based on information fusion is designed. The system consists of hardware and software parts. The hardware part of the heterogeneous database data interaction control system is composed of a data extraction module, data sending and receiving module, encryption module, and data interaction control module. On the basis of completing hardware design, the system software is designed, a fuzzy similarity matrix is constructed by calculating the similarity among the evidence, the weight coefficient of each piece of evidence is calculated by calculating the support function of each piece of evidence, the evidence source model is modified by using discount rules, and Dempster–Shafer combination rules are transformed into matrix analysis. Combined with the modified evidence source model, information fusion of the heterogeneous database is carried out to complete the software design of the data interactive control system. The experimental results show that the data interaction control effect of the heterogeneous database in this system is good, and the packet loss rate and response time are low, improving the data interaction control effect.

A Novel Semantic IoT Middleware for Secure Data Management: Blockchain and AI-Driven Context Awareness

In the modern digital landscape of the Internet of Things (IoT), data interoperability and heterogeneity present critical challenges, particularly with the increasing complexity of IoT systems and networks. Addressing these challenges, while ensuring data security and user trust, is pivotal. This paper proposes a novel Semantic IoT Middleware (SIM) for healthcare. The architecture of this middleware comprises the following main processes: data generation, semantic annotation, security encryption, and semantic operations. The data generation module facilitates seamless data and event sourcing, while the Semantic Annotation Component assigns structured vocabulary for uniformity. SIM adopts blockchain technology to provide enhanced data security, and its layered approach ensures robust interoperability and intuitive user-centric operations for IoT systems. The security encryption module offers data protection, and the semantic operations module underpins data processing and integration. A distinctive feature of this middleware is its proficiency in service integration, leveraging semantic descriptions augmented by user feedback. Additionally, SIM integrates artificial intelligence (AI) feedback mechanisms to continuously refine and optimise the middleware’s operational efficiency.

Research on the method to enhance the transparency of financial transactions by integrating blockchain and smart contracts

Abstract Financial transaction transparency has gradually become one of the main directions for the development and construction of the financial transaction market. This paper integrates blockchain and smart contracts and proposes a strategy to improve financial transaction transparency in order to protect transaction data privacy and identify and trace transaction anomalies. The proposed DM-IBBE scheme for smart contract transaction privacy involves choosing different interpolation points based on Lagrange interpolation curves and creating encryption modes that meet the requirements for financial transaction privacy. Based on a graph neural network, the propagation probability of abnormal transactions is calculated from the blockchain network topology using the TAGCN model, and the influence of irrelevant noise pairs is eliminated to realize the identification and traceability of abnormal transactions. Taking the financial transaction platform of City A as the research object and carrying out the practice of financial transaction optimization, the evaluation scores of the first-level indexes of comprehensive government transparency, transaction process transparency, operation result transparency, process service transparency, and operation transparency and guarantee are 76.58, 88.93, 95.42, 89.51, and 88.43, and except for the indexes of comprehensive government transparency, the other indexes are all greater than 80 points. The second-level indicators’ evaluation value increases from the 50–70 score range before financial transactions optimization to the 80–100 score range. The financial transaction platform in City A has significantly improved the transparency of financial transactions.

Software implementation of the data encryption module on the BeagleBone platform for data transmission systems with increased cryptoresistance

In today's digital world, where the exchange of information is an integral part of our daily lives, ensuring information security becomes a criticaltask. This work aimsto develop an information protection module for data encryption on the BeagleBone platform for data transmission systems with increased crypto resistance. Itis a hardware system based on a BeagleBone AI 64 microcomputer with antennas for transmitting/receiving data. Since the information is transmitted over a physically unprotected channel, developing a module that will encrypt the data is necessary. The information protection module ensures the confidentiality of the transmitted data in the system using the AES symmetric encryption algorithm with a variable key length (128/192/256 bits). Regardless of the hardware platform, it is characterized by universality, as it can be run on the Linux kernel adapted for use on embedded systems. Providesoptions for configuring protocols and encryption algorithms. In the process of developing the security module, modern encryption methods and algorithms were used (AES 128/192/256 –for data encryption, RSA –for the distribution of secret keys), in addition, a lightweight protocol for secure data transmission Scplight was implemented as an alternative to OpenSSL, which improves transfer speed on low-power hardware platforms. The developed information protection module has undergone thorough testing on a real system. Thedevelopment of the information protection module is based on the need for a universal component that provides high-quality data protection in wireless communication systems. This module will accelerate the development of relatively affordable physical means of secure communication, a critical partofsuch projects. The module is implemented as a library written in the C language, which implements an API for establishing a secure connection and further forwarding information over an unprotected transmissionchannel. In addition, a configurator programallows you to change the module settings even in real-time when client applications use it. This ensures continuous, seamless, and secure data exchangeandconvenient configuration of the module. Many supporting libraries were used in the development process, including Crypton, Libgcrypt, Openssl, Ncurses and Sqlite3.

Hardware fingerprint construction of optical transmitters based on permutation entropy spectrum of chaos for secure authentication

In this paper, an optical transmitter authentication method using hardware fingerprints based on the permutation entropy spectrum (PES) of electro-optic chaos is proposed. By means of permutation analysis of chaotic time series generated by the electro-optic feedback loop, PES is defined and used as the hardware fingerprint of optical transmitters for secure authentication. The time division multiplexing (TDM) module is used to combine the chaotic signal and the message, while the optical temporal encryption (OTE) module is introduced to ensure the security of the fingerprint. At the receiver, the time division demultiplexing (TDD) module and the optical time decryption (TDD) module are introduced to recover the original chaotic signal. The trained support vector machine (SVM) models will then recognize legal and illegal optical transmitters by judging whether the PES of the received chaotic signal is legitimate or not. The simulation and experimental results show that PES of electro-optic chaos has obvious fingerprint characteristics and is sensitive to the feedback delay T in the feedback loop. The authentication system based on PES can recognize both legal and illegal transmitters in optical networks, and the recognition accuracy can reach about 97%. Under the condition of a low signal-to-noise ratio, the authentication system based on the permutation entropy spectrum can still distinguish legal and illegal transmitters effectively. Meanwhile, our scheme has high controllability and flexibility.