meta user
network profile
| bio | website | bolet.org/~pornin |
|---|---|---|
| location | Quebec City, Canada | |
| age | 37 | |
| visits | member for | 1 year, 10 months |
| seen | 11 hours ago | |
| stats | profile views | 284 |
Cryptographer, programmer in several languages (C, Java, several assemblies, Pascal, Forth...). I also have a life.
|
Oct 27 |
answered | Subgroups generators with respect to group generators of composite order |
|
Oct 25 |
comment |
What is the “Random Oracle Model” and why is it controversial? @quantumSoup: well, it would be a true random oracle -- assuming that it has access to a source of truly random numbers (when we use radioactive decay, we must trust physicists for it; and obtaining uniform output is hard, especially if we do not trust hash functions for doing their job properly). And, of course, the "infinite storage" part can imply some practical issues. |
|
Oct 24 |
comment |
A discrete-log-like problem, with matrices: given $A^k x$, find $k$ In the $m\times m$ case, you just need one of the $x_j$ for $1 \lt j \leq m$ to be non-zero, to solve for $k$. To make it hard (i.e. equivalent to DL), all of the $x_j$ (except $x_1$) must be zero. |
|
Oct 24 |
revised |
A discrete-log-like problem, with matrices: given $A^k x$, find $k$ Fixed summary ("easy" vs "hard") to match the rest of the answer. |
|
Oct 24 |
reviewed | Approve suggested edit on A discrete-log-like problem, with matrices: given $A^k x$, find $k$ |
|
Oct 23 |
awarded | Nice Answer |
|
Oct 22 |
awarded | Notable Question |
|
Oct 22 |
awarded | aes |
|
Oct 20 |
answered | Is AES-256 weaker than 192 and 128 bit versions? |
|
Oct 19 |
reviewed | Approve suggested edit on Using pairings to verify an extended euclidean relation without leaking the values? |
|
Oct 17 |
awarded | Suffrage |
|
Oct 17 |
awarded | Vox Populi |
|
Oct 16 |
revised |
How was the complexity of the Biclique Attack calculated? Fixed complexity figure to account for success rate (100% vs 50%). |
|
Oct 16 |
awarded | Necromancer |
|
Oct 15 |
awarded | Revival |
|
Oct 15 |
awarded | cryptanalysis |
|
Oct 15 |
comment |
Increase number of rounds for SPN and Feistel ciphers @marluh: slowing down both the attacker and the defender by the same factor is not good security. We do it with password hashing because we know not how to do better, but we really prefer when the attacker is slowed down exponentially -- and that's what happens with a larger key. A 128-bit key is enough to defeat brute force utterly (by a large margin) so slowing down produces no tangible security gain: if the system gets broken, it won't be through brute force. However, slowing down has quite tangible drawbacks (namely, things go slower for the defender, too). |
|
Oct 14 |
answered | How was the complexity of the Biclique Attack calculated? |
|
Oct 14 |
answered | Increase number of rounds for SPN and Feistel ciphers |
|
Oct 14 |
answered | Can I save space for short messages by using encryption with private key instead of a signature? |
