A Hybrid RSA Algorithm in Support of IoT Greenhouse Applications
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Internet of Things (IoT) is being utilized in a plethora of applications, many of which aim to improve system performance. IoT nodes suffer from several limitations, such as power supply, computational capability, and information security. The current state of IoT information and the potential for security breaches represent a significant untoward condition, especially regarding the organizational necessity for confidentiality and privacy. In this paper, we propose a strong, simple and energy conserving three-stage data encryption algorithm with a focus on securing IoT data in support of greenhouse applications. The stages include: (1) a novel implementation of the K-Map substitution functions; (2) the utilization of a chaotic equation to generate a sequence of random numbers, which are added to the result of the first stage; (3) the third stage incorporates the Rivest, Shamir, and Adelman (RSA) algorithm, performed on feeds from the output of the second stage, resulting in encrypted data, requiring private key decryption. The proposed algorithm eliminates the handshaking of the traditional RSA to exchange the keys (private and public) between IoT nodes and the cloud (server), then reduce the transmission time by 30%. The proposed cryptography algorithm is implemented and tested using two evaluation methods: a single micro-controller (standalone) and on a server (cloud). The algorithm is tested in both directions up/down link, and provides an acceptable and stable performance with 1.3 faster than the original RSA.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it