Search

We have been using paper for more than a thousand years and we are so accustomed to using it. However, digital information is easy to share and manage. It is necessary to digitize the handwriting. This article proposes a method of encoding coordinates on a twodimensional page for digitizing hand-writing, combining Anoto encoding and nCode encoding. The coding scheme is calibrated based on coordinate relation, and the feasibility of the scheme is verified through experiments. [ABSTRACT FROM AUTHOR]

The wide spread of smartphones and QR codes for various end-user applications has had an impact beyond traditional fields of use, recently also reaching point-of-care testing (POCT). This work presents the integration of QR code recognition into paper-based analytical devices (PADs) with "distance-based" colorimetric signalling, resulting in semiquantitative readout fully relying on straightforward barcode reader solutions. PADs consist of an array of QR codes arranged in series inside a paperfluidic channel. A mask dye concept has been developed, which enables utilisation of colour changing indicators by initially hiding QR codes. The colour change of the indicator induced by the presence of an analyte of interest results in gradual unmasking of QR codes, which become recognisable by the smartphone barcode reader app. To reproducibly fabricate devices, all fabrication steps were performed by commercial desktop solid ink and inkjet printing. The QR code masking function was optimised by controlling the amount of printed mask dye through adjusting the opacity of printing patterns during the inkjet deposition process. For proof-of-concept, a model assay in the form of colorimetric copper ion (Cu2+) detection in the concentration range of 0.4 mM to 3.2 mM was evaluated. Consistent results independent of the smartphone model and environmental light condition were achieved with a free barcode reader app. To the best of our knowledge, this work is the first demonstration of a semiquantitative assay approach fully relying on QR code readout without digital colour analysis, customised app or hardware modification. [ABSTRACT FROM AUTHOR]

Nowadays, it is difficult to imagine a powerful algorithm of cryptography that can continue cryptanalyzing and attacking without the use of unconventional techniques. Although some of the substitution algorithms are old, such as Vigenere, Alberti, and Trithemius ciphers, they are considered powerful and cannot be broken. In this paper we produce the novelty algorithm, by using of biological computation as an unconventional search tool combined with an uninhibited analysis method is the vertical probabilistic model, that makes attacking and analyzing these ciphers possible and very easy to transform the problem from a complex to a linear one, which is a novelty achievement. The letters of the encoded message are processed in the form of segments of equal length, to report the available hardware components. Each letter codon represents a region of the memory strand, and the letters calculated for it are symbolized within the probabilistic model so that each pair has a triple encoding: the first is given as a memory strand encoding and the others are its complement in the sticker encoding; These encodings differ from one region to another. The solution space is calculated and then the parallel search process begins. Some memory complexities are excluded even though they are within the solution paths formed, because the natural language does not contain its sequences. The precision of the solution and the time consuming of access to it depend on the length of the processed text, and the precision of the solution is often inversely proportional to the speed of access to it. As an average of the time spent to reach the solution, a text with a length of 200 cipher characters needs approximately 15 minutes to give 98% of the correct components of the specific hardware. The aim of the paper is to transform OTP substitution analysis from a NP problem to a O(nm) problem, which makes it easier to find solutions to it easily with the available capabilities and to develop methods that are harnessed to attack difficult and powerful ciphers that differ in class and type from the OTP polyalphabetic substitution ciphers. [ABSTRACT FROM AUTHOR]

A new dirty paper coding technique that is robust against the gain attack is presented. Such a robustness is obtained by adopting a set of (orthogonal) equienergetic codewords and a correlation-based decoder. Due to the simple structure of orthogonal codes, we developed a simple yet powerful technique to embed the hidden message within the host signal. The proposed technique is an optimal one, in that the embedding distortion is minimized for a given robustness level, where robustness is measured through the maximum pairwise error probability in the presence of an additive Gaussian attack of given strength. The performance of the dirty coding algorithm is further improved by replacing orthogonal with quasi- orthogonal codes, namely, Gold sequences, and by concatenating them with an outer turbo code. To this aim, the inner decoder is modified to produce a soft estimate of the embedded message. Performance analysis is carried out by means of extensive simulations proving the validity of the novel watermarking scheme. [ABSTRACT FROM AUTHOR]

The mobile attendance systems are used to reduce the time and effort wasted in taking attendance in the colleges. Our research focuses on the creating mobile attendance system using Android studio and database to avoid lots of paper work and prevent data loss. This system applies QR code for each subject, so each faculty member shows the QR code to the students to scan it and make them self-present. The other option is that the faculty member takes attendance by calling the name of the students in class. If the student attends, the faculty member will pull the button ant it will change to green (the student is presence), if the student absent the button remain the same without pulling it. Faculty members can manage and check absences of students. Student can only make attendance for each subject and check their absence hours. The output will be the number of students' absences weekly or monthly. The developed system helps faculty members to mange attendance easily and efficiently. [ABSTRACT FROM AUTHOR]

Several properties of the products of finite maximal prefix, maximal biprefix, semaphore, synchronous, maximal infix and maximal outfix codes are discussed respectively. We show that, for two nonempty subsets X and Y of A * such that the product XY being thin, if XY is a maximal biprefix code, then X and Y are maximal biprefix codes. Also, it is shown that, for two finite nonempty subsets X and Y of A * such that the product XY being unambiguous, if XY is a semaphore code then X and Y are semaphore codes. Finally, two open problems to the product of finite semaphore and maximal infix codes are presented. [ABSTRACT FROM AUTHOR]

The purpose of the present article is to contribute to the postphenomenological theory of technological mediation by introducing a new type of 'human-technology' relation named 'transcending mediation'. Previously postphenomenology didn't pay much attention to the role technology plays in mediating human relation to Transcendence. This was because of empirical turn and pragmatism that are anti-metaphysical in their nature. In the present paper, however, I will show that the empirical element of technology can be balanced by some metaphysical findings. Keeping this in mind, I will rely on Karl Jaspers's metaphysics of ciphers in order to demonstrate how technology mediates not only our relation to the world but also shapes human's relation to Transcendence. As I am going to show in the present paper, this sort of mediation becomes possible because technologies are actively participating in so-called self-transcending practices. The latter, according to Karl Jaspers, are practices through which humans can elucidate one's true self (e.g., become an Existenz). In this article, I will take a case of Smart education as a particular type of self-transcending practice and will show how contemporary AI educational systems enable and disable particular forms of becoming true self (Existenz). [ABSTRACT FROM AUTHOR]

Polynomial multiplication is the most computationally expensive part of the lattice-based cryptography algorithm. However, the existing acceleration schemes have problems, such as low performance and high hardware resource overhead. Based on the polynomial multiplication of number theoretic transformation (NTT), this paper proposed a simple element of Montgomery module reduction with pipeline structure to realize fast module multiplication. In order to improve the throughput of the NTT module, the block storage technology is used in the NTT hardware module to enable the computing unit to read and write data alternately. Based on the NTT hardware module, a precalculated parameter storage and real-time calculation method suitable for the hardware architecture of this paper is also proposed. Finally, the hardware of polynomial multiplier based on NTT module is implemented, and its function simulation and performance evaluation are carried out. The results show that the proposed hardware accelerator can have excellent computing performance while using fewer hardware resources, thus meeting the requirements of lattice cipher algorithms in security chips. Compared with the existing studies, the computing performance of the polynomial multiplier designed in this paper is improved by approximately 1 to 3 times, and the slice resources and storage resources used are reduced by approximately 60% and 17%, respectively. [ABSTRACT FROM AUTHOR]

Many symmetric and asymmetric encryption algorithms have been developed in cloud computing to transmit data in a secure form. Cloud cryptography is a data encryption mechanism that consists of different steps and prevents the attacker from misusing the data. This paper has developed an efficient algorithm to protect the data from invaders and secure the data from misuse. If this algorithm is applied to the cloud network, the attacker will not be able to access the data. To encrypt the data, the values of the bytes have been obtained by converting the plain text to ASCII. A key has been generated using the Non-Deterministic Bit Generator (NRBG) mechanism, and the key is XNORed with plain text bits, and then Bit toggling has been implemented. After that, an efficient matrix cipher encryption algorithm has been developed, and this algorithm has been applied to this text. The capability of this algorithm is that with its help, a key has been obtained from the plain text, and only by using this key can the data be decrypted in the first steps. A plain text key will never be used for another plain text. The data has been secured by implementing different mechanisms in both stages, and after that, a ciphertext has been obtained. At the end of the article, the latest technique will be compared with different techniques. There will be a discussion on how the present technique is better than all the other techniques; then, the conclusion will be drawn based on comparative analysis. [ABSTRACT FROM AUTHOR]

At CRYPTO 2019, Gohr proposed the neural differential distinguisher using the residual network structure in convolutional neural networks on round-reduced Speck32/64. In this paper, we construct a 7-round differential neural distinguisher for Speck32/64, which results in better than Gohr's work. The details are as follows. Firstly, a new data format  (C _ r , C _ r ′ , d _ l , C l , C r , C l ′ , C r ′)  is proposed for the input data of the differential neural distinguisher, which can help the distinguisher to identify the features of the previous round of ciphertexts in the Speck algorithm. Secondly, this paper modifies the convolution layer of the residual block in the residual network, inspired by the Inception module in GoogLeNet. For Speck32/64, the experiments show that the accuracy of the 7-round differential neural distinguisher is  97.13 % , which is better than the accuracy of Gohr's distinguisher of  9.1 %  and also higher than the currently known accuracy of  89.63 % . The experiments also show that the data format and neural network in this paper can improve the accuracy of the distinguisher by  2.38 %  and  2.1 % , respectively. Finally, to demonstrate the effectiveness of the distinguisher in this paper, a key recovery attack is performed on 8-rounds of Speck32/64. The results show that the success rate of recovering the correct key is  92 % , with no more than two incorrect bits. Finally, this paper briefly discussed the effect of the number of ciphertext pairs in a sample on the training results of the differential neural distinguisher. When the total number of ciphertext pairs is kept constant, the accuracy of the distinguisher increases with s, but it also leads to the occurrence of overfitting. [ABSTRACT FROM AUTHOR]

Let n be a positive integer. An NFSR of n stages is called irreducible if the family of output sequences of any NFSR of stages less than n is not included in that of the NFSR. In this paper, we prove that the density of the irreducible NFSRs of n stages is larger than 0.39. This implies that it is expected to find an irreducible NFSR of n stages among three randomly chosen NFSRs of n stages. [ABSTRACT FROM PUBLISHER]

This paper studies the distinctness of primitive sequences over \bf Z/(M) modulo 2, where M is an odd integer that is composite and square-free, and \bf Z/(M) is the integer residue ring modulo M. A new sufficient condition is given for ensuring that primitive sequences generated by a primitive polynomial f\left(x\right) over \bf Z/(M) are pairwise distinct modulo 2. Such result improves a recent result obtained in our previous paper, and consequently, the set of primitive sequences over \bf Z/(M) that can be proven to be distinct modulo 2 is greatly enlarged. [ABSTRACT FROM PUBLISHER]

In 1998 Crandall introduced a method based on coding theory to secretly embed a message in a digital support such as an image. Later, in 2005, Fridrich et al. improved this method to minimize the distortion introduced by the embedding; a process called wet paper. However, as previously emphasized in the literature, this method can fail during the embedding step. Here we and sufficient and necessary conditions to guarantee a successful embedding, by studying the dual distance of a linear code. Since these results are essentially of combinatorial nature, they can be generalized to systematic codes, a large family containing all linear codes. We also compute the exact number of embedding solutions and point out the relationship between wet paper codes and orthogonal arrays. [ABSTRACT FROM AUTHOR]

Cloud cryptography is the art of converting plain text into an unreadable format, which protects data and prevents the data from being misused by the attacker. Different researchers designed various Caesar cipher algorithms for data security. With the help of these algorithms, the data can be converted into a nonreadable format, but the data cannot be completely secured. In this paper, data security is provided in different phases. Firstly, data are secured through a bit-reversing mechanism in which those replace the actual values with no relation to the original data. Then the four-bit values are added at the beginning and end of bits using a salting mechanism to interlink the salting and existing bit-values and hide the original data. A Caesar cipher value is obtained by applying the Caesar cipher algorithm to the resulting bits. The Caesar cipher algorithm is used to implement number-of-shifting on the obtained values. An efficient cipher matrix algorithm is then developed in which different rules are designed to encrypt the data. Afterward, a secure cipher value is obtained by implementing Cipher XORation rules on the result obtained and the user-defined key. In the end, the proposed algorithm is compared with various papers. It identifies how much better the proposed algorithm performs than all the previous algorithms and how much the attack rate can be reduced if this algorithm is used for data security. [ABSTRACT FROM AUTHOR]

This paper proposes a dynamic RNA-encoded color image encryption scheme based on a chain feedback structure. Firstly, the color pure image is decomposed into red, green, and blue components, and then a chaotic sequence based on plaintext association is introduced to encrypt the red component. Secondly, the intermediate ciphertext is obtained by diffusion after encryption by bit-level permutation, RNA dynamic encoding, RNA dynamic operation rules, and RNA dynamic decoding. Finally, to enhance the security of the image cryptosystem, the green and blue components of the image are repeatedly encrypted using the chain encryption mechanism associated with the intermediate ciphertext to obtain the color cryptographic image. In this paper, a 2D-SFHM chaotic system is used to provide pseudo-random chaotic sequences, and its initial key is calculated by combining the hash function and external parameters of the image, and the one-time ciphertext encryption strategy causes the proposed encryption to effectively resist cryptographic attacks. Experimental results and security analysis show that our encryption algorithm has excellent encryption effects and security performance against various typical attacks. [ABSTRACT FROM AUTHOR]

Public key Cryptography which is associated with pair of public and private keys is an important requirement for electronic commence in the history of cryptography. Since public key is shared it should be digitally stored in the software in the form of public key Infrastructure (PKI) certificates Elliptic Curve Cryptography plays major role in cloud computing due to the exceptional property of smaller key size. ECC has wide range of applications in Secure Socket Layers (SSL) of cloud computing. The main disadvantage of ECC is the cipher space is two times the message. The present paper explains an innovative elliptic curve cryptosystem that reduces the cipher space, equal to the original message. [ABSTRACT FROM AUTHOR]

Quantum-secure communication and computation have garnered increasing attention due to their powerful search capabilities for certain complex problems and their ability to provide unconditional security. This indicates that classical cryptography, such as asymmetric ciphers based on complex mathematics, faces a significant threat from quantum algorithms. However, quantum cryptography can detect any attempt to eavesdrop on a channel. As a result, the investigation and implementation of quantum computers and quantum-secure communication networks have become essential objectives for numerous research teams. This paper provides an overview of quantum cryptography, including its development, and focuses on the theoretical aspect of quantum secure direct communication (QSDC). This helps readers understand the theoretical operating principles and gain a better understanding of the entire quantum characteristic and protocol operation in the QSDC field. QSDC enables secure communication without previously shared private keys, making it a crucial topic in quantum cryptography research. This paper provides an overview of several well-known versions of QSDC in theory, discussing their applications, challenges and potential future directions. [ABSTRACT FROM AUTHOR]

The process of sending confidential data through the communication media and in complete secrecy is now necessary, whether the data is related to patients, a particular military operation, or a specified office. On the other hand, with the development of various ciphering algorithms, and information hiding algorithms, there is a need to obtain ciphered and hidden data securely without the need to exchange secret keys between the two ends of the communication. In this paper, a hiding algorithm based on fused images and Caesar cipher with intelligent methods to strengthen the security of confidential information is proposed. Firstly, fused image scattering is obtained using 1’s complement and circularly shifting the bits of fused pixels by specified positions before the hiding process. Secondly, the keys for the Caesar cipher are derived from the length of secret information according to the mathematical equation. Thirdly, strengthen the security of Caesar’s cipher by taking a 1’s complement of each letter in the cipher data. The results guarantee the security of the presented algorithm. [ABSTRACT FROM AUTHOR]

The ratio at which the number of users is increasing in cloud computing, the same as the number of data destruction, has doubled. Various algorithms have been designed to secure cloud servers to prevent an attacker from attacking, but they cannot protect the data. With the help of cryptography, data are converted into a format that is difficult for an attacker to understand, and these data can be broadcasted in a reliable format. If the attacker obtains access to the cryptographic algorithm, then the attacker can easily decrypt the data, but if the data are encrypted with the help of the key, it is difficult for the attacker to decrypt the data without the key. When the data are encrypted with the same key at different times, there is a possibility to obtain the actual key with the help of the Kasiski test. Different researchers have encrypted the data with the help of the same key or have developed an algorithm by combining different algorithms, which is a problem. This paper developed an efficient algorithm that cannot be broken easily. Even if an attacker obtains access to the algorithm, the attacker cannot identify the keys derived from that text, and the key only works in the text from which it is generated, which is the novelty of this paper. Data are secured in two different layers. In Layer-1, the proposed algorithm implements plaintext and a static key to obtain the encrypted text and a Vigenère key. In Layer-2, the encrypted text and the Vigenère key are implemented on the Vigenère cipher algorithm to obtain the ciphertext. At the end of the paper, a comparison of different papers is made with the proposed paper, and a conclusion is made based on different techniques and results. [ABSTRACT FROM AUTHOR]

Encryption of images is an important method that can effectively improve the security and privacy of crucial image data. Existing methods generally encrypt an image with a combination of scrambling and encoding operations. Currently, many applications require highly secure results for image encryption. New methods that can achieve improved randomness for both the scrambling and encoding processes in encryption are thus needed to further enhance the security of a cipher image. This paper proposes a new method that can securely encrypt color images. As the first step of the proposed method, a complete bit-level operation is utilized to scramble the binary bits in a color image to a full extent. For the second step, the bits in the scrambled image are processed with a sweeping operation to improve the encryption security. In the final step of encryption, a codebook that varies with evolutionary operations based on several chaotic systems is utilized to encrypt the partially encrypted image obtained in the second step. Experimental results on benchmark color images suggest that this new approach can securely encrypt color images and generate cipher images that remain secure under different types of attacks. The proposed approach is compared with several other state-of-the-art encryption approaches and the results show that it can achieve improved encryption security for cipher images. Experimental results thus suggest that this new approach can possibly be utilized practically in applications where color images need to be encrypted for content protection. [ABSTRACT FROM AUTHOR]

In the face of advancing quantum computing capabilities posing significant threats to current cryptographic protocols, the need for post-quantum cryptography has become increasingly urgent. This paper presents a comprehensive analysis of the performance of various post-quantum cryptographic algorithms specifically applied to digital signatures. It focuses on the implementation and performance analysis of selected algorithms, including CRYSTALS-Dilithium, Falcon, and SPHINCS+, using the liboqs library. Performance tests reveal insights into key pair generation, file signing, and signature verification processes. Comparative tests with the well-known and popular RSA algorithm highlight the trade-offs between security and time efficiency. The results can help to select secure and efficient ciphers for specific 5G/6G services. [ABSTRACT FROM AUTHOR]

Summary: The widespread use of Internet of Things devices has increased the demand for lower cost and more efficient lightweight ciphers. However, there is a difficult trade‐off between cost and efficiency for lightweight block ciphers. The optimizations of area and throughput are important for some constrained environments. This paper proposes two novel hardware architectures for the LILLIPUT cipher. In the novel low area structure, a new permutation layer is provided for LILLIPUT. The relationship between encryption algorithm and key scheduling algorithm is utilized to achieve optimal sharing among components, which significantly reduces hardware area. The experimental results show that the number of XOR gates and S‐boxes required for low area optimization is reduced by 52 and 8, respectively. The total area is reduced by about 18%. For high throughput structure, this paper provides 2‐round, 5‐round, and 15‐round loop unrolling designs for LILLIPUT to improve throughput. The experimental results show that the throughput of the 5‐round loop unrolling structure reaches a good level, which is relatively the most cost‐effective. In practical application, ciphers can be unrolled implementations according to the needs of devices to improve the execution speed, which can greatly reduce the execution time and complexity of the algorithm. [ABSTRACT FROM AUTHOR]

Lightweight cryptographic algorithms like Speck, which are a family of block ciphers developed by the US National Security Agency (NSA), have become popular because of their efficient performance and small operational size. This paper introduces the execution on a parallel multi-core processor of the optimized version of the Speck cipher. However, this proposition fulfils the increased demand for developing quick and ultra-lightweight ciphers. In this work, this is addressed by optimizing the speck128/128 cipher by reducing its number of rounds to five. The optimization is accomplished by adding the dynamic substitution layer to increase the randomness of the cipher, which allows us to reduce the speck rounds. We conducted tests such as statistical, randomness, and cryptanalysis tests for linear and differential attacks on the optimized speck. The security results show that the optimized speck overcomes the original speck security level. The conducted experiments show that the new version of the speck runs faster than the original one in terms of execution time and throughput. The parallel execution over a multicore processor is applied, and its speedup ratio is equal to 2.64 when it's compared to the parallel execution of the original speck. Different message sizes and thread configurations are used in this work. The sequential execution of both speck ciphers is computed in terms of execution time and throughput, and the acceleration ratio of the optimized speck in this case is equal to 2.63. [ABSTRACT FROM AUTHOR]

More recently, computing storage systems have started implementing an erasure code approach in storing big data due to its many advantages such as reducing storage cost, providing fault tolerance, and reliability. However, many challenges and open issues associated with the use of a code erasure approach in cloud and fog computing environments have arisen. Different methods and techniques for solving these challenges have been presented by many recent studies, however, there are still shortcomings in comprehensive surveys. Therefore, this paper attempts to present a survey of the most important studies in the last five years and discuss the solutions and future trends in this field, in addition to providing a classification of these solutions according to the main research challenges and comparative analysis of the proposed solutions with respect to objectives, environments, tools, and codes used. The ultimate goal of this paper is to provide a summary for researchers for the development of more future work. [ABSTRACT FROM AUTHOR]

With the advent of cloud computing, secured data deduplication has gained a lot of popularity. Many techniques have been pro-posed in the literature of this ongoing research area. Among these techniques, the Message Locked Encryption (MLE) scheme is often mentioned. Researchers have introduced MLE based protocols which provide secured deduplication of data, where the data is generally in text form. As a result, multimedia data such as images and video, which are larger in size compared to text files, have not been given much attention. Applying secured data deduplication to such data files could significantly reduce the cost and space required for their storage. In this paper we present a secure deduplication scheme for near identical (NI) images using the Dual Integrity Convergent Encryption (DICE) protocol, which is a variant of the MLE based scheme. In the proposed scheme, an image is decomposed into blocks and the DICE protocol is applied on each block separately rather than on the entire image. As a result, the blocks that are common between two or more NI images are stored only once at the cloud. We provide detailed analyses on the theoretical, experimental and security aspects of the proposed scheme. [ABSTRACT FROM AUTHOR]

In cryptography, a mode of operation is the way of processing plaintext and encrypted text blocks within a block cipher algorithm, or it is the presentation of a method of chaining blocks in a block cipher. Several models exist with their strengths, some are more vulnerable than others, and some combine authentication and security concepts. In this paper, a new mode of operation is proposed, inspired by the braid of long hair which we call mode CBLCH (Cipher Braided Long Hair Chaining). The HILL cipher will be used to validate it and to compare it with ECB (Electronic Code-Book: code dictionary) and CBC mode (Cipher Block Chaining: sequence of blocks) by the influence of a pixel change on the plaint-image and the encrypted image. [ABSTRACT FROM AUTHOR]

With the rapid evolvement of cryptanalysis, attacks with multiple distinguishers have emerged gradually. Many new cryptanalytic methods such as multiple differential cryptanalysis, multiple linear cryptanalysis, multiple impossible differential cryptanalysis, multidimensional zero correlation linear cryptanalysis have been proposed, which have greatly enhanced the efficiency of corresponding attacks. During these attacks, discovering more distinguishers has always been a trivial and manual work. Many cryptographers use their expertise and experience to achieve this goal. However, in most cases, either the length of the attack or the number of distinguishers is underestimated. This paper proposes a generic method to discover more different distinguishers based on a new property called "weak rotational property". Block ciphers with this property can easily discover more distinguishers such as truncated differential distinguishers, impossible differential distinguishers and zero correlation linear distinguishers in a theoretical approach. Then the number of equivalent distinguishers is proved in a mathematical form. As an application, this paper focuses on SIMON family ciphers to illustrate how this property improves cryptanalysis. For the section of application, first of all, SIMON family ciphers are proved to have weak rotational property. Thus the number of corresponding discovered distinguishers can be increased for SIMON. Then, some earlier observations on SIMON are extended accordingly to this new property. Finally, based on the idea of weak rotational property and equivalent-subkey technique, an improved impossible differential cryptanalysis on SIMON is proposed. For SIMON32(64)/SIMON128(128)/SIMON128(192), the rounds attacked are all extended by one round. For other variants of SIMON, current best non full codebook impossible differential attacks are derived. The successful application of weak rotational property indicates its potential in cryptanalysis. [ABSTRACT FROM AUTHOR]

Many organizations have insisted on protecting the cloud server from the outside, although the risks of attacking the cloud server are mostly from the inside. There are many algorithms designed to protect the cloud server from attacks that have been able to protect the cloud server attacks. Still, the attackers have designed even better mechanisms to break these security algorithms. Cloud cryptography is the best data protection algorithm that exchanges data between authentic users. In this article, one symmetric cryptography algorithm will be designed to secure cloud server data, used to send and receive cloud server data securely. A double encryption algorithm will be implemented to send data in a secure format. First, the XOR function will be applied to plain text, and then salt technique will be used. Finally, a reversing mechanism will be implemented on that data to provide more data security. To decrypt data, the cipher text will be reversed, salt will be removed, andXORwill be implemented. At the end of the paper, the proposed algorithm will be compared with other algorithms, and it will conclude how much better the existing algorithm is than other algorithms. [ABSTRACT FROM AUTHOR]

Public key cryptosystems came into force because of the problems associated with symmetric encryption. Plaintext, encryption algorithm, public and private key, decryption algorithm and ciphertext are five components of a public key cryptosystem. The more likely way for the world to be destroyed. Most experts agree is by accident. There is where we come in; we are computer professional: we cause accidents, by Nathaniel Borenstein [ABSTRACT FROM AUTHOR]

This paper proposes an image encryption algorithm based on combined 1D chaotic maps. First, a permutation technique was applied. It was then reorganized into 1D matrices along the rows and columns respectively, which were then shuffled by computing the substituted position indices to obtain the scrambled image. Subsequently, a method of confusion of the scrambled image was used through another generated data map, combined with random sub‐matrices for diffusion, then resulting in an encrypted image. Finally, the proposed cryptosystem was implemented in a single kernel platform developed using the Nios II Software Build Tools processor for Eclipse. A hardware architecture was designed using the Qsys‐built tool which is available in the Quartus II 13.0sp1 environment. The developed single‐core system was implemented using the Cyclone IV EP4CE6E22C8. Robustness evaluation of the cryptosystem was performed through security analysis tests such as histogram analysis, correlation coefficient, differential analysis, and key space analysis to prove that it is of good quality, efficient, fast, and successfully resisting brute force attacks. The hardware performance analysis was also carried out. Then the cryptosystem is compared with those in the literature both in the hardware and security performance aspects. [ABSTRACT FROM AUTHOR]

Researchers have created cryptography algorithms that encrypt data using a public or private key to secure it from intruders. It is insufficient to protect the data by using such a key. No research article has identified an algorithm capable of protecting both the data and the associated key, nor has any mechanism been developed to determine whether access to the data is permissible or impermissible based on the authentication of the key. This paper presents a WEDEx-Kerberotic Framework for data protection, in which a user-defined key is firstly converted to a cipher key using the "Secure Words on Joining Key (SWJK)" algorithm. Subsequently, a WEDEx-Kerberotic encryption mechanism is created to protect the data by encrypting it with the cipher key. The first reason for making the WEDEx-Kerberotic Framework is to convert the user-defined key into a key that has nothing to do with the original key, and the length of the cipher key is much shorter than the original key. The second reason is that each ciphertext and key value are interlinked. When an intruder utilizes the snatching mechanism to obtain data, the attacker obtains data or a key unrelated to the original data. No matter how efficient the algorithm is, an attacker cannot access the data when these methods and algorithms are used to protect it. Finally, the proposed algorithm is compared to the previous approaches to determine the uniqueness of the algorithm and assess its superiority to the previous algorithms. [ABSTRACT FROM AUTHOR]

Smartphones, digital cameras, and other imaging devices generate vast amounts of high-resolution colored images daily, stored on devices equipped with multi-core central processing units or on the cloud. Safeguarding these images from potential attackers has become a pressing concern. This paper introduces a set of six innovative image ciphers designed to be stronger, faster, and more efficient. Three of these algorithms incorporate the State-Based Tent Map (SBTM) Chaotic Pseudo Random Number Generator (CPRNG), while the remaining three employ a proposed modified variant, SBTMPi. The Grayscale Image Cipher (GIC), Colored Image Cipher Single-Thread RGB (CIC1), and Colored Image Cipher Three-Thread RGB (CIC3) showcase the application of the proposed algorithms. By incorporating novel techniques in the confusion and diffusion phases, these ciphers demonstrate remarkable performance, particularly with large colored images. The study underscores the potential of SBTM-based image ciphers, contributing to the advancement of secure image encryption techniques with robust random number generation capabilities. [ABSTRACT FROM AUTHOR]

In this paper we propose the first efficient quantum version of key-recovery attacks on block ciphers based on impossible differentials, which was left as an open problem in previous work. These attacks work in two phases. First, a large number of differential pairs are collected, by solving a limited birthday problem with the attacked block cipher considered as a black box. Second, these pairs are filtered with respect to partial key candidates. We show how to translate the pair filtering step into a quantum procedure, and provide a complete analysis of its complexity. If the path of the attack can be properly reoptimized, this procedure can reach a significant speedup with respect to classical attacks. We provide two applications on SKINNY-128-256 and AES-192/256. These results do not threaten the security of these ciphers but allow us to better understand their (post-quantum) security margin. [ABSTRACT FROM AUTHOR]

This paper utilizes Rapaille's (2006) concept of culture codes and Hall's (2001) encoding and decoding model of communication to identify the culture codes of scientific concepts in global scientific online discourse. As an example, we attempted to identify the culture codes of the concept of "image", because this concept can be interpreted in different ways in Russian and international scientific discourse. To identify these codes, we analyzed the interpretations of the concept of "image" in scientific online discourse in Russia and abroad. We studied the titles, key words, and abstracts of papers published in 2014–2018 that appeared in the Russian Science Citation Index (RSCI) and the Scopus abstract and citation database. As a result, we identified the culture codes of the concept of "image" in Russian and international scientific online discourse and compared the culture codes of RSCI-indexed and Scopus-indexed papers. The method we utilized may be used for revealing the culture codes of any scientific concept (using any citation database), which can contribute to revealing and understanding the interpretations of these concepts by researchers from different countries. [ABSTRACT FROM AUTHOR]

The paper is devoted to the problem of erasure coding in distributed storage. We consider a model of storage that assumes that nodes are organized into equally sized groups, called racks, that within each group the nodes can communicate freely without taxing the system bandwidth, and that the only information transmission that counts is the one between the racks. This assumption implies that the nodes within each of the racks can collaborate before providing information to the failed node. The main emphasis of the paper is on code construction for this storage model. We present an explicit family of maximum distance separable (MDS) array codes that support recovery of a single failed node from any number of helper racks using the minimum possible amount of inter-rack communication(such codes are said to provide optimal repair). The codes are constructed over finite fields of size comparable to the code length. We also derive a bound on the number of symbols accessed at helper nodes for the purposes of repair, and construct a code family that approaches this bound, while still maintaining the optimal repair property. Finally, we present a construction of scalar Reed-Solomon codes that support optimal repair for the rack-oriented storage model. [ABSTRACT FROM AUTHOR]

This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for subspace codes. A conjecture from 2009 provides an upper bound for the dimension of a rank-metric code with given specified Ferrers diagram shape and rank distance. While the conjecture in its generality is wide open, several cases have been established in the literature. This paper contributes further cases of Ferrers diagrams and ranks for which the conjecture holds true. In addition, the proportion of maximal Ferrers diagram codes within the space of all rank-metric codes with the same shape and dimension is investigated. Special attention is being paid to MRD codes. It is shown that for growing field size the limiting proportion depends highly on the Ferrers diagram. For instance, for $[m\times 2]$ -MRD codes with rank 2 this limiting proportion is close to $1/e$. [ABSTRACT FROM AUTHOR]

There has been much recent interest in private information retrieval (PIR) in models where a database is stored across several servers using coding techniques from distributed storage, rather than being a simply replicated. In particular, a recent breakthrough result of Fazelli, Vardy, and Yaakobi introduces the notion of a PIR code and a PIR array code, and uses this notion to produce efficient PIR protocols. In this paper, we are interested in designing PIR array codes. We consider the case when we have $m$ servers, with each server storing a fraction $(1/s)$ of the bits of the database; here $s$ is a fixed rational number with $s > 1$. A PIR array code with the $k$ -PIR property enables a $k$ -server PIR protocol (with $k\leq m$) to be emulated on $m$ servers, with the overall storage requirements of the protocol being reduced. The communication complexity of a PIR protocol reduces as $k$ grows, so the virtual server rate, defined to be $k/m$ , is an important parameter. We study the maximum virtual server rate of a PIR array code with the $k$ -PIR property. We present upper bounds on the achievable virtual server rate, some constructions, and ideas how to obtain the PIR array codes with the highest possible virtual server rate. In particular, we present constructions that asymptotically meet our upper bounds and the exact largest virtual server rate is obtained when $1 < s \leq 2$. A $k$ -PIR code (and similarly a $k$ -PIR array code) is also a locally repairable code with symbol availability $k-1$. Such a code ensures $k$ parallel reads for each information symbol. So the virtual server rate is very closely related to the symbol availability of the code when used as a locally repairable code. The results of this paper are discussed also in this context where subspace codes also have an important role. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem for which lengths a maximum distance separable (MDS) Euclidean self-dual code over $\mathbb {F}_{q}$ exists. This problem is completely solved for the case where $q$ is even. For $q$ is odd, some $q$ -ary MDS Euclidean self-dual codes were obtained in the literature. In this paper, we construct six new classes of $q$ -ary MDS Euclidean self-dual codes by using generalized Reed–Solomon (GRS for short) codes and extended GRS codes. [ABSTRACT FROM AUTHOR]