Realization and Performance Analysis of Sequence Cipher Based on NP Problem

As a branch of modern cryptology, sequence cipher technology developed rapidly in recent years. Thispaper applies NP problem to sequence cipher and runs performance analysis for the cipher, and sequence cipher basedon NP problem is proved to be an ideal cipher with extreme secrecy.

密码学中信息论及计算复杂性的研究

针对信息论和计算复杂性是密码学的两个重要理论基础,而信息的加密与破译又和信息论密切相关。研究了信息的传输和保密问题,并对保密系统进行了数学描述和分析。讨论了完善保密性、理论保密性与实际保密性,给出了算法复杂度的两个时间算法,探讨了纠错码中的几个NP问题及其密码学作用。通过介绍计算复杂性理论中的几个重要概念,给出了P,NP,CO-NP与PSPACE之间的关系。