Perfectly-secure cryptography is a branch of information-theoretic cryptography. A perfectly-
secure cryptosystem guarantees that the malicious third party cannot guess anything …

Perfectly secure cryptography is a branch of information-theoretic cryptography. A perfectly
secure cryptosystem guarantees that the malicious third party cannot guess anything …

This chapter discusses the reason why we have chosen to study perfectly secure
cryptography (as a branch of information-theoretic cryptography) among the existing …

In this chapter, we first introduce entropy and some basic concepts related to information
theory. We show how entropy has find its way from thermodynamics into information theory …

This chapter completes the discussions of the previous chapter to justify our combinatorial-
Boolean approach toward information-theoretic cryptography. The previous chapter …

In this chapter, we first overview the applications of combinatorics in cryptography. Then, we
take look at some historical applications of non-combinatorial squares and cubes in …

Shannon information theoretic approach to perfect security requires equal number of key
bits to the information bits. This fact has been studied for decades and known as" Shannon …

ICISC 2012, the 15th International Conference on Information Security and Cryptology, was
held in Seoul, Korea, during November 28–30, 2012. This year the conference was hosted …

ICITS 2012 was the 6th International Conference of Information-theoretic Security, held at
the Université de Montréal in Montreal, Quebec, Canada, during August 15–17, 2012. ICITS …

The well-known KISS principle of engineering—Keep It Simple, Stupid!—is also of value in
cryptography. In certain subfields, such as lattice-based crypto and indistinguishability …