29,875 reputation
12359
bio website
location
age
visits member for 3 years
seen 12 mins ago

Feb
3
awarded  Nice Answer
Feb
2
answered Proof for exponentiation in modular arithemtic
Feb
2
reviewed Approve suggested edit on miyaguchi-preneel tag wiki excerpt
Feb
2
reviewed Approve suggested edit on secure-storage tag wiki
Feb
2
reviewed Approve suggested edit on ephemeral tag wiki excerpt
Feb
2
reviewed Approve suggested edit on ephemeral tag wiki
Feb
2
reviewed Approve suggested edit on embedded tag wiki
Feb
2
reviewed Approve suggested edit on secure-storage tag wiki excerpt
Feb
2
reviewed Approve suggested edit on miyaguchi-preneel tag wiki
Feb
2
reviewed Approve suggested edit on embedded tag wiki excerpt
Feb
2
comment Is there a technique to confirm that a given large integer value is a product of two primes?
@User2014: there is no known test that is easier that factorization; for small (say, 128 bit) numbers, yes, we can determine whether the integer was a factor of two primes, but we can also factor that integer as well. Note that the 'answers' that Messer and Sebastian gave were really factorization methods.
Feb
2
comment Is there a technique to confirm that a given large integer value is a product of two primes?
Actually, another question would be how you intend to compute the gcd between two numbers, when one of them is over $2^{1400}$ bits long...
Feb
1
answered Is there a technique to confirm that a given large integer value is a product of two primes?
Jan
31
comment Cryptanalysis of an certain algorithm
Can I ask why this was downvoted? I have no problem someone either disagreeing with this answer, or saying that this answer doesn't address the question, however I'd prefer if I know what their objection was.
Jan
31
answered Why can ECC key sizes be smaller than RSA keys for similar security?
Jan
28
answered Z*p Generator (Cyclic Group) in java
Jan
27
comment Avoiding overflow when encrypting with RSA
I think he's not aware that you can do mod n after each intermediate multiply.
Jan
27
answered Why do we use 1024 / 160 bit primes in DSA?
Jan
27
comment How can I encrypt more than 64 bit with the Data Encryption Standard?
@Goot: well, ECB mode should be avoided unless you know what you're doing. However, ECB mode also uses the same key for each block.
Jan
27
comment Cryptanalysis of an certain algorithm
Actually, even the ability to transpose round keys is probably too strong of a capability. For example, if you have access to both AES (keyed randomly) and AES (with the same key) with the last two round keys transposed, then it would be easy to break it. This doesn't demonstrate that AES is weak; this shows that this attack is not a valid attack model.