Reputation
14,635
Next tag badge:
77/100 score
34/20 answers
Badges
3 16 60
Newest
 Nice Answer
Impact
~236k people reached

9h
revised How to calculate key size of a security algorithm?
added 7 characters in body; added 20 characters in body
16h
comment How to calculate key size of a security algorithm?
Nope, not secure. There are tricks to make them more secure and the amount of ciphertext per key matters. But it will never match a modern cipher - if that cipher is correctly applied of course.
16h
comment How to calculate key size of a security algorithm?
The effective key size is the key size when the most successful attacks are applied. A simple substitution cipher is not secure and can be attacked by frequency analysis. The above change won't influence the security.
18h
comment Why is AES-128 considered secure while RSA needs a 1024-bit size to be considered secure
If you take a look at keylength.com then you quickly find out that a modulus of 1024 bits is considered rather weak nowadays.
18h
answered How to calculate key size of a security algorithm?
18h
comment How to convert the 128 bit output of AES_CTR to 32 bit number?
Hmm, not sure if the off topic vote still counts. Answer: you can just just the leftmost bits (/ bytes) of the key stream as input. That's how the cipherstream is used for normal CTR mode.
1d
comment Caculated time One Point Multiplication with double and method
Alfred, if you post a time in ms then I suppose that is for a specific runtime. Could you post that runtime configuration ? Chances are that somebody here knows about the implementation specifics.
1d
comment Caculated time One Point Multiplication with double and method
@CodesInChaos ok, the original showed it as caption instead. Glad I at least edited that out. We can leave it as preformatted code then I suppose, unless somebody knows the correct Latex tags for this...
1d
comment Caculated time One Point Multiplication with double and method
I've formatted your question. Please do not use '#' for formulas but use Latex (or ask for help). I'm not sure about your equations to I've turned them into code fragments. Please edit your question again to clear things up. What do you mean with ADD*ADD? Please reread your question before hitting the post button.
1d
revised Caculated time One Point Multiplication with double and method
formatting
Feb
8
revised RSA PKCS#1, v1.5 padding output
deleted 179 characters in body
Feb
8
revised RSA PKCS#1, v1.5 padding output
added 333 characters in body
Feb
8
revised RSA PKCS#1, v1.5 padding output
added 333 characters in body
Feb
8
answered RSA PKCS#1, v1.5 padding output
Feb
7
comment HRNG for One Time Pad
RDRAND is standardized nowadays in probably all mainstream Intel CPU's. Not sure what the status is for AMD though, I think it will only be integrated into their next line of CPU's.
Feb
7
revised What are possible caveats when generating a group for use as parameters for Diffie-Hellman key exchange?
added 5 characters in body
Feb
7
comment How to encrypt incomplete block with RSA as a block cipher?
Note to self: add links to answer.
Feb
7
revised How to encrypt incomplete block with RSA as a block cipher?
added 44 characters in body
Feb
7
revised Compression in key generation of DES algorithm
added 18 characters in body
Feb
7
answered How to encrypt incomplete block with RSA as a block cipher?