earticle

영어

Speech perceptual hashing authentication algorithm is an efficient method for content integrity authentication and identity authentication. But the algorithm becomes transparent under the principle of Kerckhoffs which makes the algorithm unsafe. In this paper, the algorithm is encrypted under the principle of Kerckhoffs to protect the security of the algorithm. Then the specific link that won’t affect the performance of the algorithm is identified through the experiments. Next, this paper analyzes the security of the encrypted algorithm based on the concept of Shannon unicity distance. The unicity distance is figured out finally based on the experiments. That is to say, the algorithm loses its security even though the algorithm has been encrypted. Under this circumstances, the most important thing is to continue keeping the safety of the algorithm. Therefore, this paper proposed an efficient random secret key method to guarantee the safety of the algorithm after the unicity distance is figured out.