Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2023-07-18 10:55:35 +0200 | received badge | ● Enthusiast |
| 2023-07-11 11:50:47 +0200 | commented answer | Model of polynomial over $GF(2^n)$ as polynomials over $GF(2)$ Is it possible to convert this object to a polynomial over GF(2)? |
| 2023-07-06 11:59:24 +0200 | received badge | ● Popular Question (source) |
| 2023-02-15 10:51:29 +0200 | commented question | BUG: SageMath 9.6 for Ubuntu; inverse() with What is your ubuntu version? |
| 2023-02-03 10:39:09 +0200 | commented answer | Model polynomials of $GF(p)$ as polynomials of $GF(p^n)$ Thank you, I didn't explain the question clearly, I update it. |
| 2023-02-03 10:38:46 +0200 | edited question | Model polynomials of $GF(p)$ as polynomials of $GF(p^n)$ Model polynomials of $GF(p)$ as polynomials of $GF(p^n)$ Imagine that we have polynomials $F_1, F_2, \ldots, F_n : \math |
| 2023-02-03 10:37:55 +0200 | edited question | Model polynomials of $GF(p)$ as polynomials of $GF(p^n)$ Model polynomials of $GF(p)$ as polynomials of $GF(p^n)$ Imagine that we have polynomials $F_1, F_2, \ldots, F_n : \math |
| 2023-02-03 10:37:41 +0200 | edited question | Model polynomials of $GF(p)$ as polynomials of $GF(p^n)$ Model polynomials of $GF(p)$ as polynomials of $GF(p^n)$ Imagine that we have polynomials $F_1, F_2, \ldots, F_n : \math |
| 2023-02-03 10:37:16 +0200 | received badge | ● Editor (source) |
| 2023-02-03 10:37:16 +0200 | edited question | Model polynomials of $GF(p)$ as polynomials of $GF(p^n)$ Model polynomials of $GF(p)$ as polynomials of $GF(p^n)$ Imagine that we have polynomials $F_1, F_2, \ldots, F_n : \math |
| 2023-02-03 10:34:46 +0200 | commented question | Model polynomials of $GF(p)$ as polynomials of $GF(p^n)$ Yes, I will update the question with the better description. But that's what I had in mind, is it possible? |
| 2023-02-02 14:42:51 +0200 | commented answer | Model of polynomial over $GF(2^n)$ as polynomials over $GF(2)$ https://ask.sagemath.org/question/66189/model-polynomials-of-gfp-as-polynomials-of-gfpn/ |
| 2023-02-02 14:42:37 +0200 | received badge | ● Organizer (source) |
| 2023-02-02 14:42:06 +0200 | asked a question | Model polynomials of $GF(p)$ as polynomials of $GF(p^n)$ Model polynomials of $GF(p)$ as polynomials of $GF(p^n)$ Imagine that we have polynomials $F_1, F_2, \ldots, F_n : \math |
| 2023-02-02 14:22:06 +0200 | commented answer | Model of polynomial over $GF(2^n)$ as polynomials over $GF(2)$ Is the reverse direction also possible? like taking n polynomials over $\mathbb{F}_p$ and write them as polynomials over |
| 2023-02-02 14:22:00 +0200 | commented answer | Model of polynomial over $GF(2^n)$ as polynomials over $GF(2)$ Is the reverse direction also possible? like taking n polynomials over $\mathbb{F}_p$ and write them as polynomials over |
| 2023-01-24 13:05:23 +0200 | received badge | ● Supporter (source) |
| 2023-01-24 13:05:23 +0200 | marked best answer | Model of polynomial over $GF(2^n)$ as polynomials over $GF(2)$ Let's say $F = GF(2^n)$ and $P(x) = x^e, P : F \rightarrow F$. Is there a way, not necessarily optimal, to write each bit of the output of $P$ as a function of input bits? |
| 2023-01-24 13:05:23 +0200 | received badge | ● Scholar (source) |
| 2023-01-24 12:31:53 +0200 | received badge | ● Student (source) |
| 2023-01-23 23:24:15 +0200 | commented answer | Model of polynomial over $GF(2^n)$ as polynomials over $GF(2)$ How can I then write output bits as functions of input bits? like y_0 = f(x_0, x_1, x_2, x_3)? Does sage have some funct |
| 2023-01-23 20:33:14 +0200 | asked a question | Model of polynomial over $GF(2^n)$ as polynomials over $GF(2)$ Model of polynomial over $GF(2^n)$ as polynomials over $GF(2)$ Let's say $F = GF(2^n)$ and $P(x) = x^e, P : F \rightarro |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.