Integration of Key Derivation Function (KDF) Development for Advanced Encryption Standard (AES) 256 Key Generator in Digital File Security
Bibliographic record
Abstract
Digital file security has become increasingly crucial along with the rapid development of information technology. The Advanced Encryption Standard (AES) 256 bit algorithm is a strong cryptographic solution; however, its effectiveness greatly depends on the quality of the encryption key used. The use of weak keys can significantly reduce the level of security. This research aims to enhance the security of the AES key generation process by integrating the development of a Key Derivation Function (KDF). The proposed KDF utilizes a 512 bit external key that is divided into two blocks, processed using an XOR operation, and subsequently transformed with the AES SubBytes substitution to generate a more complex 256 bit derived key. The system is implemented as a desktop application with a graphical user interface (GUI) using the Python programming language with the tkinter and cryptography libraries. The test results show that the application successfully encrypts and decrypts various digital file formats (.pdf, .docx, .xlsx, .png, .mp3, and .mp4). Encrypted files cannot be accessed and can only be restored to their original form through the decryption process with the correct key. The integration of this KDF has proven effective in strengthening the key for the AES 256 algorithm, thereby providing an additional security layer to protect digital files from unauthorized access.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.003 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".