Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with modular-arithmetic
Search options not deleted
user 18699
Modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" upon reaching a certain value… the modulus.
2
votes
1
answer
538
views
Polynomial division hardware implementation
I am beginning the implementation of the polynomial binary division algorithm now as I understood i will be checking the MSB bit if 1 to XOR and shift the sum if 0 i will only shift.
What I am not get …
- 95
0
votes
0
answers
501
views
Polynomial Inversion over Galois Field
Hello guys I am looking to calculate the Inverse of a given polynomial in Galois field
I have found the little Fermat's algorithm and the Itoh-Tsujii
I am getting a bit confused with both algorithm a …
- 95
2
votes
1
answer
2k
views
Modular Reduction of polynomials in GF(2^m)
I am having trouble understanding the algorithm implementation in the hardware of the reduction process over Galois fields of $F_{2^{163}}$
In the following process, it looks like we are calculating t …
- 95