@InProceedings{Taschwer2001, author = {Taschwer, Mario}, booktitle = {Kommunikationssicherheit im Zeichen des Internet}, title = {Modular Multiplication Using Special Prime Moduli}, year = {2001}, address = {Braunschweig/Wiesbaden}, editor = {Horster, Patrick}, month = {jan}, pages = {346--371}, publisher = {Vieweg}, abstract = {Elliptic curve cryptosystems allow the use of prime fields with special prime moduli that speed up the finite field arithmetic considerably. Two algorithms for reduction with respect to special moduli have been implemented in software on both a 32-bit and a 64-bit platform and compared to well-known generic modular reduction methods. Timing results for multiplications in prime fields of size between 2^{191} and 2^{512} are presented and discussed.}, isbn10 = {3-528-05763-7}, language = {EN}, pdf = {https://www.itec.aau.at/bib/files/2001si_modmult.pdf}, talktype = {none} }