NDLI: Bit-Sliced Binary Normal Basis Multiplication

Content Provider	IEEE Xplore Digital Library
Author	Brumley, B.B. Page, D.
Copyright Year	2011
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.
Starting Page	205
Ending Page	212
File Size	302739
Page Count	8
File Format	PDF
ISBN	9781424494576
ISSN	10636889
DOI	10.1109/ARITH.2011.36
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-07-25
Publisher Place	Germany
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Software Polynomials Logic gates Clocks Software algorithms Cryptography Hardware Data encryption Computer arithmetic Computations in finite fields Algorithm design analysis
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

New Bit-Level Serial GF (2^m) Multiplication Using Polynomial Basis

Low complexity sequential normal basis multipliers over GF(2/sup m/)

Multifunction Residue Architectures for Cryptography

Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields

$GF(2^{n})$ Montgomery multiplication using Polynomial Residue Arithmetic

Small FPGA Based Multiplication-Inversion Unit for Normal Basis Representation in GF(2m)

Hardware Design of a 256-Bit Prime Field Multiplier Suitable for Computing Bilinear Pairings

High-Speed Architectures for Multiplication Using Reordered Normal Basis

A systolic trinomial GF(2k) multiplier based on the Montgomery Multiplication Algorithm

Bit-Sliced Binary Normal Basis Multiplication

Similar Documents

New Bit-Level Serial GF (2^m) Multiplication Using Polynomial Basis

Low complexity sequential normal basis multipliers over GF(2/sup m/)

Multifunction Residue Architectures for Cryptography

Concurrent Error Detection in Montgomery Multiplication over Binary Extension Fields

$GF(2^{n})$ Montgomery multiplication using Polynomial Residue Arithmetic

Small FPGA Based Multiplication-Inversion Unit for Normal Basis Representation in GF(2m)

Hardware Design of a 256-Bit Prime Field Multiplier Suitable for Computing Bilinear Pairings

High-Speed Architectures for Multiplication Using Reordered Normal Basis

A systolic trinomial GF(2k) multiplier based on the Montgomery Multiplication Algorithm

Bit-Sliced Binary Normal Basis Multiplication