Time filter

Source Type

Sharma C.,Chitkara UniversityHimachal Pradesh | Rinku,Chitkara UniversityHimachal Pradesh
2015 International Conference on Computing for Sustainable Global Development, INDIACom 2015 | Year: 2015

Turing machines are equivalent to modern electronic computers at a certain theoretical level, but differ in many details. In the analogy with a computer, the "tape" of the Turing machine is the computer memory, idealized to extend infinitely in each direction. The remarkable fact is that certain Turing machines are "universal", in the sense that with appropriate input, they can be made to perform any ordinary computation. Not every Turing machine has this property; many can only behave in very simple ways. In effect, they can only do specific computations; they cannot act as "general-purpose computers". Turing machine can process different types of strung written in various type language defined by Chomsky hierarchy. Machine will stop when it didn't have proper input ora machine state which is stable but not final and show halting state of machine. In this paper we are trying to describe using a example that a Turing machine can accept a language or string defined by context sensitive, context free or regular language till it find suitable input, but it show the halting state of the machine when it does not reach to a state closure to the final state along with the complexity of the process to process of that language or string. © 2015 IEEE. Source

Saxena S.,Chitkara UniversityHimachal Pradesh | Kapoor B.,Chitkara UniversityHimachal Pradesh
International Journal of Applied Engineering Research | Year: 2015

A Digital Signature is a mean of providing security, authenticity and integrity to the electronic information shared or transferred during the crucial applications running on Internet such as Banking, Trading, and Money Transactions in e-commerce, etc. Popularly two algorithms are used for generating the digital signatures for electronic documents – RSA and DSA. The Digital Signature algorithms are the combination of two important techniques – Signing and Verification of Signature. In the RSA Digital signature algorithm, the signature generation and signature verification is solely based on the modular exponentiation and modular reduction. The larger key sizes are taken in RSA Digital signature, typically 2048 bits, to ensure the security of the algorithm. Because of the involvement of larger key sizes the algorithm becomes compute-intensive and takes lot of time and energy to execute. Moreover in the era of mobile devices with limited power backup there has to be some technique that can increase the pace of Signing/Verification. One of the most popular techniques is Parallel Programming that can be used to redesign the existing digital signature algorithm at the same time maintaining its security intact. In this paper, we are proposing the redesigned Parallel RSA Digital Signature algorithm. The parallel algorithm is tested using OpenMP API on GCC infrastructure and results shows the speedup of approximately 5X as compared to its sequential counterpart. © Research India Publications. Source

Discover hidden collaborations