MétaCan
Menu
Back to cohort
Record W4403905839 · doi:10.59934/jaiea.v4i1.647

Super Encryption Feal Algorithm and Base64 Algorithm Image File Security

2024· article· en· W4403905839 on OpenAlex
Tiara Br Bangun, Achmad Fauzi, I Gusti Prahmana

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of Artificial Intelligence and Engineering Applications (JAIEA) · 2024
Typearticle
Languageen
FieldComputer Science
TopicCryptography and Residue Arithmetic
Canadian institutionsKootenay Association for Science & Technology
Fundersnot available
KeywordsEncryptionFEALComputer scienceImage (mathematics)AlgorithmComputer securityComputer visionMaterials scienceMetallurgy

Abstract

fetched live from OpenAlex

In the rapidly advancing digital era, image file security has become a critical issue, especially with the increasing risks of data breaches and attacks on digital files. This study aims to enhance the security of image files by implementing a combination of two cryptographic algorithms: Fast Data Encipherment Algorithm- 4 (FEAL-4) and Base64. FEAL-4 is a symmetric encryption algorithm known for its high speed and processing efficiency, while Base64 is used for encoding binary data into ASCII format to ensure safer transmission. This research develops a super encryption system that integrates these two algorithms to protect the integrity and confidentiality of image files, particularly for BMP, JPEG, and PNG formats. The implementation was carried out using the Visual Basic programming language. The results of the study show that the combination of FEAL-4 and Base64 algorithms significantly enhances the security of image files, with a high success rate in the encryption and decryption processes.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.964
Threshold uncertainty score0.528

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.

Opus teacher head0.010
GPT teacher head0.242
Teacher spread0.232 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it