meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | 43 | |
| visits | member for | 1 year, 9 months |
| seen | 1 hour ago | |
| stats | profile views | 9 |
programs in C and Perl, mostly
|
Mar 22 |
answered | reduces the coefficients of a modulo 3 on NTRU |
|
Mar 12 |
comment |
computing inverses in truncated polynomial rings manually for NTRU encryption Pretty sure, if I have more time, I'll try to compute it too, by hand, of course. |
|
Mar 12 |
comment |
computing inverses in truncated polynomial rings manually for NTRU encryption @SuniaRaharja yes, the polynomial $x$ (bad choice of notation) is indeed the inverse, and then you need to reduce mod 11. If all is well, you shouls get $a^{-1}$ or an equivalent (mod 11) polynomial. |
|
Mar 11 |
comment |
computing inverses in truncated polynomial rings manually for NTRU encryption Basically, using Extended Euclidean, do the inverse computation of $a$ in $\mathbb{Z}[X]$, doing the gcd with $X^7 - 1$, and reduce the coefficients modulo 11 afterwards. |
|
Mar 11 |
comment |
computing inverses in truncated polynomial rings manually for NTRU encryption @SuniaRaharja typo alert: $4^X$ should be $4X$; do you the result of the multiplication as correct, using $X^7 \equiv 1, X^8 \equiv X$, etc? This we do in $\mathbb{Z}[X]$ first, then reduce the coeffficients modulo $11$ (so $22 \equiv 0$, $-10 \equiv 1$). |
|
Mar 11 |
comment |
computing inverses in truncated polynomial rings manually for NTRU encryption @SuniaRaharja Take the coefficients (which are integers) modulo 11. |
|
Mar 1 |
comment |
Finding roots in $\mathbb{Z}_p$ Cantor-Zassenhaus or Berlekamp algorithms will factor polynomials, e.g. |
|
Feb 28 |
answered | Finding roots in $\mathbb{Z}_p$ |
|
Feb 23 |
answered | RSA private key format for Mega |
|
Feb 20 |
comment |
Why are RSA keys encoded with ASN.1 for TLS? @roger ASN.1 does not allow for arbitrary code execution, it's just a way (which is already used in many other standards!) to unambiguously code data, like a sequence of big integers (as we need to do, among other things). The parsing library can be bad and have bugs, but it's not the encoding that is the problem. Data is just data... And javascript has nothing to do with it. (I don't understand that remark at all) |
|
Feb 19 |
comment |
Why is Blum-Goldwasser not IND-CCA-2 secure? @Johannes We choose the same $y$. Read up on what the Ind-CCA2 game is: the adversary is allowed to ask for decryptions of all messages, except the ones that are totally identical to challenge messages. So we choose the message to be the same except the first bit, and this is allowed. You can see it is quite a strong notion of security! |
|
Feb 19 |
answered | Why is Blum-Goldwasser not IND-CCA-2 secure? |
|
Feb 19 |
revised |
RSA Certificate Owner and Issuer line meanings? added 119 characters in body |
|
Feb 19 |
comment |
Why is Blum-Goldwasser not IND-CCA-2 secure? The argument is mentioned (briefly) under the point Security and Efficiency on that same page. |
|
Feb 19 |
answered | RSA Certificate Owner and Issuer line meanings? |
|
Feb 8 |
awarded | Commentator |
|
Feb 8 |
comment |
RSA primes vs. largest known primes the problem with a Mersenne prime $p$ is that $p+1$ only has small factors, and this allows for faster factoring. Same holds when $p-1$ has lots of small factors as well. So in RSA keygeneration, such primes are not used, in the standard libraries.. |
|
Oct 25 |
comment |
Because the algorithm is known, it is no longer a trade secret @WilliamHird there were weaknesses in the system itself that were exploitable, e.g. the fact that no letter could encrypt to itself aided the placing of probable plaintext, and the specifics of the stepping (which was too regular) also implied the Stecker-settings could be separated from the wheel settings if probable plaintext was known. The allied rotor systems (Typex, SIGABA) did not suffer from such weaknesses. Human errors played a role (the weak indicator system in the beginning of WW II, stereotypical text) but were IMHO not even the most essential. |
|
Oct 7 |
comment |
RSA encryption input range - plaintexts that map to ciphertexts? Indeed. And that's why RSA is used with padding, to ensure that values like that cannot occur, and to ensure that the same message will have different encryptions at different times (which is another desirable property: the ciphertext leaks as little information as possible). |
|
Oct 7 |
comment |
When is each key used when encrypting an email using OpenPGP? @Xeoncross Indeed. |
