Researchers at Los Alamos National Laboratory have developed a new approach that addresses the limitations of generative AI ...

Abstract: The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor’s work, it has been known that the DLP can be solved by combining a polynomial-size quantum ...

Add a description, image, and links to the discrete-logarithm-problem topic page so that developers can more easily learn about it.

A new report by Capgemini warns that quantum computing may break the widely used public-key cryptographic systems within the next decade — threatening everything from online banking to blockchain ...

In this post, we describe FrodoKEM, a key encapsulation protocol that offers a simple design and provides strong security guarantees even in a future with powerful quantum computers. For decades, ...

They’re not our besties, but they’re more than just acquaintances. How much of ourselves do we owe them? Credit...Photo Illustration by Lauren Peters-Collaer Supported by By Lisa Miller Most of us ...

Only recently, progress has been made in obtaining o(log (rank))-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish ...

Abstract: The discrete logarithm problem has been used as the basis of several cryptosystems. P systems are a cluster of distributed parallel computing devices in a biochemical type. This paper ...