Reputation
14,540
Next tag badge:
102/100 score
17/20 answers
Badges
1 36 76
Newest
 Nice Answer
Impact
~289k people reached

9h
comment ECFP harder than ECDLP ?
@Sandy It's an Underdetermined system of linear equations. There are many equally valid valid solutions with nothing to distinguish one of them as the single correct one. But that doesn't make it a harder problem in the cryptographic sense.
9h
comment ECFP harder than ECDLP ?
@Sandy What do you mean by "the correct set"?
13h
answered ECFP harder than ECDLP ?
23h
comment Here I am like a
I'm voting to close this question as off-topic because it's not about cryptography.
1d
comment If I am about to generate one-time pad, where should I generate my pads from?
@assp1r1n3 Buy a hardware RNG. Or RDSEED from your application, if your CPU supports that instruction (AFAIK few do).
1d
comment If I am about to generate one-time pad, where should I generate my pads from?
@otusRDRAND is only computationally secure. Only RDSEED aims of information theoretical security.
1d
answered If I am about to generate one-time pad, where should I generate my pads from?
2d
comment Examples of modern, widely used ciphers that suddenly fell?
Was RC4 already a major cipher when it fell to cryptoanalysis in 1995, merely a year after being published?
2d
answered Strength of $H(k\|H(m))$ as a MAC algorithm
May
1
revised Is Schannel supposed to use SHA1 for (EC)DHE params?
edited tags; edited tags
May
1
revised Can I get successful signature verification with just altering message and signature?
edited tags
May
1
revised RSA signatures without padding
edited tags
May
1
comment What are the advatages or disadvatages of using seperate chaining over linear or quadratic probing?
It sounds to me like this question is about data-structures (hash tables). Could you explain how this relates to security or cryptography?
May
1
comment Is there a cryptographic function or system in which it becomes HARDER to break as time passes?
@E.Rose Post quantum crypto, like McEliece, NTRU, hash signatures. There is some work on moving these from theoretical schemes to something used in practice.
Apr
29
comment What is the private key in RSA?
Personally I wouldn't call $d$ the private key, because it can't decrypt on its own. I'd just refer to it as the private exponent.
Apr
28
revised Is this cascading encryption, and is my security weakened as a result?
deleted 10 characters in body
Apr
28
reviewed Approve Is this cascading encryption, and is my security weakened as a result?
Apr
26
awarded  Nice Answer
Apr
25
comment What implementation properties of a hash function prevent safe truncation?
I feel comfortable truncating SHA2 as long as the truncated size is sufficient for my desired security level. NIST does so as well (consider SHA-512/256 as an example)
Apr
24
comment RSA when n= 2360221 and encryption = 5 find decryption key d, when M =1234
1) Factor n 2) Follow the wikipedia article on RSA to compute d. | hint: $2360221 = 1117 \cdot 2113$