The tag has no wiki summary.

learn more… | top users | synonyms

0
votes
0answers
51 views

Simple recursive function?

I'm new in Mathematica and need some help. I'm trying to make a recursive function but I'm not sure how to iterate through more than one item. To be more clear, take this pseudo code for example: ...
1
vote
0answers
37 views

Package FiniteFields

In a Mathematica session, I evaluate: Needs["FiniteFields`"]; fld = GF[2]; Now, for example, I'd like to compute $a^3+a^5$ for $a \in{Z_2}$. The result I'd like ...
4
votes
1answer
126 views

Computing Smith Normal form of a matrix with mod p coefficients

I would like to compute the Smith Normal form of a matrix with coefficients in GF(p). In particular, I am interested in GF(2). I have used the Smith normal form packages for integer and polynomial ...
0
votes
0answers
147 views

Elliptic curve cryptography in Mathematica

I can find no resources for doing elliptic curve cryptography. I have used the finite field package, but I find it cumbersome and it does not seem to have any builtin methods for ECC. How can I get ...
0
votes
1answer
48 views

Square root of a value defined in a finite field?

I am trying to find the right way to compute the square root of a number defined in a finite field. For example, ...
0
votes
1answer
187 views

How to enter and solve this equation in finite fields?

Is there a way in Mathematica 9 to enter and solve the following equation $p(x) = r^x$ where $p(x)$ is a polynomial whose coefficients are drawn from a finite field, and $r$ is a primitive root of ...
2
votes
1answer
79 views

How can we use RowReduce with a modulous AND variables?

We can use RowReduce with a field. For example, we state RowReduce[{{1,3,5},{0,1,2}},Modulous->23] ...which then returns: ...
1
vote
0answers
228 views

Polynomial factorization over finite fields with non-prime order

One can easily factor a polynomial over finite fields of prime order, using Factor command: ...
8
votes
3answers
535 views

How do I make Reduce yield all solutions explicitly?

Say I want to do the following: Reduce[ x+y+z==1, {x,y,z}, Modulus -> 7 ] then I get a solution with parameters, C[1] : ...
0
votes
3answers
233 views

How to evaluate all the essentially distinct polynomials in 4 variables over $F_2$ on points of $F_2 ^ 4$

I am a beginner with Mathematica. For my research purpose I would like to get a list of all the polynomials in $F_2[x,y,z,w]$ and for each polynomial I would like to know the result that it gives then ...
0
votes
1answer
169 views

Interpolating a Bivariate Polynomial over a Finite Field

Let $F=GF(p)$ be a finite field, $p$ prime and write $F^\times=\{x_1,\ldots,x_n\}$. I'm trying to implement an earlier version of Sudan's list-decoding algorithm for Reed Solomon Codes ...
3
votes
1answer
444 views

How to do the polynomial stuff over finite fields extensions fast?

This question is raised from the problem of package FiniteFields being very slow (please, see the corresponding question): I have had an evidence that Mathematica ...