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

14h
comment Encryption algorithms larger than 256 Bit for “big data” encryption?
I think the actual issue is more with the blocksize of the cipher and not the key size
1d
comment How AES treat string input to encrypt data and what will happen if the cipher key is less than that expected?
The word you are looking for is "Padding"
Jul
28
comment In which step does AES use the key to encrypt data?
How was that not explicitly clear by the names of the steps?
Jul
23
comment Publish my Encryption algorithm and test it
"whenever you cypher plain text with the same algorithm with the same key you would always get a different cypher text" is generally achieved in practice by using a block cipher in CTR mode with nonce or CBC mode with a random IV
Jul
21
comment Understanding JCE Cipher Algorithm Strings
the password needs to be converted into an encryption key for the cipher
Jul
18
comment Why should one prefer Salsa20 over ChaCha?
It is my recollection that the advantage of ChaCha is slightly better diffusion per round, and a modified round structure that allows better performance when certain SSE instructions are available
Jul
11
comment Does AES(x || x) provide secure message authentication when message fits in a single block?
how about M=y || AES(K,x || y) where y is a 64-bit nonce? still 64-bit "mac", but you get replay protection
Jul
11
comment TRNG vs PRNG - Entropy?
True random number generators sometimes generate bits with fractional entropy, or at random intervals, which then need to be "conditioned" by a PRNG of some kind. Intel RDRAND for example uses AES CBC-MAC mode to condition the entropy before sending it to another PRNG for output
Jul
10
comment One cipher to rule them all?
The sponge/duplex constructions such as Keccak are extremely versatile
Jul
10
comment one complex password as a “seed” for localy generated per-service passwords
without checking the code for security, I will say I made my own algorithm that does essentially the exact same thing, except I take the website and username along with a short per site/user password as variables in the 2nd stage
Jul
9
comment different feistel words in key size
@NikhilSingh For the first sentence, yes. Not sure what you mean by word being the same..
Jul
9
comment PK systems using groups in practice
@dylan7 hex, binary, and decimal are all just different ways of viewing the same number, the key is treated as a series of bits, and the mathematical operations are performed on those bits
Jul
9
answered different feistel words in key size
Jul
8
comment How many bits of entropy does an elliptic curve key of length n provide?
@GeraldDavis not the elliptic curve part, rather the seed entropy part that was not quoted here
Jul
8
comment How many bits of entropy does an elliptic curve key of length n provide?
that FAQ is confusing, I do not think the statement is technically accurate
Jul
6
comment SHA-256 exhaustive search
rainbow table isnt even necessary with such a small password and poor salt scheme, only 32GB are required to store the entirety of all salted hashes, with around 1000s of precomputation on a modern desktop, or just over 1 minute on a crack machine.
Jul
6
comment SHA-256 exhaustive search
1 billion per second is using an off the shelf video card from a few years ago, a modern system designed for cracking or bitcoin mining based on Haswell-E with multiple cards can do over 15 times that rate, or about 1 million accounts per hour
Jul
6
comment Can I reduce the MAC size in TLS?
Indeed, reducing the size of the MAC in GCM is a very bad idea
Jul
4
comment Parallel authentication of encrypted data. What AE type to choose?
You want Norx: norx.io
Jul
3
comment Is standardizing a modified AES a good idea?
Kalyna is not a modified version of AES, it is just built from similar components using the same structure.