Keywords
cryptographic system, prime number, extended Euclid algorithm, binary numbers, knapsacks problem, high rise set, Merkle – Hellman algorithm.
How to Cite
[1]
L. CHIRIAC and A. DANILOV, “METHODICAL APPROACHES IN STUDYING THE MERKLE – HELLMAN ASYMMETRIC CRYPTOGRAPHIC SYSTEM”, ActaEd, vol. 25, no. 3, pp. 7-23, Oct. 2021.
Abstract
This article, based on the Merkle – Hellman cryptographic system, examines the encryption /decryption process and the connection with the concepts and basics of abstract algebra. At the same time, the interconnection between abstract algebra - cryptography - algorithmic - programming is highlighted. From a methodological point of view, the stages of encryption and decryption used in the application of the Merkle – Hellman cryptographic system are examined in detail.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.