Simson Garfinkel on Spooky Cryptographic Action at a Distance

Excellent read. One example:

Consider the case of basic public key cryptography, in which a person’s public and private key are created together in a single operation. These two keys are entangled, not with quantum physics, but with math.

When I create a virtual machine server in the Amazon cloud, I am prompted for an RSA public key that will be used to control access to the machine. Typically, I create the public and private keypair on my laptop and upload the public key to Amazon, which bakes my public key into the server’s administrator account. My laptop and that remove server are thus entangled, in that the only way to log into the server is using the key on my laptop. And because that administrator account can do anything to that server­—read the sensitivity data, hack the web server to install malware on people who visit its web pages, or anything else I might care to do­—the private key on my laptop represents a security risk for that server…

Continue reading Simson Garfinkel on Spooky Cryptographic Action at a Distance

What NIST’s post-quantum cryptography standards mean for data security

Data security is the cornerstone of every business operation. Today, the security of sensitive data and communication depends on traditional cryptography methods, such as the RSA algorithm. While such algorithms secure against today’s threats, organizations must continue to look forward and begin to prepare against upcoming risk factors. The National Institute of Standards and Technology […]

The post What NIST’s post-quantum cryptography standards mean for data security appeared first on Security Intelligence.

Continue reading What NIST’s post-quantum cryptography standards mean for data security

What NIST’s post-quantum cryptography standards mean for data security

Data security is the cornerstone of every business operation. Today, the security of sensitive data and communication depends on traditional cryptography methods, such as the RSA algorithm. While such algorithms secure against today’s threats, organizations must continue to look forward and begin to prepare against upcoming risk factors. The National Institute of Standards and Technology […]

The post What NIST’s post-quantum cryptography standards mean for data security appeared first on Security Intelligence.

Continue reading What NIST’s post-quantum cryptography standards mean for data security

Microsoft Adds Support for Post-Quantum Algorithms in SymCrypt Library

Microsoft has started introducing support for post-quantum algorithms in SymCrypt, its main cryptographic library.
The post Microsoft Adds Support for Post-Quantum Algorithms in SymCrypt Library appeared first on SecurityWeek.
Continue reading Microsoft Adds Support for Post-Quantum Algorithms in SymCrypt Library

Post-Quantum Cryptography Firm PQShield Raises $37 Million

Post-quantum cryptography (PQC) company PQShield has raised $37 million in Series B funding for its quantum-safe cryptography solutions.
The post Post-Quantum Cryptography Firm PQShield Raises $37 Million appeared first on SecurityWeek.
Continue reading Post-Quantum Cryptography Firm PQShield Raises $37 Million

Lattice-Based Cryptosystems and Quantum Cryptanalysis

Quantum computers are probably coming, though we don’t know when—and when they arrive, they will, most likely, be able to break our standard public-key cryptography algorithms. In anticipation of this possibility, cryptographers have been working on quantum-resistant public-key algorithms. The National Institute for Standards and Technology (NIST) has been hosting a competition since 2017, and there already are several proposed standards. Most of these are based on lattice problems.

The mathematics of lattice cryptography revolve around combining sets of vectors—that’s the lattice—in a multi-dimensional space. These lattices are filled with multi-dimensional periodicities. The …

Continue reading Lattice-Based Cryptosystems and Quantum Cryptanalysis

New Lattice Cryptanalytic Technique

A new paper presents a polynomial-time quantum algorithm for solving certain hard lattice problems. This could be a big deal for post-quantum cryptographic algorithms, since many of them base their security on hard lattice problems.

A few things to note. One, this paper has not yet been peer reviewed. As this comment points out: “We had already some cases where efficient quantum algorithms for lattice problems were discovered, but they turned out not being correct or only worked for simple special cases.” I expect we’ll learn more about this particular algorithm with time. And, like many of these algorithms, there will be improvements down the road…

Continue reading New Lattice Cryptanalytic Technique