6,223 research outputs found

    New Cryptographic Algorithms for Enhancing Security of Voice Data

    Get PDF
    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

    Multi-Level Steganography: Improving Hidden Communication in Networks

    Full text link
    The paper presents Multi-Level Steganography (MLS), which defines a new concept for hidden communication in telecommunication networks. In MLS, at least two steganographic methods are utilised simultaneously, in such a way that one method (called the upper-level) serves as a carrier for the second one (called the lower-level). Such a relationship between two (or more) information hiding solutions has several potential benefits. The most important is that the lower-level method steganographic bandwidth can be utilised to make the steganogram unreadable even after the detection of the upper-level method: e.g., it can carry a cryptographic key that deciphers the steganogram carried by the upper-level one. It can also be used to provide the steganogram with integrity. Another important benefit is that the lower-layer method may be used as a signalling channel in which to exchange information that affects the way that the upper-level method functions, thus possibly making the steganographic communication harder to detect. The prototype of MLS for IP networks was also developed, and the experimental results are included in this paper.Comment: 18 pages, 13 figure

    Improved Attack on the Cellular Authentication and Voice Encryption Algorithm

    Get PDF
    We present new cryptanalysis of the Telecommunications hash algorithm known as Cellular Authentication and Voice Encryption Algorithm (CAVE). The previous guess-and-determine style reconstruction attack requires 2912^{91} (resp. 2932^{93}) evaluations of CAVE-4 (resp. CAVE-8) to find a single valid pre-image (one which satisfies the input redundancy). Here we present a new attack that finds emph{all} valid pre-images with effort equivalent to around 2722^{72} evaluations of the algorithm for both CAVE-4 and CAVE-8
    • …
    corecore