71 reputation
5
bio website nadim.computer
location Montreal, Canada
age 24
visits member for 2 years, 7 months
seen Sep 6 at 19:37

My website: http://nadim.computer


Apr
30
revised How do decryption algorithms determine whether your attempted passphrase is correct?
added 11 characters in body
Apr
30
comment How do decryption algorithms determine whether your attempted passphrase is correct?
An HMAC is a hash value (such as a SHA1 hash) that is generated by evaluating the plaintext in conjunction with an authentication key. The authentication key is necessary to prevent the modification of the HMAC itself. During verification, the same HMAC procedure is performed on the plaintext to be verified using the same authentication key. If the same final HMAC is obtained, we know we have the plaintext we're looking for.
Apr
30
awarded  Teacher
Apr
30
revised How do decryption algorithms determine whether your attempted passphrase is correct?
added 345 characters in body
Apr
30
awarded  Supporter
Apr
30
answered How do decryption algorithms determine whether your attempted passphrase is correct?
Apr
29
awarded  Autobiographer
Mar
7
awarded  Student
Mar
6
comment Is it safer to generate your own Diffie-Hellman primes or to use those defined in RFC 3526?
Thank you! I was wondering - are the primes defined in the RFC special in any other way than being derived from Pi? Have they undergone any other testing? If so, what makes them safer or better studied?
Mar
6
awarded  Editor
Mar
6
revised Is it safer to generate your own Diffie-Hellman primes or to use those defined in RFC 3526?
Added link to RFC
Mar
6
asked Is it safer to generate your own Diffie-Hellman primes or to use those defined in RFC 3526?