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

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 completes our discussions in this book via presenting the hybrid combinatorial-
Boolean approach for perfectly secure cryptography in IoT. To this end, we first propose a …

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 overview the applications of combinatorics in cryptography. Then, we
take look at some historical applications of non-combinatorial squares and cubes in …

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

Cryptographic Boolean Functions and Applications, Second Edition is designed to be a
comprehensive reference for the use of Boolean functions in modern cryptography. While …

In this paper, we survey a number of studies in the literature on improving lightweight
systems in the Internet of Things (IoT). The paper illustrates recent development of Boolean …

There exist journals covering the broader domain, but none that focus on these specific
areas. And while there are conferences which address these specific research areas, the …

I would like to express my deepest appreciation to my supervisor prof. D. Sc. Tsonka
Baicheva for the invaluable patience, feedback, and constructive criticism. I cannot begin to …