Abstract
Creating efficient finite field implementations has
been an active research topic for several decades. Many appli-
cations in areas such as cryptography, signal processing, erasure
coding and now also network coding depend on this research to
deliver satisfactory performance. In this paper we investigate
the use of prime fields with a field size of 232 − 5, as this
allows implementations which combines high field sizes and low
complexity. First we introduce the algorithms needed to apply
prime field arithmetics to arbitrary binary data. After this we
present the initial throughput measurements from a benchmark
application written in C++. These results are finally compared
to different binary and binary extension field implementations.
The results show that the prime field implementation offers a
large field size while maintaining a very good performance. We
believe that using prime fields will be useful in many network
coding applications where large field sizes are required.
been an active research topic for several decades. Many appli-
cations in areas such as cryptography, signal processing, erasure
coding and now also network coding depend on this research to
deliver satisfactory performance. In this paper we investigate
the use of prime fields with a field size of 232 − 5, as this
allows implementations which combines high field sizes and low
complexity. First we introduce the algorithms needed to apply
prime field arithmetics to arbitrary binary data. After this we
present the initial throughput measurements from a benchmark
application written in C++. These results are finally compared
to different binary and binary extension field implementations.
The results show that the prime field implementation offers a
large field size while maintaining a very good performance. We
believe that using prime fields will be useful in many network
coding applications where large field sizes are required.
| Original language | English |
|---|---|
| Title of host publication | Communications (ICC), 2013 IEEE International Conference on |
| Number of pages | 6 |
| Publisher | IEEE |
| Publication date | 2013 |
| Pages | 2922 - 2927 |
| ISBN (Print) | 978-1-4673-3122-7 |
| DOIs | |
| Publication status | Published - 2013 |
| Event | IEEE CoCoNet5 Workshop 2013 - Cooperative and Cognitive Mobile Networks (CoCoNet5) : IEEE ICC 2013 - Budapest, Hungary Duration: 9 Jun 2013 → … |
Workshop
| Workshop | IEEE CoCoNet5 Workshop 2013 - Cooperative and Cognitive Mobile Networks (CoCoNet5) |
|---|---|
| Country/Territory | Hungary |
| City | Budapest |
| Period | 09/06/2013 → … |
| Series | I E E E International Conference on Communications |
|---|---|
| ISSN | 1550-3607 |