@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",
series = "I E E E International Conference on Communications",
publisher = "IEEE",
pages = "2922 -- 2927",
booktitle = "Communications (ICC), 2013 IEEE International Conference on",
address = "United States",
note = "IEEE CoCoNet5 Workshop 2013 - Cooperative and Cognitive Mobile Networks (CoCoNet5) : IEEE ICC 2013 ; Conference date: 09-06-2013",
}