Ceriath
  • Member for 3 years
  • Last seen more than 2 years ago
Does a Finite Field of 36 elements exist?
Accepted answer
8 votes

Finite fields only exist for an order $q$ if $q$ is prime or a power of a prime (http://mathworld.wolfram.com/FiniteField.html). Since 36 is neither a prime itself, nor it is a power of a prime ($36 = ...

View answer
How is Blakley's Secret Sharing Scheme perfect?
Accepted answer
3 votes

Okay so SEJPM's comment just gave me an answer or better made me realize my flaw: Since the secret is only one coordinate (e.g. $x$) the information that the secret is on a specific infinite line is ...

View answer
Time to guess a 100-bit key at one billion operations per second and one billion cores?
Accepted answer
2 votes

Yes, your math is correct. That is why 128-bit keys are considered secure.

View answer
What is the difference between static and dynamic tokens?
1 votes

Software tokens are software that generate tokens for you. For example the Google Authenticator App or Authy on your smartphone, while hardware tokens are actual hardware that are only made for ...

View answer
Asmuth-Bloom Secret Sharing $m_0$ public?
Accepted answer
1 votes

According to Dragan&Tiplea,On the Asymptotic Idealness of the Asmuth-Bloom Threshold Secret Sharing Scheme $m_0$ is a public parameter. The scheme itself does not require $m_0$ to be kept secret. ...

View answer
Is my proof of Asmuth-Bloom scheme's perfection correct?
Accepted answer
1 votes

Okay, so i was finally able to figure out a solution for this. The scheme does indeed yield 138 valid results to guess the secret from. However, since they already know the secret lies in $\mathbb{Z}_{...

View answer
How many keys in a Hybrid Cryptosystem?
Accepted answer
1 votes

So first, for each employee there is a public-private-key pair, which is $2n$. For each session one symmetric key is created. Your solution assumes the communication partners initially agree on a ...

View answer
Original papers for hashing functions
0 votes

MD4,5 and 6 can be found on Rivest's website, but 4 and 5 are both RFCs which won't have the insight, while there is a paper and a talk to MD6. There also is a paper for SHA3/Keccak.

View answer