Scribd Logo
Upload

Welcome to Scribd!

  • RTAS v1

    Uploaded by

    adem adem
    8 views6 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    8 views6 pages

    RTAS v1

    Uploaded by

    adem adem

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 6
    American Journal of Computer Science x (x): 20:28, 2005 ISSN 1546-9239 1© 2005 Science Publications ‘New security technique for real time applications (RTAS) Ammar AIRoz ‘ABSTRACT “The Internet has worked so far with aber efor traffic model, every packet i treed (forwarded or discarded) equally. This sa very simple and efficient model. Recently many interactive or real-time services have been introduced andthe economical importance of the Internet lass grown The IP phoues and services based on that technology is theateaing the traditional circut-swtehed telephone services, especially on long-distance services. ‘Tramsmutting meracive real-time medias the greatest challenge in packet based networks. The end-to-end delay, the delay variations (jter), and the packet Toss must not exceed some time limits; otierwise, usability of the service degrades badly Many companies have teen deploying Real time applications (RTA) over the intenet like VOIP, Video Conferencing and other Multimedia services in recent years. The need to protect users, data and inffastructures [becoming more enical than ever Encryption i used to provide the security aeeded fr realtime applications. Since RTA contain high velume of data, classical encryption techmues are not appropriate. Because most of RTA are implemented on the intemet. the encryption and decryption techniques fas to take minimal me to achieve acecptable end fo end delays. In this paper, a new cryptographic Algona is developed to amprove the time for ‘eneryption and decryption of data (VOT) of end to end delay. ‘Keywords: Real time applications security. VOIP. Encryption, Decryption, Introduction CCrypiogzaphy the science of wansforming the data s0 that aobody can read it or change it except an authorized user. So, changing te onginal data to 3 Secret message is called Encryption, while decryption 1s ie reverse. The process of encrypnon and decryption of the data is based of a mathematical procedure called the algorsizn ‘The major security goals that are of concem to cayptogtaphy’ ate, Gist, confideatialty which a the function of allowing only amthoized ters to accest the mfermation, second, authentication which 3 the function of the receiver verifying the seader and trust that de sender as actually who he clams to be. dnd integrity, which means that the recerver should be able to aust thot the message has aot been altered uring transmission, fourth, nca-repadiation whichis the inblty of the sender or ecesver to deay thatthe siessage has been seat or received. finaly. accest contol which is to sestict the avabiity of feerypted information. These five elements as been the focus of well configured cryptography system. There are three categories of cryprographic algonthms - Hashing ‘Many algorithms have been proposed to implement hnashing One- way hash as oue of these algertame which is widely ted in the ATM. Message digest is another algorithm which has three versions MD2, (MD. MDS. The basic idea of the message algcritn +510 take a plain text of any length and creates a hash ‘of various length depends on the version Hash fimenons has proven to have weaknesses and should Ibe cepaced by a more sere methods Syumetic encyption algortims which the mor category of eryprograpic algorithms and the most common type uses a single key to encrypt and eoypt a meseage The pupose of de symmetic algorithms 35 wo decypt the ciphenext compared 10. bashing gots where they never mtended 0 decrypt the Information sot is also called Private Ker Cryptography. The most common Algorithm is ‘led Data Encryption Standard (DES), uses a key Tength of 56 bts and xt can be implemented in Inacdware and software by exectting the alaeitsa 16 tones, Dut the Key i considered un secu because oF the length Triple DES is an improvement over the DES because st exploys thee ter the enceuing of the algorithm aod ses aly of 192 bit lone whic ‘makes te computation time fo log and ao suitable for real time applications (VOTP) ‘Advanced Encsypion Stadad (AES) is aaoiber Alzoritam which provides mach higher sect level tsa DES and pecfrayst ia $0 10 ess computational ‘power than tripleDESt™ J. Computer Set, 2 2): 2%, 2005 AES performs three steps on every block of 128 bite ‘of pla text f dhe 128 bat key is used, st perfoms 9 rounds, if 192 bit key is used, it performs 11 rounds and 2 356 bit key perfoms 13 rounds, whicls makes ‘this protocol ideal for real ume enerypiion of voice and C4 algoralim whick was aveated by Roa Rivest (Ref) isa sream cipher that accepts keys mp 10 128 bits in Ieugth and at is used as pat of Wired Equivalent Privacy (WEP) encryption standard on IEEE 902112, band g wueless networks. Implemengions canbe very competion ‘The primacy weakness i the symmetric encryption algocthos is keeping a single key secure. which yields ‘another approsch fo cryptography whici a called asymmetric encryption or Public Key that which uses ‘ovo keys inetead of one. Oue of the keys is sed to ‘encrypt the message and scaled private key andthe ‘second is ted to decrypt the message and is called Public key. The two keys are mathematically elated ‘Three asyrmetric algorithms are commonly used which ae RSA. Dulie Hellman, and Elliptic Curve. RSA is the most commonly used asymmetric algorithm which is built in operating systems by ‘Microsof, Apple, Sun, and Novell. is also found in seonre telephones, ethemet network cards, and. saact Sa The second, Diffie-Heiman algorithm does not ‘encrypt or decrypt data, rather i allows two users to share a secret key securely over the public nenworks ‘Once the key is being shared thea both parties can use at encrypt and decrypt messages sng symmetric cryptography. This algorithm is used in BPSec and Secure Shell (SSE) protocols. ‘Tae last algorithm, Elliptic Conve. has not beea fully tested because itis sll new concept” ‘Real te applications As voice service providers roll out Voice-over IP (Wor), instant ‘messaging OM). multimedia conferencing. the seed 10 protect user's privacy against eavesdropping are becoming 3 moce ‘cial sues Except for AES protocol, all other protocols ‘meatioged above afe ot suitable for real time applications because ofthe delay that they impose on the packets and since the real time packets ace sensitive to time delay. We need to design an Algorithm that have & beter level of secury, with ‘mininmim encryption delay and 1 our algontim. we claim that i encryption and eeryption contribute to the message time delay at ‘munuiom, and iti better than the standards which shouldbe kept to less than one second “This algoritm has been designed with to major ‘ctor m mand. Fist, the ume needed for encryphion and decryption, Classical eneryption techoiqes take alot of tme like Triple DES, and AES-Riyndae, soit ‘snot appropriate for seal tine applications Secend, the level of secunty should be high enough so atackers ean not break the Key ‘There are two components aa stacker ned, the Key and the index table. We use 1024 bit key. and this key Is randomly generated which becomes harder t0 intercepted. Ths key is delivered in each packet. This keey is randomly generate an indexes in an index table, Index tables in ender and receiver. indexes are not send wath packets orm any other way. so attacker feed to pies 128 indexes. In the approach, helshe needs to we have mo levels of secunty, the anacker ‘needs to decrypt the key. and remove the key fom the packet, or else he wall hear some noise, and when the conversation will not be clear low it will work? ‘The proposed algonitim 1 implemented as the following 1. We need to request a comection. This request 36 done by sending one packet which is called ail packet This packet depends on some actions is dane atthe sender side. These actions ate: ‘onsticton of the intial candem generator table in the sender and he recewer sides (Table 1). Numbess inthis table are generated by mathematical equation, ‘Tials equation shouldbe initialized inthe same way at the sender and receiver sides, The table size is 16°16 1s showa below, and numbers in the table are varieag Hom 09, dey. ‘A security key thar is 56 bit long can be discovered ‘canly, A key of 192 bit can consume lots of power processing and is act desirable for RTA. The complexity of the algorithm can impact the ‘encryption and decrypsion delay TERS SESE STI video, and s{sfols}ols[s}o]4]2/a}s| o[ sora ols [2fs}o1ols 121413 /ol 4121s] oT oI 3]0]5]9]5]9]3] 0] 3] 2} >] 8] 311319 &|8|s}o} 0] 6|81¢| 0] 2/e}3| 6|o/ ol ¢| sffs[4[5[@1s[o/s} 2] tats stolore| Table 1 Random generator table m the sender and the receiver sides “American Journal of Computer Seience x (x) xx-x8, 2008 ISSN 1546-9239 {©2005 Science Publications 2. The sender Chooses a large random number (128 Digi) fom 1 to 15, The random geucrator table is then acheived This table gives indexes. The (128) digits are encrypted in any typical encryption protocol and mixed with some informition and data ‘Then the randomized generator table ie cent to the receiver. This untial packet i the compection request. 3. Affer the eceiver gets the request for connection, ‘he satal random number and the dara are removed rom the packet. Then the receimer decrypts this packet and use this aumber to get the random ‘zenerator table which wil give the same indexes as in Ihe receiver side ‘Affer the comection is established, we start with the real time data (VOIP). The algontim works as fellows atthe sender side 1 ‘Choose a random number of 1024 ‘bit ong which wl be the key. Encrypt data_using the XOR ‘operation with the key ( Key SOR Atthe receiver side 1. Split the key fom the data, which

    You might also like