This chapter completes the discussions of the previous chapter to justify our combinatorial-Boolean approach toward information-theoretic cryptography. The previous chapter suggested combinatorial designs and especially Latin squares as powerful tools for some cryptographic purposes. This chapter presents discussions that make it pertinent to think of Boolean cryptography and especially Boolean functions as part of an approach toward the design of a cryptosystem. In this chapter, we first try to present a definition for Boolean cryptography via highlighting the connection points between Boolean algebra, Boolean functions, etc. to cryptography and related areas. Next, we shed light on the position of Boolean cryptography in the ecosystem and the life cycle of information-theoretic cryptography (developed in Part I).