Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,052,339 papers from all fields of science
Search
Sign In
Create Free Account
Blum–Micali algorithm
Known as:
Blum-Micali algorithm
The Blum–Micali algorithm is a cryptographically secure pseudorandom number generator. The algorithm gets its security from the difficulty of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Blum Blum Shub
Cryptographically secure pseudorandom number generator
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Puncturable Symmetric KEMs for Forward-Secret 0-RTT Key Exchange
Matilda Backendal
2019
Corpus ID: 199007528
The latest version of the Transport Layer Security protocol (TLS 1.3) introduces a pre-shared key zero round-trip time (0-RTT…
Expand
2017
2017
An efficient solution to the socialist millionaires' problem
Maryam Hezaveh
,
C. Adams
Canadian Conference on Electrical and Computer…
2017
Corpus ID: 26563815
We present a two-round protocol to solve the socialist millionaire problem based on the homomorphic property of the Goldwasser…
Expand
2013
2013
Primeless Factoring-Based Cryptography – Solving the complexity bottlenecks of public-key encryption with ephemeral keys –
Noen Given
2013
Corpus ID: 9579232
Factoring-based public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which…
Expand
2012
2012
Primeless Modular Cryptography (Extended Abstract)
Sonia Bogos
,
Ioana Boureanu
,
S. Vaudenay
2012
Corpus ID: 18905662
Most of the known public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE