Reputation
4,387
Next tag badge:
85/100 score
33/20 answers
Badges
2 17
Newest
 Nice Answer
Impact
~61k people reached

15h
comment “123456” and “password” as crack standards
so you are basically asking if security by obscurity is a good idea?
16h
comment “123456” and “password” as crack standards
en.wikipedia.org/wiki/Salt_%28cryptography%29
1d
comment Ideas for non duplicate cryptographically secure numbers
@GuutBoy yes 37-bits, corrected
1d
revised Ideas for non duplicate cryptographically secure numbers
fix on block size notation
1d
answered Ideas for non duplicate cryptographically secure numbers
2d
comment Ideas for non duplicate cryptographically secure numbers
generate random key, encrypt a sequential counter
Jun
26
comment HMAC for encrypted authentication token: recommended iteration number
iterative hashing is for weak entropy, if your tokens are random and large enough, then 1 iteration is fine
Jun
26
comment Program to generate a secure 128 bit key on a windows machine
@VincentAdvocaat I can make a standalone of the RNG provider I use in my own programs
Jun
18
comment How can complexity be increased or decreased in AES?
0% = no encryption?
Jun
18
awarded  Nice Answer
Jun
17
answered SHA512 faster than SHA256?
Jun
16
comment How HMAC.Update function works?
crypto.stackexchange.com/questions/16510/…
Jun
16
comment Why can't I use ECB with some obfuscation for transient RAM?
I assume you are talking about encrypting data in memory. See how OCB works, it uses the XEX structure with ECB as the encrypt operation
Jun
16
comment Securely start a client server connection without ssl/tls
thats not how HMAC works
Jun
12
comment Encryption of exe file
AV software also looks for certain behaviour in memory, like if a process tries to do something that a regular process should not, and it also looks for memory signatures.
Jun
11
answered Is DES slow in hardware or only in software?
Jun
11
comment Rationale for use of right-shift (rather than rotate) in SHA-2?
The followup on that, is that with modular addition the probability of a differential characteristic (for a specific attach on HMAC-SHA-1) depends on the position within the word, and rotating the characteristic doubles the probability. This type of attack would not work on the SHA-2 message schedule. eprint.iacr.org/eprint-bin/getfile.pl?entry=2006/…
Jun
11
comment Rationale for use of right-shift (rather than rotate) in SHA-2?
@fgrieu actually I think he is spot on, from a paper describing attacks on SHA-1: "the linear code describing the SHA-1 message expansion is invariant with respect to word rotation". The linear code being $\sigma$.
Jun
10
comment How to calculate 16x16 SBox and InvSBox in AES Encryption?
crypto.stackexchange.com/questions/18062/…
Jun
10
revised Rationale for use of right-shift (rather than rotate) in SHA-2?
fixed FIPS number