Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,166,814 papers from all fields of science
Search
Sign In
Create Free Account
Safe prime
A safe prime is a prime number of the form 2p + 1, where p is also a prime. (Conversely, the prime p is a Sophie Germain prime.) The first few safe…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Decisional Diffie–Hellman assumption
Diffie–Hellman key exchange
Discrete logarithm
Discrete logarithm records
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Dynamic Salt Generating Scheme Using Seeds Warehouse Table Coordinates
Jieling Zhang
,
Sirapat Boonkrong
International Conferences on Information Science…
2015
Corpus ID: 18883436
The expectancy in authentications that trump vagaries of cracking techniques have surfaced two blurred lines. One lays between…
Expand
2015
2015
Prevention of Exponential Equivalence in Simple Password Exponential Key Exchange (SPEKE)
Hanwook Lee
,
Dongho Won
Symmetry
2015
Corpus ID: 13103541
Simple Password Exponential Key Exchange (SPEKE) and Dragonfly are simple password-based authenticated key exchange protocols…
Expand
2014
2014
A comparison study between the TLS-based security framework and IKEv2 when protecting DSMIPv6 signaling
Bruno H. C. Faria
,
J. Korhonen
,
E. Souto
Comput. Stand. Interfaces
2014
Corpus ID: 28863407
2011
2011
Probabilistic Analysis on the Optimal Combination of Trial Division and Probabilistic Primality Tests for Safe Prime Generation
Heejin Park
,
Dong Kyue Kim
IEICE Trans. Inf. Syst.
2011
Corpus ID: 40018924
SUMMARY As afe primep is a prime such that (p − 1)/2 is also a prime. A primality test or a safe primality test is normally a…
Expand
2008
2008
A New Blind Signature Scheme Based On Factoring and Discrete Logarithms
N. Tahat
,
E. S. Ismail
,
R. Ahmad
2008
Corpus ID: 9265632
Blind signature scheme, an important cryptographic primitive, is useful in protocols that guarantee the anonymity of the…
Expand
2007
2007
Optimal resilient threshold GQ signatures
Cheng-Kang Chu
,
Wen-Guey Tzeng
Information Sciences
2007
Corpus ID: 41259042
2005
2005
Verifiable Threshold Sharing of a Large Secret Safe-Prime
M. Ibrahim
International Symposium on Information Technology…
2005
Corpus ID: 11756096
Verifiable secret sharing schemes (VSS) are schemes for the purpose of ensuring that the players are sharing a unique secret and…
Expand
2005
2005
Verifiable threshold sharing of a large secret safe-prime
M. Ibrahim
International Conference on Information…
2005
Corpus ID: 16912795
Verifiable secret sharing schemes (VSS) are schemes for the purpose of ensuring that the players are sharing a unique secret and…
Expand
2003
2003
Double-Speed Safe Prime Generation
D. Naccache
IACR Cryptology ePrint Archive
2003
Corpus ID: 17634546
Safe primes are prime numbers of the form p = 2q +1 where q is prime. This note introduces a simple method for doubling the speed…
Expand
2003
2003
Safe Prime Generation with a Combined Sieve
M. Wiener
IACR Cryptology ePrint Archive
2003
Corpus ID: 36466646
A number p is a safe prime if both p and (p − 1)/2 are prime. This note describes a method of generating safe primes that is…
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