Skip to search formSkip to main contentSkip to account menu
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.
2017
2017
Roscoe recently showed how HISPs, a class of protocol to allow humans to contribute to the creation of secure authentic channels… Expand
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
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
2005
2005
Verifiable secret sharing schemes (VSS) are schemes for the purpose of ensuring that the players are sharing a unique secret and… Expand
2003
2003
  • M. Wiener
  • IACR Cryptol. ePrint Arch.
  • 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
2003
2003
  • D. Naccache
  • IACR Cryptol. ePrint Arch.
  • 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
Key exposures bring out very serious problems in security services. Especially, it is more severe in the applications such as… Expand
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
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
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