Abstract

functions. In: Coding, Cryptography and Combinatorics. Basel: Birkahauser

Modern Cryptography – Current Challenges and Solutions

[19] Gao SM, Zhao Y, Zhao Z. Walsh spectrum of cryptographically concatenating functions and its applications in constructing resilient Boolean functions. The Journal of Computer Information Systems. 2011;

[20] Zhang W, Xiao G. Constructions of

[21] Zhang W, Pasalic E. Improving the

[22] Zhang F, Wei Y, Pasalic E, Xia S. Large sets of disjoint spectra plateaued functions inequivalent to partially linear

[23] Carlet C, Mesnager S. On semibent Boolean functions. IEEE Transactions on Information Theory. 2012;58(5):

[24] Sun G, Wu C. Construction of semibent Boolean functions in even number

[25] Pasalic E, Gangopadhyay S, Zhang W, Bajric S. Design methods for semibent functions. Information Processing

of variables. Chinese Journal of Electronics. 2009;18(2):231-237

Letters. 2019:61-70

16

functions. IEEE Transactions on Information Theory. 2018:2987-2999

almost optimal resilient Boolean functions on large even number of variables. IEEE Transactions on Information Theory. 2009;55(12):

lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria. Information Sciences. 2017;376:21-30

Verlag; 2004. pp. 3-28

7(4):1074-1081

5822-5831

3287-3292

Rivest et al. patented (US) RSA. RSA forms the basis of most public encryption systems. It describes a public key encryption algorithm and certification process, which protects user data over networks. The patent expired in September 2000 and now is available for general use. According to Marketsandmarkets.com, the global network encryption market size is expected to grow from USD 2.9 billion in 2018 to USD 4.6 billion by 2023, at a compound annual growth rate (CAGR) of 9.8%. Major growth drivers for the market include increasing adoption of optical transmission, an increasing demand to meet various regulatory compliances and a growing focus on shielding organizations from network security breaches. In short, RSA forms the basis of almost all public encryption systems. This, however, is not without risk. This chapter explores some of these vulnerabilities in a mathematical context and provides the reader with an appreciation of the strength of RSA.

Keywords: survey, public keys, vulnerability
