Search

With the development of science and technology and the appearance of various special conditions that cause signers to be unable to sign, proxy signature is gradually becoming a hot spot in cryptography research. This paper combines proxy signature, quantum teleportation, and multi-party verification and proposes a multi-party verifiable quantum proxy signature scheme based on quantum teleportation. This scheme has the following characteristics: The authentication method based on the H a s h function can effectively solve the problem of identity identification among members; in order for the proxy signer to be able to verify the correctness of the proxy authorization, a form of proxy signature authorization that concatenates the identity information of the original signer is used. The security analysis shows that our scheme is unforgeable and undeniable and can resist intercept-resend attacks and cheating attacks. [ABSTRACT FROM AUTHOR]

The article focuses on the 1943 American military operation "Operation Vengeance," which sought to kill Japanese Admiral Isoroku Yamamoto during the Solomon Islands campaign of World War II. The author discusses how Allied codebreaking was in jeopardy because of this mission and examines several published works that reflect on or avoid the event, including "Islands of Destiny," by John Prados, "Operation Vengeance," by Dan Hampton, and "We Killed Yamamoto," by Si Sheppard.

We numerically demonstrate that a pure time-harmonic bias AC current of a specific amplitude τ f and angular frequency ω f can excite the chaotic magnetization dynamics in a Josephson-like antiferromagnetic (AFM) spin Hall oscillator (SHO) with biaxial magnetic anisotropy of an AFM layer. The nature of such a stochastic generation regime in a Josephson-like AFM SHO could be explained by the random hopping of the working point of the SHO between several quasi-stable states under the action of an applied AC current. We reveal that depending on the ω f / τ f ratio several stochastic generation regimes interspersed with regular generation regimes can be achieved in an AFM SHO, which can be used in spintronic random signal sources and various nano-scale random signal devices, including the spintronic p-bit device considered in this work. The obtained results are important for the development and optimization of spintronic devices capable of generating and processing (sub-)THz-frequency random signals, which are promising for ultra-fast probabilistic computing, cryptography, secure communication, etc. [ABSTRACT FROM AUTHOR]

Recently, many image encryption algorithms have been proposed. Part of them failed to pass the cryptanalysis test and were found to be unsecure. Some others were more secure and could resist the known cryptanalysis methods. Many of those recent schemes followed a well-known model that consists of encrypting the image's pixels using a variety of techniques and methods. Many algorithms were claimed to be secure and performant to be used in real applications. This paper investigates this claim by performing a comparative analysis between a chaotic algorithm recently proposed and the standard general purpose AES cryptosystem in a web application context. The experimental tests conducted on both algorithms in this paper proved that the pixel-wise algorithms are not suitable for this kind of applications. [ABSTRACT FROM AUTHOR]

Users of computer networks may benefit from cloud computing, which is a fairly new abstraction that offers features like processing as well as the sharing and storing of data. As a result of the services it provides, cloud computing is drawing significant investments from across the world. Despite this, Cloud Computing Security continues to be one of the most important issues for businesses and consumers that use cloud computing systems. A few of the security flaws that are associated with cloud computing were passed down from earlier computer systems. In contrast, the other flaws were brought about by the distinctive qualities and design of cloud computing. The newly developed platform has measures that restrict data access to just those users who are authorized to do so. Using the user's identification and authentication/authorization information, a third-party service is responsible for managing access to the data. This service checks on all requests. Sensitive information and facts pertaining to users are encrypted both while in transit and while being stored. The platform was put into operation, analysed, and compared to other cloud platforms that were already in existence in terms of how effective it was in comparison to other platforms. When compared to the other security platforms, the findings demonstrated that this platform performed as anticipated in a relatively short amount of time and offered robust protection against the acts of an intruder. [ABSTRACT FROM AUTHOR]

From 1944 the State Department attempted to improve its communications security by creating a Division of Cryptography and mechanising the encryption process. This article assesses the effectiveness of these reforms and shows that State's new cipher equipment had cryptographic vulnerabilities. Moreover, the department was unable to maintain physical security at the Moscow embassy and through espionage and technical surveillance the KGB broke the ciphers and read American communications. The paper concludes by analysing the impact of this security failure, including the claim that intercepted messages influenced Stalin's decision to approve the North Korean invasion of South Korea in 1950. [ABSTRACT FROM AUTHOR]

In the field of Cryptography, Quantum Key Distribution (QKD) is an application of Quantum Information theory that obtained a great deal of attention in recent years. It allows to establish secret keys between two or more parties, in a much safer way than that implemented by classic cryptography (based on discrete logarithms and factorization of prime numbers). The most promising way of realizing a QKD network (especially over great distances) in the near future is by a constellation of satellites. This paper considers the problem of optimizing the orbits of the satellites in order to maximize the minimum key length shared in a network of ground stations over a fixed amount of time. Different networks of stations are considered and the influence of their geographical disposition on the design and the performance index is highlighted. The networks considered are: a global constellation, a regional European constellation, and two in which there are groups of stations in two different narrow bands of latitude. The effect of Inter-satellite links is then taken into account and how, in some cases, they can improve the performances. Finally the daily performance of the considered constellations are analyzed. [ABSTRACT FROM AUTHOR]

In this paper, we develop the theoretical provisions of symmetric cryptographic algorithms based on the polynomial residue number system for the first time. The main feature of the proposed approach is that when reconstructing the polynomial based on the method of undetermined coefficients, multiplication is performed not on the found base numbers but on arbitrarily selected polynomials. The latter, together with pairwise coprime residues of the residue class system, serve as the keys of the cryptographic algorithm. Schemes and examples of the implementation of the developed polynomial symmetric encryption algorithm are presented. The analytical expressions of the cryptographic strength estimation are constructed, and their graphical dependence on the number of modules and polynomial powers is presented. Our studies show that the cryptanalysis of the proposed algorithm requires combinatorial complexity, which leads to an NP-complete problem. [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]

Summary: Communicating large amounts of data requires an encryption solution that ensures fast and secure data transfer. Unfortunately, it faced privacy and security issues, resulting in higher power consumption, data scarcity, energy, diversity, data reliability, low security, and packet loss in the communication process. The goal of this research is to ensure data transfer while conserving energy and protecting data transmission in WSNs. Therefore, this paper proposes a multipath routing protocol using the HGSPSO algorithm, which is a combination of hybrid gravitational search algorithm (HGSA) and particle swarm optimization (PSO), to securely transmit data from one node to another node under public and private key cryptography. The PSO approach is utilized to resolve the energy hole problem by selecting the cluster head in the sink coverage area. The RSA can be employed for data encryption, data decryption, key generation, and sharing. The metrics like acceleration constants and inertial weights are used for the HGSPSO algorithm. The result of this implementation demonstrated that the scheme had a low energy consumption of 36%, a maximum packet delivery ratio (PDR) of 96%, a higher throughput rate of 88%, and a low packet loss of 39%. [ABSTRACT FROM AUTHOR]

Information security holds paramount importance in the contemporary information society. Here, a novel cryptography method is proposed based on the multi‐wavelength complex‐amplitude metasurface, which can achieve a high security level by generating a frequency‐selective key as an additional layer of protection. Moreover, the quality of the decrypted holographic images can be significantly improved by employing the complex‐amplitude encoding method and the modified visual secret sharing scheme, which adopts a new superposition operator to prevent fidelity loss. As a proof‐of‐concept demonstration, a prototype metasurface sample is designed, fabricated, and characterized, where the measured results agree very well with the numerical ones and the design goals. The proposed method can reinforce security level and improve fidelity of the decrypted message, rendering it appealing for applications in communication and anti‐counterfeiting. [ABSTRACT FROM AUTHOR]

We propose a verifiable (t,n)-threshold secret sharing scheme using Lagrange interpolation and secure cryptographic hash functions. This scheme is an improvement of Shao’s scheme [Inform. Sci. 278 (2014) 104–109]. In our variant, verification of shares is achieved through computation of their multiplicative inverses in conjunction with a secure hash function such as SHA-3. This idea results in a significant size reduction, in comparison with Shao’s scheme, to the shares assigned to each participant. Applications of the proposed scheme include sharing of cryptographic keys, access codes, etc. Furthermore, we improve our construction to present a method for secret sharing with adjustable access structure. This can further be extended to a secret sharing scheme with essential participants, where any authorized set of participants must meet a threshold in the number of essential participants it contains. While our proposal has smaller share sizes compared to Shao’s scheme, it also adds the capabilities of changeable parameters and essential participants. [ABSTRACT FROM AUTHOR]

Named Data Networking (NDN) stands out as a prominent architectural framework for the future Internet, aiming to address deficiencies present in IP networks, specifically in the domain of security. Although NDN packets containing requested content are signed with the publisher's signature which establishes data provenance for content, the NDN domain still requires more holistic frameworks that address consumers' identity verification while accessing protected contents or services using producer/publisher-preapproved authentication servers. In response, this paper introduces the NDN One-Time Authentication (NDNOTA) framework, designed to authenticate NDN online services, applications, and data in real time. NDNOTA comprises three fundamental elements: the consumer, producer, and authentication server. Employing a variety of security measures such as single sign-on (SSO), token credentials, certified asymmetric keys, and signed NDN packets, NDNOTA aims to reinforce the security of NDN-based interactions. To assess the effectiveness of the proposed framework, we validate and evaluate its impact on the three core elements in terms of time performance. For example, when accessing authenticated content through the entire NDNOTA process, consumers experience an additional time overhead of 70 milliseconds, making the total process take 83 milliseconds. In contrast, accessing normal content that does not require authentication does not incur this delay. The additional NDNOTA delay is mitigated once the authentication token is generated and stored, resulting in a comparable time frame to unauthenticated content requests. Additionally, obtaining private content through the authentication process requires 10 messages, whereas acquiring public data only requires two messages. [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]

Nowadays, most image steganographic schemes embed secret messages by minimizing a well-designed distortion cost function for the corresponding domain, i.e., the spatial domain for spatial image steganography or the JPEG (Joint Photographic Experts Group) domain for JPEG image steganography. In this paper, we break the boundary between these two types of schemes by establishing a theoretical link between the distortion costs in the spatial domain and those in the JPEG domain and thus propose a scheme for domain transformations of distortion costs for efficient JPEG steganography with symmetric embedding, which can directly convert the spatial distortion cost into its JPEG counterpart. Specifically, by formulating the distortion cost function for JPEG images in the decompressed spatial domain, a closed-form expression for a distortion cost cross-domain transformation is derived theoretically, which precisely characterizes the conversion from the distortion costs obtained by existing spatial steganographic schemes to those applied in JPEG steganography. Experimental results demonstrate that the proposed method outperforms other advanced JPEG steganographic schemes, e.g., JUNIWARD (JPEG steganography with Universal Wavelet Relative Distortion), JMiPOD (JPEG steganography by Minimizing the Power of the Optimal Detector), and DCDT (Distortion Cost Domain Transformation), in resisting the detection of various advanced steganalyzers. [ABSTRACT FROM AUTHOR]

A new generalized definition of Mersenne numbers is proposed of the form a n − a − 1 n , called global generalized Mersenne numbers and noted G M a , n with base a and exponent n positive integers. The properties are investigated for prime n and several theorems on Mersenne numbers regarding their congruence properties are generalized and demonstrated. It is found that for any a, G M a , n − 1 is even and divisible by n, a and a − 1 for any prime n > 2 , and by a a − 1 + 1 for any prime n > 5 . The remaining factor is a function of triangular numbers of a − 1 , specific for each prime n. Four theorems on Mersenne numbers are generalized and four new theorems are demonstrated, showing first that G M a , n ≡ 1 or 7 mod 12 depending on the congruence of a mod 4 ; second, that G M a , n − 1 are divisible by 10 if n ≡ 1 mod 4 and, if n ≡ 3 mod 4 , G M a , n ≡ 1 or 7 or 9 mod 10 , depending on the congruence of a mod 5 ; third, that all factors c i of G M a , n are of the form 2 n f i + 1 such that c i is either prime or the product of primes of the form 2 n j + 1 , with f i , j natural integers; fourth, that for prime n > 2 , all G M a , n are periodically congruent to ± 1 or ± 3 mod 8 depending on the congruence of a mod 8 ; and fifth, that the factors of a composite G M a , n are of the form 2 n f i + 1 with f i ≡ u mod 4 with u = 0 , 1, 2 or 3 depending on the congruences of n mod 4 and of a mod 8 . The potential use of generalized Mersenne primes in cryptography is shortly addressed. [ABSTRACT FROM AUTHOR]

Mainstream research on information theory within the field of living systems involves the application of analytical tools to understand a broad range of life processes. This paper is dedicated to an opposite problem: it explores the information theory and communication engineering methods that have counterparts in the data transmission process by way of DNA structures and neural fibers. Considering the requirements of modern multimedia, transmission methods chosen by nature may be different, suboptimal, or even far from optimal. However, nature is known for rational resource usage, so its methods have a significant advantage: they are proven to be sustainable. Perhaps understanding the engineering aspects of methods of nature can inspire a design of alternative green, stable, and low-cost transmission. [ABSTRACT FROM AUTHOR]

Blockchain applications are gradually receiving wide acceptance as a transformative technology that could potentially bring a reformation in the industry. Blockchain handles sensitive data through cryptography, consensus mechanism, transaction immutability, and peer‐to‐peer network to manage decentralized data features. In addition to ensuring operational efficiency, blockchain development is a complex and challenging process, which warrants further exploration. In an attempt to reduce the complexity of the development, various software methodologies have been introduced to support the development of blockchain applications systematically. It has been found that those methodologies introduced structured processes that are not suitable for software models. Moreover, all models are generic and do not take into blockchain concept as first‐class entities. Hence, there is a gap in extending and transforming the current blockchain modeling and practices when developing a blockchain application. This paper introduces a new insight and innovative methodology for blockchain‐based application development through extended agent‐oriented modeling (eAOM) to discover blockchain opportunities and contribute to the growth of the technology. With eAOM, the blockchain modeling processes start with requirement elicitation, computation independent modeling, early identification of blockchain use case, platform independent modeling, and platform specific model. A walkthrough example of a blockchain application, "win a fortune games" has showcased the feasibility of eAOM in modeling blockchain enabling application development in a systematic manner. A usability analysis is conducted among novice students to test the usability of eAOM versus original AOM in modeling blockchain application development. From the findings, 44% of the students managed to capture more than 80% of blockchain requirements through eAOM. On the other hand, 51% of the students scored between 20% and 60% of the blockchain requirement, and only 5% of the students failed to model blockchain requirements through eAOM. The results reveal the usage of the eAOM to model blockchain‐enabled application comprehensively. [ABSTRACT FROM AUTHOR]

The smart healthcare system is one of the Internet of Things‐based applications that are increasingly used nowadays. One of the requirements of this system is privacy‐preserving, which should protect the disclosure of the patient record contents. In the present paper, a combination of chaotic functions and a new DNA‐based steganography method, and image blocking are suggested to protect patients' privacy‐preserving. First, the image is blocked, and the initial key for the chaotic function will be gained by using the centers of the blocks. Then the data and image are transformed into DNA sequences. Finally, one of the randomly chosen DNA strands of data is XOR with the center of one randomly selected block and will be placed in one of the block pixels. The failure to send the initial key separately to generate random numbers, as well as the random selection of secret data bits and image pixels for steganography has increased the security of the proposed method. The simulation results not only indicate the quality of the stego‐image but also show better performance of the proposed method than the existing methods. [ABSTRACT FROM AUTHOR]

In the past two decades, we have seen the proliferation of Internet and its applications. The information exchange happens via images, videos, texts, audio clips, etc. Medical experts use images as the most common form of information exchange such as X-rays, MRI scans, CT scans, etc. These scanned images contain confidential information about a patient. With images being the most attractive mode for medical information exchange, it becomes the target of many security attacks. Many researchers have put out their best efforts to protect the images from these attacks by proposing several techniques. Despite all efforts, many cryptosystems still compromise with one or more key attributes like efficiency or time required for them to be top-notch. Along with an appreciation of work, careful inspection is also required that can influence the future work and make them better. Hence, this survey aims to summarize and analyze the existing chaos-based medical image encryption techniques introduced in the last five years. The paper starts with a brief introduction about the basic chaos maps, security parameters, and then, progresses to analysis of the encryption algorithms based on categories followed by comparative study and open security issues. [ABSTRACT FROM AUTHOR]

In Eurocrypt'96, the concept of Designated Verifier Signature was proposed. Such signatures can only be verified by a single designated verifier specified during signature creation. However, there exist situations in which the signer, as well as the designated verifier, should be equipped with the ability to check the validity of the signature. At the same time, either of them should be able to help third parties to verify the signature. This is achieved by Directed Signature Schemes. In this paper, we consider directed signatures in the certificateless cryptography setting and propose an efficient pairing-free certificateless directed signature (CLDS) scheme. Then, we prove that the proposed CLDS scheme meets the needed security requirements in the random oracle model and under the assumption of the hardness of discrete logarithm and Gap Diffie-Hellman problems. We also compare the proposed scheme with the related ones to indicate the overall superiority of the proposed CLDS scheme. [ABSTRACT FROM AUTHOR]

The diffused bit generator (DBG) is an entropy generator that generates a stream of random bits. DBG is realized using a linear feedback shift register (LFSR) and cellular automata (CA). LFSR and CA are realized using flip-flops and XOR gates. The flip-flops required are designed using true single-phase clock (TSPC)-based logic to minimize the area and power of the LFSR and CA circuits. The XOR gates used in the circuits are realized either using a 12-transistor (12T) or a 6-transistor (6T). To further reduce power dissipation in the DBG circuit, low-power techniques are incorporated. In the proposed 8-bit DBGs, the adaptive voltage level at source (AVLS) is incorporated to reduce power consumption. The circuits are realized using Cadence Virtuoso in CMOS 180 nm technology, and Specter is used for simulation and power analysis. The DBG functionality is assessed for frequencies ranging up to 1 GHz with a supply voltage of 1.8 V. From the results, it was inferred that at 1 GHz the proposed-1 DBG (using a 12T XOR gate) is 94.05% power efficient; while, the proposed-2 DBG (using a 6T XOR gate) is 90.27% power efficient when compared to the reference circuits. Implementation of the proposed-1 DBG was also carried out in CMOS 45 nm technology, the functionality was verified and the power was analyzed. A similar trend of power reduction was observed. [ABSTRACT FROM AUTHOR]

VANET performs analysis of patient records and sends security warnings to the carer through VANET so that they may provide urgent assistance while keeping patient data safe. Threat actors might potentially access data packets that go between biological sensors and smart ambulances in the vehicular network. When healthcare professionals use a VANET, they run the risk of receiving inaccurate or delayed data as a result of assaults like the Sybil attack, denial of service attacks, and impersonation attacks. As a result, protecting people's personal information and data has become an important task for academics. In this research, we propose the use of an Urbanized Block Chain Key Agreement Protocol (UB-KAP) based on a one-way hash chain model to increase protections for individual privacy and data integrity in VANET-based healthcare networks. The messages include timestamps in case the messages that have already expired cause excessive delays. The beacons' packet classification mechanism separates them into benign and harmful emergency signals to speed up response times. The suggested model is tested by road traffic simulation using SUMO (Simulation of Urban Mobility). Data collection per user, message delivery ratio, total data gathered, delay, and energy usage are all included in the model's overall evaluation. [ABSTRACT FROM AUTHOR]

Mobile devices have risen due to internet growth in recent years. The next generation of internet protocol is evolving for mobile devices to generate their addresses and get continuous services across networks to support the enormous number of addresses in network-based mobility. The mobile device updates its current location to its home network and the correspondent users through a binding update scheme in the visited network. Numerous studies have investigated binding update schemes to verify the reachability of the mobile device at its home network. However, most schemes endure security threats due to the incompetence of authenticating user identity and concealing the temporary location of mobile devices. To address these issues, this paper proposes a secure and efficient binding update scheme (One-CLU) by incorporating a one-key-based cryptographically generated address (CGA) to validate and conceal the address ownership of mobile devices with minimal computations. The security correctness of the proposed One-CLU scheme is verified using AVISPA – a model checker. Finally, the simulation and the numerical results showthat the proposed scheme significantly reduces communication payloads and costs for the binding update, binding refresh, and packet delivery. [ABSTRACT FROM AUTHOR]

Cryptology is a part of mathematics as encryption and decryption. The purpose of encryption is to make information incomprehensible when it is in the hands of unauthorized people. The receiver can decrypt the message that encrypted by the sender with helping of the key. The important point is that the key cannot be decrypted by other people. One Time Pad method solves this problem. The key is used only once each encryption in this method. So, the key becomes harder to guess. If the key is solved by unauthorized people, the message cannot be solved. Because of with each decryption, many meaningful messages are obtained. Every cyclic shift in a cyclic code constructs a new key and in each encryption is used the new key. Many keys are generated thanks to cyclic codes. In this paper, we improve the new encryption scheme by using the cyclic codes with One Time Pad method. [ABSTRACT FROM AUTHOR]

The crypto space is a rapidly growing industry with a rapidly growing carbon footprint. The industry's expanding energy use has sparked a vigorous debate over whether and how best to regulate crypto mining's environmental effects. The Biden Administration and many members of Congress have studied the industry's environmental impact and concluded that there should be environmental regulations for the industry. Regulation, however, faces an obstacle in the form of concern that regulation may unduly stifle innovation and competition within the industry. This is a major reason why Congress has yet to enact environmental regulations for crypto mining. This Article proposes a win-win regulatory approach that would reduce crypto mining's environmental harms while also promoting, rather than stifling, competition and innovation. The Article proposes applying the Porter Hypothesis, a well-known economic theory in environmental law scholarship, to the problem of environmental harm caused by crypto mining. The Porter Hypothesis calls for a consultative, flexible approach to environmental regulation that involves input from the industry, focuses on reducing pollution at its source instead of mitigating its effects after the fact, and provides the industry flexibility by setting emission limits and using market incentives, but not prescribing the technological means, to meet them. Applied to crypto mining, the Porter Hypothesis suggests regulations that use a market incentive--like a pollution tax or a cap-and-trade program--to encourage crypto miners to reduce their pollution at its source, without mandating the use of a particular technology. The program should also provide funding for pilot projects, use phase-in periods and realistic deadlines, as well as require policymakers to monitor and publish data about individual miners' energy usage and greenhouse gas emissions. This Article is the first to propose a regulatory program of environmental regulations for the industry, the first to apply the Porter Hypothesis to crypto mining, and the first to propose a regulatory approach that offers a win-win solution to overcome political opposition to regulating the environmental harms of crypto mining. [ABSTRACT FROM AUTHOR]

A quantum image steganography algorithm based on edge detection is proposed. Firstly, a new fractal chaotic system with good chaotic properties is proposed to improve the security of the secret information. In addition, this study creates a new steganography algorithm with edge detection. By finding as many edge points in the image as possible through edge detection, the secret information is embedded in non-edge locations, which greatly improves the security and invisibility of the algorithm. Meanwhile, an efficient and secure quantum steganographic circuit is designed. The results of simulation experiments and numerical analysis show that the algorithm is securely complete and invisible and also has good robustness. [ABSTRACT FROM AUTHOR]

Thus far, several papers reported concrete resource estimates of Shor's quantum algorithm for solving the elliptic curve discrete logarithm problem. In this paper, we study quantum FLT-based inversion algorithms over binary elliptic curves. There are two major algorithms proposed by Banegas et al. and Putranto et al., where the former and latter algorithms achieve fewer numbers of qubits and smaller depths of circuits, respectively. We propose two quantum FLT-based inversion algorithms that essentially outperform previous FLT-based algorithms and compare the performance for NIST curves of the degree n. Specifically, for all n, our first algorithm achieves fewer qubits than Putranto et al.'s one without sacrificing the number of Toffoli gates and the depth of circuits, while our second algorithm achieves smaller depths of circuits without sacrificing the number of qubits and Toffoli gates. For example, when n = 571 , the number of qubits of our first algorithm is 74 % of that of Putranto et al.'s one, while the depth of our second algorithm is 83 % of that of Banegas et al.'s one. The improvements stem from the fact that FLT-based inversions can be performed with arbitrary sequences of addition chains for n - 1 although both Banegas et al. and Putranto et al. follow fixed sequences that were introduced by Itoh and Tsujii's classical FLT-based inversion. In particular, we analyze how several properties of addition chains, which do not affect the computational resources of classical FLT-based inversions, affect the computational resources of quantum FLT-based inversions and find appropriate sequences. [ABSTRACT FROM AUTHOR]

In recent years, the tropical polynomial factorization problem, the tropical matrix decomposition problem, and the tropical multivariate quadratic equation solving problem have been proved to be NP-hard. Some asymmetric cryptographic systems based on tropical semirings have been proposed, but most of them are insecure and have been successfully attacked. In this paper, a new key exchange protocol and a new encryption protocol are proposed based on the difficulty of finding the multiple exponentiation problem of the tropical Jones matrices. The analysis results indicate that our protocol can resist various existing attacks. The complexity of attacking an MEP by adversaries is raised due to the larger number of combinations in the tropical Jones matrices compared to regular matrix polynomials. Furthermore, the index semiring is the non-negative integer cyclic matrix semiring, leading to a higher efficiency in key generation. [ABSTRACT FROM AUTHOR]

Symmetric cryptography provides the best examples of cryptosystems to be applied in lightweight environments (e.g., IoT). A representative example is the cryptosystem TinyJambu, one of the ten finalists in the NIST Lightweight Cryptography Standardization Project. It is an authentication encryption with associated data scheme that is extremely lightweight and fast. In this work, we analyze the security of TinyJambu from two distinct and non-symmetric points of view: (1) the improvement of the best cryptanalytical attack found in the literature and (2) a randomness analysis of the generated sequences. Concerning item (1), we launched a differential forgery attack with probability 2−65.9487, which was improved considerably compared with previous numerical results. Concerning item (2), we analyzed the degree of randomness of the TinyJambu keystream sequences with a complete and powerful battery of statistical tests. This non-symmetric study shows the weakness of TinyJambu against cryptanalytic attacks as well as the strength of TinyJambu against statistical analysis. [ABSTRACT FROM AUTHOR]

This paper introduces a methodology for generating secure cryptographic key bits from analog values obtained from the Lorenz chaotic circuit. The analog values are transferred from the chaotic circuit to the computer via an Analog Discovery-2 device and then post-processed by using a fixed-point number representation format and Von-Neumann corrector for the sampled values on the MATLAB program. By employing this method, the analog values are digitized and randomized as the main idea is to obtain secure and efficient statistically random bits. Furthermore, the generated random bits are utilized for secure audio encryption by demonstrating a practical application of the proposed methodology. In addition to the classical randomness test criteria, NIST 800.22 statistical test suite, the throughput bit stream is also subjected to Chi-square and FIPS 140-1 tests to further evaluate its effectiveness. The results of these comprehensive tests confirm the successful performance of the proposed system in generating statistically random bits and its secure audio encryption system. The utilization of the Lorenz chaotic circuit as an entropy source in generating true random bits for secure audio transmission applications showcases the potential of the proposed system. [ABSTRACT FROM AUTHOR]

To hide confidential messages from people who are not responsible or who can access the messages, a way is needed to hide the messages. One way to hide messages in transmission is to change the data into something unintelligible by encoding and embedding it using cryptography and steganography techniques. This application was built using the hill cipher algorithm and the Rivest Cipher 4 (RC4) method. This algorithm is a symmetric key algorithm which has several advantages in data encryption. The hill chiper algorithm uses a mxm matrix as the encryption and decryption key. Meanwhile, the RC4 symmetric key is in the form of a stream cipher which can process input data as well as messages or information. Input data is generally in the form of bytes or even bits. The results of this research show that hill cipher and RC4 have their respective advantages and disadvantages. However, currently, RC4 is generally considered less safe for use in securitycritical scenarios due to its vulnerability to attack. It is highly recommended to use an encryption algorithm such as advanced encryption standard (AES) which is modern and strong and has been tested and proven to be more resilient. [ABSTRACT FROM AUTHOR]

Video steganography has the potential to be used to convey illegal information, and video steganalysis is a vital tool to detect the presence of this illicit act. Currently, all the motion vector (MV)‐based video steganalysis algorithms extract feature sets directly from the MVs, but ignoring the embedding operation may perturb the statistical distribution of other video encoding elements, such as the skipped macroblocks (no direct MVs). This paper proposes a novel 11‐dimensional feature set to detect MV‐based video steganography based on the above observation. The proposed feature is extracted based on the skipped macroblocks by recompression calibration. Specifically, the feature consists of two components. The first is the probability distribution of motion vector prediction (MVP) difference, and the second is the probability distribution of partition state transfer. Extensive experiments on different conditions demonstrate that the proposed feature set achieves good detection accuracy, especially in lower embedding capacities. In addition, the loss of detection performance caused by recompression calibration using mismatched quantization parameters (QP) is within the acceptable range, so the proposed method can be used in practical scenarios. [ABSTRACT FROM AUTHOR]

This paper proposes a new four-dimensional hyper-chaotic system capable of generating multi-wing chaotic attractors by introducing active magnetron memristors, multi-segmented square functions and trigonometric functions. The dynamical properties of this new hyper-chaotic system, such as equilibrium point, dissipation, Lyapunov exponential spectrum, bifurcation diagram and Poincaré cross-section and attraction basin, are analyzed theoretically and simulated numerically, and the complexity of this system with different parameters is analyzed. It is observed that this hyper-chaotic system has periodic, chaotic and hyper-chaotic variations with an infinite number of equilibria and coexisting attractors under different parameter conditions. The circuit simulation was performed using Multisim and the results obtained were consistent with the numerical analysis of the dynamics, and the chaotic circuit system is designed by FPGA to verify the realizability of the system. Finally, an image encryption algorithm is designed in conjunction with the DNA algorithm to enable a new system chaotic sequence for image encryption. The results show that the hyper-chaotic system has rich dynamical behavior and has high-security performance when applied to image encryption with strong chaotic key and plaintext sensitivity and large key space in image encryption. [ABSTRACT FROM AUTHOR]

Cloud computing has become increasingly popular due to its scalability, cost-effectiveness, and ability to handle large volumes of data. However, entrusting (sensitive) data to a third party raises concerns about data security and privacy. Homomorphic encryption is one solution that allows users to store and process data in a public cloud without the cloud provider having access to it. Currently, homomorphic encryption libraries only support addition and multiplication; other mathematical functions must be implemented by the user. To this end, we discuss and implement the division, exponential, square root, logarithm, minimum, and maximum function, using the CKKS cryptosystem of the OpenFHE library. To demonstrate that complex applications can be realized with this extended function set, we have used it to homomorphically realize the Box–Cox transform, which is used in many real-world applications, e.g., time-series forecasts. Our results show how the number of iterations required to achieve a given accuracy varies depending on the function. In addition, the execution time for each function is independent of the input and is in the range of ten seconds on a reference machine. With this work, we provide users with insights on how to extend the original restricted function set of the CKKS cryptosystem of the OpenFHE library with basic mathematical functions. [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]

Internet a network of interconnected systems which is used to transmit different kinds of sensitive data is made secure by encrypting this data during transmission and protecting it against any kind of violation. This paper presents a symmetric data encryption algorithm developed in Python to encrypt images, making the transmission secure. The major computations performed in the algorithm are Mix Columns, Key dependent ex-or operation with upper and lower triangular sections of the matrix, Shift Rows, and Customized Sub Bytes transformation which provides diffusion and confusion. Results of various analysis performed on the algorithm prove its authenticity, confidentiality, and integrity. [ABSTRACT FROM AUTHOR]

Advanced Encryption Standard (AES) or Data Encryption Standard (DES) are standard block cipher techniques mostly used for text or numbers but not preferred for multimedia data. Many researchers presented their work for grayscale image cryptography. However, little work has been reported for RGB image cryptography. This paper presents DieRoll, an encryption technique for color images. The key generation provides a novel approach with various stages of dividing and scrambling followed by using a fair die to transpose, reintegrate and form a new key. This newly generated key is used to encrypt RGB images. The implementation and performance evaluation of DieRoll is also given. The paper compares DieRoll encryption techniques with other techniques found in the literature. Quantitative and visual evaluation is also presented to analyze the resistance against modern threats. In the end attack analysis is given to support the claims. [ABSTRACT FROM AUTHOR]