Using Carry-less Multiplication (CLMUL) to Implement Erasure Code

摘要

Systems and methods for using carry-less multiplication (CLMUL) to implement erasure code are provided. An embodiment method of using CLMUL to implement erasure code includes initiating, with a processor, a first CLMUL call to calculate a first product of a data bit word and a constant, partitioning, with the processor, the first product into a high portion and a low portion, and initiating, with the processor, a second CLMUL call to calculate a second product of the high portion and a hexadecimal number portion, a bit size of the second product less than a bit size of the first product. The second product, or a third product generated by a third CLMUL call, is used to calculate a parity bit. Because the second product or the third product has a number of bits equivalent to the number of bits used by the processor, the erasure codes are more efficiently implemented.

主权项

1. A method of using Carry-less Multiplication (CLMUL) to implement erasure code, comprising:
initiating, with a processor, a first CLMUL call to calculate a first product of a data bit word and a constant; partitioning, with the processor, the first product into a high portion and a low portion; and initiating, with the processor, a second CLMUL call to calculate a second product of the high portion and a hexadecimal number portion, a bit size of the second product less than a bit size of the first product.