Abstract
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.
Highlights
Fog computing is a decentralized computing architecture compared to cloud computing and is currently used primarily for mobile and portable devices
Fog computing should be defined for a broader range of ubiquitous connected devices, which requires the fog server to generate a large number of security codes at one time and a relatively low computational load during verification
In the fog computing environment using stream ciphers, the security verification and data transmission should be considered between the length of the password and the verification algorithm
Summary
The Information Security Department, The First Research Institute of the Ministry of Public Security of P.R.C., Beijing 100084, China. In the fog computing environment, the periodic sequence can provide sufficient authentication code and reduce the power consumption in the verification. 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
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have