Bits In Order Research Articles

Enhancing Data Security: A Cutting-Edge Approach Utilizing Protein Chains in Cryptography and Steganography

Nowadays, with the increase in cyber-attacks, hacking, and data theft, maintaining data security and confidentiality is of paramount importance. Several techniques are used in cryptography and steganography to ensure their safety during the transfer of information between the two parties without interference from an unauthorized third party. This paper proposes a modern approach to cryptography and steganography based on exploiting a new environment: bases and protein chains used to encrypt and hide sensitive data. The protein bases are used to form a cipher key whose length is twice the length of the data to be encrypted. During the encryption process, the plain data and the cipher key are represented in several forms, including hexadecimal and binary representation, and several arithmetic operations are performed on them, in addition to the use of logic gates in the encryption process to increase encrypted data randomness. As for the protein chains, they are used as a cover to hide the encrypted data. The process of hiding inside the protein bases will be performed in a sophisticated manner that is undetectable by statistical analysis methods, where each byte will be fragmented into three groups of bits in a special order, and each group will be included in one specific protein base that will be allocated to this group only, depending on the classifications of bits that have been previously stored in special databases. Each byte of the encrypted data will be hidden in three protein bases, and these protein bases will be distributed randomly over the protein chain, depending on an equation designed for this purpose. The advantages of these proposed algorithms are that they are fast in encrypting and hiding data, scalable, i.e., insensitive to the size of plain data, and lossless algorithms. The experiments showed that the proposed cryptography algorithm outperforms the most recent algorithms in terms of entropy and correlation values that reach −0.6778 and 7.99941, and the proposed steganography algorithm has the highest payload of 2.666 among five well-known hiding algorithms that used DNA sequences as the cover of the data.

Insertion and Deletion Correction in Polymer-Based Data Storage

Synthetic polymer-based data storage seems to be a particularly promising candidate that could help to cope with the ever-increasing demand for archival storage requirements. It involves designing molecules of distinct masses to represent the respective bits {0, 1}, followed by the synthesis of a polymer of molecular units that reflects the order of bits in the information string. Reading out the stored data requires the use of a tandem mass spectrometer, that fragments the polymer into shorter substrings and provides their corresponding masses, from which the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">composition</i> , i.e. the number of 1s and 0s in the concerned substring can be inferred. Prior works have dealt with the problem of unique string reconstruction from the set of all possible compositions, called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">composition multiset</i> . This was accomplished either by determining which string lengths always allow unique reconstruction, or by formulating coding constraints to facilitate the same for all string lengths. Additionally, error-correcting schemes to deal with substitution errors caused by imprecise fragmentation during the readout process, have also been suggested. This work builds on this research by extending previously considered error models, mainly confined to substitution of compositions. To this end, we define new error models that consider insertions of spurious compositions and deletions of existing ones, thereby corrupting the composition multiset. We analyze if the reconstruction codebook proposed by Pattabiraman <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al</i> . is indeed robust to such errors, and if not, propose new coding constraints to remedy this.

THE STATE OF STANDARDIZATION OF POST-QUANTUM CRYPTO-ALGORITHMS AT THE GLOBAL LEVEL

Abstract. In the digital age, cryptography is widely used in various important systems such as financial, military and government ones, medical records etc.&#x0D; The life of modern people is closely connected with the cryptography. We send messages via instant messengers without even considering in which way the security of communications and data is ensured. We buy things both online and transfer money with confidence in transaction security. The level of digitization of our society is constantly increasing, and the digital data needs a reliable protection, which makes cryptography a current topic.&#x0D; Cryptographic systems ensure our security and the basic properties of information, such as privacy, integrity, availability.&#x0D; However, with the beginning of the development of quantum computers, the field of cryptography has developed in a new direction. Quantum cryptography is a science that studies the methods of communication systems protection. It is based on the idea that patterns of quantum physics (physical properties described by the laws of quantum optics, quantum electrodynamics, or quantum field theory) are inviolable. The current state of development and usage of powerful quantum computers, as well as their mathematical and software, is strictly confidential and securely protected. Only clear-cut information about quantum computers and their usage in cryptography is provided.&#x0D; NIST has announced an open competition to select quantum-resistant public-key cryptographic algorithms. After the third round, CRYSTALS-KYBER, CRYSTALS Dilithium, FALCON, and SPHINCS+ were proposed to be standardized. NIST has already recommended moving from the sizes of keys and algorithms that provide 80 security bits to the sizes of keys and algorithms that provide 112 or 128 security bits in order to protect against classic attacks.&#x0D; Post-quantum cryptography, which with its complexities still requires a more detailed study, challenge science once more. However, it is unknown when the changes will occur and when the quantum era will begin, as well as what consequences they will have. It is only possible to predict how many advantages will have quantum calculations compared to usual, and how different the new quantum models will be from classic ones.

BiSuT: A NoC-Based Bit-Shuffling Technique for Multiple Permanent Faults Mitigation

Since several decades, fault tolerance has become a major research field due to transistor shrinking and core number increasing in system-on-chip (SoC). Especially, faults occurring to the network-on-chips (NoCs) of those systems have a significant impact, due to the high amount of data, crossing the NoC, for the communication among intellectual properties (IPs). Furthermore, existing fault-tolerant approaches cannot efficiently deal with several permanent faults, which occur in NoC routers. To address these limitations, we propose the bit shuffling method (BiSuT) for fault-tolerant NoCs that reduces the impact of faults on data communications. To achieve that, the proposed approach exploits, at runtime, the position of permanent faults and changes the order of bits inside a flit. Our method reduces, as much as possible, the impact of faults by transferring the faults on least significant bits (LSBs), instead of keeping them on most significant bits (MSBs). The results obtained by extensive evaluations show that BiSuT can reduce the impact of multiple permanent faults, with low hardware costs, compared to the existing approaches, like the Hamming code.

Runtime Analysis of the (mu + 1)-EA on the Dynamic BinVal Function

We study evolutionary algorithms in a dynamic setting, where for each generation a different fitness function is chosen, and selection is performed with respect to the current fitness function. Specifically, we consider Dynamic BinVal, in which the fitness functions for each generation is given by the linear function BinVal, but in each generation the order of bits is randomly permuted. For the (1 + 1)-EA it was known that there is an efficiency threshold c_0 for the mutation parameter, at which the runtime switches from quasilinear to exponential. Previous empirical evidence suggested that for larger population size mu, the threshold may increase. We prove that this is at least the case in an varepsilon-neighborhood around the optimum: the threshold of the (mu + 1)-EA becomes arbitrarily large if the mu is chosen large enough. However, the most surprising result is obtained by a second-order analysis for mu =2: the threshold increases with increasing proximity to the optimum. In particular, the hardest region for optimization is not around the optimum.

Booth Multiplier Based on Low Power High Speed Full Adder With Fin_FET Technology

This paper proposes a novel Fin FET-based HSFA for the multiplier in order to overcome the issues of low speed operation. It is advantageous to use Fin FETs to construct the arithmetic circuit while assessing the available works. The carry propagation and slow operation of the old technique are disadvantages. The CMOS-based compressor circuit, on the other hand, suffers from leakage current, which reduces its driving capabilities. High current DSP applications are well matched to the design's specifications. Even with a supply voltage of 1 volt, the proposed device has a decent driving capability. As a result, the circuit runs more quickly and has less latency. A transmission gate is used in the design of the suggested adder structure to selectively block or transfer data from the input to output. Half adder and adder are shown in the following illustrations. The smaller the transistor count, the less power it uses. The suggested Fin FET design for the smaller transistors has a superior driving capability than the CMOS equivalent. Additionally, when cascading, the Fin FET based adder may contribute to superior switch performance, such as when using ripple carry adder. There is also the possibility of a low operation, which may operate at Low wattage Electronic designs for high-performance and small devices have become increasingly dependent on the use of VLSI circuits. The power of a processor is determined in large part by the multiplier used in its design. Multiplier factor booth coding is being used to reorder the input bits in order to reduce facility use. The booth decoder works by rearranging the specified booth equivalent. The Booth decoder has the ability to expand the range of zeros. As a result, the power consumption of the design will be decreased even more. As soon as the input bit constant drops below zero, related rows or columns of an adder must be disabled, if possible.

Post-COVID-19 Neural Cryptographic Onset of Homeopathy Psychiatry Medicine's Transmission in "New Normal Form"

In telepsychiatric treatments, the medical data of various types of patients' data are to be communicated in a well-protected way between the patient and the psychiatrists. Homeopathy drugs play a significant role in treating such psychiatric patients. The objective of this manuscript is to develop a strong session key with the help of neural cryptography. Neural cryptography is the extensive usage of the artificial neural networks for the cryptographic functions. E-medicines were encrypted here by the classical methods and the proposed session keys of 128 bits long. The length has been selected to 128 bits in order to have less memory space needed. Alzheimer's disease, Dementia, Insomnia, Stress, OCD, Brain restlessness, Depression, etc are the most clinical mental complications observed in this post COVID-19 situations. This is the era of digital health to deal the remote patients who are non-invasive in nature. In this manuscript, a session key has been proposed by the Key Distribution Centre (KDC) with the aid of artificial neural networks. Strong session keys were derived of 128 bits length which in turn used for AES 128 encryption. To avoid the Man-InThe-Middle attacks, it has been designed that the server machine shall accumulate all the needful symptoms of the psychiatric patients.

Co-relation scan attack analysis (COSAA) on AES: A comprehensive approach

Scan based DfT is indispensable for IC testing in the semiconductor chip industry to ensure correctness of chip, both functionally and structurally. Since a higher degree of fault coverage is essential, cryptographic ICs rely on it as a standard technique during manufacturing test. Yet an invaluable tradeoff needs to be met between security and testability, because it is the observability and controllability of the sequential memory elements in the scan chain which are enhanced to facilitate testing. Well designed differential scan attacks which make use of this feature can prove to be critically pervasive to leak secret keys embedded in cryptochips. Use of response compactors ensure test cost reduction. Existing differential scan attacks target Hamming weight pairs that are unique. The motivation of our work lies in the fact that carefully fabricating additional bits in order to transform a unique Hamming weight to a non-unique one, existing attacks can be defended. In this paper, we propose Co-relation scan attack (COSAA) on AES crypto-system which can work even in the presence of test response compaction. We show our attack technique to be lethal against any possible Hamming weight model which means that the designer needs to prevent the circuit under test from a relatively broader attack surface. Our experiments show the proposed attack can successfully recover the secret key of AES with XOR compaction in 24 milliseconds using an average desktop machine.

Evaluation of different tool geometries in the finite element simulation of ultrasonic-assisted drilling of Ti6A14V

This paper attempts to analyze the effect of various drilling parameters such as feed rate, spindle speed and vibration frequency on performance characteristics such as thrust force, effective stresses, temperature and chip morphology in conventional drilling (CD) and ultrasonic-assisted drilling (UAD) of Ti6A14V using three different point angle (140°, 120°, 90°) drill bits in order to optimize the chip breakability of Ti6A14V. The three different point angle drill bits are utilized to establish the finite element models (FEM) to simulate the drilling process with Lagrangian approach in DEFORM-3D software. The simulations are validated by the experimental findings and analytical data of thrust forces, and the percent errors in results range approximately between 3 and 7%. The results obtained prove that UAD can produce segmental discontinuous chip, lower thrust force, lower process temperature and lower effective stress. The point angle of 120° drill achieved the thinnest chip thickness and the excellent effects of chip breaking. The achieved results are assumed to help for the optimization of the drill tool geometries, drilling parameters and chip breakability.

Steganography Genetic Algorithm Hyperparameter Tuning through Response Surface Methodology

&#x0D; &#x0D; &#x0D; Steganography consists of hidding bits of an information source into a host source. In image processing, a common way of doing the hiding process is to break each byte from the message information and embbed into the message bytes in a way that the differences among the original host and the embedded one is minimized. A genetic algorithm can be used to find the proper combination of bits in order to minimize such differences, but some hyperparameters need to be optimized in order to get an optimized performance. This work investigates the application of Response Surface Methodology in order to find the best hyperparameters of a genetic algorithm applied to image steganography.&#x0D; &#x0D; &#x0D;

A Deliberate Bit Flipping Coding Scheme for Data-Dependent Two-Dimensional Channels

In this paper, we present a deliberate bit flipping (DBF) coding scheme for binary two-dimensional (2-D) channels, where specific patterns in channel inputs are the significant cause of errors. The idea is to eliminate a constrained encoder and, instead, embed a constraint into an error correction codeword that is arranged into a 2-D array by deliberately flipping the bits that violate the constraint. The DBF method relies on the error correction capability of the code being used so that it should be able to correct both deliberate errors and channel errors. Therefore, it is crucial to flip minimum number of bits in order not to overburden the error correction decoder. We devise a constrained combinatorial formulation for minimizing the number of flipped bits for a given set of harmful patterns. The generalized belief propagation algorithm is used to find an approximate solution for the problem. We evaluate the performance gain of our proposed approach on a data-dependent 2-D channel, where 2-D isolated-bits patterns are the harmful patterns for the channel. Furthermore, the performance of the DBF method is compared with classical 2-D constrained coding schemes for the 2-D no isolated-bits constraint on a memoryless binary symmetric channel.

DESIGN OF LIGHTWEIGHT CRYPTOGRAPHIC MODEL FOR END-TO-END ENCRYPTION IN IOT DOMAIN

Digitalization rapidly connected the entire world. Everyday an enormous volumes of digital data produced by billions of intelligent devices which requires safe transmission over internet. If we look into embedded environment, handling massive volume of data is impractical for low power and low memory devices which leads to lightweight concept. The proposed lightweight model includes many symmetric key sequentially. The model follows fiestel network structure where 64 bits input block divided by two 32 bits blocks. Then every half undergoes through various symmetric key algorithms like TE (Triangular Encryption), RPPT (Recursive Pared Parity Technique), RPSPNC( Recursive Positional Substitution on Prime-Nonprime of Cluster), TB(Transformation of Bits) and bits rotation process. A triangular bit sequence generated by TE and from there various encryption as well as decryption techniques[1] have generated by reading bits in a certain order. RPPT encrypts bits by executing logical OR of successive bits. Bit swapping technique is used by TB for encryption and decryption. RPSPNC interchanges bits on the basis of prime-non prime bit position and considers any in between bit sequence as a cipher text. Lastly two resultant sub-blocks are merged to produce cipher text of 64 bits. To check the acceptance of the proposed model, comparisons take place with popular symmetric key algorithm AES and one embedded algorithm RPPT+TB. Software parameters like entropy, n-gram(4-gram), non-homogeneity, histogram are analysed. Hardware analysis of the model ensures us that it falls into lightweight domain by comparing the GE (Gate equivalent) with the ISO /IEC standard value ranges between 1000-2000GE.

Guess and determine cryptanalysis with variable sampling and its applications

Non-linear filtering generators, as a well-known family of stream ciphers, employ a filtering function F : GF ( 2 ) n → GF ( 2 ) m to process the secret state bits and thus outputs binary keystream blocks of length m. In this study, the authors extend the framework of a generic cryptanalytic method applicable to non-linear filtering generators called generalised filter state guessing attacks (GFSGA), introduced as a generalisation of the filter state guessing attack method, by applying a variable sampling of the keystream bits in order to retrieve as much information about the secret state bits as possible. Two different modes that use a variable sampling of keystream blocks are presented and it is shown that in many cases these modes may outperform the standard GFSGA mode. They also demonstrate the possibility of employing GFSGA-like attacks to other design strategies such as non-linear feedback shift register-based ciphers (Grain family for instance). It is also indicated that the tap positions of Grain-128 are not chosen optimally with respect to this generic cryptanalytic method and provide a better selection of taps that gives higher resistance to GFSGA-like attacks.

Design of a Scalable Low-Power 1-Bit Hybrid Full Adder for Fast Computation

A novel design of a hybrid Full Adder (FA) using Pass Transistors (PTs), Transmission Gates (TGs) and Conventional Complementary Metal Oxide Semiconductor (CCMOS) logic is presented. Performance analysis of the circuit has been conducted using Cadence toolset. For comparative analysis, the performance parameters have been compared with twenty existing FA circuits. The proposed FA has also been extended up to a word length of 64 bits in order to test its scalability. Only the proposed FA and five of the existing designs have the ability to operate without utilizing buffer in intermediate stages while extended to 64 bits. According to simulation results, the proposed design demonstrates notable performance in power consumption and delay which accounted for low power delay product. Based on the simulation results, it can be stated that the proposed hybrid FA circuit is an attractive alternative in the data path design of modern high-speed Central Processing Units.

Low-Complexity Bit Allocation for RSS Target Localization

The overall localization error performance for a sensor network employing quantized received signal strength (RSS) measurements largely depends on the number of bits used and their distribution. In this paper, we consider a rate-constrained bit allocation problem in which multiple points of interest (PoIs) are assigned possibly non-uniform error requirements. The main objective is to allocate a number of bits in order to satisfy error requirements as best as possible in a squared error sense. Due to the computational complexity of optimally solving the allocation problem, two novel low complexity allocation algorithms are proposed. The main idea behind these algorithms is to relate localization errors to corresponding bit density requirements. In the first algorithm, bit allocation is formulated as a sequential constrained convex optimization problem which can be solved with efficiency using available convex solvers. The second algorithm is a greedy version of the first algorithm in which sensors are selected for allocation based on the bit density differences at their neighboring PoIs. Numerical experiments show the efficacy of the proposed algorithms in comparison to other available algorithms in terms of overall error, coverage, and computational complexity.

Data Recovery from Encrypted Image and Recovering Image

This paper refers to the data hiding technique in an encrypted image and restoring image as it was before to its fullest. There are three bids of the framework to this process, which are a content owner, data hiding and recipient. The content owner encrypts the image with ciphertext making it an encrypted image. Data hider channelizes encrypted image into 3 different channels and adds each with additional bits in order to obtain marked encrypted image. At the recipient end, the noise from the image could be removed consuming the extraction key and the image obtained will be intact as original. Utilizing RDH_EI method, we not only receive secret information but also, the image is recovered using progressive recovery.

Understanding why inaccuracies happen when drilling bone

Orthopaedic surgery may be reduced to three key factors: knowledge, understanding and accuracy. It is essential that surgeons both know and understand the rules when investigating a problem and when...

Remote Sampling with Applications to General Entanglement Simulation.

We show how to sample exactly discrete probability distributions whose defining parameters are distributed among remote parties. For this purpose, von Neumann’s rejection algorithm is turned into a distributed sampling communication protocol. We study the expected number of bits communicated among the parties and also exhibit a trade-off between the number of rounds of the rejection algorithm and the number of bits transmitted in the initial phase. Finally, we apply remote sampling to the simulation of quantum entanglement in its essentially most general form possible, when an arbitrary finite number m of parties share systems of arbitrary finite dimensions on which they apply arbitrary measurements (not restricted to being projective measurements, but restricted to finitely many possible outcomes). In case the dimension of the systems and the number of possible outcomes per party are bounded by a constant, it suffices to communicate an expected bits in order to simulate exactly the outcomes that these measurements would have produced on those systems.

The characterization of wear in roller cone drill bit by rock material – Sandstone

Roller cone drill bit efficiency time during drilling depends, to a large extent, on the properties of the materials from which the components of the roller cone bit are made.The faster the roller cone bit is worn, due to the effects of the rock material through which we drill and the drilling regimes used during the drilling, the worse is the efficiency of drilling and the higher is the number of drill bits needed to drill the well.The aim of our research was to determine the mechanisms of wear on roller cone bit materials according to the characteristics of the steel material of the roller cone bit and the characteristics of the rock material, in this case, sandstone on the drilling regime. The results of the discovered wear mechanisms help us to anticipate the possible improvement of the resistance of the unprotected roller cone bit steel material to excessive wear and, consequently, the longevity of the roller cone bit.For this purpose, we examined the steel materials of the roller cone bit, which we used during well drilling and the rock material, sandstone, through which we drilled with the roller cone bit under consideration.The results of our analysis present the mechanisms that result in the wear of the roller cone bit material under the given conditions of the rock material and the drilling regime. The results of the discovered wear mechanism can be used to improve the material of the roller cone bits in order to achieve a longer operating life and decrease the related costs of drilling.

Xorshift1024*, xorshift1024+, xorshift128+ and xoroshiro128+ fail statistical tests for linearity

L’Ecuyer & Simard’s Big Crush statistical test suite has revealed statistical flaws in many popular random number generators including Marsaglia’s Xorshift generators. Vigna recently proposed some 64-bit variations on the Xorshift scheme that are further scrambled (i.e., xorshift1024*, xorshift1024+, xorshift128+, xoroshiro128+). Unlike their unscrambled counterparts, they pass Big Crush when interleaving blocks of 32 bits for each 64-bit word (most significant, least significant, most significant, least significant, etc.). We report that these scrambled generators systematically fail Big Crush – specifically the linear-complexity and matrix-rank tests that detect linearity – when taking the 32 lowest-order bits in reverse order from each 64-bit word. • We expose previously unknown faults in widely used random generators proposed by Vigna. • These faults are systematic and decisive. • They are generated by reversing the order of the bits, an approach stressed by Vigna himself. • We provide open source code and scripts to make reproduction easy. • Our work illustrates the need to test 64-bit generators more carefully.