Cosine transforms over fields of characteristic 2: Fast computation and application to image encryption

作者：

Highlights：

• we introduce a fast algorithm for computing cosine transforms over fields of characteristic 2 (FFCT).

• The referred algorithm is based on fast algorithms for computing cyclic convolutions over fields of characteristic 2.

• In particular, we present an algorithm for an 8-point FFCT over GF(28) and show how such a transform can be used as the basis of an image encryption scheme.

摘要

Highlights•we introduce a fast algorithm for computing cosine transforms over fields of characteristic 2 (FFCT).•The referred algorithm is based on fast algorithms for computing cyclic convolutions over fields of characteristic 2.•In particular, we present an algorithm for an 8-point FFCT over GF(28) and show how such a transform can be used as the basis of an image encryption scheme.

论文关键词：Finite field cosine transform,Fields of characteristic 2,Fast algorithms,Image encryption

论文评审过程：Received 24 June 2016, Revised 12 January 2017, Accepted 14 March 2017, Available online 20 March 2017, Version of Record 23 March 2017.

论文官网地址：https://doi.org/10.1016/j.image.2017.03.007