Work

Fast Xor-based Erasure Coding based on Polynomial Ring Transforms

Year: 2017

Type: preprint

Abstract: The complexity of software implementations of MDS erasure codes mainly depends on the efficiency of the finite field operations implementation. In this paper, we propose a method to reduce the complexity of the finite field multiplication by using fast transforms between a field and a ring to perform the multiplication in a ring. We show that moving to a ring reduces the complexity of the operations. Then, we show that this construction allows the use of simple scheduling to reduce the number of operations.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1701.07731

Authors: Detchart, Jonathan, Lacan, Jérôme

Institutions: Institut Supérieur de l'Aéronautique et de l'Espace (ISAE-SUPAERO), Université de Toulouse

Language: English

Topic: Cryptography and Residue Arithmetic

Subfield: Information Systems

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2626779969

Cites: 9

Cited by:

Related to: 20