: In today’s rapidly expanding era of the Internet of Things (IoT) and the Industrial Internet of Things (IIoT), the emphasis on robust data security and insightful data interpreta- tion is more pronounced than ever. This research introduces a comprehensive approach to both data protection and predictive analytics, leveraging the diverse dataset TON IoT.csv, sourced from a myriad of IoT and IIoT environments. For data security, a dual-encryption technique incorporating both AES and RSA algorithms is established. Its efficacy is evidenced by a perfect match between the original and decrypted datasets, underscoring the integrity of our encryption process. Concurrently, the study ventures into predictive modeling using a modified Snake Optimization Algorithm (SOA) to streamline hyperparameter selection. This subsequently aids in the development and fine-tuning of an LSTM network, which exhibits remarkable predictive accuracy. Additionally, the paper provides an in-depth examination of various encryption methodologies like elliptic curve cryptography (ECC), Lightweight Cryptography for Cloud computing, and homomorphic encryption, while also emphasizing the nuances of encryption in cloud setups, particularly contrasting server-side with client-side encryption and efficient key management. The insights presented serve as a cornerstone for ensuing research, promising a bright future for advancements in IoT and IIoT data protection and analysis

In this paper, different cryptography algorithms were reviewed, and their relative merits were discussed. Symmetric and asymmetric cryptography algorithms were compared for time and space efficiencies. These experiments were run to measure the execution time and the memory footprints of various algorithms to understand the implications of their real-life applications. In the experiment performed, it was observed that elliptic curve cryptography was the most efficient in terms of encryption/decryption time, as well as memory usage.

With the emerging technology connected with the internet, there is one constant issue related to that is data security. The only solution with which this issue can be resolved at a limit and can be used to protect the data is various algorithms for encryption. Though different approaches were used for the same, Cryptography seems to be efficiently protecting the data while transmitting in network from sender to receiver. Firstly the data is encrypted before sending to receiver using the most secure and reliable encryption algorithm. Secondly, at the receiver end it can be decrypted using the same decryption algorithm. Only receiver will have the key with which the data can be decrypted. In this paper, AES, DSS and RSA algorithms were implemented. These algorithms are encryption algorithms which perform encoding and decoding of data, to be sent from sender to receiver, using the keys. Each have different criteria for encryption and are then compared based on different parameters viz. delay, throughput, PDR is an acronym for packet delivery ratio, PLR represents packet loss ratio and RPC denotes Received Packet Count. The results in the form of graphs are given to analyze the security provided by each algorithm.

In this paper, we gave an attack on RSA when Euler function has small multiplicative inverse modulo "e" and the prime sum p+q is of the form p+q=2^nk_0+k_1 where n is a given positive integer and k_0 and k_1 are two suitably small unknown integers using sublattice reduction techniques and Coppersmith's methods for finding small roots of modular polynomial equations. When we compare this method with an approach using lattice based techniques, this procedure slightly improves the bound and reduces the lattice dimension.

The human microbiome is an extremely complex ecosystem considering the amount of bacterial species, their interactions, and its variability over time. Here we untangle the complexity of the human microbiome for the Irritable Bowel Syndrome (IBS) that is the most prevalent functional gastrointestinal disorder in human populations. Based on a novel information theoretic network inference model we detect species interaction networks that are functionally and structurally different for healthy and unhealthy individuals. Healthy networks are characterized by a neutral symmetrical pattern of species interactions and scale-free topology versus random unhealthy networks. We detect an inverse scaling relationship between species total outgoing information flow, meaningful of node interactivity, and relative species abundance (RSA). The top ten interacting species are also the least relatively abundant for the healthy microbiome and the most detrimental. These findings support the idea about the diminishing role of network hubs and hubs should be defined considering the total outgoing information flow rather than the node degree. Macroecologically, the healthy microbiome is characterized by the highest total species diversity growth rate, the lowest species turnover, and the smallest variability of RSA for all species. This result challenges current views that posit a universal association between healthy states and the highest absolute species diversity in ecosystems. Additionally, we show how the transitory microbiome is unstable and microbiome criticality is not at the phase transition between healthy and unhealthy states. We stress out the importance of considering interacting pairs versus single node dynamics when characterizing the microbiome and of ranking these pairs in terms of their dynamics. Interactions (i.e. species collective behavior) shape transition from healthy to unhealthy states.\\ The macroecological characterization of the microbiome is useful for diagnostic purposes and disease etiognosis, while species-specific analyses can detect species that are more beneficial leading to personalized design of pre- and pro-biotic treatments and microbiome engineering.

We propose an electrocardiogram (ECG) signal-based algorithm to estimate the respiratory rate is a significant informative indicator of physiological state of a patient. The consecutive ECG signals reflect the information about the respiration because inhalation and exhalation make transthoracic impedance vary. The proposed algorithm extracts the respiration-related signal by finding out the commonality between the frequency and amplitude features in the ECG pulse train. The respiration rate can be calculated from the principle components after the procedure of the singular spectrum analysis. We achieved 1.7569 breaths per min of root-mean-squared error and 1.7517 of standard deviation with a 32-seconds signal window of the Capnobase dataset, which gives notable improvement compared with the conventional Autoregressive model based estimation methods.

User-generated passwords often pose a security risk in authentication systems. However, providing a comparative substitute poses a challenge, given the common tradeoff between security and user experience. This paper integrates cryptographic methods (both asymmetric and symmetric), steganography, and a combination of physiological and behavioral biometrics to construct a prototype for a passwordless authentication system. We demonstrate the feasibility of scalable passwordless authentication while maintaining a balance between usability and security. We employed threat modeling techniques to pinpoint the security prerequisites for the system, along with choosing appropriate cryptographic protocols. In addition, a comparative analysis is conducted, examining the security impacts of the proposed system in contrast to that of traditional password-based systems. Results from the prototype indicate that authentication is possible within a timeframe similar to passwords (within 2 seconds), without imposing additional hardware costs on users to enhance security or compromising usability. Given the scalable nature of the system design and the elimination of shared secrets, the financial and efficiency burdens associated with password resets are alleviated. Furthermore, the risk of breaches is mitigated, as there is no longer a need to store passwords and/or their hashes. Differing from prior research, our study presents a pragmatic design and prototype that deserves consideration as a viable alternative for both password-based and passwordless authentication systems.

We explore the class of positive integers n that admit idempotent factorizations n=pq such that lambda(n) divides (p-1)(q-1), where lambda(n) is the Carmichael lambda function. Idempotent factorizations with p and q prime have received the most attention due to their cryptographic advantages, but there are an infinite number of n with idempotent factorizations containing composite p and/or q. Idempotent factorizations are exactly those p and q that generate correctly functioning keys in the RSA 2-prime protocol with n as the modulus. While the resulting p and q have no cryptographic utility and therefore should never be employed in that capacity, idempotent factorizations warrant study in their own right as they live at the intersection of multiple hard problems in computer science and number theory. We present some analytical results here. We also demonstrate the existence of maximally idempotent integers, those n for which all bipartite factorizations are idempotent. We show how to construct them, and present preliminary results on their distribution.

We propose a new scheme based on ephemeral elliptic curves over the ring Z/nZ where n=pq is an RSA modulus with p=up^2+vp^2, q=uq^2+vq^2, up≡uq≡3(mod4). The new scheme is a variant of both the RSA and the KMOV cryptosystems. The scheme can be used for both signature and encryption. We study the security of the new scheme and show that is immune against factorization attacks, discrete logarithm problem attacks, sum of two squares attacks, sum of four squares attacks, isomorphism attacks, and homomorphism attacks. Moreover, we show that the private exponents can be much smaller than the ordinary exponents for RSA and KMOV, which makes the decryption phase in the new scheme more efficient.

(1) Background: Information overload challenges decision-making in the Industry 4.0 era. While Natural Language Processing (NLP), especially Automatic Text Summarization (ATS), offers solutions, issues with factual accuracy persist. This research bridges cognitive neuroscience and NLP, aiming to improve model interpretability. (2) Methods: This research examined four fact extraction techniques: dependency relation, named entity recognition, part-of-speech tagging, and TF-IDF, in order to explore their correlation with human EEG signals. Representational Similarity Analysis (RSA) was applied to gauge the relationship between language models and brain activity. (3) Results: Named entity recognition showed the highest sensitivity to EEG signals, marking the most significant differentiation between factual and non-factual words with a score of -0.99. The dependency relation followed with -0.90, while part-of-speech tagging and TF-IDF resulted in 0.07 and -0.52, respectively. Deep language models such as GloVe, BERT, and GPT-2 exhibited noticeable influences on RSA scores, highlighting the nuanced interplay between brain activity and these models. (4) Conclusions: Our findings emphasize the crucial role of named entity recognition and dependency relations in fact extraction and demonstrate the independent effects of different models and TOIs on RSA scores. These insights aim to refine algorithms to reflect human text processing better, thereby enhancing ATS models’ factual integrity.

This paper intends to discuss SSLs, how they work, their advantages and drawbacks. It will end with the author’s thoughts on the efficacy of the system and whether it is a viable solution for the majority of network security problems or if those drawbacks prevent that.