Reputation
246
Top tag
Next privilege 250 Rep.
View close votes
Badges
1 9
Impact
~27k people reached

  • 0 posts edited
  • 0 helpful flags
  • 19 votes cast
Apr
19
awarded  Autobiographer
Apr
18
comment How secure is a client-side javascript encrypter?
See: tonyarcieri.com/whats-wrong-with-webcrypto JS is never trusted code over HTTP. If HTTPS is in use the need for JS encryption vanishes.
Feb
13
comment Encryption with two meanings without computer or programming
Simliar question here.. Essence: its not possible in a secure way.
Feb
13
comment Metrics of PRNGs
When recently the flaws in Google Chromes RNG were discovered one could see the non-randomness in a small sample of data (one computer screen). I'd like to know whether there are more sphisticated algorithms for pattern detection than looking at noise generated by the RNG under test.
Feb
13
accepted Metrics of PRNGs
Feb
12
asked Metrics of PRNGs
Feb
5
comment Would the rotors in Enigma machines always advance by one position? Or was there a way to set this?
Advantage? It would not add to security if it was done always; actually, always advancing two steps in the second rotor would half the keyspace.
Jan
10
comment Need for salt with IV
You are getting something wrong here: IVs are used in encryption, e.g. AES. Salts are used in hash functions.
Jan
10
comment Need for salt with IV
I dont understand your question. A salt randomizes a hash to protect against rainbow tables. IVs make cryptoanalysis very hard. Thats two very different things.
Jan
3
comment end-to-end encrypted chat app with symmetric + public key encryption, TLS and cert pinning
Guessing the password gives access to the account, the private key is effectively useless; the private key needs to be derived from the password. Also no forward secrecy. In general, this is possible. Its just that nobody does it because you would need to charge people for the service (as, obviously, you cannot sell other peoples data) and other, free alternatives are "secure" enough for most people.
Dec
29
awarded  Critic
Dec
28
comment Modular exponentiation on calculator for textbook RSA
As said: there are algorithms. Google for mod pow operation. But you dont want to type these out on your small calculator. Use sth. like this: javascripter.net/math/calculators/100digitbigintcalculator.htm
Dec
28
comment Modular exponentiation on calculator for textbook RSA
Standard calculators cannot do that because $15^{23}$ is too big for a calculator to store. Computers use special algorithms to combine the exponentiation and the modulus in one calcuation step thus avoiding having to calculate $m^e$. If you get hands on a scientific calcuator that allows custom programs to be written on it, you can implement such an algorithm.
Dec
27
revised How should I generate secure random numbers deterministically?
added 6 characters in body; added 4 characters in body
Dec
26
comment How should I generate secure random numbers deterministically?
The hash is not required. I dont know about Any padding techniques for the counter in CTR; i added the hash to be on the safe side. I frickled the 128bit cipher in there because i believe AES is the most battle-tested cipher available - and it has 128bit (yes, Rihjandel 256 would work, too, but again i'd rather be on the safe side)
Dec
26
answered How should I generate secure random numbers deterministically?
Dec
24
comment What is the best current way to cryptographically secure databases?
What about running your favourite DB on a hardware-encrypted hdd?
Jun
23
awarded  Caucus
Mar
5
awarded  Yearling
Aug
10
comment Help deciphering caesar cipher
Does that underscore represent a sapce or is it part of the alphabet/character set of this cipher?