Newest Questions

0 votes
3 answers
2k views

Assume a simple case, that an attacker knows the password creation scheme, and that we're not dealing with state actors, nor with sites which keep passwords in plain text. We're trying to defend ...
ispiro's user avatar
  • 2,095
2 votes
2 answers
499 views

This might be a very short very obvious answer, because I've yet to come across a question similar to mine in my searches. Given a lattice L, with a good base B1 and a bad base B2, what stops an ...
Daniel B's user avatar
  • 357
4 votes
3 answers
483 views

Let's assume I have datapiece A which, after being put through a model or neural network, has a known output X in the unencrypted space. When I move datapiece A into an encrypted space, and put it ...
nick carraway's user avatar
2 votes
3 answers
2k views

This string, "Au+u1hvsvJeEXxky" has a Shannon entropy of 3.75 and a length of 16. The binary form of the string ( derived from Ascii-table ) is: 01000001 01110101 ...
joop s's user avatar
  • 93
0 votes
1 answer
153 views

We would like to ask you to give a construction for requested scheme which provides those properties or give a proof that is not achievable. [Note that unsuccessful attempts to build such a scheme ...
Robert's user avatar
  • 51
2 votes
2 answers
385 views

Ok, I am in a little bit of cryptographical fix :D I need to figure out a way to encrypt and decrypt data handled by a website. The website is intended only for a certain group of people who will ...
flipper's user avatar
  • 123
1 vote
0 answers
310 views

I am building kinda simple IoT project, but I would like to implement good security (just for educational purposes and fun). My plan is to build simple solution where one arduino board reads some data ...
user219863's user avatar
1 vote
1 answer
69 views

As I understand it, if you have a Bloom filter that was generated from the members of a specific set, you can test whether a given bit string is in the set (with some given false positive rate). The ...
Ian MathWiz's user avatar
-1 votes
1 answer
223 views

Let $F:\{ 0,1 \}^n \times \{ 0,1 \}^ n \rightarrow Z^*_q $ is a PRF, and $H:\{ 0,1 \}^{2n} \rightarrow \{ 0,1\}^n$ is a secure hash function. Is the following construction $\Pi=(Gen,Mac,Vrfy)$ is a ...
Robert's user avatar
  • 51
0 votes
1 answer
215 views

Suppose we have an almost shared secret. For example if we have a noisy connection to a shared secret source of randomness. So Alice has $k_1$ and Bob has $k_2$ similar but not necessarily identical ...
Meir Maor's user avatar
  • 12.2k
0 votes
1 answer
560 views

I only understand assurance of integrity using a hash function. How to use cryptograpy to assure data integrity?
Ed S's user avatar
  • 125
4 votes
1 answer
911 views

Assume I have a password with sufficient entropy but may not be uniformly distributed, how can I turn the password into a key that can be used for symmetric encryption? I think there is surely such a ...
Cyker's user avatar
  • 769
2 votes
0 answers
88 views

RFC 5869: Thus, the goal of the "extract" stage is to "concentrate" the possibly dispersed entropy of the input keying material into a short, but cryptographically strong, ...
Cyker's user avatar
  • 769
0 votes
1 answer
184 views

Suppose \begin{align*} g^r &\equiv h \pmod N, \\ h^s &\equiv g \pmod N, \end{align*} for known $g$, $h$, $r$, $s$, and $N$, but not $\phi(N)$. Then $$g^{r\cdot s - 1} \equiv 1 \pmod N,$$...
user avatar
0 votes
1 answer
176 views

I have an implementation of scrypt that doesn’t produce the same output as an online scrypt key generator I found. For example, if I run my own scrypt in a function like this: ...
katrik's user avatar
  • 35

15 30 50 per page