Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We consider the problem of constructing Diffie-Hellman (DH) parameters which pass standard approaches to parameter validation but… Expand
  • table 1
  • table 2
Is this relevant?
2015
2015
The expectancy in authentications that trump vagaries of cracking techniques have surfaced two blurred lines. One lays between… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
For a number of elliptic curve-based cryptographic protocols, it is useful and sometimes necessary to be able to encode a message… Expand
Is this relevant?
2005
2005
Verifiable secret sharing schemes (VSS) are schemes for the purpose of ensuring that the players are sharing a unique secret and… Expand
Is this relevant?
2003
2003
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
Is this relevant?
2003
2003
Key exposures bring out very serious problems in security services. Especially, it is more severe in the applications such as… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We present a new protocol for efficient distributed computation modulo a shared secret. We further present a protocol to… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A credential system is a system in which users can obtain credentials from organizations and demonstrate possession of these… Expand
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We present the first efficient statistical zero-knowledge protocols to prove statements such as: - A committed number is a prime… Expand
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We present efficient zer~knowledge proof systems for quasisafe prime products and other related languages. Quasisafe primes are a… Expand
Is this relevant?