Super Enkripsi Kriptografi Pengamanan Pesan File Audio Record Mp3 dengan Algoritma Riverst Shamir Adleman (RSA) dan Elgamal
Bibliographic record
Abstract
MP3 audio files are often used in a variety of fields, but they are prone to security risks such as eavesdropping and illegal access. This study proposes a super encryption method by combining the algorithms of Rivest Shamir Adleman (RSA) and ElGamal to improve the protection of audio data. RSA was chosen for its efficiency and ease of implementation, while ElGamal offers a high level of security through discrete logarithmic complexity. The combination of the two is expected to address the weaknesses of each algorithm and strengthen file security. The system is developed using the Python programming language with the Visual Studio Code environment. The encryption process is done in layers: MP3 files are first encrypted with RSA, and then the results are encrypted again with ElGamal. The decryption is done in reverse order. Tests are conducted with various MP3 file sizes to measure the effectiveness and performance of the system. The results show that this method is able to secure audio files so that they cannot be accessed without the private keys of both algorithms. Although processing times are increased compared to single encryption, the level of security obtained is much higher. This approach can be an effective solution for protecting digital audio data, particularly MP3 format, and could potentially be applied to a wide range of other data types that require a high level of security.
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 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.003 | 0.000 |
| Meta-epidemiology (narrow) | 0.002 | 0.003 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.003 | 0.006 |
| Science and technology studies | 0.003 | 0.001 |
| Scholarly communication | 0.005 | 0.016 |
| Open science | 0.009 | 0.005 |
| Research integrity | 0.001 | 0.003 |
| 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 itClassification
machine, unvalidatedMachine predicted; both teacher heads agree on what is shown here.
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".