Network Coding Over The 232: 5 Prime Field

Morten Videbæk Pedersen, Janus Heide, Peter Vingelmann, Frank Fitzek

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

7 Citations (Scopus)
227 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationCommunications (ICC), 2013 IEEE International Conference on
Number of pages6
PublisherIEEE
Publication date2013
Pages2922 - 2927
ISBN (Print)978-1-4673-3122-7
DOIs
Publication statusPublished - 2013
EventIEEE CoCoNet5 Workshop 2013 - Cooperative and Cognitive Mobile Networks (CoCoNet5) : IEEE ICC 2013 - Budapest, Hungary
Duration: 9 Jun 2013 → …

Workshop

WorkshopIEEE CoCoNet5 Workshop 2013 - Cooperative and Cognitive Mobile Networks (CoCoNet5)
CountryHungary
CityBudapest
Period09/06/2013 → …
SeriesI E E E International Conference on Communications
ISSN1550-3607

Fingerprint

Network coding
Cryptography
Signal processing
Positive ions
Throughput

Cite this

Pedersen, M. V., Heide, J., Vingelmann, P., & Fitzek, F. (2013). Network Coding Over The 232: 5 Prime Field. In Communications (ICC), 2013 IEEE International Conference on (pp. 2922 - 2927). IEEE. I E E E International Conference on Communications https://doi.org/10.1109/ICC.2013.6654986
Pedersen, Morten Videbæk ; Heide, Janus ; Vingelmann, Peter ; Fitzek, Frank. / Network Coding Over The 232 : 5 Prime Field. Communications (ICC), 2013 IEEE International Conference on . IEEE, 2013. pp. 2922 - 2927 (I E E E International Conference on Communications).
@inproceedings{3b07c32b67f8404f9692f04dbd06bd15,
title = "Network Coding Over The 232: 5 Prime Field",
abstract = "Creating efficient finite field implementations hasbeen an active research topic for several decades. Many appli-cations in areas such as cryptography, signal processing, erasurecoding and now also network coding depend on this research todeliver satisfactory performance. In this paper we investigatethe use of prime fields with a field size of 232 − 5, as thisallows implementations which combines high field sizes and lowcomplexity. First we introduce the algorithms needed to applyprime field arithmetics to arbitrary binary data. After this wepresent the initial throughput measurements from a benchmarkapplication written in C++. These results are finally comparedto different binary and binary extension field implementations.The results show that the prime field implementation offers alarge field size while maintaining a very good performance. Webelieve that using prime fields will be useful in many networkcoding applications where large field sizes are required.",
author = "Pedersen, {Morten Videb{\ae}k} and Janus Heide and Peter Vingelmann and Frank Fitzek",
year = "2013",
doi = "10.1109/ICC.2013.6654986",
language = "English",
isbn = "978-1-4673-3122-7",
pages = "2922 -- 2927",
booktitle = "Communications (ICC), 2013 IEEE International Conference on",
publisher = "IEEE",
address = "United States",

}

Pedersen, MV, Heide, J, Vingelmann, P & Fitzek, F 2013, Network Coding Over The 232: 5 Prime Field. in Communications (ICC), 2013 IEEE International Conference on . IEEE, I E E E International Conference on Communications, pp. 2922 - 2927, IEEE CoCoNet5 Workshop 2013 - Cooperative and Cognitive Mobile Networks (CoCoNet5) , Budapest, Hungary, 09/06/2013. https://doi.org/10.1109/ICC.2013.6654986

Network Coding Over The 232 : 5 Prime Field. / Pedersen, Morten Videbæk; Heide, Janus; Vingelmann, Peter; Fitzek, Frank.

Communications (ICC), 2013 IEEE International Conference on . IEEE, 2013. p. 2922 - 2927.

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

TY - GEN

T1 - Network Coding Over The 232

T2 - 5 Prime Field

AU - Pedersen, Morten Videbæk

AU - Heide, Janus

AU - Vingelmann, Peter

AU - Fitzek, Frank

PY - 2013

Y1 - 2013

N2 - Creating efficient finite field implementations hasbeen an active research topic for several decades. Many appli-cations in areas such as cryptography, signal processing, erasurecoding and now also network coding depend on this research todeliver satisfactory performance. In this paper we investigatethe use of prime fields with a field size of 232 − 5, as thisallows implementations which combines high field sizes and lowcomplexity. First we introduce the algorithms needed to applyprime field arithmetics to arbitrary binary data. After this wepresent the initial throughput measurements from a benchmarkapplication written in C++. These results are finally comparedto different binary and binary extension field implementations.The results show that the prime field implementation offers alarge field size while maintaining a very good performance. Webelieve that using prime fields will be useful in many networkcoding applications where large field sizes are required.

AB - Creating efficient finite field implementations hasbeen an active research topic for several decades. Many appli-cations in areas such as cryptography, signal processing, erasurecoding and now also network coding depend on this research todeliver satisfactory performance. In this paper we investigatethe use of prime fields with a field size of 232 − 5, as thisallows implementations which combines high field sizes and lowcomplexity. First we introduce the algorithms needed to applyprime field arithmetics to arbitrary binary data. After this wepresent the initial throughput measurements from a benchmarkapplication written in C++. These results are finally comparedto different binary and binary extension field implementations.The results show that the prime field implementation offers alarge field size while maintaining a very good performance. Webelieve that using prime fields will be useful in many networkcoding applications where large field sizes are required.

U2 - 10.1109/ICC.2013.6654986

DO - 10.1109/ICC.2013.6654986

M3 - Article in proceeding

SN - 978-1-4673-3122-7

SP - 2922

EP - 2927

BT - Communications (ICC), 2013 IEEE International Conference on

PB - IEEE

ER -

Pedersen MV, Heide J, Vingelmann P, Fitzek F. Network Coding Over The 232: 5 Prime Field. In Communications (ICC), 2013 IEEE International Conference on . IEEE. 2013. p. 2922 - 2927. (I E E E International Conference on Communications). https://doi.org/10.1109/ICC.2013.6654986