Satellite communication is one of the essential communication mechanisms that can be used for significant distance and under circumstances where the other communication mechanisms cannot work. Therefore, the security of this communication method is highly needed. Because in this era where information plays an important role, information security becomes the first priority for everyone. When we talk about information security, the key exchange and authentication are two key factors of information security. Whitfield Diffie and Martin Hellman 1 proposed the first key exchange protocol. In the last two or three decades, various authentication schemes have been proposed to create a secure network that mainly depends on classical number-theoretical hard assumptions (factorization or discrete logarithm), but due to the Shor's 2 algorithm, above-mentioned scheme is no longer secure because any discrete logarithm or factorization problems can be solved by Shor's algorithm in polynomial time if the quantum computer becomes the reality soon. As far as our knowledge goes, there is no authentication protocol for satellite communication, which is secure against quantum computer attacks. Therefore, in this paper, we first proposed authentication protocol for satellite communication based on ring learning with error which is secure against quantum attacks.

Plant identification is critical for a wide range of biological fields and goals, ranging from understanding ecological processes, such as community assembly, to the conservation of rare and threatened species (Thessen, 2016). Historically, species have been identified using trait-based approaches in the form of dichotomous and polyclave keys (Tilling, 1984; Edwards et al., 1987). These identification keys remain an important and widely used resource for scientists (Gaylard and Kerley, 1995; Randler, 2008), as they are convenient, inexpensive, and enable identification when tissue samples cannot be collected for molecular barcoding (Will and Rubinoff, 2004). Improving trait-based plant identification (e.g., reducing the number of traits required for identification) could be especially useful for improving the efficacy of citizen scientists in large-scale projects where the use of genetic tools is not feasible or cost-effective (Gallo and Waitt, 2011; Roy et al., 2016). Advancements in computational methods such as machine learning, in tandem with the recent rise of online, easily accessible "big data, " could provide an unprecedented opportunity to improve traitbased identification, just as it has proved useful in other important ecological areas. For instance, machine learning has been applied to large databases to predict phenomena such as global surface temperatures (Casaioli et al., 2003), and underpins some of the most

Summary Recently, many authentication schemes were proposed by researchers in the satellite communication environment. Unfortunately, several types of security flaws occur in relative works (Qi et al., 2019; Xu, 2019; Liu et al., 2017; Altaf et al., 2020), such as off‐line guessing attacks, smart card stolen attacks and replay attacks. In this paper, we proposed a secure authentication technique based on chaotic maps to solve these drawbacks. To establish the security of the proposed scheme, we employ formal proof under the random oracle model. In addition, an informal study with various security properties is provided to augment the security characteristics. Furthermore, we compare our protocol to several current schemes and demonstrate that our plan meets the security criteria while being cost‐effective. As a result, it is more suited to the satellite communication environment.

Recently, Yulei Chen and Jianhua Chen (An enchanced dynamic authentication scheme for mobile satellite communication systems. Int J Satell Commun Netw. 2020; 39(3): 250-262) presented an enhanced dynamic authentication scheme for mobile satellite communication systems in 2020. The authors found that there is a flaw in the authentication phase of the scheme proposed by Yulei Chen and Jianhua Chen's scheme. Due to this flaw, user is unable to authenticate to NCC (network control center) and also fails to establish the session key with NCC. In this paper, the authors improved the Yulei Chen and Jianhua Chen's scheme. In the proposed scheme, it is shown that user is able to authenticate to NCC (network control center) and also establish the session key with NCC. The authors also demonstrate that the computation cost and communication cost are also decreased.

No abstract