Rinaldi Munir

Security analysis of selective image encryption algorithm based on chaos and CBC-like mode

This paper present a security analysis of the proposed selective image encryption algorithm based on chaos and CBC-like mode. The algorithm uses a Logistic Map to generate kesytreams that XOR-ed with 4-bit MSB of each pixel. Security analysis covers key space analysis, histogram analysis, correlation analysis, entropy analysis, and sensitivity analysis. Based on experiment results and the security analysis can be concluded that the proposed algorithm is secure from various attacks which aim to find the secret keys or pixels in plain-images.

A block-based image encryption algorithm in frequency domain using chaotic permutation

Images can be encrypted in spatial domain, frequency domain, or both. Most of the image encryption algorithms operate in spatial domain. Encryption in frequency domain has an advantage of being resistante to many image processing operations. This paper presents an image encryption algorithm in frequency domain using a chaotic permutation. Because of the images represented in JPEG format, then to increase robustness to the image processing operations, the plain images are encrypted in blocks 8 × 8. After an image is encrypted, the cipher-image was modified by some common image processings. The experiments shows that the cipher-image was robust to the image processing operation, the decrypted images can be still recognized well.

Selective encryption algorithm implementation for video call on Skype client

Video calling is one of the widely used method of communicating. Encryption is applied to video call data to keep it secret. Real-time encryption is needed to support real-time communication such as video calling. Selective encryption is present as a solution to this problem. Skype is software that supports video calling. It cannot be ascertained whether Skype communication channel can be eavesdropped or not, since Skype communication protocol is very closed and concealed. Because of skype closed and concealed communication protocol, there is possibility that Skype party can eavesdrop communication in its communication channel. In this paper, we proposed a Skype client application made especially for video calling. Its main objective is to implement a selective encryption algorithm in video calling, especially via Skype. This Skype client is implemented in C++ programming language using Skypekit API from Skype. Testing proved that Skype client built support video calling with minor delay. Selective encryption algorithm is implemented to encrypt video in this Skype client.

Cyclical metamorphic animation of fractal images based on a family of multi-transitional IFS code approach

The metamorphic technology is very important and can make an animation more attractive. The cyclical metamorphic animation of fractal images can be constructed by more than two fractal images. The multi-transitional IFS code can represent the multiple fractal images as the nodes of the iteration of the cyclical animation. To have the interpolation between the source and target of fractal images looked natural, the IFS code form of fractal attractors should be in a family with the correct order and the same number of transformation functions and relatively with the same size of attractors.

Arithmetic coding modification to compress SMS

This paper proposes an effective method to compress SMS by doing some modifications to arithmetic coding data compression mechanism. The aim of this proposal is to optimize the maximum character capacity of SMS body. Every character in SMS is mostly encoded in 7 bit and the maximum capacity of one SMS is only 1120 bit. Those SMS characteristics require a very efficient compression method to compress SMS.

A chaos-based fragile watermarking method in spatial domain for image authentication

In this paper, a fragile watermarking method based on chaos map for image authentication is proposed. The watermark is a binary logo of the same size with the host image. Before embedding, the watermark is encrypted by XOR-ing it with a chaotic image. The chaotic image is generated by using Logistic Map. Next, the least significant bits (LSB) of pixels is used for embedding where the LSBs of the host image are replaced by the encrypted watermark. Authentication is done by extracting the watermark from the watermarked image and then compare it with the original watermark. If found the extracted watermark fragile then it indicates that the image has been altered. Various typical attacks to the watermarked images are carried out to assess the performance of the proposed method. Experiment results show that the proposed method can detect image integrity due to the attacks. For increasing security, the chaos system give sensitivity aspect so that the method is secure from the exhaustive attack.

Security system for surveillance radar network communication using chaos algorithm

Surveillance radar network is the network of some radar station to monitor and keep watch ship/vessel traffic. The communication of these station used tcp/ip over internet and local area network. The security system is an important part that can not be ignored for network communication. This paper proposed a prototype of security system for surveillance radar network, which is handling the security of communications over the Internet between a radar station to master station. The system is designed to protect the radar data against unauthorized parties. From the previous work, there was a weakness in the pseudorandom number generator. The generated number could not satisfy the randomness, it might be raise a security problem. Thus, Pseudorandom Number Generator (PNRG) using chaos algorithm was added to strengthen the salt cryptographic scheme. The analysis of result will be discussed to obtain the advantages of new system. Finally, a layered security system has been developed by taking advantage of a variety of encryption algorithms to get the best protection for the security of surveillance radar network communication.

A new string matching algorithm based on logical indexing

Searching process performance is very important in this modern world that consists of various advanced technology. String matching algorithm is one of the most commonly applied algorithms for searching. String that contains sequences of character is the simplest representation of any complex data in our real life, such as search engine database, finger print minutiae, or DNA sequence. The current most famous string algorithms are Knuth-Morris-Pratt (KMP) algorithm and Boyer-Moore (BM) algorithm. Boyer-Moore algorithm and KMP algorithm are not efficient in some cases. We introduced a new variation of string matching algorithm based on Logical-Indexing (LI), which is more efficient than those algorithms. Logical-Indexing algorithm implements a new function or method and defines different jumping rules compared to others. The indexes of texts and patterns are used to reduce the number of comparisons. Index enables us to analyze the condition of comparison without directly comparing each character in the pattern. Theoretically, we have proven that Logical-Indexing algorithm can skip more characters than KMP and BM algorithm by analyzing KMPs and BMs weaknesses then giving the better solution that are implemented in LI. Furthermore, experiments conducted on various combinations of pattern matching cases also demonstrate that the average number of LIs direct comparisons is smaller than KMPs and BMs algorithm.

Chaos-based modified “EzStego” algorithm for improving security of message hiding in GIF image

EzStego is a steganography algorithm to embed the secret message in the GIF images. The message is embedded into indices of sorted color palette of the images. EzStego is a sequential embedding type of stego-algorithm. There is no key required for embedding, so anyone that know the algorithm can extract the message. For improving security, a modified EzStego algorithm is proposed. Bits of the message are embedded randomly in the image. Locations of embedding is generated from a random permutation which need an initial value as stego key. Before embedding, the message is encrypted with random bit which is generated by a chaos map. Based on experiments, the modified EzStego is more secure than the original EzStego, because anyone who has no information on the key can not extract the message from the stego-images.

SAML single sign-on protocol development using combination of speech and speaker recognition

Single sign on (SSO) is a centralized authentication system where user acquires access to many services using one credential. However, Single Sign On has one fatal weakness. If one credential has been acquired by an attacker, the attacker can acquire access to many services. SAML SSO protocol, that widely studied also suffers this vulnerability. This research provides economic solution for such problem by combining speech and speaker recognition and apply it to SAML SSO protocol.