Publication Search

This research proposes a combination of Quantum Key Distribution (QKD) based on the BB84 protocol with Improved Logistic Map (ILM) to improve data transmission security. This method integrates quantum key formation from BB84 with ILM encryption. This combination creates an additional layer of security, where by default, the operation on BB84 is only XOR-substitution, with the addition of ILM creating a permutation operation on quantum keys. Experiments are measured with several quantum measurements such as Quantum Bit Error Rate (QBER), Polarization Error Rate (PER), Quantum Fidelity (QF), Eavesdropping Detection (ED), and Entanglement-based detection (EDB), as well as classical cryptographic analysis such as Bit Error Ratio (BER), Entropy, Histogram Analysis, and Normalized Pixel Change Rate (NPCR) and Unified Average Changing Intensity (UACI). As a result, the proposed method obtained satisfactory results, especially perfect QF and BER, and EBD, which reached 0.999.

Quantum computing has emerged as a revolutionary paradigm, holding immense potential to solve complex problems that classical computing struggles to address. This study explores the application of quantum computing in cryptography, with a specific focus on two major quantum algorithms: Shor’s algorithm for large number factorization and Grover’s algorithm for unstructured database searching. The main objective of this research is to compare the performance of these quantum algorithms with classical cryptographic methods in terms of computational efficiency and time. Shor’s algorithm, which can factorize large numbers in polynomial time, presents a significant threat to the security of public-key cryptosystems such as RSA, which rely on the difficulty of factoring large numbers. On the other hand, Grover’s algorithm offers a quadratic speedup for searching unstructured databases, making it highly relevant for symmetric key cryptography systems like AES. In this study, simulations of both algorithms were conducted using quantum simulators to assess their speed and effectiveness in solving cryptographic challenges. The results demonstrate that quantum algorithms significantly reduce the computation time compared to classical methods, with Shor’s algorithm efficiently solving factorization problems and Grover’s algorithm accelerating key searching processes. However, while these quantum algorithms show promise in improving cryptographic systems, the implementation of large-scale quantum computers remains a challenge. This research highlights the potential of quantum computing to revolutionize data security and underscores the need for further development in quantum algorithms and the transition to quantum-resistant cryptographic systems to safeguard against the threat posed by quantum computers.

This research introduces an image encryption scheme combining several permutations and substitution-based chaotic techniques, such as Arnold Chaotic Map, 2D-SLMM, 2D-LICM, and 1D-MLM. The proposed method is called Half-Inverted Cascading Chaos Cipheration (HIC3), designed to increase digital image security and confidentiality. The main problem solved is the image's degree of confusion and diffusion. Extensive testing included chi-square analysis, information entropy, NCPCR, UACI, adjacent pixel correlation, key sensitivity and space analysis, NIST randomness testing, robustness testing, and visual analysis. The results show that HIC3 effectively protects digital images from various attacks and maintains their integrity. Thus, this method successfully achieves its goal of increasing security in digital image encryption

Cryptography is a solution or method of information security that is good for maintaining the confidentiality and security of information, and can improve information or information security in an era of very rapid development of information technology. The rapid development of this technology, many new implications and problems arise in the delivery and communication of information, this is because everyone has easy access to the media and this affects the security of information and messages on the media. Therefore, to protect messages, we can use Caesar encryption, which is relatively easy to implement in PHP. How to apply message security in this study by designing web-based applications using the PHP and HTML programming languages. Message protection uses the Caesar encryption algorithm by changing every character of the original message into ciphertext. Characters in plain text are replaced with keys that are determined based on the number of alphabetical orders of plain text. In this way, unauthorized parties cannot read these private messages and users can interact with private messages more freely.

The more rapid development of information technology, this has an impact and can cause changes in people's thinking patterns in communicating. In the past, the way people used to communicate remotely was still manual, namely by using letters. The lack of efficiency in sending letters encourages people's mindsets to create innovations that facilitate long-distance communication, namely via SMS, email, WhatsApp and the internet. One of the impacts of the development of message delivery technology is the tapping of data which makes the user feel insecure. One way to secure data breaches is by securing the sender's and recipient's email passwords using AES (Advanced Encryption Standard) cryptography. We conclude that the AES algorithm can be applied to encrypt passwords, so that passwords cannot be easily read by other users. In addition, the password will not be easily cracked.

As a democratic country, voting is a mandatory and routine agenda for our country when choosing leaders in an organization to the state level. The paper-based voting system that has been used so far has several weaknesses such as ballot damage, vote counting errors, susceptibility to fraud, and delayed election results. To overcome these issues, a more secure and guaranteed electronic voting system is needed. The shift from conventional media to various media used for opinion polling, such as social media/internet, has occurred in this technological era. The E-Voting system has been confirmed as safe and in line with the latest technological advancements. To enhance its security level, the system can use various types of cryptographic algorithms, including AES. Cryptography can be the solution in maintaining information security such as confidentiality, data integrity, non-repudiation, and authentication

Cryptography (cryptography) is the science and art of keeping messages safe. The sender of the message will encrypt it while the recipient of the message will decrypt it. The encryption and decryption process uses keywords that have been agreed upon by the sender and recipient of the message. To better understand the development of cryptography, this journal will introduce a comparison of classical cryptography and modern cryptography at the level of computer network security. The cryptography that will be compared is Caesar Cipher and AES. This study uses the method of literature review (library research), namely research based on expert opinion and the results of previous studies.    

(Cryptography Advanced Encryption Standard (AES) for File Document Encryption). Advanced Encryption Standard (AES) is a cryptographic algorithms as a standard symmetric key encryption algorithm that used in current time. AES 128 has 1 blok plaintext with 128 bit sized, where in the process of cryptographic algorithms, first the plaintext is converted into hexadecimal-sized 4 x 4 matrices called the state, where each element of state has 1 byte size. The process of encryption on AES is the transformation towards the state repeatedly in the 10th round. Each round of AES requires one key result of the key generation using 2 basic transformation, i.e. substitution and transformation. AES encryption using 4 transformation by the following sequence: subbytes, shiftrows, mixcolumns, and addroundkey. On the other hand, the process of decryption is using the inverse of all the basic transformation of AES algorithm, except addroundkey. Therefore, the sequence of transformation on the decription is invshiftrows, invsubbytes, invmixcolumns, and addroundkey. In the data text, the encryption process is initiated with convertion the data text into ASCII code in hexadecimal numbers that are molded into the matrix 4 x 4 bytes. Next, do some basic transformation such as subbytes, shiftrows, mixcolumns, and addroundkey. However, when performing the transformation, the processed data on every trasformation is in the form of binary data obtained from the hexadecimal matrix. AES 128 bit cryptography have room 2128 keys which is a tremendous value and is considered secure to use to avoid the brute force attack.