Discover how IBM is shaping the future of quantum computing, AI, and cybersecurity with innovative technologies. IBM's ...
The factorization of integers and computation of discrete logarithms in polynomial time via the quantum computing-enabled Shor’s algorithm pose a major threat to traditional public-key cryptography.
Wouldn’t it be great if power utilities had an easy way to use deep data analysis to deploy their assets in the perfect places, predict and prevent outages, and optimize the ...
This is an implementation (in progress) of the Shamir Discrete Logarithm Hash. It generates an RSA key and hashes a message by exponentiating the generator of the group, using the message as the ...
Abstract: Most of the provably-secure proxy signature schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, ...
Abstract: The discrete logarithm method is the foundation of many public key algorithms. However, one type of key, defined as a weak-key, reduces the security of public key cryptosystems based on the ...
It is significant for revealing the formation mechanism of the lunar Mascon to invert the refined 3-D lunar crust and upper mantle structure of the Mare Serenitatis. As the development of space ...
On each trial, magnitudes were drawn from a discrete uniform distribution (1, 9) (i.e., rewards would take values from the range {1, 2,…, 9} with equal probability). Subjects began the experiment with ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results