IMPLEMENTASI LAGGED FIBONACCI GENERATOR PADA PROSES PEMBANGKITAN KUNCI ALGORITMA ONE TIME PAD (OTP)

Abstract

The effectiveness of the key used in a data security algorithm is one of the essential aspects that must be considered when implementing data security techniques. Many data security algorithms, particularly classical cryptographic algorithms, still employ key generation techniques that are not sufficiently optimized to ensure data security. As a result, secured data or information can be easily accessed by unauthorized parties.

Key resistance to attacks is a fundamental requirement in cryptographic techniques for protecting data against various forms of attacks. Resistance to data attacks does not depend solely on the complexity of the cryptographic algorithm used but is also significantly influenced by the optimization of the key to support the objectives of data security.

One technique that can be used to generate more effective keys is random key generation, in which the keys are designed to be unpredictable so that the patterns of the keys used to secure data are difficult for attackers to identify. One approach that can be employed is random number generation, which can be used to produce keys with unpredictable patterns and no easily identifiable relationships. The Lagged Fibonacci Generator algorithm is one of the variants of random number generation algorithms. The application of this algorithm in generating keys for cryptographic algorithms is expected to improve the effectiveness of the algorithms used to encrypt and decrypt confidential data or information.