meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 6 months |
| seen | 8 hours ago | |
| stats | profile views | 9 |
|
Feb 25 |
accepted | Which one is fastest? Karatsuba or Montgomery multiplication? |
|
Feb 25 |
comment |
Which one is fastest? Karatsuba or Montgomery multiplication? @HenrickHellström Thanks for your comment. But why on x64 is the other way around? You just have bigger registers on x64.At each clock pulse you can transfer 64bits. That means that you can save at once 64bits and your word size is 64 bits. So i guess it will further improve the running time of the scheme Karatsuba-then-Montgomery. Or i am missing sth? |
|
Feb 24 |
asked | Which one is fastest? Karatsuba or Montgomery multiplication? |
|
Feb 24 |
answered | Bad/Crackable Encryption Example? |
|
Feb 15 |
comment |
Low complexity implementation of a small blocksize cipher (< 64 bit) Have you looked at present leightweight block cipher with 64 bit block size? |
|
Feb 6 |
comment |
Guarding against cryptanalytic breakthroughs: combining multiple hash functions It was my misunderstanding of your question.I didn't check thoroughly the case of different hash functions. |
|
Feb 6 |
answered | Guarding against cryptanalytic breakthroughs: combining multiple hash functions |
|
Jan 29 |
accepted | What are the differences between proofs based on simulation and proofs based on games? |
|
Jan 29 |
accepted | Is there any semantic difference between predicate encryption and functional encryption? |
|
Jan 29 |
comment |
What are the differences between proofs based on simulation and proofs based on games? Also it seems that simulation based definitions are completely different with game based and more abstract. As in simulation you are trying to prove that the idealized model is the best model that a security construction "must" follow in its security proof. So as i first step you have a simulation definition for the best things someone should prove and them with games and indistinguishability you prove that your construction is very close to the idealized one. Am i correct? |
|
Jan 29 |
comment |
What are the differences between proofs based on simulation and proofs based on games? Can you point out some "good" simulation based proofs where "X model the best that one could do"? Yes you clearly defined what i wanted to say in question 1 but question 2 contains some valuable info as well if it can be answered... |
|
Jan 28 |
asked | What are the differences between proofs based on simulation and proofs based on games? |
|
Jan 16 |
asked | Where i can find an AES implementation in python? |
|
Dec 20 |
comment |
Why the following attack in common modulus RSA works? and why $gcd(e_b,V)=1$ , according to your notation where $V=e_a \cdot d_a -1$ |
|
Dec 20 |
comment |
Why the following attack in common modulus RSA works? So why in every book, research paper, textbook, the requirement is $e \cdot d \equiv 1 \phi(N)$ and not $e \cdot d \equiv 1 \lambda(N)$ |
|
Dec 20 |
comment |
Why the following attack in common modulus RSA works? I don't understand the involvement of $\lambda(N) = lcm(p-1, q-1)$. As far as i know $e \cdot d \equiv 1 mod\phi(N)$ |
|
Dec 20 |
asked | Why the following attack in common modulus RSA works? |
|
Dec 18 |
comment |
Is there any semantic difference between predicate encryption and functional encryption? Ok but you didn't answer to my question. Is there an obvious difference, a use case scenario whereby i cannot use PE in terms of functionality and security and i should use FE |
|
Dec 18 |
comment |
Is there any semantic difference between predicate encryption and functional encryption? It's better to point me the paper of the TCC. |
|
Dec 13 |
asked | Is there any semantic difference between predicate encryption and functional encryption? |
