A Fog Computing Security: 2-Adic Complexity of Balanced Sequences

Abstract EN

In the fog computing environment, the periodic sequence can provide sufficient authentication code and also reduce the power consumption in the verification.

But the periodic sequence faces a known full-cycle attack threat in fog computing.

This paper studies the 2-adic complexity attack ability of the periodic balance sequence in the fog computing environment.

It uses the exponential function as a new approach to study the 2-adic properties of periodic balance sequence and presents that the 2-adic complexity of the periodic balanced sequence is not an attacking threat when used in fog computing.