Search

There are two basic requirements for symmetric encryption algorithms. The first of these is diffusion. The second and most important is confusion. In these algorithms, this requirement is usually met by s-box structures. Therefore, s-box structures must be strong. So, a cryptographically good s-box will make the encryption algorithm difficult to crack. However, obtaining a strong s-box is a rather difficult problem. In this study, Josephus circle logic is used to solve this problem. Initially, with a random s-box structure, the elements are replaced according to their Josephus positions, and the s-box is made stronger. In the proposed algorithm, according to the Josephus logic, the elements that kill each other are replaced and this process continues until one element remains. The last 30 surviving elements are replaced with all elements. In this way, three different s-boxes were obtained. In two of them, the nonlinearity value was 110.5, and in one of them, the nonlinearity value was 110.75. Fixed points in the proposed s-box structures were identified and eliminated. In addition, it has been proven because of the analysis that the obtained s-box structures also meet other cryptographic requirements. In addition to leaving behind most studies in the literature, the proposed method will also provide strong s-box structures for encryption algorithms to be built in the future. [ABSTRACT FROM AUTHOR]

AES is yet one of the prominent cryptographic algorithms of the 21st century with the reputation of excellent performance and reliability. AES revolves around the S-Box, a nonlinear substitutive table that is essential to attain the level of cryptosecurity. In this paper, there are several methods discussed as how to increase AES S-Box functionality with regard to new cryptographic threats and their effectiveness. We detail the consequences of raising S-Box length and size, dynamical S-Box producing, higher nonlinearity, and efficient methods of S-Box calculation by means of hardware and software. Furthermore, it explains the issues with these improvements and how they impact security measures & relevant computations. Here it is possible to state that applying all these modern approaches, it is possible to strengthen the AES S-Box essentially and ensure compliance with present day demands to cryptographic solutions. [ABSTRACT FROM AUTHOR]

The importance of crucial current technical advancements, particularly those centered on the cryptography process such as Cryptographic advanced encryption standard (AES) hardware architectures are gaining momentum with respect to improving the speed and area optimizations. In this paper, we have proposed a novel architecture to implement AES on a reconfigurable hardware i.e., field programmable gate arrays (FPGA). The controller in AES algorithm is responsible to generate the signals to perform operations to generate the 128 bits ciphertext. The proposed controller uses multiplexer and synchronous register-based approach to obtain area and speed efficient on the FPGA hardware. The entire architecture of AES with proposed controller is implemented on Virtex 5, Virtex 6, and Virtex 7series using XilinxISE 14.7 and tested for critical path delay, frequency, slices, efficiency and throughput. It is observed that all the parameters are improved compared to existing architectures achieving the throughput of 32.29, 40.01, and 43.01 Gbps respectively. The key benefit of this approach is the high level of parallelism it displays in a quick and efficient manner. [ABSTRACT FROM AUTHOR]

The increasing reliance on telecommunication technologies across various domains has raised concerns surrounding data security and privacy during transmission. In response to these concerns, this study introduces a different approach to cryptographic algorithm construction, utilizing cellular automata (CA). The idea involves designing an encryption algorithm based on a specific class of one-dimensional CA, incorporating elementary evolution rules specifically constructed to establish a reversible system, thereby enhancing information preservation and security. The encryption process involves forward iteration of the system, while decryption employs backward iteration, both processes being based on the same rule. Classified as a symmetric key cryptosystem within the stream cipher framework, the proposed algorithm was implemented using a Field Programmable Gate Array (FPGA) device (XILINX Spartan3E) at the hardware-level, complemented by software applications developed using the C# programming language. Testing on the experimental findings was conducted to check the efficacy of the proposed algorithm in ensuring information security and randomness, confirming its viability for practical encryption applications. [ABSTRACT FROM AUTHOR]

S-boxes are very important structures for encryption algorithms. For S-boxes to be strong, they should not be as linear as possible. Obtaining an S-box with high nonlinearity is a difficult problem. For this reason, it has attracted the attention of researchers for many years. In this study, cellular automata logic was used to overcome this problem. A chaotic tent map was used for the initial population. Then, in this weak S-box, the elements were replaced with their neighbors, and the nonlinearity value was checked. When this value increased, the S-box was transferred to the next generation. With the proposed algorithm, an S-box structure with a nonlinearity value of 110.5 was obtained. This value surpasses most studies in the literature. In addition, it has been proven because of the analysis that the proposed S-box also provides other performance criteria. [ABSTRACT FROM AUTHOR]

Neuromorphic computing draws inspiration from the brain to design energy-efficient hardware for information processing, enabling highly complex tasks. In neuromorphic computing, chaotic phenomena describe the nonlinear interactions and dynamic behaviors. Chaotic behavior can be utilized in neuromorphic computing to accomplish complex information processing tasks; therefore, studying chaos is crucial. Today, more and more color images are appearing online. However, the generation of numerous images has also brought about a series of security issues. Ensuring the security of images is crucial. We propose a novel fourth-direction hyperchaotic system in this paper. In comparison to low-dimensional chaotic systems, the proposed hyperchaotic system exhibits a higher degree of unpredictability and various dynamic behaviors. The dynamic behaviors include fourth-direction hyperchaos, third-direction hyperchaos, and second-direction hyperchaos. The hyperchaotic system generates chaotic sequences. These chaotic sequences are the foundation of the encryption scheme discussed in this paper. Images are altered by employing methods such as row and column scrambling as well as diffusion. These operations will alter both the pixel values and positions. The proposed encryption scheme has been analyzed through security and application scenario analyses. We perform a security analysis to evaluate the robustness and weaknesses of the encryption scheme. Moreover, we conduct an application scenario analysis to help determine the practical usability and effectiveness of the encryption scheme in real-world situations. These analyses demonstrate the efficiency of the encryption scheme. [ABSTRACT FROM AUTHOR]

For the security concerns of communication data and key in automotive ethernet, an automotive ethernet security communication method based on dynamic keys was innovatively designed. The attack tree model for automotive ethernet security threats was established to analyze the faced security threats. The comprehensive architecture for automotive ethernet security communication methods was constructed to address the threats, and the dynamic key algorithm model was designed to generate implicit dynamic keys. The secure communication method based on dynamic keys was designed to encrypt original data through dynamic keys, and the digests were generated and compared at the receiving end. Communication and network attack processes between domains were simulated using Linux-based systems, I. MX6ULL microcontrollers and Windows devices, and the difference degrees of keys, ciphertexts and plaintexts were compared. The communication process was attacked to analyze the data interactions by Wireshark software. The results show that the proposed method can effectively ensure the key security and the confidentiality, freshness, authenticity and integrity of automotive ethernet data, and it can effectively counter tampering attacks and replaying attacks. [ABSTRACT FROM AUTHOR]

Symmetric encryption approaches are generally used for data encryption. One of the basic requirements for symmetric encryption algorithms to provide security is strong s-box structures. Because s-box is a nonlinear unit in these encryption algorithms and provides the requirement called confusion. In this article, a new technique is developed to produce effective s-boxes like the 16*16 s-box structure used in the AES algorithm. In the proposed method, the sine cosine algorithm (SCA), one of the recently developed optimization algorithms, is used. SCA is a suitable option for generating strong s-boxes because of its strong randomness and ease of implementation. The proposed method first uses a logistic map to generate the initial population. Then, the nonlinearity value is optimized with the help of the sine cosine algorithm. The proposed method reaches the highest nonlinearity value (112) by relocating 126 values in the s-box structure produced initially. Looking at the results, it is seen that the proposed method gives better results than other optimization-based s-box creation methods. This new method has significant potential to improve the security of symmetric encryption algorithms and make data encryption processes stronger. [ABSTRACT FROM AUTHOR]

A critical component of information security is data encryption, and numerous researchers have invented various approaches to encrypt data. This paper presents a novel image encryption approach using the shortest weight first algorithm from graph theory, categorized as a symmetric cipher where the user has much freedom in selecting the keys. Furthermore, this method requires no sophisticated computations and is simple to understand and implement while providing effective protection against cryptographic attacks, such as brute force. The detailed algorithm, analysis, and security implications are also presented. The results firmly set a good base for many real-world applications involving security. [ABSTRACT FROM AUTHOR]

In today's mass communication landscape, security is a paramount concern, notably with the rapid expansion of the Internet of Things (IoT). Various methods aim to bolster IoT communication security, particularly by regulating access between IoT devices and networks. Encrypting data with a shared secret key is crucial, considering the limited capabilities of these devices, demanding a lightweight yet robust control mechanism. While traditional methods like Diffie-Hellman facilitated secure communication, vulnerabilities arose from modular and exponential equations. Our paper proposed a mathematical refinement of the Diffie Hellman (D_H) protocol. By leveraging GF finite fields and multi-order recursive sequences, this enhanced method aims to fortify confidentiality and complexity in exchanged keys, enabling secure data transmission while remaining efficient for resource restricted IoT devices. Validation using the Affine encryption method demonstrates considerable improvements in complexity, security, and speed. Incorporating Galois field (GF) and third-order sequencing enhances secrecy and complexity, ensuring swift computational processes. [ABSTRACT FROM AUTHOR]

Mixnets are an instrument to achieve anonymity. They are generally a sequence of servers that apply a cryptographic process and a permutation to a batch of user messages. Most use asymmetric cryptography, with the high computational cost that this entails. The main objective of this study is to reduce delay in mixnet nodes. In this sense, this paper presents a new scheme that is based only on symmetric cryptography. The novelty of this scheme is the use of binary graphs built by mixnet nodes. The root node collects user keys and labels without knowing their owners. After feeding each node by its graph, they can establish a random permutation and relate their keys to the incoming batch positions through labels. The differences with previous symmetric schemes are that users do not need long headers and nodes avoid the searching process. The outcomes are security and efficiency improvements. As far as we know, it is the fastest mixnet system. Therefore, it is appropriate for high-throughput applications like national polls (many users) or debates (many messages). [ABSTRACT FROM AUTHOR]

Untrusted servers are servers or storage entities lacking complete trust from the data owner or users. This characterization implies that the server hosting encrypted data may not enjoy full trust from data owners or users, stemming from apprehensions related to potential security breaches, unauthorized access, or other security risks. The security of searchable encryption has been put into question by several recent attacks. Currently, users can search for encrypted documents on untrusted cloud servers using searchable symmetric encryption (SSE). This study delves deeply into two pivotal concepts of privacy within dynamic searchable symmetric encryption (DSSE) schemes: forward privacy and backward privacy. The former serves as a safeguard against the linkage of recently added documents to previously conducted search queries, whereas the latter guarantees the irretrievability of deleted documents in subsequent search inquiries. However, the provision of fine-grained access control is complex in existing multi-user SSE schemes. SSE schemes may also incur high computation costs due to the need for fine-grained access control, and it is essential to support document updates and forward privacy. In response to these issues, this paper suggests a searchable encryption scheme that uses simple primitive tools. We present a multi-user SSE scheme that efficiently controls access to dynamically encrypted documents to resolve these issues, using an innovative approach that readily enhances previous findings. Rather than employing asymmetric encryption as in comparable systems, we harness low-complexity primitive encryption tools and inverted index-based DSSE to handle retrieving encrypted files, resulting in a notably faster system. Furthermore, we ensure heightened security by refreshing the encryption key after each search, meaning that users are unable to conduct subsequent searches with the same key and must obtain a fresh key from the data owner. An experimental evaluation shows that our scheme achieves forward and Type II backward privacy and has much faster search performance than other schemes. Our scheme can be considered secure, as proven in a random oracle model. [ABSTRACT FROM AUTHOR]

The security of cloud databases may be a basic concern for organizations as they store and manage expansive volumes of delicate information within the cloud. Cryptosystems played an essential part in securing information privacy and integrity in these situations. This paper gives an in-depth investigation of the utilization of cryptosystems for cloud database security. The paper starts by talking about the foundation and importance of cloud database security, highlighting the expanding requirement for strong information security measures. A comprehensive study reviewed and investigated the current state of research in this space, distinguishing key progressions and challenges. The paper at that point digs into the execution of cryptosystems in cloud databases, looking at their execution and trade-offs. Besides, rising patterns and advances for improving cloud database security, such as multi-factor confirmation, homomorphic encryption, and blockchain, are discussed. The paper moreover recognizes different inquiries about openings and future headings within the field, counting various encryption methods, execution optimization, key administration, convenience enhancements, compliance contemplations, and integration with rising advances. Furthermore, we proposed encryption software for file protection, the software designed based on symmetric and asymmetric cryptosystems. The proposed software can be adapted for file protection in cloud database security. In conclusion, the paper emphasizes the significance of cryptosystems for cloud database security and underscores the requirement for continuous inquiry about and collaboration to address challenges and drive development in this zone. [ABSTRACT FROM AUTHOR]

This research proposes an efficient hybridized approach for symmetrical encryption of image files in bitmap formats. Due to the heavy use of lightweight encryption in fields such as military and corporate workplaces, intruders try to intercept communication through illegal means and gain access to classified information. This can result in heavy losses if the leaked image data is misused. The proposed enhances the security and efficiency of one of the most used standard symmetric algorithms, Advanced Encryption Standard (AES). In the proposed method, the AES architecture has been modified using a less intensive algorithm, Data Encryption Standard (DES). DES carries a sub-process of permuting data columns rather than the AES’s mixing feature. The proposed algorithm is analyzed using a set of 16 bitmap images of varying memory sizes and resolutions. The effectiveness of the algorithm is evaluated solely in terms of perceptual invisibility as per the main objective of the research.

With the advancement in information and communication technologies (ICTs), the widespread dissemination and sharing of digital images has raised concerns regarding privacy and security. Traditional methods of encrypting images often suffer from limitations such as a small key space and vulnerability to brute-force attacks. To address these issues, this paper proposes a novel eighth-order hyperchaotic system. This hyperchaotic system exhibits various dynamic behaviors, including hyperchaos, sub-hyperchaos, and chaos. The encryption scheme based on this system offers a key space larger than 22338. Through a comprehensive analysis involving histogram analysis, key space analysis, correlation analysis, entropy analysis, key sensitivity analysis, differential attack analysis, and cropping attack analysis, it is demonstrated that the proposed system is capable of resisting statistical attacks, brute force attacks, differential attacks, and cropping attacks, thereby providing excellent security performance. [ABSTRACT FROM AUTHOR]

Nowadays, in order to ensure its confidentiality, it has become necessary to take additional measures during the transfer of information from one place to another through modern network technologies. In the symmetric encryption algorithms developed for this purpose, the sensitive aspect is the secrecy of the information used as a cryptographic key. In this paper, the problem of sending the key to the parties and the solutions proposed for this purpose were analyzed, and information about one-time pads and their features were provided. In this research, an approach for using web pages as a one-time cryptographic key is proposed. At the same time, a method of identifying and agreeing to use web pages and social network posts as cryptographic keys has been developed.

With the rapid development of Internet of Things technology and cloud computing technology, all industries need to outsource massive data to third-party clouds for storage in order to reduce storage and computing costs. Verifiable and dynamic searchable symmetric encryption is a very important cloud security technology, which supports the dynamic update of private data and allows users to perform search operations on the cloud server and verify the legitimacy of the returned results. Therefore, how to realize the dynamic search of encrypted cloud data and the effective verification of the results returned by the cloud server is a key problem to be solved. To solve this problem, we propose a verifiable dynamic encryption scheme (v-PADSSE) based on the public key cryptosystem. In order to achieve efficient and correct data updating, the scheme designs verification information (VI) for each keyword and constructs a verification list (VL) to store it. When dynamic update operations are performed on the cloud data, it is easy to quickly update the security index through obtaining the latest verification information in the VL. The safety and performance evaluation of the v-PADSSE scheme proved that the scheme is safe and effective. [ABSTRACT FROM AUTHOR]

In view of the security problem of embedded device firmware update, this study proposes a multi-check firmware security update scheme based on hash, symmetric and asymmetric encryption algorithms. In this study, the master key pairs, temporary key pairs, shared key and hash chain are designed to protect firmware update from identity authentication, data encryption, integrity check and other aspects, which can effectively prevent illegal users, firmware tampering, firmware data leakage, replay attack, firmware rollback and other attacks. In this study, the concrete implementation of the security update scheme is carried out. The experiment results show that compared with the ISP(In System Programming) and IAP(In Application Pragramming) technologies without any security protection, the scheme achieves the security protection of the whole process of firmware update at the time cost of about 7% and 11%, it provides a safe and reliable update method for embedded device firmware update. [ABSTRACT FROM AUTHOR]

E-healthcare requires communication of patient report to a specialized doctor in a real time scenario. Therefore, any harm to patient medical data can lead to a faulty diagnosis that can be lethal for the patient. Some of the earlier state-of-the-art reversible data hiding methods make use of prediction for embedding data reversibly. To ensure secure and safe communication in encrypted domain, predictors has attained an extraordinary consideration from the research community nowadays. This paper presents an enhanced reversible data hiding method that gives a high embedding capacity by embedding m, ( m ≥ 1 ) binary bits of electronic patient information (EPI) at embeddable pixels of cover image respectively. In addition to EPI, a fragile watermark has been embedded for observing any tamper to the patient data during transmission phase. In proposed method, deep neural network is used for prediction and data is embedded through generalized prediction error expansion scheme. Through combination of stream ciphers and logistic map, proposed method generated encrypted stego image to improve resistance against various attacks such as cipher-only attack and differential attack respectively. The experimental study reveals that for all types of test images, proposed method has an embedding capacity nearly twice larger than the compared methods, at receiver end precisely recover EPI (Bit Error Rate value is zero) with a PSNR value of ∞ dB between the cover image and reconstructed image successfully. For all test images, the proposed method altogether beat all the compared methods in its ability to embed secret information and precisely recover it with maintaining the visual quality of stego images too. [ABSTRACT FROM AUTHOR]

As the IoT paradigm is expanding year by year with different evolving technologies to connect to more and more uniquely distinguishable devices/end nodes. These devices are resource constrained and work under small envelop of power and memory. The encryption algorithms deployed on these devices have to be lightweight with lesser computational complexity. The conventional cryptographic primitives for encryption such AES, triple DES and many more are not suitable for providing the encryption with the desired performance for emerging technologies such as Automotive security, blockchain and health care which work on constrained environments. Security of the data instilled at the end node in these areas gives serious concern to threats arising, as the end nodes are connected to internet. The security primitives deployed on the end nodes should be lightweight in terms of the footprint and power with better performance efficiency. This work aims in providing confidentiality i.e. encryption with the ISO/IEC 29192 standard of lightweight cryptography for confidentiality i.e PRESENT80/128. In this work, we propose an improved architecture of the above algorithm and realize the same on target FPGA boards. This works reports reduced area and improved performance for the algorithm PRESENT-80/128 with reported works on target FPGA boards. The proposed PRESENT-80/128 algorithm for encrypting a 64-bit block size achieves a maximum operating frequency of 650Mhz on Kintex-7 FPGA board. [ABSTRACT FROM AUTHOR]

The International Data Encryption Algorithm (IDEA) is a symmetric block cipher developed in 1991 by Xuejia Lai and James Massey. This algorithm operates on 64-bit blocks using a 128-bit key and is known for its high resistance to cryptographic attacks. IDEA is based on a combination of mathematical operations-modular addition, modular multiplication and XOR-which are applied over 8.5 processing rounds. These operations allow even minute variations in the input data or key to generate significantly different results, resulting in robust cryptographic security. The structure of the algorithm follows a modified Feistel scheme, where the data block is split into parts, processed through several rounds of transformation, and re-combined to form the final cipher block. In addition, the generation of subkeys from the main key adds an extra layer of security. IDEA's success in cryptography is reflected in its implementation in critical applications, such as PGP (Pretty Good Privacy), where it is used to encrypt emails and secure electronic communications. Over the years, IDEA has proven effective against attacks such as differential and linear cryptanalysis, making it a secure option for data protection. Although new algorithms have emerged over time that have displaced IDEA in some applications, its design remains relevant and studied in modern cryptography. This article provides a detailed overview of IDEA's operation, its structure and its importance in the field of information security, highlighting its ability to provide secure and efficient encryption in a wide range of contexts. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) are increasingly used in a wide variety of settings, including defence, industry, healthcare, and education. Hundreds or even thousands of sensor nodes are spread out across a given area and linked to a central Base Station (BS) in order to keep tabs on the environment. The BS then sends the data out to the users over the internet. The sensor network's adaptability, portability, dependability, and quickness are driving its widespread use across industries. The suggested SHS evaluates the efficiency of well-established symmetric algorithms to see where it stands in the spectrum of security. The Blowfish encryption algorithm was proven to require the least amount of processing power after extensive benchmarking. Therefore, the Blowfish algorithm is selected to protect sensitive medical information. The medical database receives the encrypted health records. Only those with proper permissions should be able to access them. Therefore, the CP-ABE is implemented to regulate access to patient records. The SHS's results on the dataset are compared to those of other existing systems. With SHS, health data may be transmitted to doctors rapidly and securely because it requires less computing time and energy. In addition to these benefits, SHS also offers privacy, authentication, and authorization. [ABSTRACT FROM AUTHOR]

This paper contains an in-depth investigation into a modularized and parameterized AES implementation with options for the addition of many different AES optimizations. This implementation takes advantage of the low complexity and high malleability of the AES standard's hardware implementation and its ability to integrate with different block modes of operation. Through investigation of the various available optimizations and implementation methodologies, a high frequency, low power, and low area AES implementation is presented. Results are delivered in an SoC 90nm technology using a combination of multiple industry-standard tools. Results compare the different optimizations and Power, Performance, and Area (PPA) compromises available to AES hardware as well as different options for implementation configuration. This work also presents a new design optimization for AES that provides a significant decrease in the critical path of the hardware design of the operation. In addition to this, this work presents a pipelined architecture which utilizes the optimized AES core to obtain a high throughput. [ABSTRACT FROM AUTHOR]

With the characteristics of large space-time and satellite-ground network integration, the space integrated ground network has attracted much attention.Satellites can not only be used as emergency communication supplements, but also serve as air stations to expand the coverage of terrestrial networks, occupying an important position in both military and civilian scenarios.The entity authentication and key negotiation mechanism can prevent the malicious entities from joining the integrated network to steal users’ privacy, and guarantee network information security.In view of the characteristics of the high satellite-ground transmission delays, exposed links, limited processing capability and dynamic topology of the integrated network, a lightweight authentication scheme between satellites and ground suitable for double-layer satellite network was proposed to achieve a secure satellite networking architecture with session keys to protect data transmission.The scheme was based on symmetric cryptographic system, using lightweight cryptographic algorithms and introducing group key and hierarchical management mechanisms.The proposed scheme included three parts: inter-satellite authentication for geostationary earth orbit satellites, layer and inter-satellite authentication for same low earth orbit, and inter-satellite authentication for adjacent low earth orbit satellites.The group key and hierarchical management mechanism improved the efficiency of inter-group information transfer, reduced the authentication pressure on the ground control center, and enhanced the authentication security strength by realizing double verification in the three-entities authentication protocol.Different from the previous single scene authentication, the proposed authentication protocol took the form of multiplexing authentication parameters, which can realize the authentication requirements of dual scenes in one process.The results of Scyther, a protocol formal security simulation tool, show that the proposed scheme achieves secure access authentication.Compared with existing protocols, the proposed scheme improves authentication security and reduces communication and computational overhead.

Aimed at the problems in continuous crowd sensing,such as the increased privacy requirements,the unreliable perception data collected and the low enthusiasm of users to participate,this paper proposes an incentive mechanism based on symmetric encryption and double-layer truth discovery(SDIM).First,the symmetric encryption algorithm is used to protect the privacy of the perceived data.When the privacy requirements are high and the number of perceptions is large,the computing overhead and the time of data encryption and reward computing will be greatly reduced.Second,based on a double-layer truth discovery model,an incentive mechanism supporting data reliability evaluation is proposed.The purpose is to simultaneously realize the real time reward of continuous crowd sensing,and improve the fairness of reward when the participants have malicious behavior.Finally,the dual privacy analysis of the proposed method is illustrated.The simulation results show that the proposed method can effectively calculate the true value and the reward according to the data reliability.Notably,it is obviously superior to the comparative model in the time of data encryption and reward computing,and can calculate the reward more fairly when the participants have malicious behavior.

In photonic computing, the quantum systems consist of coherent states and squeezed coherent states. Common quantum gates found in these systems are: phase shift, displacement, and squeezing gates. These gates are all unitary and reversible. Outside of quantum systems, coherent states also plays a significant role in coherent optical communications with speeds of hundreds of gigabits per second. Secure optical communications is generally implemented at the data layer with classical symmetric encryption such as Advanced Standard Encryption or AES. This inevitably allows any wiretapping to capture the transmitted data either in the plaintext mode or in the encrypted ciphertext mode in the optical infrastructure. The recent and rapid developments in Quantum computing further lift up the need for quantum secure communications in the optical infrastructure. This paper proposes a novel quantum encryption in the coherent optical domain utilizing a displacement operator and implementing with IQ-MZM optical modules, called Quantum Encryption in Phase Space or QEPS. The communication peers share a secret used to seed cryptographic pseudo random number generators to produce a synchronized random number at both the transmitter and receiver. The synchronized random numbers are used to establish displacement operators to encrypt the coherent states at the transmission and decrypt the cipher coherent states at the receiver. Therefore, malicious parties tapping along the fibre line would not extract the message in transit from optical domain due to a high Bit Error Rate or BER. The optimal displacement operator is split into a standard 16-QAM and a random phase shift operator to enhance the transmission security. We analysis the transmission security with the wiretap channel model for semantic security. We have simulated the QEPS encryption and decryption for two data modulation schemes: QPSK and 16-QAM over 80 km for transmission speeds of 56 Gbps for QPSK and 112 Gbps for 16-QAM. [ABSTRACT FROM AUTHOR]

Cryptosystems employing a synchronous binary-additive stream cipher are susceptible to a generic attack called 'bit-flipping', in which the ciphertext is modified to decrypt into a fraudulent message. While authenticated encryption and message authentication codes can effectively negate this attack, encryption modes can also provide partial protection against bit-flipping. PudgyTurtle is a stream-cipher mode which uses keystream to encode (via an error-correcting code) and to encipher (via modulo-2 addition). Here, we describe the behavior of this mode during bit-flipping attacks and demonstrate how it creates uncertainty about the number, positions, and identities of decrypted bits that will be affected. [ABSTRACT FROM AUTHOR]

Modern text encryption is mostly based on symmetric encryption. Its efficient and safe encryption method greatly improves the application of intelligent transportation system (ITS), and effectively solves the security problems in data communication and sharing. In symmetric encryption, the stream cipher uses the key stream generated by the key to encrypt the message. Due to the simple implementation and fast encryption and decryption speed, the efficiency of this method is generally higher than other symmetric encryption methods. And because of its one-time pad feature, stream ciphers can effectively resist chosen plaintext attacks. In this paper, a new stream cipher encryption algorithm is proposed, which alternately encrypts plaintext using ratio of the circumference of a circle to its diameter (PI), which can effectively prevent fast correlation attacks. More importantly, as an irrational number, PI not only has good random number characteristics, but also can be quickly generated mathematically, and has stronger security and lighter efficiency performance than existing algorithms. In addition, in terms of speed, each round of iteration produces twice the number of bits than the previous round, which makes the iterative complexity of the proposed scheme lower than the linear growth complexity. On this basis, by using linear feedback shift registers (LFSR), our method conforms to the characteristics of light weight, fast transmission and robust security, which is very suitable for ITS applications. [ABSTRACT FROM AUTHOR]

Featured Application: The algorithm can be used to develop cryptographic protection for data transmission in front and back-end systems. As the algorithm does not require key distribution, it also has applications in the distributed domain. This paper provides a systematic analysis of existing resource platforms, evaluating their advantages and drawbacks with respect to data privacy protection. To address the privacy and security risks associated with resource platform data, we propose a novel privacy protection algorithm based on chunking disorder. Our algorithm exchanges data within a specific range of chunk size for the position and combines the chunked data with the MD5 value in a differential way, thus ensuring data privacy. To ensure the security of the algorithm, we also discuss the importance of preventing client and server decompilation during its implementation. The findings of our experiments are as follows. Our proposed privacy-preserving algorithm is extremely secure and easy to implement. Our algorithm has a significant avalanche effect, maintaining values of 0.61–0.85, with information entropy being maintained at 4.5–4.9. This indicates that our algorithm is highly efficient without compromising data security. Furthermore, our algorithm has strong encryption and decryption time stability. The key length can be up to 594 bits, rendering it challenging to decrypt. Compared with the traditional DES algorithm, our algorithm has better security under the same conditions and approaches the levels of security offered by the AES and RC4 algorithms. [ABSTRACT FROM AUTHOR]

These days a large number of people are suffering from heart diseases on the planet. Therefore in E-healthcare framework a large number of ECG signals as well as patient confidential information will be communicated via the Internet. Any modifications in the ECG signal may conduct a wrong diagnosis by the specialist, which can be deadly for patients. To ensure secure and safe communication in E-healthcare framework, proposed method presents an enhanced reversible data hiding algorithm based on prediction of most significant bit planes (MSB). Proposed method reserved room for embedding patient information before encryption, after data embedding stego signal is encrypted through combination of stream ciphers respectively. The experimental study has performed on MIT-BIH arrythmia database and proposed method achieved average embedding rate of 15.04 bits per sample, at receiver end precisely recover patient information (Bit Error Rate value is zero) with an average percentage residual difference of 0.0415 between the cover and reconstructed ECG signal successfully. [ABSTRACT FROM AUTHOR]

Lattice attacks can compromise the security of encryption algorithms used in blockchain networks, allowing attackers to tamper with transaction records, steal private keys, and execute other forms of attacks. With symmetric encryption, both parties can encrypt and decrypt messages using the same key. Lattice attacks on digital signature algorithms (ECDSA) involve forming a basis and setting a target vector from signatures, then solving the closest vector problem (CVP) or shortest vector problem (SVP) in the generated lattice to obtain the private key. Prior research focused on obtaining leakage information from the signature's random nonce to facilitate a CVP or SVP solution. This study establishes a clear boundary for a successful ECDSA attack and introduces a "double basis" lattice version that expands the boundary or reduces the necessary signatures by nearly half with the same lattice rank. To approach the boundary, a heuristic strategy is employed to shift the target vector in different directions with a feasible step size, using tests on the Trusted Platform Module (TPM) 2.0 ECDSA. The distance from the closest moved target vector to the boundary is reduced by a ratio of 424 to 179 to the minimal length of orthogonal vectors in the formed basis. Experimental results show that moving attempts in two directions with the original basis and 84 signatures take approximately 247.7 s on the experiment computer. [ABSTRACT FROM AUTHOR]

Nowadays, in order to ensure its confidentiality, it has become necessary to take additional measures during the transfer of information from one place to another through modern network technologies. In the symmetric encryption algorithms developed for this purpose, the sensitive aspect is the secrecy of the information used as a cryptographic key. In this paper, the problem of sending the key to the parties and the solutions proposed for this purpose were analyzed, and information about one-time pads and their features were provided. In this research, an approach for using web pages as a one-time cryptographic key is proposed. At the same time, a method of identifying and agreeing to use web pages and social network posts as cryptographic keys has been developed. [ABSTRACT FROM AUTHOR]

Untrusted servers are servers or storage entities lacking complete trust from the data owner or users. This characterization implies that the server hosting encrypted data may not enjoy full trust from data owners or users, stemming from apprehensions related to potential security breaches, unauthorized access, or other security risks. The security of searchable encryption has been put into question by several recent attacks. Currently, users can search for encrypted documents on untrusted cloud servers using searchable symmetric encryption (SSE). This study delves deeply into two pivotal concepts of privacy within dynamic searchable symmetric encryption (DSSE) schemes: forward privacy and backward privacy. The former serves as a safeguard against the linkage of recently added documents to previously conducted search queries, whereas the latter guarantees the irretrievability of deleted documents in subsequent search inquiries. However, the provision of fine-grained access control is complex in existing multi-user SSE schemes. SSE schemes may also incur high computation costs due to the need for fine-grained access control, and it is essential to support document updates and forward privacy. In response to these issues, this paper suggests a searchable encryption scheme that uses simple primitive tools. We present a multi-user SSE scheme that efficiently controls access to dynamically encrypted documents to resolve these issues, using an innovative approach that readily enhances previous findings. Rather than employing asymmetric encryption as in comparable systems, we harness low-complexity primitive encryption tools and inverted index-based DSSE to handle retrieving encrypted files, resulting in a notably faster system. Furthermore, we ensure heightened security by refreshing the encryption key after each search, meaning that users are unable to conduct subsequent searches with the same key and must obtain a fresh key from the data owner. An experimental evaluation shows that our scheme achieves forward and Type II backward privacy and has much faster search performance than other schemes. Our scheme can be considered secure, as proven in a random oracle model.

Mixnets are an instrument to achieve anonymity. They are generally a sequence of servers that apply a cryptographic process and a permutation to a batch of user messages. Most use asymmetric cryptography, with the high computational cost that this entails. The main objective of this study is to reduce delay in mixnet nodes. In this sense, this paper presents a new scheme that is based only on symmetric cryptography. The novelty of this scheme is the use of binary graphs built by mixnet nodes. The root node collects user keys and labels without knowing their owners. After feeding each node by its graph, they can establish a random permutation and relate their keys to the incoming batch positions through labels. The differences with previous symmetric schemes are that users do not need long headers and nodes avoid the searching process. The outcomes are security and efficiency improvements. As far as we know, it is the fastest mixnet system. Therefore, it is appropriate for high-throughput applications like national polls (many users) or debates (many messages).

The theory and application of cellular automata (CA) for a stream cipher-based encryption principle are presented in this study. Certain fundamental transformations are developed based on CA theory regarding decentralized computation for modeling different system's behavior. The changes governing state transitions rely on simple evolution rules, which can easily be translated into functions using logic operators. A class of linear hybrid cellular automata (LHCA) based on rules 90 and 150 is used to implement these functions. Symmetric key systems theory is the foundation of the suggested algorithm. The algorithm functions use the proprieties provided by the LHCA evolution in order to convert plain text into cipher text and vice versa, in each case starting from the same initial state of the system and performing the same number of steps for each operation. Cellular automata's parallel information processing property, in addition to their regular and dynamical structure, makes hardware implementation of such schemes best suited for VLSI implementation. Testing of the proposed algorithm was performed by developing both software and hardware solutions. Hardware implementation of the presented cryptosystem was developed using VHDL hardware description language and a FPGA device (XILINX Spartan3E XC3S500E). Design and software simulations have been carried out using the C# programming language. [ABSTRACT FROM AUTHOR]

We present an implementation of Kuang and Bettenburg's Quantum Permutation Pad (QPP) used to encrypt superposition states. The project was conducted on currently available IBM quantum systems using the Qiskit development kit. This work extends previously reported implementation of QPP used to encrypt basis states and demonstrates that application of the QPP scheme is not limited to the encryption of basis states. For this implementation, a pad of 56 2-qubit Permutation matrices was used, providing 256 bits of entropy for the QPP algorithm. An image of a cat was used as the plaintext for this experiment. The plaintext was randomized using a classical XOR function prior to the state preparation procedure. To create corresponding superposition states, we applied a novel operator defined in this paper. These superposition states were then encrypted using QPP, with 2-qubit Permutation Operators, producing superposition ciphertext states. Due to the lack of a quantum channel, we omitted the transmission and executed the decryption procedure on the same IBM quantum system. If a quantum channel existed, the superposition ciphertext states could be transmitted as qubits, and be directly decrypted on a different quantum system. We provide a brief discussion of the security, although the focus of the paper remains on the implementation. Previously we have demonstrated QPP operating in both classical and quantum computers, offering an interesting opportunity to bridge the security gap between classical and quantum systems. This work broadens the applicability of QPP for the encryption of basis states as well as superposition states. We believe that quantum encryption schemes that are not limited to basis states will be integral to a secure quantum internet, to reduce vulnerabilities introduced by using two separate algorithms for secure communication between a quantum and a classical computer. [ABSTRACT FROM AUTHOR]

With the characteristics of large space-time and satellite-ground network integration, the space integrated ground network has attracted much attention. Satellites can not only be used as emergency communication supplements, but also serve as air stations to expand the coverage of terrestrial networks, occupying an important position in both military and civilian scenarios. The entity authentication and key negotiation mechanism can prevent the malicious entities from joining the integrated network to steal users' privacy, and guarantee network information security. In view of the characteristics of the high satellite-ground transmission delays, exposed links, limited processing capability and dynamic topology of the integrated network, a lightweight authentication scheme between satellites and ground suitable for double-layer satellite network was proposed to achieve a secure satellite networking architecture with session keys to protect data transmission. The scheme was based on symmetric cryptographic system, using lightweight cryptographic algorithms and introducing group key and hierarchical management mechanisms. The proposed scheme included three parts: inter-satellite authentication for geostationary earth orbit satellites, layer and inter-satellite authentication for same low earth orbit, and inter-satellite authentication for adjacent low earth orbit satellites. The group key and hierarchical management mechanism improved the efficiency of inter-group information transfer, reduced the authentication pressure on the ground control center, and enhanced the authentication security strength by realizing double verification in the three-entities authentication protocol. Different from the previous single scene authentication, the proposed authentication protocol took the form of multiplexing authentication parameters, which can realize the authentication requirements of dual scenes in one process. The results of Scyther, a protocol formal security simulation tool, show that the proposed scheme achieves secure access authentication. Compared with existing protocols, the proposed scheme improves authentication security and reduces communication and computational overhead. [ABSTRACT FROM AUTHOR]

This article is made with the purpose to present a hybrid encryption prototype implemented over a grid network, with the intention to demonstrate the security level that is possible to achieve with this way of encryption by means of a messaging application; which will be target to analysis with and without the libraries implementation generated in order to compare the results obtained once it is running, likewise there will perform an analysis process over the prototype proposed for verifying possible points of failures. The prototype was developed based on an architecture capable to share resources and functionalities in order to provide the ability to operate with any system that require the use of them, therefore, the messaging application itself is only a test object that give us information about the capacity of the cypher prototype, and aims to provide a confidence level for its implementation in other communication systems. [ABSTRACT FROM AUTHOR]

The problem of management of the reliable information security is one of the most important problems of our time. The problem of protecting information from unauthorized intervention and external impact is always topical and seriously investigated. A modification of the encryption algorithm related to the symmetric encryption method during the transmission of classified voice information is considered in the paper. A management of the assessment of a level of protection of encrypted classified voice information against cryptographic attacks is investigated by using of calculation of the keys number of encrypted data. This method is based on the rule of reflected sliding encrypted voice information.

Quantum permutation pad or QPP is a quantum-safe symmetric cryptographic algorithm proposed by Kuang and Bettenburg in 2020. The theoretical foundation of QPP leverages the linear algebraic representations of quantum gates which makes QPP realizable in both, quantum and classical systems. By applying the QPP with 64 of 8-bit permutation gates, holding respective entropy of over 100,000 bits, we accomplished quantum random number distributions digitally over today's classical internet. The QPP has also been used to create pseudo quantum random numbers and served as a foundation for quantum-safe lightweight block and streaming ciphers. This paper continues to explore numerous applications of QPP, namely, we present an implementation of QPP as a quantum encryption circuit on today's still noisy quantum computers. With the publicly available 5-qubit IBMQ devices, we demonstrate quantum secure encryption (256 bits of entropy) using 2-qubit QPP with 56 permutation gates, and 3-qubit QPP with 17 permutation gates respectively. Initial qubits of the encryption circuit correspond to the plaintext and after applying quantum encryption operations, cipher qubits are measured with probabilistic distributions, and the results with the highest probability are recorded as cipher bits. The cipher bits are then decrypted with an inverse QPP circuit. The output state plaintext qubits are measured and the most frequent count measurement results are recorded as plaintext bits. This quantum encryption and decryption process clearly demonstrates that QPP quantum implementations works exactly as symmetric encryption and decryption schemes should. The plaintext and ciphertext bits can also be encrypted and decrypted respectively by any classical computing device with the corresponding QPP algorithm as in quantum computers. This work reveals that it is possible to build quantum-secure communications between quantum-to-quantum and quantum-to-classical computers over today's internet and the future quantum internet. [ABSTRACT FROM AUTHOR]

Data has become increasingly popular for advanced digital content transmission. Researchers are concerned about the protection of data. The transmission of digital data over a network has made multimedia data vulnerable to various threats, including unauthorized access and network hacking. As a result, the data must be protected with encryption methods based on symmetric encryption algorithms, which will ensure the data security. The Blowfish encryption algorithm is one of the most well-known cryptographic algorithms. However, each of the current algorithms has its own set of advantages and disadvantages. However, there are several drawbacks to using this algorithm, including complex computational operations, fixed (S-Box) and pattern issues, which can arise while dealing with more complex data, including texts. Many academics have sought to increase the algorithm's efficiency. The modifications to the Blowfish algorithms provided by researchers in prior works are summarized in this publication. [ABSTRACT FROM AUTHOR]

With the advancement in information and communication technologies (ICTs), the widespread dissemination and sharing of digital images has raised concerns regarding privacy and security. Traditional methods of encrypting images often suffer from limitations such as a small key space and vulnerability to brute-force attacks. To address these issues, this paper proposes a novel eighth-order hyperchaotic system. This hyperchaotic system exhibits various dynamic behaviors, including hyperchaos, sub-hyperchaos, and chaos. The encryption scheme based on this system offers a key space larger than 22338. Through a comprehensive analysis involving histogram analysis, key space analysis, correlation analysis, entropy analysis, key sensitivity analysis, differential attack analysis, and cropping attack analysis, it is demonstrated that the proposed system is capable of resisting statistical attacks, brute force attacks, differential attacks, and cropping attacks, thereby providing excellent security performance.

Symmetric cryptography allows faster and more secure communication between two entities using the identical pre-established secret key. However, identifying the honest entity with the same secret key before initiating symmetric encryption is vital since the communication may be impersonated. Tea and Ariffin, in 2014, proposed a new identification (ID) scheme based on the Bivariate Function Hard Problem (BFHP) that proved secure against impersonation under passive, active and concurrent attacks via the BFHP-hardness assumption. In this paper, we upgrade the ID scheme and improve some of its settings. Next, we provide the security proof against impersonation under active and concurrent attacks in the random oracle model via the hardness assumption of the One-More BFHP. Finally, we include an additional discussion about the computational efficiency of the upgraded ID scheme based on BFHP and present its comparison with other selected ID schemes. [ABSTRACT FROM AUTHOR]

Copyright of Dokuz Eylul University Muhendislik Faculty of Engineering Journal of Science & Engineering / Dokuz Eylül Üniversitesi Mühendislik Fakültesi Fen ve Mühendislik Dergisi is the property of Dokuz Eylul Universitesi Muhendislik Fakultesi Fen ve Muhendislik Dergisi and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The traditional Long-Range Wide-Area Network (LoRaWAN) uses an Advanced Encryption Standard (AES) 128 bit symmetric key to secure entities and data against several attacks. However, due to the existence of heterogeneous applications, designing a globally accepted and resilient LoRaWAN security model is challenging. Although several security models to maximize the security efficiency in LoRaWAN exist using the trusted key server to securely manage the keys, designing an optimum LoRaWAN security model is yet to be fully realized. Therefore, in this paper, we proposed two LoRaWAN security algorithms, A and B, for a trusted key management server (TKMS) to securely manage and distribute the keys amongst the entities. Algorithm B is an enhanced version of Algorithm A, which utilizes the security shortcomings of Algorithm A. We employed two formal analysis methods in the modelling, results analysis, and verification. The Scyther security verification tool was used for algorithm modelling and analysis against all possible attacks, while BAN logic was used to prove the logical correctness of the proposed algorithms. The results indicate that BAN logic feasibly proves the model logic correctness and the security claims employed in Scyther are reliable metrics for assessing the algorithms' security efficiency. The security claims proved that the security algorithm is more secure and reliable as no attacks were detected across all entities in the enhanced-Algorithm B, unlike in Algorithm A. Moreover, the application of hashing minimizes computation cost and time for authentication and message integrity as compared to symmetric and asymmetric encryption. However, the proposed algorithm is yet to be verified as completely lightweight. [ABSTRACT FROM AUTHOR]

This paper proposes an approach for pool mining in public blockchain systems based on the employment of a recently reported consensus protocol with the puzzle based on a symmetric encryption that provides an energy–space trade-off and reduces energy consumption. The proposed architecture employs a pseudo-symmetric allocation of the resources for the blockchain consensus protocol and provides protection against certain malicious actions of the pool members, as well as a miner's opportunity for selecting the resources required for participation in the consensus protocol. Given that the considered consensus protocol employs two resources, the proposed architecture uses this two-dimensional nature to provide resistance against block withholding and selfish mining attacks, as well as a reduction in energy spending as a trade-off with the employment of certain memory resources. The high resistance of the proposed pool mining approach against the considered attacks appears to be a consequence of the success probability of the pool in comparison with the success probability of malicious miners. Assuming appropriate selection of the puzzle hardness, the probability that malicious miners can solve the puzzle without the support of the pool manager can be arbitrarily small. Implementation of the proposed approach on a modified Ethereum platform and experimental evaluation issues have also been reported. The conceptual novelty of the proposed pool mining approach is the following: Instead of separation of the blockchain consensus protocol and control of pool miners honest work, this paper proposes an approach where honest work of miners and pool managers is provided by a dedicated application of the considered consensus protocol. Advantages of the proposal in comparison with the previously reported ones include the following: (i) high resistance against block withholding and selfish mining attacks without an additional security procedure; (ii) reduction in the energy required, and at the same time preservationthe security of the consensus protocol; (iii) flexibility of the pool miners regarding selection of the resources that should be employed providing a trade-off between required energy and memory resources. The proposed architecture was implemented employing a dedicated modification of the Ethereum platform and the performed experiments confirmed the feasibility and effectiveness of the proposal. [ABSTRACT FROM AUTHOR]

The proper verification of users plays a vital role during communication over a social network to protect the personal data of users. Multifarious protocols have been implemented to secure the confidential data of the users, but these protocols have various limitations and are incapable of providing secrecy of data against various attacks, such as replay and cryptanalysis attacks. In this article, the authors proposed a novel method for security verification of the social network model using an improved three-party authenticated key exchange (3PAKE) protocol based on symmetric encryption and (ECC) elliptic curve cryptography. The outcome of the paper demonstrates that our proposed algorithm provides the desired secrecy to the confidential data exchange over social networks in real-time and consumes less time in comparison to existing protocols. Our protocol consumes a search time of 0.09 s, overall communication steps took 2 during the verification, and depth plies was 3 along with 20 visited nodes. The 3PAKE protocol has been considered a suitable approach for social network secrecy during information exchange between user and server, thereby providing greater secrecy to the user in data exchange over social networks and more robustness against multifarious known attacks, such as cryptanalysis and replay attacks in real-time. [ABSTRACT FROM AUTHOR]

With the maturity and popularization of the Internet of Things, we saw the emergence of the Internet of Vehicles. This collects and processes real-time traffic information, alleviates traffic congestion, and realizes intelligent transportation. However, sensitive information, such as real-time driving data of vehicles, are transmitted on public channels, which are easily to steal and manipulate for attackers. In addition, vehicle communications are vulnerable to malicious attacks. Therefore, it is essential to design secure and efficient protocols. Many studies have adopted asymmetric cryptosystems and fog computing to in this environment, but most of them do not reflect the advantages of fog nodes, which share the computational burden of cloud servers. Therefore, it is challenging to design a protocol that effectively uses fog nodes. In this paper, we design an authentication protocol based on a symmetric encryption algorithm and fog computing in the Internet of Vehicles. In this protocol, we first propose a four-layer architecture that significantly reduces the computational burden of cloud servers. To resist several well-known attacks, we also apply Intel software guard extensions to our protocol. This is because it can resist privileged insider attacks. We prove the security of the proposed protocol through the Real-Or-Random model and informal analysis. We also compare the performance of the proposed protocol with recent protocols. The results show better security and a lower computational cost. [ABSTRACT FROM AUTHOR]

Mobile Edge Computing (MEC), which is a product of 5G technology development, is actually a kind of edge computing form. It takes the base station as the edge server and sinks the cloud computing services to the network edge. To better protect the users and the base stations, a lightweight authentication and key agreement scheme, which is applicable to the MEC field, is proposed in this paper. It achieves secure and efficient key agreement under the premise that the users and the edge servers are completely anonymous and untraceable. For this scheme, instead of the complicated elliptic curve computation and the bilinear pairing computation, it flexibly adopts a number of temporarily generated symmetric keys to realize the identity authentication of the three parties while guaranteeing both the security and efficiency. Compared with other schemes, it is featured in low performance requirements and can better adapt to MEC environment. [ABSTRACT FROM AUTHOR]