Search

The pseudo-randomness exhibited by chaotic systems has proven valuable not only in plaintext information encryption of images with varying dimensions but also as a key signal for protecting image copyright information. Image copyright protection is a crucial part of image information protection. Currently, digital watermarking technology is predominantly employed for copyright protection of digital images. However, most of the existing watermarking technologies primarily focus on the improvement of watermarking performance, neglecting the security of the watermarking system itself. Drawing inspiration from the Latin square rule, this paper proposes a novel hyperchaotic mapping modulation framework, which is employed to construct a new 3D hyperchaotic mapping and enhance the security of the fragile watermark and the zero-watermark generation process. Additionally, it is integrated into the classical image encryption framework of scrambling-diffusion to safeguard meaningful copyright information. Moreover, a functional watermarking system is designed based on the RSA asymmetric encryption algorithm, least significant bit (LSB), and polar harmonic Fourier moments (PHFMs). The proposed system enables identity verification, tampering location, and copyright authentication simultaneously. During the generation of zero watermarks, the binarization threshold of the PHFMs information matrix is determined by the method of maximum variance. The experimental results demonstrate that this scheme achieves a high level of security, better robustness to both conventional and geometric attacks, and precise localization for different types of tampering attacks. [ABSTRACT FROM AUTHOR]

The article focuses on the quest of cryptographers to find encryption algorithms that can withstand cyberattacks from conventional computers and future quantum machines. Topics discussed include the development of the CRYSTALS-Kyber algorithm for encrypting data, strategy devised by cryptographers Whitfield Diffie and Martin Hellman that could pass secret messages, the RSA public-key encryption method, and the SIKE algorithm which is based on a special mathematical map.

Shoring up security Getting ahead of the problem is the aim of Moody, Robinson and others who are part of NIST's effort to select and standardize post-quantum encryption and digital signatures. An effort headed by the U.S. National Institute of Standards and Technology, or NIST, aims to release new standards for such post-quantum cryptography algorithms next year. That's still far from the Y2Q threshold: To break RSA encryption, a quantum computer would need 20 million qubits, researchers reported in 2021 in Quantum. "All of those public-key algorithms are vulnerable to an attack that can only be carried out by a quantum computer", says mathematician Angela Robinson of NIST, in Gaithersburg, Md. "Our whole digital world is relying on quantum-vulnerable algorithms.". [Extracted from the article]

The White House has issued a new rule aimed at restricting U.S. investments in Chinese technology, particularly in areas like quantum computing, artificial intelligence, and advanced microelectronics, due to national security concerns. The rule prohibits U.S. persons from engaging in certain transactions involving semiconductors, quantum, and artificial intelligence, and requires notification of other transactions in these areas. The focus is on preventing investments in Chinese companies developing quantum computers that could undermine encryption and AI technologies with potential military applications or offensive cyber operations. The rule follows concerns about U.S. investments in Chinese AI companies, with a significant amount of venture capital funding going to firms eventually placed on the Treasury Department's "Entity List" for working with Chinese military and intelligence services. [Extracted from the article]

The article discuses the use of digital encryption schemes also known as cryptosystems. Topics mention including application of (Rivest-Shamir-adleman) RSA cryptosystem in protecting the vast reams of data, elliptic curve codes which comes with its encryption capacity consisting a series of simple operations and lattice-based cryptosystems.

Apple is preparing for the threat of quantum computing by introducing a new form of encryption for iMessage. Quantum computers have the potential to render current encryption methods obsolete due to their ability to solve mathematical problems much faster. Apple's new encryption protocol, PQ3, is designed to be resistant to quantum attacks by using more complex mathematics. However, there is still no industry consensus on post-quantum standards, and the timeline for a quantum breakthrough remains uncertain. Nonetheless, Apple's actions may encourage other companies to prepare for the future impact of quantum computing. [Extracted from the article]

In this paper we propose and benchmark an innovative implementation of the Random Sequential Addition (or adsorption) (Rsa) algorithm. It provides Mpi parallelization and is designed to generate a high number of spheres aiming for maximal compactness, without introducing any bias. Although parallelization of such an algorithm has been successfully undertaken with shared memory (and in particular with Gpu), this is seemingly the first available implementation with distributed memory (Mpi). Our implementation successfully generated more than 12 billions of spheres over 131,072 Mpi processes in 16 seconds in dimension d = 3. [ABSTRACT FROM AUTHOR]

For example, the widely used RSA algorithm relies on the fact that multiplying two prime numbers to generate a large encryption key is easy, while finding those original prime factors when you only have the encryption key is very difficult. News A GROUP of researchers has claimed that quantum computers can now crack the encryption we use to protect emails, bank accounts and other sensitive data. But quantum computers can exploit the unusual properties of quantum physics to speed up some calculations and will probably render current encryption techniques obsolete once the hardware is sufficiently powerful and accurate. [Extracted from the article]

The article presents research on using optical, acoustic, and thermal "side channels" as a means of monitoring personal computers with the goal of breaking their cryptographic security protocols. The leaking of cryptographic information due to computers' varying acoustic, electrical, and electromagnetic properties can allegedly be used to decrypt RSA algorithms and ElGamal keys and methods to prevent side channel attacks are presented.

A patent has been issued for a method of multi-factor authentication by the Alfred E. Mann Foundation for Scientific Research. The method involves receiving a partial digital certificate with partial certificate information and a digital signature, decrypting the signature to obtain a hash, generating a second hash based on the partial certificate information and authentication factors, and comparing the two hashes. The authentication factors can include a time stamp, GPS coordinates, and a unique identification number. The method aims to increase security and provide a more robust authentication process. [Extracted from the article]

A recent paper published by Chinese scientists claims to have found a way to use a 372-qubit quantum computer to break the RSA encryption system. This breakthrough, if true, could have significant implications for U.S. military and intelligence communication, financial transactions, and personal text messages. However, experts have expressed skepticism about the paper's claims, noting that there is a lack of evidence and some hand-waving in the research. While the U.S. government has been increasingly concerned about the obsolescence of encryption standards in the face of quantum computing, it is unclear whether this paper represents a genuine threat or is simply a false claim. [Extracted from the article]

A new n -dimensional conservative chaotic model is proposed to quickly realise a conservative chaotic system. The validity of this model is verified by generating a five-dimensional conservative chaotic system as an example. This system is dynamically analysed from the perspective of Lyapunov exponents (LEs), complexity and phase diagram, which prove its good chaotic properties. Compared with existing systems, the proposed system has a simple structure, large LEs, continuous chaotic ranges and high complexity. Additionally, the National Institute of Standards and Technology verified that the proposed system demonstrates good randomness and is implemented on a digital signal processor hardware platform. Subsequently, a new image encryption scheme that uses true random numbers, lattice-based public key cryptography and dynamic P- and S-boxes is presented based on the new system. The results show that the algorithm demonstrates the capability of the cryptosystem to achieve quality encryption while resisting quantum computer, statistical, differential and cutting attacks compared with other encryption algorithms. [ABSTRACT FROM AUTHOR]

The number of attempts to break modern encryption methods increases day by day and therefore the need for the design of systems to ensure higher security has occurred. This study aims, an encryption algorithm that combines the strong of asymmetric encryption algorithm and the rich dynamic behaviors of chaotic systems is developed. In this study, firstly a new chaotic system design with high dynamic features is performed and then circuit realization and analyses are made. A chaos based RNG (random number generator) is designed with the help of the new developed chaotic system, NIST and FIPS tests are run. Chaos based hybrid RSA (CRSA) encryption algorithm design in which RNG and RSA algorithms are used together is performed. Text and image encryption is carried out with the algorithm and security analyses of these applications are made. Security analyses results are compared with classical RSA algorithm. It is observed that the developed CRSA algorithm provided better results than RSA algorithm in security tests. [ABSTRACT FROM AUTHOR]

This paper proposes new countermeasures for RSA cryptosystems using additive blinding. In general, existing countermeasures for RSA cryptosystems have implemented multiplicative blinding while additive blinding methods have been used to protect symmetric cryptosystems, such as AES, DES, and so on. However, we show here that additive blinding can be efficiently and securely implemented with RSA cryptosystems. We prove that the proposed methods can greatly enhance security to protect against power and fault analysis, as compared to existing countermeasures. In addition, the proposed countermeasures are faster than existing ones and can be executed with a low computational cost, as proven herein by conducting a security and performance analysis. [ABSTRACT FROM AUTHOR]

RSA algorithm is one of the most popular and secure public key cryptographic algorithms and has been widely used in many real-life applications. The security of the RSA algorithm lies in the difficulty of factoring large integers efficiently and the General Number Field Sieve (GNFS) algorithm is the most efficient algorithm for factoring integers greater than 110 digits at present. In this paper, targeted to speed up the factorization process of RSA, we discuss the current research about solving large and sparse linear systems over GF(2), which is one of the most time-consuming steps of the GNFS algorithm. With that, we propose an improved parallel block Lanczos (IBL) algorithm to reduce the communication cost of solving large and sparse linear systems over GF(2). More specifically, we firstly re-implement the parallel block Lanczos algorithm from the BSP paradigm to Open MPI. To further improve the performance, we then reorganize and redesign the algorithm to reduce the synchronization and communication costs during the outer product step. After this, we integrate the improved parallel block Lanczos algorithm with the GNFS algorithm. Finally, theoretical and experimental results demonstrate that the IBL algorithm greatly enhances the performance of GNFS compared with previous parallel block Lanczos (PBL) algorithm, in terms of both execution time and speedup. [ABSTRACT FROM AUTHOR]

There have been many ways to construct a threshold cryptosystem. Most often they are constructed by combining original public encryption schemes with some methods such as Shamir’s secret sharing. In this paper a new threshold cryptosystem based on RSA is presented, which is constructed by several RSA instances with chosen moduli and private keys. In fact, by computing the common private keys of some individual RSA instances and modifying the moduli, we combine those RSA instances and get a new threshold cryptosystem (hereinafter called combined RSA for simplification). First, it is proved that this system has similar security properties to the CRT-based (Chinese remainder theorem) threshold RSA while being convenient to implement, i.e., it only needs modular multiplication once to encrypt or decrypt respectively. Although the new system has the same security strength as the CRT-based RSA theoretically, it will provide fewer opportunities for adversaries in practical applications as there is only one step for encryption or decryption. Second, for complexity, as plain RSA is efficient, the combined RSA is also practical in computation. Therefore, if a plain RSA user wants to develop threshold decryption or threshold signature more conveniently and more securely, the combined RSA would be suitable. Finally, an application of the combined RSA is provided in this paper to realize distributed data access control with collusion-resistance. [ABSTRACT FROM AUTHOR]

The article discusses the role of quantum computers in encryption security innovation. Topics include the development of the computer network security system called quantum key distribution (QKD), the idea of post-quantum cryptography, and how computer qubits have the ability to hack the encryption schemes RSA and the elliptic curve cryptography (ECC).

Abstract: In timing attack, a class of side channel attack, the attacker attempts to break a cryptographic algorithm by timing the operations of a specific system. Several studies on different types of timing attacks have been published, but they are either theoretical or hard to put into practice. To improve the feasibility of timing attack, the current study proposes an improved timing attack scheme on RSA-CRT using t-test. Some similar types of timing attacks, such as BB-attack and Schindler’s attack, have been previously reported. However, none of these studies has applied these statistical methods with such efficiency, or has actually obtained complete recovery by attacking on RSA-CRT. The algorithm proposed in the present study provides an error detection mechanism and correction strategy that can detect and correct the erroneous decision of guessing q k . With an improvement timing attack on the RSA algorithm in OpenSSL, the 0–1gap is enlarged, the neighborhood size is reduced, and the precision of the decision is improved. Moreover, obtaining the factor q is practical, and even recovers a 1024-bit RSA key completely for an interprocess timing attack. [Copyright &y& Elsevier]

Howard Watson (pictured), CTO of BT, said: "BT and Toshiba have established a global lead in the development of quantum-secure networks. The company, working with Toshiba, will provide data services secured using quantum key distribution (QKD) and post-quantum cryptography (PQC). BT and Toshiba to build "world's first" quantum metro network. [Extracted from the article]

In 2020 we went virtual and migrated to the cloud by necessity. The Innovation Sandbox startup contest showcases the tech needed to secure 2021's virtual cloud world. [ABSTRACT FROM AUTHOR]

B Web Roundup b Items from other news organizations The full story of the stunning RSA hack can finally be told Smart911 allows Chicago resident to share security-camera footage with police How Myanmar's military moved in on the telecoms sector to spy on citizens How to avoid another cybersecurity disaster like SolarWinds U.S. insurance giant CNA Financial paid $40 million ransom to regain control of systems: report Tennessee board details impact of Christmas bombing on 911 systems Hackers threaten to release police records, knock 911 offline Columbus, Ohio, pilot program will help determine which 911 calls are emergencies and which aren't All those electric vehicles pose a problem for building roads RSA experts call for new cybersecurity stats, reporting law Knopp resigns as Wyoming CIO after major health-data leak The prison-phone kickback game Apple AirTag teardown and test point mapping Send My: Arbitrary data transmission via Apple's Find My network Internet Explorer for Windows 10 will be discontinued next year Microsoft officials acknowledges Windows 10X isn't happening What is low-code and no-code?. [Extracted from the article]

The article discusses the development of a factorisation method for multiple target Mersenne numbers by Arjen Lenstra of the Swiss Federal Institute of Technology in Lausanne and colleagues, reported in the journal "Cryptology ePrint Archive," which can be used to factor RSA encryption numbers.

eWEEK EVENT ANALYSIS: Securing DevOps and SaaS, and managing the human element were dominant trends at Innovation Sandbox, the annual startup competition at RSA 2020 Conference. [ABSTRACT FROM AUTHOR]

Here is a listing of some key news announcements from Day 1 of the RSA 2020 Security Conference here at Moscone Center. [ABSTRACT FROM AUTHOR]

Dell has struck a deal to sell RSA Security to private equity firm STG Partners. Dell announced Tuesday that it's selling RSA Security to STG in an all-cash deal for $2.075 billion, subject to certain adjustments. [ABSTRACT FROM AUTHOR]

Dell is reportedly pondering the sell-off of its RSA Security cybersecurity business for at least $1 billion, including debt. Citing sources familiar with the matter, Bloomberg reported that Dell was in the early stages of its discussions, and that there was no guarantee the sale would actually take place. [ABSTRACT FROM AUTHOR]

The cloud visibility theme was widespread across the expo floor, with many exhibitors proudly displaying their capabilities for ending everyone's worries. [ABSTRACT FROM AUTHOR]

PRIME TIME The U.S. Patent Office has been criticized a lot recently for granting patents on certain Y2K fixes, user interface designs, and, if British Telecommunications (BT) is to be […]

The computer industry will find out later this year if RSA Secu rity Inc.'s loss is everyone else's gain. On Sept. 20, the patent on RSA's namesake public-key encryption algorithm […]

While bad actors continue to ravage personal and business information worldwide, the infosec sector is responding. At the recent RSA 2018 conference in March, security experts and practitioners from all over the globe were witness to some new ideas and services that either are already in the market or are soon to become available. We're going to chat about this in the June 13 #eWEEKchat. [ABSTRACT FROM AUTHOR]

The article is an announcement of the newest version of RSA Lifecycle and Governance and also the completion of RSA Via family of Smart Identity solutions, it talks about improved security and speedy detection of unauthorised users by RSA, The Security Division of EMC

The article discusses acoustic cryptanalysis as a potential method for deciphering encrypted messages by eavesdropping on the sonic signatures of computer processors, focusing on the work of the researchers Adi Shamir, Eran Tromer, and Daniel Genkin as of 2014. Computer security and RSA encryption is mentioned.

When John Hancock signed the Declaration of Independence in 1776, he wrote his signature large - so large, the saying goes, 'that King George would be able to read it […]

The article reports that the developers of ransomware programs Petya and Mischa published 3,500 RSA keys in July 2016, which will allegedly decrypt data in the computer systems infected with another ransomware application Chimera. It says that researchers from Malwarebytes Corp. have confirmed the Petya developers' claim of hacking the development system used by Chimera's creators. However, it says that the researchers have yet not confirmed about the legitimacy of the leaked private keys.