283 reputation
27
bio website allhours.com
location
age
visits member for 2 years, 9 months
seen 12 mins ago

1d
comment Decrypting a small Message using RSA with a Private Key
@e-sushi There is whole chapter in book provided on exactly this question.Person who ask also did not provide any other relevant information's on RSA like e, and this necessaries are well explained in this relatively short chapter (6 pages). I posted this link, because I was able to write such program with examples in this book long time ago.
1d
answered Decrypting a small Message using RSA with a Private Key
Dec
16
answered Two-timing a one-time pad
Oct
23
comment Is there a “brainwallet” for GPG keys?
This shouldn’t be that difficult to made. All one need is crypto secure, password based, deterministic "random" source.
Oct
22
answered Implementing OpenSSL padding
Aug
10
accepted Why do we need extra hashing if we could use simpler scheme?
Jul
4
awarded  Taxonomist
Jul
30
comment Why do we need extra hashing if we could use simpler scheme?
Oh, I see, what about replacing whit some other mode. That propagates trough all
Jul
30
asked Why do we need extra hashing if we could use simpler scheme?
Jul
14
awarded  Yearling
May
15
awarded  Nice Question
Aug
3
revised What alphanumeric string length can be used to guarantee no hash collisions from CRC-64?
edited body
Aug
3
awarded  Teacher
Aug
3
awarded  Editor
Aug
3
comment What alphanumeric string length can be used to guarantee no hash collisions from CRC-64?
CRC is guaranteed since it uses primitive polynomial. Primitive polynomials are generators of finite field and that mean that CRC can have any value between 1 and 2^N
Aug
3
revised What alphanumeric string length can be used to guarantee no hash collisions from CRC-64?
added 413 characters in body
Aug
3
answered What alphanumeric string length can be used to guarantee no hash collisions from CRC-64?
Jul
31
accepted Security of N bit HMAC
Jul
31
awarded  Scholar
Jul
29
awarded  Student