New Cryptographic Algorithms for Enhancing Security of Voice Data

A real-time application Voice over Internet Protocol (VoIP) is the technology that enables voice packets transmission over internet protocol (IP). Security is of concern whenever open networks are to be used. In general, the real-time applications suffer from packet latency and loss due to the nature of IP network. Cryptographic systems may be used to achieve VoIP security, but their impact on the Quality of Services (QoS) should be minimized. Most of the known encryption algorithms are computationally expensive resulting in a significant amount of time added to packet delay. VoIP is usually used by public users resulting in a key exchange problem and a trusted intermediate authority normally takes this responsibility. In this research, VoIP security was enhanced via a proposed cryptographic system. The proposed solution consists of a simple, but strong encryption/decryption algorithm as well as an embedded method to exchange the keys between the users. In this research, a new keys is generated in a random fashion and then used to encrypt each new voice packet to strengthen the security level. Key exchange is carried out by inserting the key with the ciphered voice packet that depends on the table of the key positions at the sender and receiver sides, and the target receiver is the only one who is able to extract the key. The encryption process in this research is divided into three main stages: key generation, encryption process, and key insertion process. The decryption process on the other hand is divided into two main stages: key extraction process, and decryption process. The proposed solution was implemented and tested and the results showed that the required time for the security processes is minimized compared to some known algorithms such as AES_Rijndael algorithm. Furthermore, the analysis has proved that the security level has a direct relationship to the key length and the voice packet size in that large packet size requires more processing time. Finally, the implementation result in this research shows the average time needed to encrypt and decrypt a voice packet size using a proposed algorithm with the long key of 1024-bits is much smaller than AES_Rijndael algorithm with a short key length of 128-bits

SISTEM PEMILU ONLINE BERBASIS PROTOKOL TWO CENTRAL FACILITIES

An election is an simple example of a scenario where security and confidentiality of data  between parties is critical. General election system that used in Indonesia as it long still use conventional trick that evokes a lot of problem as elector of double, voice distension and another fault and also long time for vote count. This conventional trick also require big costs and resources. To settle that thing, one of solution which can be done is use electronic voting ( e-voting ) with arrange general election system online  that building to use a safe protocol.System that is made has default pock secure voting reguirements to get settles and secure security each threat which will happen. One of protocol which can accomplish partly criterion default secure voting reguirements  and has security zoom that passably is Two Central Facilities Protocol , where consisting of Central Legitimazation Agency  (CLA) for elector validation and Central Tabulating Facility (CTF) for vote count

Security in Peer-to-Peer SIP VoIP

VoIP (Voice over Internet Protocol) is one of the fastest growing technologies in the world. It is used by people all over the world for communication. But with the growing popularity of internet, security is one of the biggest concerns. It is important that the intruders are not able to sniff the packets that are transmitted over the internet through VoIP. Session Initiation Protocol (SIP) is the most popular and commonly used protocol of VoIP. Now days, companies like Skype are using Peer-to-Peer SIP VoIP for faster and better performance. Through this project I am improving an already existing Peer-to-Peer SIP VoIP called SOSIMPLE P2P VoIP by adding confidentiality in the protocol with the help of public key cryptography

Micro protocol engineering for unstructured carriers: On the embedding of steganographic control protocols into audio transmissions

Network steganography conceals the transfer of sensitive information within unobtrusive data in computer networks. So-called micro protocols are communication protocols placed within the payload of a network steganographic transfer. They enrich this transfer with features such as reliability, dynamic overlay routing, or performance optimization --- just to mention a few. We present different design approaches for the embedding of hidden channels with micro protocols in digitized audio signals under consideration of different requirements. On the basis of experimental results, our design approaches are compared, and introduced into a protocol engineering approach for micro protocols.Comment: 20 pages, 7 figures, 4 table

Using Transcoding for Hidden Communication in IP Telephony

The paper presents a new steganographic method for IP telephony called TranSteg (Transcoding Steganography). Typically, in steganographic communication it is advised for covert data to be compressed in order to limit its size. In TranSteg it is the overt data that is compressed to make space for the steganogram. The main innovation of TranSteg is to, for a chosen voice stream, find a codec that will result in a similar voice quality but smaller voice payload size than the originally selected. Then, the voice stream is transcoded. At this step the original voice payload size is intentionally unaltered and the change of the codec is not indicated. Instead, after placing the transcoded voice payload, the remaining free space is filled with hidden data. TranSteg proof of concept implementation was designed and developed. The obtained experimental results are enclosed in this paper. They prove that the proposed method is feasible and offers a high steganographic bandwidth. TranSteg detection is difficult to perform when performing inspection in a single network localisation.Comment: 17 pages, 16 figures, 4 table