This compilation, Cryptographic Engineering, offers a comprehensive guide for aspiring cryptographic engineers, stemming from lecture notes delivered since 2002 at EPFL in Lausanne, Switzerland. The text explores foundational concepts such as random number generators (RNGs), distinguishing between deterministic (DRNGs) and true (TRNGs) while detailing their classification and security implications. It also covers fast finite field multiplication and efficient unified arithmetic for hardware cryptography, including discussions on Montgomery modular reductionand binary extension fields. Furthermore, the book examines instruction set extensions (ISEs) for cryptographic applications, addressing their benefits and limitations, and presents hardware implementations of AES on FPGAs and ASICs. Finally, it elaborates on side-channel analysis (SCA), microarchitectural attacks (MIA) like cache and branch prediction analysis, and countermeasures such as randomized exponentiation, emphasizing the continuous evolution of security challenges and engineering solutions.