Yusuf Kurniawan

The design of mini PGP security

We created Mini PGP application which has the function as encryption/description and digital signatures. The other functions of PGP had been removed in the pursuit of facilitating everybody in checking its security. Asymmetry algorithm utilizes the RSA 4096 bit only while symmetry algorithm utilizes Twofish only. We use SHA256 as hash function. This paper shows the security analysis of mini PGP. Comprehensive analysis on PGP conventional version of Windows is highly complex due to very large amount of source code. The goodness of mini PGP is more secured against dictionary attack and spyware if compared with the conventional one. Some PGP for Windows has also the program code that is able to tap the keyboard typing.

Design of TCP SYN Flood DDoS attack detection using artificial immune systems

TCP Flood DDoS attack is one of the most commonly-used attacks. DDoS has a huge impact on the victim because DDoS attack can multiply the power of attack and makes the victim server unavailable for the normal user. Recently, there are many types of research about DDoS attacks and the detection or mitigation techniques. One of the novel methods to detect DDoS is using dendritic cell algorithm (DCA). DCA is a kind of artificial immune system in the evolutionary algorithm that can be used as an anomaly detection. The DCA is also designed to solve the problem in network intrusion detection. In this paper tries to make a design of TCP Flood DDoS attack detection using artificial immune systems, especially dendritic cell algorithm.

The New Block Cipher: BC2

In this paper, we propose a new block cipher called BC2 (Block Cipher 2). We make a cipher using components that are believed secure. The structure of BC2 is very simple. We use Feistel network with input-output 128 bits, matrix Maximum Distance Separable (MDS) 8x8 with branch number 9 to give high diffusion, a function affine equivalent to the inverse function in GF(2^8) that we get from Camellia and Hierocrypt S-Box for confusion and we make FN function, based on FL function of Camellia. We use a heuristic method to count the minimum number of active substitution box at Feistel Network. And we also construct a new key schedule that is fast and secure.

SOC design and FPGA implementation of Digital TV receiver

This paper proposes a System-on-chip (SoC) Architecture Design for real-time Digital TV receiver. The SoC includes RF interface, a Host Processor, a Physical Layer and Ethernet interface. The Physical Layer itself consists of Baseband Processing modules based on DVB-T standard which includes 2048-point FFT/IFFT, Channel Decoder, Synchronizer, Equalizer, Demodulator, etc. The SoC utilizes a 32-bit RISC based processor acting as the Host Processor. Both Processor and Physical layer works on 32 MHz clock cycle to ensure low power consumption. A real-time OS based on eCos is also used for controlling the Physical Layer and interfaces in a real-time basis. The system is implemented using FPGA and has been verified capable of receiving a realtime video transmitted by a standard digital TV transmitter/modulator.

Security analysis testing for secure instant messaging in android with study case: Telegram

Instant messaging activity plays a major role in our life. With increasing usage of mobile phones and instant messaging users, vulnerabilities against these devices raised exponentially. In this paper, we propose a security analysis testing for secure instant messaging apps in Android which is designed using a threat analysis, considering possible attack scenarios and vulnerabilities specific to the domain. To demonstrate the testing methodology, we subsequently analyze one of the popular instant messaging that promises security and privacy for its users, Telegram. Therefore, we give detailed discussion about vulnerabilities that help developer to design for further secure application developments.

Improved generalizations of the Karatsuba algorithm in GF(2 n )

The process of multiplications in Finite Fields required huge resources. If those implemented in the Elliptic Curve Cryptography (ECC), the need of resources would be inflated because those processes were enough to dominated in every ECC level. There were many researches to found methods that could reduce the number of multiplications. One method that was well-known and developed was Karatsuba ofman algorithm, where the development of this research were General Karatsuba Multiplier, Efficient Multiplier in GF((2n)4) Generalizations of Karatsuba Algorithm, 5-6-7 Term Karatsuba-Like Formulae, and improved modulo functions. From those researches is made a better algorithm than Generalizations of Karatsuba Algorithm and it is expected to leads to generalize the form n-Term Karatsuba-Like Formulae.