Leveling the risks of timing attacks based on permutation decoding

Abstract

The telecommunication systems development based on single-mode and multimode optical fibers is aimed at the rapidly increasing demand for bandwidth not only transport networks, but also intra-site data centers networks, cloud computing, and web servers. The solution to this problem is provided by the signal processing technologies complexity. In this case, the requirements for the receiver complexity can be reduced by using technologies to combat signal distortion due to equalizers together with FEC. There was known that the use of FEC based on permutation decoding in relation to the RS codes provides a significant gain in the data processing speed by the receiver due to the use of a cognitive procedure for searching the generating matrix of the equivalent code. The paper shows that the use of this technology can be successful in solving another important task related to minimizing the timing attacks consequences on the protection confidential information system. This is due to the active development of quantum computers and the problems of post-quantum cryptography that arose on this basis. The essence of leveling the timing attacks risks is to equalize the time spent on processing vectors of redundant BCH or RS codes. The use of permutation decoding fully matches these requirements by replacing the algebraic system of detection and errors correction in the data on the procedure of lexicographic search for the desired result. It is shown that the data processing time when using permutation decoding in conjunction with the cognitive search for the decoding result varies slightly.