The Blum–Micali algorithm is a cryptographically secure pseudorandom number generator. The algorithm gets its security from the difficulty of computing...

University of California, Berkeley in 1982; for research supervised by Manuel Blum. Micali has been on the faculty of MIT's Electrical Engineering and Computer...

retrieved 2010-01-24. Manuel Blum at DBLP Bibliography Server Manuel Blum publications indexed by Microsoft Academic Blum, Manuel; Micali, Silvio (1984). "How...

The Goldwasser–Micali (GM) cryptosystem is an asymmetric key encryption algorithm developed by Shafi Goldwasser and Silvio Micali in 1982. GM has the distinction...

the Blum Blum Shub algorithm. However the algorithm is very inefficient and therefore impractical unless extreme security is needed. The Blum–Micali algorithm...

The Commercial National Security Algorithm Suite (CNSA) is a set of cryptographic algorithms promulgated by the National Security Agency as a replacement...

slow to be practical in most applications. They include: Blum–Micali algorithm (1984) Blum Blum Shub (1986) Naor–Reingold pseudorandom function (1997) These...

Ron Rivest, Adi Shamir and Leonard Adleman, who publicly described the algorithm in 1977. An equivalent system was developed secretly in 1973 at Government...

cryptography, the Double Ratchet Algorithm (previously referred to as the Axolotl Ratchet) is a key management algorithm that was developed by Trevor Perrin...

cryptography, the Elliptic Curve Digital Signature Algorithm (ECDSA) offers a variant of the Digital Signature Algorithm (DSA) which uses elliptic-curve cryptography...

also point out that the blossom algorithm and the algorithms by Micali and Vazirani can be seen as approximation algorithms running in linear time for any...

The Digital Signature Algorithm (DSA) is a public-key cryptosystem and Federal Information Processing Standard for digital signatures, based on the mathematical...

the more complicated algorithm of Micali and Vazirani. The Hopcroft–Karp algorithm can be seen as a special case of Dinic's algorithm for the maximum-flow...

The Blum–Goldwasser (BG) cryptosystem is an asymmetric key encryption algorithm proposed by Manuel Blum and Shafi Goldwasser in 1984. Blum–Goldwasser is...

GMR public signature scheme, published with Shafi Goldwasser and Silvio Micali in 1988,[C3] and of ring signatures, an anonymized form of group signatures...

cryptography, the ElGamal encryption system is an asymmetric key encryption algorithm for public-key cryptography which is based on the Diffie–Hellman key exchange...

The Cayley–Purser algorithm was a public-key cryptography algorithm published in early 1999 by 16-year-old Irishwoman Sarah Flannery, based on an unpublished...

Goldreich verifying that a two-prime modulus is not a Blum integer. Oded Goldreich, Silvio Micali, and Avi Wigderson took this one step further, showing...

remainder theorem). Topics in cryptography Blum Blum Shub Shanks–Tonelli algorithm Schmidt–Samoa cryptosystem Blum–Goldwasser cryptosystem Galbraith, Steven...

"Hash trees"), and Rabin signatures. In 1988, Shafi Goldwasser, Silvio Micali, and Ronald Rivest became the first to rigorously define the security requirements...

and named after Pascal Paillier in 1999, is a probabilistic asymmetric algorithm for public key cryptography. The problem of computing n-th residue classes...

led to the definition of semantic security by Shafi Goldwasser and Silvio Micali. The concept of multi-player mental poker was introduced in Moti Yung's...

Schnorr signature is a digital signature produced by the Schnorr signature algorithm that was invented by Claus Schnorr. It is a digital signature scheme known...

encryption scheme. They are also used in several integer factorization algorithms that have applications in cryptography, such as Lenstra elliptic-curve...

assumptions: examples include the Micali–Schnorr generator, Naor-Reingold pseudorandom function and the Blum Blum Shub algorithm, which provide a strong security...

Gilbert Vernam • GMR (cryptography) • GNU Privacy Guard • GnuTLS • Goldwasser–Micali cryptosystem • Gordon Welchman • GOST (block cipher) • GOST (hash function)...

its "Private Conversations". The protocol combines the Double Ratchet Algorithm, prekeys (i.e., one-time ephemeral public keys that have been uploaded...

the second phase of the selection process, several parameters of the algorithm were adjusted and the compression of the public keys was dropped. Most...

problem is "easy" and solvable in polynomial time with a simple greedy algorithm. In Merkle–Hellman, decrypting a message requires solving an apparently...

with Silvio Micali, an algorithm for finding maximum matchings in general graphs; the latter is still the most efficient known algorithm for the problem...