Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Komputasi: Jurnal Ilmiah Ilmu Komputer dan Matematika

SIMULASI PERAMBATAN GELOMBANG ELEKTROMAGNETIK PADA KRISTAL FOTONIK 2D MENGGUNAKAN METODE FINITE DIFFERENCE FREQUENCY DOMAIN Adly Maulana Suherman; Teguh Puja Negara; Hendradi Hardhienata; Husin Alatas
KOMPUTASI Vol 16, No 2 (2019): Komputasi: Jurnal Ilmiah Ilmu Komputer dan Matematika
Publisher : Ilmu Komputer, FMIPA, Universitas Pakuan

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (453.567 KB) | DOI: 10.33751/komputasi.v16i2.1619

Abstract

Numerical simulations on two-dimensional photonic crystals with defects were analyzed using the Finite Difference Frequency Domain (FDFD). This approach consists of Maxwell's formulation that uses Central Finite Difference to place fields and materials at discrete points of the Yee grid, so that the matrix wave equation is obtained in the form of column vectors. Absorbent boundary conditions use Perfectly Matched Layer (PML) with fictitious magnetic conductivity to shed incoming waves at the edge of the domain calculation. Photonic crystals can be assumed to be a periodic lattice of dielectric material that produces the phenomenon of photonic band gap (PBG). The results of FDFD simulations are compared with the literature with a difference of 0.056. This small difference value means that this method is good enough to analyze PBG phenomena. For point defects and the accumulation of electromagnetic waves, linear defects are investigated and analyzed with spectral responses. Insertion of defects in photonic crystals will produce a photonic pass band (PPB). The simulation results show that PPB depends on the angle of arrival vector, material permittivity, and width of the defect structure.
IMPLEMENTASI ALGORITMA TANDA TANGAN DIGITAL BERBASIS KRIPTOGRAFI KURVA ELIPTIK DIFFIE-HELLMAN Asep Saepulrohman; Teguh Puja Negara
KOMPUTASI Vol 18, No 1 (2021): Komputasi: Jurnal Ilmiah Ilmu Komputer dan Matematika
Publisher : Ilmu Komputer, FMIPA, Universitas Pakuan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33751/komputasi.v18i1.2569

Abstract

In data communication systems, digital signatures are a form of electronic signature security services based on the Elliptic Curve Digital Signature Algorithm (ECDSA) which are considered resistant to certain types of attacks. Attacks on digital signature schemes aim to fake a signature or are called forgery which is said to be successful if the key pair and signature generated by the attacker are accepted by the verifier. Mathematical schemes used to prove the authenticity of messages or digital documents or guarantees that the data and information actually come from the correct source. ECDSA-based digital signatures rely on discrete logarithmic problems as the basis for mathematical calculations. Q = kP where Q and P are the points of the elliptic curve in the finite field  or  and k is a positive integer number. The hash function generated from the algorithm process is then encoded (encrypted) with an asymmetric key cryptographic algorithm. In this work use p = 149 to encrypt plain text by converting the original message using dots on a curve with the help of Python programs.