Volume-1 , Issue-2 , Jun 2013, ISSN 2321-3256 (Electronic Version) Go Back

• Open Access   Article

  Performance Comparison of Latency for RSC-RSC and RS-RSC Concatenated Codes

  Manish Kumar and Jyoti Saxena

  Research Paper | Journal (IJSRNSC)

  Vol.1 , Issue.2 , pp.1-4, Jun-2013

  Abstract

  Full-Text HTML

  References

  Citation

  Abstract
  In practical communication systems, a low error probability and a high transmission rate are not the only important factors. Another very important parameter is the latency. In this paper, an attempt has been made to enhance the latency performance of serially concatenated convolutional codes. In particular, we compare RSC-RSC concatenated codes using non-iterative concatenated Viterbi decoding to RS-RSC concatenated codes using concatenation of Viterbi & Berklelamp-Massey decoding. Overall code rate i.e. transmission rate of concatenated code system is varied through puncturing & its effect on the latency of concatenated systems is simulated. On the basis of simulations, it is shown that RSC-RSC code is better than RS-RSC codes for in terms of latency. It is also shown that for concatenated codes a trade-off is needed to be considered between BER & latency in digital communications.

  Key-Words / Index Term
  SCCC; Turbo Codes; Reed-Solomon Code; RSC Codes; Viterbi Decoding; Latency

  References
  [1] G Shannon, “A Mathematical Theory of Communication”, Bell Technical System 27, 379-423, 1948
  [2] G. D. Forney, “Concatenated Codes. Cambridge”, M.I.T. Press, 1966
  [3] J. Hagenauer and P. Hoeher, “Concatenated Viterbi Decoding”Proceedings of the International Workshop on Information Theory, 1989
  [4] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon Limit Error-Correcting Coding and Decoding, Turbo-Codes”, Proceedings of ICC'93, Geneva, Switzerland, May 1993
  [5] S. Benedetto and G. Montorsi, “Serial concatenation of block and convolutional codes”, Electron. Lett. vol. 32, pp. 887-888, May 1996.
  [6] S. Benedetto and G. Montorsi, “Iterative decoding of serially concatenated convolutional codes” Electronics Letters, vol. 32, pp. 1186 – 1188, June 1996.
  [7] P.Elias, “Coding for Noisy Channels”, IRE Conv. Rec.: 37-46, (1955).
  [8] I. S. Reed and G. Solomon, “Polynomial codes over certain finite fields”, J. Soc. Industrial Appl. Math, vol. 8, pp. 300-304, (1960)
  [9] Byun, Sunghan, Dong Joon, and Jung Sun,” Performance comparison of RS-CC concatenated codes using NSC and RSC codes”, Network Infrastructure and Digital Content, 2nd IEEE International Conference, Beijing, 24-26 Sept. 2010
  [10] E. Boutillon, C. Douillard, and G. Montorsi, “Iterative Decoding of concatenated codes Implementation issues”, draft, January 29, 2007.
  [11] K. Manish., and S. Jyoti, “Performance Comparison of RSC-RSC Concatenated code and RS-RSC Concatenated code using Non- iterative Concatenated Viterbi Decoding Technique”, Manuscript submitted for publication, IEEE proceedings of ICMIRA’, Dec 2013
  [12] Shin-Lin Shiehat., et. al, “A Low-Latency Decoder for Punctured/ Shortened Reed-Solomon Codes" IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications, pp 2547-2551, 2005
  [13] M. Kaiser et al., “A Comparison of Decoding Latency for Block and Convolutional CodesUniversity Science, 1989.
  

  Citation
  Manish Kumar and Jyoti Saxena, "Performance Comparison of Latency for RSC-RSC and RS-RSC Concatenated Codes," International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.2, pp.1-4, 2013

• Open Access   Article

  Modelling and simulation of DDOS Attack using SimEvents

  Abubakar Bala and Yahya Osais

  Research Paper | Journal (IJSRNSC)

  Vol.1 , Issue.2 , pp.5-14, Jun-2013

  Abstract

  Full-Text HTML

  References

  Citation

  Abstract
  At the beginning of the 21st century, a new form of denial of service (DoS) attack emerged which is the Distributed DoS (DDoS). This new form of attack was launched on huge number of prominent websites such as yahoo, e-bay, Amazon, and buy.com, resulting in tremendous financial loses. DDoS attack has continued to increase over the years due to the rapid increase in internet users. Moreover, even more alarming is the fact that developers of DDoS tools have assumed unprecedented sophistication in their design methods, thus making their attacks highly destructive and undetectable. As a result of these reason and many others, researchers have focused their attention on the study of this new method of attack, they are particularly interested in studying its evolution, and with this knowledge they are being able to design anti-DDoS tools in order to prevent networks from falling into the clutches of DDoS attack. In this research work, a DDoS attack is simulated using MATLAB’s SimEvents, with the aim of finding the quantitative measure of its effect on the victim, experiments conducted in this study show that the server is scarcely utilized in its normal working condi-tions thus having high availability and low average utilization since it accepts requests only from legitimate clients. However, as the attacker launches an attack on the server, its utilization increases sharply and thus resulting in decrease in availability, this is because the server is flooded with illegal requests from the attacker as well as zombies from within the network domain. Additional study reveals that when a warm-up phase is added to the simulation of the server failure, the utilization suddenly increases due to the fact that the attacker seizes the opportunity of the slow recovery of the server to further overwhelm it and eventually push it into saturation.

  Key-Words / Index Term
  Modelling, simulation, DDoS, DoS, SimEvents, MATLAB

  References
  [1] A. Noureldien, “Protecting web servers from dos/ddos flooding attacks. a technical overview,” in International Conference on Web-Management for International Organisations. Proceedings. Geneva, 2002.
  [2] I. Kotenko and A. Ulanov, “Simulation of internet ddos attacks and defense,” in Information Security, pp. 327–342, Springer, 2006.
  [3] I. Kotenko, A. Alexeev, and E. Man’kov, “Formal framework for model-ing and simulation of ddos attacks based on teamwork of hackers-agents,” in Intelligent Agent Technology, 2003. IAT 2003. IEEE/WIC International Conference on, pp. 507–510, IEEE, 2003.
  [4] L. Li and G. Lee, “Ddos attack detection and wavelets,” Telecommunica-tion Systems, vol. 28, no. 3-4, pp. 435–451, 2005.
  [5] J. Ryan, M.-J. Lin, and R. Miikkulainen, “Intrusion detection with neural networks,” in Advances in neural information processing systems, pp. 943–949, MORGAN KAUFMANN PUBLISHERS, 1998.
  [6] G. Khazan and M. A. Azgomi, “A distributed attack simulation for quan-titative security evaluation using SimEvents,” in Computer Systems and Applications, 2009. AICCSA 2009. IEEE/ACS International Conference on, pp. 382–385, IEEE, 2009.
  [7] Mathworks,“Simevents,http://www.mathworks.com/help/simevents/release-notes.html.”

  Citation
  Abubakar Bala and Yahya Osais, "Modelling and simulation of DDOS Attack using SimEvents," International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.2, pp.5-14, 2013

• Open Access   Article

  Cryptography Automata Based Key Generation

  Harsh Bhasin and Neha Kathuria

  Research Paper | Journal (IJSRNSC)

  Vol.1 , Issue.2 , pp.15-17, Jun-2013

  Abstract

  Full-Text HTML

  References

  Citation

  Abstract
  Cellular Automata is one of the most fascinating disciplines. It is being used in many practical applications but it’s used in cryptography is still not being explored¬¬¬¬¬¬¬¬¬¬¬¬¬¬¬¬. A technique of generating key for public key cryptography has been proposed in the work. The work also applies different tests to the data generated by the application developed to generate cryptography key. It is found that the key is generated follows the gap test and frequency test .Moreover, the coefficient of autocorrelation of the data generated is also apt. Therefore, the method can be safely used in public key cryptography. The strength of the key generated is being tested against AES.

  Key-Words / Index Term
  Cryptography, Key Generation, Cellular Automata, Gap Test, Frequency Test

  References
  [1] Harsh Bhasin, Ramesh Kumar, Neha Kathuria, ‘Cryptography using Cellular Automata’, International Journal of Computer Science and Information technologies, Vol. 4 (2), 2013.
  [2] Umesh Kumar Singh, Shivlal Mewada, Lokesh Laddhani and Kamal Bunkar, “An Overview & Study of Security Issues in Mobile Ado Networks”, International Journal of Computer Science and Information Security (IJCSIS) USA, Vol-9, No.4, pp (106-111), April 2011.
  [3] Harsh Bhasin, “Corpuscular Random Number Generator”, International Journal of Information and Electronics Engineering, Vol. 2 (2), 2012.
  [4] Harsh Bhasin, Nakul Arora, “ Cryptography Using Genetic Algorithm”, Reliability Infocom Technology and Optimization,2010
  
  
  
  [5] Barbara Kitchenham, O. Pearl Brereton, David Budgen, Mark Turner, John Bailey, Stephen Linkman, “Systematic literature reviews in software engineering – A systematic literature review”, Journal Information software technologies”, Vol. 51 (1), 2009.
  [6] Harsh Bhasin, “Use of Cellular Automata Patterns in Cryptography” in National Conference on Advances in Computational Intelligence, 2011.
  
  [7] Sonia Goyat, “Cryptography using Genetic Algorithm”, IOSR Journal of Computer Engineering, Vol. 1 (5), 2012.
  [8] Benjamin Jun, Paul Kocher, "The Intel Random Number Generator”, Cryptography Research, Inc. White Paper Prepared For Intel Corporation, 1999.
  [9] K. J. Jegadish Kumar, K. Chenna Kesava Reddy, S. Salivahanan, “Novel and Efficient Cellular Automata based Symmetric Key Encryption Algorithm for Wireless Sensor Networks”, International Journal of Computer Applications Vol. 13 (4), 2011.
  [10] Sonia Goyat, “Genetic Key Generation For Public Key Cryptography”, International Journal of Soft Computing and Engineering (IJSCE), Vol. 2 (3), 2012.
  [11] Uttam Kr. Mondal, Satyendra Nath Mandal, J. Pal Choudhury, J. K. Mandal , “Frame Based Symmetric Key Cryptography”, International Journal Advanced Networking and Applications 762 Vol. 2 (4), 2011.
  [12] Farhat Ullah Khan, Surbhi Bhatia, “A Novel Approach To Genetic Algorithm Based Cryptography”, International Journal of Research in Computer Science, Vol. 2 (3), 2012. Introduction
  

  Citation
  Harsh Bhasin and Neha Kathuria, "Cryptography Automata Based Key Generation," International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.2, pp.15-17, 2013

• Open Access   Article

  Review: Software Defined Networking and OpenFlow

  Mandar B. Shinde, Sunil G. Tamhankar

  Review Paper | Journal (IJSRNSC)

  Vol.1 , Issue.2 , pp.18-20, Jun-2013

  Abstract

  Full-Text HTML

  References

  Citation

  Abstract
  This review paper explains Software Defined Networking (SDN), wherein control and forwarding planes are detached, shifting all the network intelligence to a server (SDN controller) to make a logically centralized network infrastructure. Open Flow protocol is the communication interface between control and forwarding plane. It allows researchers to experiment their abstractions in heterogeneous environment in a uniform way at line-rate and with high port-density; while on the other hand, manufacturers need not reveal the interior design and operations of their switches. Open Networking Foundation (ONF) community is encouraging different vendors to introduce OpenFlow in their products and elevate networking related innovations in world-wide college campuses.

  Key-Words / Index Term
  Software defined networking, OpenFlow, Virtualization

  References
  Open Networking Foundation, “Software-Defined Networking: The New Norm for Networks,” ONF White Paper, April 12, 2012.
  [2] Vaughan-Nichols S. J., “OpenFlow: The Next Generation of the Network?”, IEEE Computer Society, Vol. 44 (8), 13-15 (2011).
  [3] McKeown N., Anderson T., Balakrishnan H., Parulkar G., Peterson L., Rexford J., Shenker S., and Turner J., “OpenFlow: Enabling Innovation in Campus Networks,” ACM SIGCOMM Computer Communication Review , Vol. 38(2), 69–74 (2008).
  [4] (2012). Pitt D. Introduction to OpenFlow and Software-Defined Networking. [Online]. Available: https://www.youtube.com/watch? v=5-pLO4MZU3o
  [5] Limoncelli T. A., “OpenFlow: A Radical New Idea in Networking”, Communications of the ACM, Vol. 55(8), 42-47 (2012).
  [6] (2012). Hoelzle U. Keynote speech at the Open Networking Summit. [Online]. Available: http://www.youtube.com/ watch?v=VLHJUfgxEO4.
  

  Citation
  Mandar B. Shinde, Sunil G. Tamhankar, "Review: Software Defined Networking and OpenFlow," International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.2, pp.18-20, 2013

• Open Access   Article

  Modified Pairwise Key Pre-distribution Scheme with Deployment Knowledge in Wireless Sensor Network

  Sanchita Gupta and Pooja Saini

  Research Paper | Journal (IJSRNSC)

  Vol.1 , Issue.2 , pp.21-23, Jun-2013

  Abstract

  Full-Text HTML

  References

  Citation

  Abstract
  To achieve security in wireless sensor networks it is important to be able to encrypt the messages sent among the sensor nodes. Keys for encryption and authentication purpose must be agreed upon by communicating nodes. Due to the resource constraint (limited memory size), achieving such key agreement in wireless sensor network is extremely difficult. Many key agreement schemes used in general networks, such as Diffie-Hellman and public key based schemes, are not suitable for wireless sensor networks. Pre-distribution of secret key for all the pair of nodes is not possible due to the large amount of memory is used when network size is large. In this paper, we provide a view of pairwise key pre-distribution scheme and the deployment knowledge; and also describe the pairwise key pre-distribution scheme with deployment knowledge as an improvement. Deployment knowledge avoids the unnecessary key assignments and improves the performance of the sensor networks in terms of memory usage.

  Key-Words / Index Term
  Wireless sensor networks, Pairwise key pre-distribution scheme, Deployment knowledge and security

  References
  [1] N. Sugathi et al. “Secure key management for dynamic sensor networks”, International journal of wireless communications and networking, vol. 3, no. 1, 2011, pp. 83-88.
  [2] W. Du, J. Deng, Y. S. Han, S. Chen, and P. K. Varshney, “A key management scheme for wireless sensor networks using deployment knowledge”, in Proceedings of IEEE INFOCOM 2004, pages 586-597, 2004.
  [3] Wenliang Du et al. “A pairwise key pre-distribution scheme for wireless sensor networks”, ACM transactions, October, 2003.
  [4] H. Chan, A. Perrig, and D. Song., “Random key pre-distribution schemes for sensor networks”, in IEEE Symposium on Security and Privacy, Pages 197-213, Berkeley, California, May 11-14 2003.
  [5] D. Liu and P. Ning, “Establishing pairwise keys in distributed sensor networks”, in Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS), Washington, DC, USA, October 27-31 2003, pp. 52–61.
  [6] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. “A survey on sensor networks”, IEEE Communications Magazine, 40(8):102–114, August 2002.
  [7] L. Eschenauer and V. D. Gligor, “A key-management scheme for distributed sensor networks”, in Proceedings of the 9th ACM conference on Computer and communications security, November 2002.
  [8] R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, Cambridge, 1996.
  [9] B. C. Neuman and T. Tso, “Kerberos: An authentication service for computer networks”, IEEE Communications, vol. 32, no. 9, pp.33-38, September 1994.
  [10] W. Diffie and M. E. Helllman, “New directions in cryptography”, IEEE Transactions on Information Theory, vol. 22, pp. 644-654, November 1976.
  

  Citation
  Sanchita Gupta and Pooja Saini, "Modified Pairwise Key Pre-distribution Scheme with Deployment Knowledge in Wireless Sensor Network," International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.2, pp.21-23, 2013

• Open Access   Article

  Microstrip Antenna Using Dummy EBG

  Arpit Nagar, Aditya Singh Mandloi and Khem Singh Solanki

  Research Paper | Journal (IJSRNSC)

  Vol.1 , Issue.2 , pp.24-28, Jun-2013

  Abstract

  Full-Text HTML

  References

  Citation

  Abstract
  Micro strip patch antennas have been studied extensively over the past two decades because of its low profile structure, light weight and low cost. they have many advantages over conventional antennas, which make them suitable for a wide variety of applications. however, major drawback for this type of antennas low efficiency , narrow bandwidth and surface wave losses. to improve surface wave losses uses electro magnetic band gap structures & for bandwidth improvement we use dummy EBG patern on feed line.

  Key-Words / Index Term
  Dual Patch Antenna, Dummy EBG, Improve Bandwidth

  References
  [1]. Berenger, J.P., 1996. Three-dimensional perfectly matched layer for the absorption of electromagnetic waves. J. Com. [doi:10.1006/jcph.1996.0181]
  [2]. Brown, E., Parker, C., Yablonovitch, E., 1993. Radiation properties of a planar antenna on a photonic-crystal substrate. J. Opt. Soc. Am. B, 10:404-407.
  [3]. Enoch, S., Tayeb, G., Sabouroux, P., Guerin, N., Vincent, P., 2002. A metamaterial for directive emission. Phys. Rev
  [4]. George Mathai and J.P. Shinde, “ Design of Compact Multiband and EBG and Effect on Antenna Performance” International Journal of Recent Trends in Engineering, Vol 2, No. 5, November 2009.
  [5]. Vivekananda Lanka Subrahmanya , Pattern Analysis of “The Rectangular Microstrip Patch Antenna” Master thesis-2009.
  [6]. Seo, J. and J. Woo, \Miniaturization of microstrip antenna using iries," Electronics Letters, Vol. 40, 718{719, 2004.
  [7]. Waterhouse, R., \Small microstrip patch antenna," Electronics Letters, Vol. 31, 604{605, 1995.
  [8]. Slavova, A., A. Abdel Rahman, and A. S. Omar, \Broadband bandwidth enhancement of an Aperture coupled microstrip patch antenna," Digest of 2004 IEEE AP-S International Symposium on Antennas and Propagation, Vol. 4, 3737{3740, Jun. 2004.
  [9]. Balanis, C. A., Antenna Theory: Analysis and Design, John Wiley & Sons, Inc., 1997.
  [10]. Moradi, K. and S. Nikmehr, \A dual-band dual-polarized microstrip array antenna for base stations,"
  [11]. Monavar, F. M. and N. Komjani, \Bandwidth enhancement of microstrip patch antenna using jerusalem cross-shaped frequency selective surfaces by invasive weed optimization approach," Progress In Electromagnetics Research, Vol. 121, 103{120, 2011
  [12]. Pendry, J.B., 2000. Negative refraction makes a perfect lens. Phys. Rev. Lett., 85(18):3966-3969. [doi:10.1103/Phys- RevLett.85.3966]
  [13]. Thèvenot, M., Cheype, C., Reineix, A., Jecko, B., 1999. Directive photonic-bandgap antennas. IEEE Trans. on Microwave Theory and Techniques, 47(11):2115-2122. [doi:10.1109/22.798007] Veselago, V.G., 1968. The electrodynamics of substances wity.
  [14]. Chair, R., K.M., Luk, and K.F., Lee, 2000. “Miniature multilayer shorted patch antenna”, Electronic Letters 36, pp. 3-4.
  [15]. Arpit Nagar and Khem Singh Solanki, “Design & Analysis of Micro Strip Patch Antenna”, ISROSET-IJSRNSC, Vol-1, Issue-1, pp(1-5), Feb-March 2013.
  

  Citation
  Arpit Nagar, Aditya Singh Mandloi and Khem Singh Solanki, "Microstrip Antenna Using Dummy EBG," International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.2, pp.24-28, 2013

• Open Access   Article

  Reconfigurable Hardware Implementation of Adaptive LMS algorithm for Noise Cancellation on Real-time Audio signals

  Mulla Syed Musabbin Ahmed and Shalini

  Technical Paper | Journal (IJSRNSC)

  Vol.1 , Issue.2 , pp.29-30, Jun-2013

  Abstract

  Full-Text HTML

  References

  Citation

  Abstract
  The voice signal is first processed in MATLAB and the spectrogram is obtained for the same. Gaussian noise is deliberately added to the signal and the two text files 'with noise' and 'without noise' files are obtained. These two files are first modified to bring it in matrix form and used as the header files in design of adaptive LMS algorithm in embedded C on Xilinx Platform Studio and implemented on FPGA for processing and recovered text file is obtained. The recovered signal is plotted and played back on MATLAB and verified with the original signal and was found to be matching.

  Key-Words / Index Term
  Adaptive LMS, Noise Cancellation, Spectrogram

  References
  [1] Simon Haykin. "Adaptive Filters Theory" Pearson Education,2008.
  [2] A FPGA-based Adaptive Noise Cancelling System Wolfgang Fohl, Jorn Matthies and Bernd Schwarz. Proc. of the 12th Int. Conference on Digital Audio Effects (DAFx-09), Como, Italy, September 1-4, 2009
  [3] S. S. Godbole, P. M. Palsodkar and V.P. Raut, “FPGA Implementation of Adaptive LMS Filter” Proceedings of SPIT-IEEE Colloquium and International Conference, Mumbai, India
  [4] Raj Kumar Thenua et. Al, “Simulation and Performance analysis of Adaptive filter in noise cancellation”, IJEST Vol. 2(9), 2010, 4373-4378
  [5] Shailesh M. Sakhare, Prof. Swati S. Godbole, Dr. Sanjay B. Pokle, “Applications Of ADC In FPGA Implementation Of LMS Algorithm For Audio Applications”, IJETAE (ISSN 2250-2459, Volume 2, Issue 5, May 2012
  

  Citation
  Mulla Syed Musabbin Ahmed and Shalini, "Reconfigurable Hardware Implementation of Adaptive LMS algorithm for Noise Cancellation on Real-time Audio signals," International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.2, pp.29-30, 2013

• Open Access   Article

  Bluetooth and Ad Hoc Networking

  Poonam Ahuja

  Review Paper | Journal (IJSRNSC)

  Vol.1 , Issue.2 , pp.31-34, Jun-2013

  Abstract

  Full-Text HTML

  References

  Citation

  Abstract
  This paper is written to give introduction of the usage of the Bluetooth technology in ad hoc networking. Most common ad hoc networking applications for Bluetooth technology are introduced and current status of the Bluetooth technology suitability for ad hoc networks is examined. Also different protocols and functions, which are integral part of Bluetooth specification and used for ad hoc networking purposes, are discussed. Finally there are some recent studies shortly evaluated concerning Bluetooth scatternet formation and routing protocols performance.

  Key-Words / Index Term
  Bluetooth, LAN, TCP/IP, Protocol, MANET, Service Discovery Protocol

  References
  [1] Umesh Kumar Singh, Shivlal Mewada, Lokesh Laddhani and Kamal Bunkar, “An Overview & Study of Security Issues in Mobile Ado Networks”, International Journal of Computer Science and Information Security (IJCSIS) USA, Vol-9, No.4, pp (106-111), April 2011.
  [2] Shivlal Mewada and Umesh Kumar Singh, “Measurement Based Performance of Reactive and Proactive Routing Protocols in WMN”, Int. Journal of advanced research in Computer Science and Software Engineering, Vol. 1, No. 1, pp(1-4), Dec.-2011.
  [3] Jennifer Bray and Charles F. Sturman: Bluetooth: Connect without Cables, Prentice Hall, 2001, ISBN 0-13-089840-6
  [4] Bluetooth SIG: Core Specification of the Bluetooth System, version 1.1, 2001
  [5] Gergely V. Záruba, Stefano Basagni and Imrich Chlamtac: Bluetrees – Scatternet Formation to Enable Bluetooth-Based Ad Hoc Networks, IEEE, 2001, ISBN 0-7803-7097-1
  [6] Simon Duncan: Data on Bluetooth: A Guide to Its Deployment, Mobile Lifestreams Limited, 2001, ISBN 1929105452
  [7] Gy. Miklós, A. Rácz, Z. Turányi, A. Valkó, P. Johansson: Performance Aspects of Bluetooth
  [8] Scatternet Formation, IEEE, 2000, ISBN 0-7803- 6534-8
  [9] Ching Law, Amar K. Mehta and Kai-Yeung Siu Performance of a New Bluetooth Scatternet Formation Protocol, Massachusetts Institute of Technology, 2001
  [10] Bluetooth SIG: Profiles Specification of the Bluetooth System, version 1.1, 2001and Bluetooth SIG: Bluetooth Personal Area Networking Profile, version 0.95a, 2001
  

  Citation
  Poonam Ahuja, "Bluetooth and Ad Hoc Networking," International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.2, pp.31-34, 2013

• Open Access   Article

  Data Encryption and Decryption Using Modified RSA Cryptography Based on Multiple Public Keys and ‘n’prime Number

  V. Kapoor

  Research Paper | Journal (IJSRNSC)

  Vol.1 , Issue.2 , pp.35-38, Jun-2013

  Abstract

  Full-Text HTML

  References

  Citation

  Abstract
  Now a days, have a great dependence on computer and network and the security of computer related to the whole world and everybody. Cryptography is the art and science of achieving security by encoding message to make them non-readable [1] to secure data or information transmits over the network. In this paper introduced modified RSA approach based on multiple public keys and n prime number.RSA algorithm is mostly used in the popular implementation of public key cryptography. In public key cryptography two different keys are generated in RSA one keys is used in encryption data and other corresponding key used for decryption. No other key decrypt the data. Even if it is efficient algorithm it is vulnerable to other person. With the help of all brute force attacks can obtain private keys. In this research paper new approach we used n prime number and multiple public keys. Which is not easily crack able .In here implementation RSA algorithm .using some mathematical logic integer factorization and discrete logarithm problem.

  Key-Words / Index Term
  Cryptography, RSA algorithm, Triple DES, Asymmetric key Cryptography, ’n’ Prime Number

  References
  [1]. AAtul Kahate, Cryptography and Network Security, Tata McGraw-Hill Publication Company Limited page no. 32 2003.
  [2] Xiaowen Kang; Inst. of Electron. Technol., PLA Inf. Eng. Univ., Beijing; Yingjie Yang; Xin Du,” A Disaster-Oriented Strong Secure File System” Innovative Computing Information and Control, 2008. ICICIC '08. Pages 557.
  [3] Xin Zhou, Xiaofei Tang,”Reasearch and Implementation of RSA algorithm for Encryption and Decryption “IEEE 6th International Forum on strategic Technology pp 1118-1121, 2011.
  [4] Rajan.s.jamgekar, Geeta shantanu joshi “File Encryption and Decryption using secure RSA” International Journal of Emerging Science and Engineering (IJESE) ISSN: 2319–6378, Volume-1, Issue-4, February 2013.
  [5] P.Saveetha & S.Arumugam “Study on Improvement in RSA Algorithm and its Implementation” International Journal of Computer & Communication Technology ISSN (PRINT): 0975 - 7449, Volume-3, Issue-6, 7, 8, 2012
  [6] en.wikipedia.org/wiki/Euclidean algorithm
  [7] B.Persis Urbana Ivy, Purshotam Mandiwa. Mukesh Kumar “A modified RSA cryptosystem based on ‘n’ prime numbers” International Journal of Engineering and Computer Science ISSN: 2319-7242 Volume1 Issue 2 Nov 2012 Page No. 63-66
  [8] en.wikipedia.org/wiki/Random_number_generation
  [9] Avinash kak, Purdue University Lecture Notes on “Computer and Network Security”June 20, 2003
  [10] Milad Bahadori1, Mohammad Reza Mali, Omid Sarbishei, Mojtaba Atarodi, Mohammad Sharifkhani,”Novel Approach witch is the Secure and Fast Generation of RSA Public and Private Keys on Smart-Card”, 978-1-4244-6805-8/10/$26.00 2010 IEEE.
  [11] Maryam Ahmed, Baharan Sanjabi, Difo Aldiaz, Amirhossein Rezaei, Habeeb “Diffie-Hellman and Its Application in Security Protocols” International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 1, Issue 2, November 2012
  [12] P. Golle, J. Staddon, M. Gagne, and P. Rasmussen, “A Content-Driven Access Control System,” Proc. Symp. Identity and Trust on the Internet, pp. 26-35, 2008.
  [13] Rangarajan A. Vasudevan, Sugata Sanyal” Jigsaw-based Secure Data Transfer over Computer Networks” Information Technology: Coding and Computing,. Proceedings. ITCC 2004. International Conference on (Volume:1 ) 2004.
  [14] Wuling Ren, Zhiqian Miao, College of Computer and Information Engineering, Zhejiang Gongshang University, “A Hybrid Encryption Algorithm Based on DES and RSA” in Bluetooth Communication Second International Conference on Modeling, Simulation and Visualization Methods 2010.

  Citation
  V. Kapoor, "Data Encryption and Decryption Using Modified RSA Cryptography Based on Multiple Public Keys and ‘n’prime Number," International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.2, pp.35-38, 2013

• Open Access   Article

  A New Cryptography Algorithm with an Integrated Scheme to Improve Data Security

  V. Kapoor

  Research Paper | Journal (IJSRNSC)

  Vol.1 , Issue.2 , pp.39-46, Jun-2013

  Abstract

  Full-Text HTML

  References

  Citation

  Abstract
  Information is a valuable asset. As an asset information needs to be secured from cryptanalysis attacks. Security by encoding a message to make them non readable is the art and science of cryptography. Cryptographic algorithms are computationally rigorous function and guzzle a large amount of CPU time and space complication at the time of encryption. In this research paper we have proposed a reliable, an efficient and a more secure system by using our proposed algorithm for encryption and decryption. The Encryption key is long and consists of 128 bits. In cryptography, information should be confidential not only when it is stored in the computer, it should maintain its confidentiality when it is transmitted from one computer to another. For this purpose here we proposed an integrated cryptographic scheme. This scheme is based on a new cryptographic algorithm, message digest algorithm MD5 and RSA Algorithm. Proposed Encryption Algorithm is used to achieve confidentiality, whereas Message Digest Algorithm MD5 is used to verify the integrity of the message. RSA is adopted to encrypt the key of the encryption algorithm and to generate the digital signature. Four major security principles such as Authentication, Confidentiality, Integrity of Data and Non-Repudiation are achieved together using this scheme.

  Key-Words / Index Term
  Brute-force attack, Cryptography, Cryptographic algorithm, Encryption key, Information Security

  References
  [1] Bhatele, K. Sinhal, A.; Pathak, “A novel approach to the design of a new hybrid security protocol architecture” Advanced Communication Control and Computing Technologies (ICACCCT), 2012 IEEE International C0nference on page(s): 429-433 Print ISBN; 978-1-4673-2045-0
  [2] Atul Kahate, Cryptography and Network Security Second Edition.
  [3] Mehran Mozaffari-Kermani and Arash Reyhani-Masoleh, “Efficient and High Performace Parallel Hardware Architecture for the AES –GSM” IEEE Transaction On Computers, vol.61,no.8, August 2012.
  [4] Introduction of cryptography by H. Delfs and H. Knebl springer Verlag berlin Heidelberg 2007.
  [5] Henry Beker & Fresd piper, “Cipher System, the protection of communications”, A willey inter-science publication 1982.
  [6] El-Mageed, T., Hamdy, N., Amer, F., and Kerisha, Y.,”Cipher System and Cryptanalysis Techniques: An overview of the basic principles”. The Egyptian Computer Journal, ISSR, Cairo UNIV, VOL (28), No.1,2000.
  [7] Akanksha Mathur, “A Research paper: An ASCII value based datta encryption algorithm and its comparision with other symmetric data encryption algorithms”, International journal on Computer Science and Engineering (IJCSE). Vol. 4 No. 09. Pp. 1650-1657, September 2012.
  [8] http://en.wikipedia.org/wiki/Cryptographic_hash_function
  [9] Behrouz A. Forouzan: “Cryptography and Network security” McGraw Hill companies (special indian edition, Science, 2011)
  [10] http://www.webopedia.com/TERM/M/message_digest.html
  [11] Trishna Panse, V. Kapoor, “An Integrated Scheme based on Triple DES, RSA and MD5 to Enhance the Secutity in Bluetooth Communiation”, International Journal of Computer Applications, Vol. 50- No.7, July 2012
  [12] Zhao Yong-Xia, Zhen Ge, “MD5 Research” Multimedia and Information Technology (MMIT), Second International Conference on (Volume:2 ) 2010.
  [13] .Vishwa gupta,. Gajendra Singh, Ravindra Gupta, “Advance cryptography algorithm for improving data security”, International Journal of Advance Research in Computer Science and Software Engineering, Vol.2-Issue 1, January 2012
  [14] Neal Koblitz “A Course in Number Theory and Cryptography” Second Edition Published by Springer-Verlag.
  [15] B. Schneier, Applied Cryptography, John Wiley & Sons, New York, 1994.
  [16] Dorothy Elizabeth, “Cryptography and Data Security”, Addison-Wesley, 1982.
  [17] Donghua Xu, Chenghuai Lu, and Andre D. Santos, “Protecting Web Usage of Credit Cards Using One-Time Pad Cookie Encryption”, Proc. Annual Computer Security Applications Conference (ACSAC), 2002.
  [18] William Stallings “Cryptography and Network Security”, 3rd Edition, Prentice-Hall Inc., 2005.
  [19] Bruce Shnier “Applied Cryptography Second Edition Protocols. Algorithms, and Source, and Source Code in C”, John Wiley and Sons, Inc., 1996.
  [20] B. Schneier ,Applied Cryptography, John Wiley &Sons, New York, 1994.
  [21] Rivest, R.L., Robshaw, M.J.B., Sidney, R., & Yin, Y.L(2000). “The Case for RC6 as the AES.” AES Round 2 Public Comments. URL: http://csrc.nist.gov/CryptoToolkit/aes
  

  Citation
  V. Kapoor, "A New Cryptography Algorithm with an Integrated Scheme to Improve Data Security," International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.2, pp.39-46, 2013