Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal International Journal of New Media Technology Jurnal ULTIMA Computing
Hargyo Tri Nugroho
Universitas Multimedia Nusantara
Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering Engineering

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Jurnal ULTIMA Computing

 1 
Analisis dan Implementasi Protokol Otentikasi FIDO U2F Sunderi Pranata; Hargyo Tri Nugroho; Hirofumi Yamaki
Ultima Computing : Jurnal Sistem Komputer Vol 9 No 1 (2017): Ultima Computing : Jurnal Sistem Komputer
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (547.627 KB) | DOI: 10.31937/sk.v9i1.571

Abstract

It is known that password itself is not enough for formidable authentication method since it has a lot of vulnerabilities. Multi factor authentication (MFA) is introduced for the next generation for good authentication to address that issue. MFA combines two or more of three principles of good security, “something you know”, “something you have”, and “something you are”. Most MFA mechanisms work as one time passwords (OTP). However, they can still be vulnerable to phishing and MiTM attack. On top of that, OTP can be hard to use as it requires user to input another password given by the device (SMS, token, authenticator). Implemented in small USB U2F device, FIDO U2F delivers easier yet stronger security on authentication process which implements public key cryptography, challenge-response protocol, and phishing and MitM protection. Index Terms— Authentication protocol, FIDO U2F, Multi factor authentication, OTP
Pengaruh Algoritma Stemming Nazief-Adriani Terhadap Kinerja Algoritma Winnowing Untuk Mendeteksi Plagiarisme Bahasa Indonesia Hargyo Tri Nugroho
Ultima Computing : Jurnal Sistem Komputer Vol 9 No 1 (2017): Ultima Computing : Jurnal Sistem Komputer
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (476.904 KB) | DOI: 10.31937/sk.v9i1.572

Abstract

Winnowing algorithm is one among many algorithms for detecting document similarity and plagiarism. Some studies show that Winnowing algorithm performs quite well. One form of plagiarism is paraphrase plagiarism. Paraphrase plagiarism can be done by changing sentence structure, changing vocabulary, and adding or changing affixes. Based on some of our previous experiments, detecting document resemblances can be enhanced by changing the words containing affixes to their basic words. In computer science, this technique is known as stemming - a technique to extract the basic word from an affixed word. Usually this technique is required in the filtering process to save storage media. For Indonesian, the Nazief-Adriani stemming algorithm is by far the most appropriate. This study examines how the effect of Nazief-Adriani stemming algorithm on Winnowing algorithm's performance against Indonesian texts. The results showed that the stemming process using Bloom-Filter on the Winnowing algorithm tends to decrease the similarity level achieved, but it accelerates processing time by approximately 30%. Keywords—Algoritma Nazief-Adriani, Algoritma Winnowing, Bloom-Filter, Plagiat, Plagiat Checker
Co-Authors Hirofumi Yamaki Nehemia Edbertus Samuel Hutagalung Sunderi Pranata