Tampere University of Technology

TUTCRIS Research Portal

Bit-sliced binary normal basis multiplication

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Standard

Bit-sliced binary normal basis multiplication. / Brumley, Billy; Page, Dan.

Proceedings - 20th IEEE Symposium on Computer Arithmetic, ARITH-20. 2011. p. 205-212 5992128.

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Harvard

Brumley, B & Page, D 2011, Bit-sliced binary normal basis multiplication. in Proceedings - 20th IEEE Symposium on Computer Arithmetic, ARITH-20., 5992128, pp. 205-212, 20th IEEE Symposium on Computer Arithmetic, ARITH-20, Tubingen, Germany, 25/07/11. https://doi.org/10.1109/ARITH.2011.36

APA

Brumley, B., & Page, D. (2011). Bit-sliced binary normal basis multiplication. In Proceedings - 20th IEEE Symposium on Computer Arithmetic, ARITH-20 (pp. 205-212). [5992128] https://doi.org/10.1109/ARITH.2011.36

Vancouver

Brumley B, Page D. Bit-sliced binary normal basis multiplication. In Proceedings - 20th IEEE Symposium on Computer Arithmetic, ARITH-20. 2011. p. 205-212. 5992128 https://doi.org/10.1109/ARITH.2011.36

Author

Brumley, Billy ; Page, Dan. / Bit-sliced binary normal basis multiplication. Proceedings - 20th IEEE Symposium on Computer Arithmetic, ARITH-20. 2011. pp. 205-212

Bibtex - Download

@inproceedings{d49e6d19a58f4177b9c4661e7cd5e625,
title = "Bit-sliced binary normal basis multiplication",
abstract = "The performance of many cryptographic primitives is reliant on efficient algorithms and implementation techniques for arithmetic in binary fields. While dedicated hardware support for said arithmetic is an emerging trend, the study of software-only implementation techniques remains important for legacy or non-equipped processors. One such technique is that of software-based bit-slicing. In the context of binary fields, this is an interesting option since there is extensive previous work on bit-oriented designs for arithmetic in hardware, such designs are intuitively well suited to bit-slicing in software. In this paper we harness previous work, using it to investigate bit-sliced, software-only implementation arithmetic for binary fields, over a range of practical field sizes and using a normal basis representation. We apply our results to demonstrate significant performance improvements for a stream cipher, and over the frequently employed Ning-Yin approach to normal basis implementation in software.",
keywords = "Algorithm design, analysis, Computations in finite fields, Computer arithmetic, Data encryption",
author = "Billy Brumley and Dan Page",
year = "2011",
doi = "10.1109/ARITH.2011.36",
language = "English",
isbn = "9780769543185",
pages = "205--212",
booktitle = "Proceedings - 20th IEEE Symposium on Computer Arithmetic, ARITH-20",

}

RIS (suitable for import to EndNote) - Download

TY - GEN

T1 - Bit-sliced binary normal basis multiplication

AU - Brumley, Billy

AU - Page, Dan

PY - 2011

Y1 - 2011

N2 - The performance of many cryptographic primitives is reliant on efficient algorithms and implementation techniques for arithmetic in binary fields. While dedicated hardware support for said arithmetic is an emerging trend, the study of software-only implementation techniques remains important for legacy or non-equipped processors. One such technique is that of software-based bit-slicing. In the context of binary fields, this is an interesting option since there is extensive previous work on bit-oriented designs for arithmetic in hardware, such designs are intuitively well suited to bit-slicing in software. In this paper we harness previous work, using it to investigate bit-sliced, software-only implementation arithmetic for binary fields, over a range of practical field sizes and using a normal basis representation. We apply our results to demonstrate significant performance improvements for a stream cipher, and over the frequently employed Ning-Yin approach to normal basis implementation in software.

AB - The performance of many cryptographic primitives is reliant on efficient algorithms and implementation techniques for arithmetic in binary fields. While dedicated hardware support for said arithmetic is an emerging trend, the study of software-only implementation techniques remains important for legacy or non-equipped processors. One such technique is that of software-based bit-slicing. In the context of binary fields, this is an interesting option since there is extensive previous work on bit-oriented designs for arithmetic in hardware, such designs are intuitively well suited to bit-slicing in software. In this paper we harness previous work, using it to investigate bit-sliced, software-only implementation arithmetic for binary fields, over a range of practical field sizes and using a normal basis representation. We apply our results to demonstrate significant performance improvements for a stream cipher, and over the frequently employed Ning-Yin approach to normal basis implementation in software.

KW - Algorithm design

KW - analysis

KW - Computations in finite fields

KW - Computer arithmetic

KW - Data encryption

UR - http://www.scopus.com/inward/record.url?scp=80055027798&partnerID=8YFLogxK

U2 - 10.1109/ARITH.2011.36

DO - 10.1109/ARITH.2011.36

M3 - Conference contribution

SN - 9780769543185

SP - 205

EP - 212

BT - Proceedings - 20th IEEE Symposium on Computer Arithmetic, ARITH-20

ER -