cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Alex Rikki
Contact Email
alexrikisinaga@gmail.com
Phone
+6282275847123
Journal Mail Official
login.jurnal@gmail.com
Editorial Address
Komplek New Pratama Asri Blok C, No.2, Deliserdang, Sumatera Utara, Indonesia
Location
Unknown,
Unknown
INDONESIA
Login : Jurnal Teknologi Komputer
Published by SEAN INSTITUTE
ISSN : 23029692     EISSN : 27238695     DOI : -
Core Subject : Science,
Computer Science & IT Decision Sciences, Operations Research & Management
Is a journal managed by the SEAN Institute, this journal discusses science in the field of Computer Science, Appropriate Computer Technology, Information System Design, as a forum for pouring research results both conceptually and technically related to information science. Journal Login is published twice a year, namely in June and December. The incoming article will be accepted by the editor and then forwarded to the section editor and forwarded again to the reviewer for review using a double-blind peer review. The scope of the journal Login as follows: [Domain-Specific Frameworks and Applications]: IT Management dan IT Governance, e-Government, e-Healthcare, e-Learning, e-Manufacturing, e-Commerce, ERP dan Supply Chain Management, Business Process Management. [Smart Systems]: Smart City, Smart Cloud Technology, Smart Appliances & Wearable Computing Devices, Smart Sensor Networks, Information Infrastructure for Smart Living Spaces, Intelligent Transportation Systems. [Models, Methods and Techniques]: Conceptual Modeling, Languages, and design, Software Engineering, Information-centric Networking, Human-Computer Interaction, Media, Game and Mobile Technologies, Information Retrieval, Information Security, Image Processing and Pattern Recognition, Natural Language Processing.
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 40 Documents
 1   2   3   4 
Simulasi Pencarian Rute Terpendek dengan Metode Algoritma A* (A-Star) Simbolon, Oslan Juliana
Login : Jurnal Teknologi Komputer Vol. 17 No. 1 (2023): Login : Jurnal Teknologi Komputer, Edition June 2023
Publisher : Sean Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58471/login.v17i1.97

Abstract

Pencarian rute terpendek merupakan suatu permasalahan yang sering muncul pada pengguna sarana transportasi, karena para pengguna sarana transportasi dalam melakukan perjalanan memerlukan solusi untuk mendapatkan rute atau jalur tempuh terpendek. Hal ini eratkaitannya dengan efisiensi waktu, biaya, serta tenaga yang dikeluarkan. Algoritma A* menggunakan estimasi jarak terdekat untuk mencapai tujuan (goal) dan memiliki nilai heuristik yang digunakan sebagai dasar pertimbangan. Heuristik adalah kriteria, metoda, atau prinsip-prinsip untuk menentukan pilihan sejumlah alternatif untuk mencapai sasaran dengan efektif. Hasil pada penelitian iniadalah berupa realisasi program simulasi pencarian rute terpendek dari posisi asal ke posisi yang dituju (goal) dengan menggunakan bahasa pemrograman Visual 2008. Representasi visual dari Graf adalahdengan menyatakan obyek sebagai simpul, dan hubungan antara simpul dinyatakan dengan Titik-titik. Program simulasi ini memberikan kemudahan untuk menentukan rute terpendek yanga kan dilalui dari posisi asal ke tujuan.
Analysis Of The Utilization Of Echo Hiding Algorithm In Hiding Secret Messages Pangaribuan, Cahaya Elyzabeth; Ogy Kevinta Surbakti; Fera Sihotang; Yosafat Tamba; Yordan Daniel Ndruru; Paskah Marto Hasugian
Login : Jurnal Teknologi Komputer Vol. 18 No. 01 (2024): Jurnal Teknologi Komputer, Edition June 2024
Publisher : Sean Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58471/login.v18i01.108

Abstract

Steganography is a technique of hiding information in other media to maintain the confidentiality of the message. One of the challenges in steganography is finding a method that can insert data without being detected while maintaining the quality of the original media. This study discusses the application of the Echo Hiding algorithm in audio steganography, which utilizes acoustic properties to insert information into sound signals. The main objective of this study is to analyze the effectiveness and security of the Echo Hiding algorithm in hiding data in audio signals. To achieve this goal, this study uses a digital signal processing method, which includes the stages of message insertion, hidden message extraction, and audio quality evaluation using objective and subjective parameters. Testing was carried out with various scenarios to assess the capacity of insertion, resistance to attacks, and changes in sound quality. The results showed that the Echo Hiding algorithm was able to store information efficiently with little impact on audio quality. Signal analysis showed that the modifications made were not significant to the listener's perception, thus increasing the security and transparency aspects in audio steganography. Thus, this study contributes to the development of a safe and effective steganography method to maintain the confidentiality of information in sound media.
Information Technology Resource Framework Hasugian, Paska Marto
Login : Jurnal Teknologi Komputer Vol. 18 No. 01 (2024): Jurnal Teknologi Komputer, Edition June 2024
Publisher : Sean Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58471/login.v18i01.109

Abstract

This study is a literature review aimed at investigating and analyzing concepts and frameworks related to Information Technology Resource. Through a literature review approach, this research gathers, organizes, and analyzes previous studies conducted in this field. The main focus of this study is to gain an understanding of the roles, components, and characteristics of the Information Technology Resource framework, as well as its impact on company performance. The method used in this research involves searching and selecting relevant scientific articles, journals, and publications related to the topic. After a careful selection process, the literature studies that meet the inclusion criteria are analyzed in detail, and relevant essential information is extracted for further analysis. The results of this literature review present various frameworks within the domain of Information Technology Resource. These frameworks encompass crucial aspects such as managing information technology resources, integrating information technology into business strategies, measuring information technology performance, and developing information technology competencies within organizations. In this context, the research identifies key concepts, theoretical perspectives, and recent trends in the development of Information Technology Resource frameworks.
Cryptography with Ring Algorithm – LWE Gaol, Paramita Lumban; Stephen Buulolo; Aritmen Andreas L. Manurung; Yeremia, Yeremia
Login : Jurnal Teknologi Komputer Vol. 18 No. 01 (2024): Jurnal Teknologi Komputer, Edition June 2024
Publisher : Sean Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58471/login.v18i01.110

Abstract

Ring Learning With Errors (Ring-LWE) is one of the basic schemes used to develop cryptographic algorithms that are resistant to quantum attacks, offering better computational efficiency compared to standard Learning With Errors (LWE). Ring-LWE uses the algebraic characteristics of polynomial rings to create a robust and fast encryption system. This study implements and evaluates the Ring-LWE algorithm in the context of public key exchange and encryption. Simulations are performed with various security parameters, including modulus size and error rate, to test the resistance to brute force attacks and lattice-based attacks. The experimental results show that the Ring-LWE algorithm can achieve a balance between security and computational efficiency, with shorter processing time than conventional LWE while maintaining a high level of security even in the face of quantum computers. From this study, it can be concluded that Ring-LWE is an excellent choice for application in post-quantum security systems, especially in encrypted communication and digital authentication applications. The next step can be directed at optimizing resource utilization and testing against various types of attacks.
Analysis of the Effect of Padding Schemes on Entropy, Bit Distribution, Hash Collisions, and Processing Time in Merkle-Damgård Sirait, Valois Vicenti; Mia Elisabet Malau; Jeni Percani Sinaga; Dian Pratama Gulo; Berkat Damai Halawa
Login : Jurnal Teknologi Komputer Vol. 18 No. 01 (2024): Jurnal Teknologi Komputer, Edition June 2024
Publisher : Sean Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58471/login.v18i01.111

Abstract

Data security in cryptographic systems is highly dependent on the strength of the hashing algorithm. One of the most commonly used hashing structures is Merkle-Damgård, which converts the compression function into a fixed-size hashing function. The padding technique in this structure plays an important role in determining the bit distribution, entropy, and the probability of collision in the hash results. This study aims to analyze and compare three padding methods, namely 1 & 0 bit padding, repeating pattern padding (0xAA), and 1 bit padding (0xFF), based on bit distribution parameters, Shannon entropy, hash collision, and processing time. The results show that 1 bit padding (0xFF) has the highest Shannon entropy value (0.9940), indicating a better level of randomness compared to other methods. In terms of bit distribution, this padding also produces better balance than other paddings. However, the hash collision rate (74.90%) is still relatively high, indicating that the padding method alone is not enough to significantly reduce the probability of collision. In terms of time efficiency, padding bits 1 & 0 have the fastest execution time (0.000132 seconds), while padding bit 1 (0xFF) has the longest processing time (0.000177 seconds). With these results, it can be concluded that the padding method affects the hash characteristics, but does not significantly reduce the collision probability. Therefore, further optimization is needed to improve the security of Merkle-Damgård-based hashing.
The Implememtation Of Hiding Information By Using Discrete Wavelet Transform (DWT) Simbolon, Devi Silvia; Kevin Enrique Keliat; Kristian Sigalingging; Vicky Nainggolan; Rifelson Sipayung
Login : Jurnal Teknologi Komputer Vol. 18 No. 02 (2024): Jurnal Teknologi Komputer, Edition December 2024
Publisher : Sean Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58471/login.v18i02.112

Abstract

Steganography using Discrete Wavelet Transform (DWT) is a technique for embedding information into an image without significantly altering its visual quality. This study aims to analyze the effectiveness of DWT in securing hidden messages within digital images. DWT decomposes image signals into approximation and detail coefficients, allowing data embedding in the high-frequency components while preserving the most essential image features. The research methodology involves converting secret messages into numerical form, applying DWT to the image, embedding data into the detail coefficients, and reconstructing the image using inverse DWT. The results show that this approach enables secure and imperceptible data hiding while maintaining image quality. Additionally, DWT provides advantages in signal analysis, data compression, and noise resistance, making it a robust technique for steganography. The study concludes that DWT is an effective method for secure data embedding with minimal distortion, offering potential applications in digital watermarking and confidential communication.
Steganography With End Of File Sitohang, Zuvernius; Yohana Desma R. Munte; Pembinata Taringan; Hiskia Hasugian; Trihadi Pinem
Login : Jurnal Teknologi Komputer Vol. 18 No. 02 (2024): Jurnal Teknologi Komputer, Edition December 2024
Publisher : Sean Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58471/login.v18i02.113

Abstract

Steganography is the science and art of hiding secret messages in other messages, so that the existence of the message cannot be known by third parties. One method used in steganography is the EOF (End of File) message insertion method, which is inserting data at the end of a file by providing a special mark to identify the beginning and end of the data. This technique is used to insert data as needed, and the steganographed file does not appear to change visually or audibly, even though the file size becomes larger. In this regard, this technique can be applied to protect the copyright of digital products, such as software or multimedia, through digital watermarking techniques that use the EOF method to insert information or messages as permanent identification in digital files. In addition, in an effort to improve security, a technique for combining Blowfish cryptography with Hexa steganography is also proposed. This technique has advantages over DCS steganography, namely fewer pixel color changes, so that the inserted data is more difficult to detect and easier to maintain even if the stego image is processed or edited. The results of the study show that the combination of Blowfish cryptography with Hexa steganography is more effective than DCS steganography in protecting the inserted data. The test was carried out by analyzing the robustness of Hexa steganography using the PNSR test to determine the level of change in the original image and the inserted image.
Application of Diffie-Hellman Algorithm Method (Key-Exchange) in Cryptography Sagala, Sarah
Login : Jurnal Teknologi Komputer Vol. 18 No. 02 (2024): Jurnal Teknologi Komputer, Edition December 2024
Publisher : Sean Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58471/login.v18i02.114

Abstract

In cryptography, key exchange security is essential. Because the message code can only be a message that is analyzed with a key offer that matches this message. Secret messages can be delivered through symmetric cryptographic algorithms with coded keys or with key exchange algorithms. One of the key exchange methods that has been developed is Diffie-Hellman Key-Exchange (DHKE). Diffie-Hellman is a simple method used to generate a key between two parties in order to communicate securely. The two parties running this algorithm have their own secret variables, by exchanging two public variable values and performing calculations using the received variables and secret variables obtained randomly shared secret. The security strength in this algorithm can be improved by combining an asymmetric key algorithm, namely RSA. This algorithm is not only in generating RSA keys, but also in calculating discrete logarithms in RSA and Diffie-Hellman. The results of this algorithm are key strength and confidentiality that can be used in symmetric cryptographic algorithms.
Implementation of DCT Based Steganography Algorithm to Hide Information in Images Napitupulu, Septrian; Ryan Revaldo Siagian; Ramli Simanullang; Kelvin Daniel Manalu; Conglii Fao Silalahi
Login : Jurnal Teknologi Komputer Vol. 18 No. 02 (2024): Jurnal Teknologi Komputer, Edition December 2024
Publisher : Sean Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58471/login.v18i02.115

Abstract

Steganography is the art and science of hiding secret messages in digital media, ensuring that only the sender and intended recipient are aware of its existence. One of the widely used techniques in digital image steganography is the Discrete Cosine Transform (DCT) based method, which embeds secret data into the frequency domain of an image. This study explores the application of DCT-based steganography to hide information in an image while maintaining its visual integrity. The research methodology involves transforming the image into DCT coefficients, embedding the secret message into selected high-frequency coefficients, and then applying the Inverse Discrete Cosine Transform (IDCT) to reconstruct the stego image. The quality of the modified image is evaluated using the Peak Signal-to-Noise Ratio (PSNR) and Mean Square Error (MSE) metrics. The results show that the proposed method effectively hides information while maintaining image quality, as indicated by the high PSNR value and minimal MSE. This study contributes to the field of secure data communication by presenting a reliable and undetectable approach to information hiding.
Analysis of Cryptographic Utilization with Merkle-Damgård Algorithm Nainggolan, Peronika Ulianti; Dennis Afrilyans Manik; Laurenzio Gratian A. Daeli; Flory E Bako
Login : Jurnal Teknologi Komputer Vol. 18 No. 02 (2024): Jurnal Teknologi Komputer, Edition December 2024
Publisher : Sean Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58471/login.v18i02.116

Abstract

Cryptography plays an important role in data security, especially in authentication and digital signatures. One method that is widely used in cryptographic hash functions is the Merkle-Damgård algorithm. This algorithm allows the transformation of variable-sized data into a fixed hash value through an iterative process with a compression function. This study aims to analyze and understand the working mechanism of the Merkle-Damgård algorithm and its implementation in a data security system. The methods used in this study include the hashing process by dividing messages into fixed blocks, adding padding, initializing the initial value, and iterating the compression function. Testing was carried out with the example of the plaintext "ABC" using a simple XOR operation. The results of the analysis show that the Merkle-Damgård algorithm can produce unique and deterministic hash values, making it effective in detecting data changes. However, this algorithm also has weaknesses against collision attacks, which is a challenge in its development. Therefore, a deep understanding of this algorithm is essential in improving the security of modern hash functions.

Page 4 of 4 | Total Record : 40

 1   2   3   4 

Filter by Year

2023 2024


Reset
Filter By Issues
All Issue Vol. 18 No. 02 (2024): Jurnal Teknologi Komputer, Edition December 2024 Vol. 18 No. 01 (2024): Jurnal Teknologi Komputer, Edition June 2024 Vol. 17 No. 02 (2023): Jurnal Teknologi Komputer, Edition Desember 2023 Vol. 17 No. 1 (2023): Login : Jurnal Teknologi Komputer, Edition June 2023