Article Per Year (5 Year)
p-Index From 2021 - 2026
2.56
P-Index
This Author published in this journals
All Journal Journal of ICT Research and Applications MULTINETICS Jurnal Pengabdian Kepada Masyarakat (JPKM) Langit Biru eProceedings of Engineering Jurnal Pengabdian Masyarakat Bangsa The Indonesian Journal of Computer Science Jurnal Abdimas UM Jambi LOGIC: Jurnal Penelitian Informatika International Journal of Computing Science and Applied Mathematics-IJCSAM Proceeding of Community Service and Engagement
Farah Afianti
Telkom University
Aerospace Engineering Agriculture, Biological Sciences & Forestry Arts Humanities Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Health Professions Industrial & Manufacturing Engineering Law, Crime, Criminology & Criminal Justice Mathematics Medicine & Pharmacology Nursing Physics Public Health Social Sciences Transportation

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

Found 2 Documents
Search
Journal : multinetics

 1 
ANALISIS PENGGUNAAN ECC PADA SISTEM AUTENTIKASI DI IOT Purwiko, Daniel Perdana Putra; Dewanta, Favian; Afianti, Farah
MULTINETICS Vol. 8 No. 1 (2022): MULTINETICS Mei (2022)
Publisher : POLITEKNIK NEGERI JAKARTA

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32722/multinetics.v8i1.4701

Abstract

The Internet of Things is a complex system that is widely used in many ways to advance human life. As a result, Internet of Things (IoT) has many security vulnerabilities and requires an authentication system to protect user data. Selecting the authentication type that suits your needs is critical to achieving excellent performance on your Internet of Things (IoT) devices with relatively minimal specifications. Due to this situation, Elliptic Curve Cryptography (ECC) algorithm is one of the recommended algorithms which consumes less resources in the process. This study aims to test and compare the Fiat-Shamir based Elliptic Curve Cryptography (ECC) and Elliptic Curve Diffie-Hellman based Hash Message Authentication Code (ECDH-HMAC) authentication algorithms. Parameters for this test are computation time, delay, program storage, and communication cost of the authentication algorithm. The experimental results show that the Elliptic Curve Diffie-Hellman based Hash Message Authentication Code (ECDH-HMAC) algorithm has the lowest computational time, delay, and program storage usage, and the Fiat-Shamir based Elliptic Curve Cryptography (ECC) algorithm has the lowest communication cost value.
Analisis Perbandingan Block Cipher Simon-Speck, Simeck, Skinny pada Komunikasi Berbasis LoRa Putri, Winda Ezranata; Favian Dewanta; Farah Afianti
MULTINETICS Vol. 8 No. 2 (2022): MULTINETICS Nopember (2022)
Publisher : POLITEKNIK NEGERI JAKARTA

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32722/multinetics.v8i2.4821

Abstract

Inventions solving problems through the incorporation of technology and social impacts to facilitate human life can be defined as the Internet of Things (IoT). Security and privacy are challenges in various Internet of Things applications given the rapid growth of IoT devices. Meanwhile, IoT devices still do not have sufficient communication security. Communication systems on IoT devices require cryptographic to maintain the security of their communications. The appropriate algorithm to be implemented on IoT devices should be the smallest and fastest lightweight cryptographic algorithm or commonly called Lightweight Cryptography because IoT devices have limited memory and computing power. In this study, the proposed algorithm to be implemented in Long Range or LoRa-based IoT devices is the Simon-Speck, Simeck, and Skinny encryption algorithm. This study discusses the implementation of the Simon-Speck, Simeck, and Skinny algorithms on Long Range-based IoT devices. The parameters compared are the computation time of the encryption and decryption process and the avalanche effect value. In the encryption and decryption process, the Speck algorithm has the fastest computation time. Meanwhile, the highest avalanche effect value is obtained by the Skinny algorithm, which is 50.34%.
Co-Authors Abdullah Hanifan Aji Gautama Putrada Al Muzaffar, Moza Sajidah Putri Ari Moesriami Barmawi Audrey Kurvanka Carlos Riverro A. B. Dyah Ayu Suci Ilhami Edouardo Bintang Rokatenda Favian Dewanta Gede Agung Ary W Hanifan, Abdullah Indra Aulia Juri Febrianto Kal El Muhammad Pratama Muhammad Arzaki Muhammad Azwar Zulmi Muhammad Naufal Rabbani Muhammad Raihan Fadani Muhammad Rifqi Kusmayadi Muhammad Rizky Khomeini Nungki Selviandro Prasetyo Nugroho, Ecky Purwiko, Daniel Perdana Putra Putri, Winda Ezranata Rafi Athallah Sjakha Rahardja, Khairunnisa Novitania Raissa Henardianti Hanifa Ridwan Nur Rahman Selly Meliana Setyorini Setyorini Siti Saadah Syachrani Nur Annisa