FORM - 2 THE PATENTS ACT, 1970 (39 of 1970) & THE PATENTS RULES, 2006 COMPLETE SPECIFICATION (See section 10 and rule 13) A COMPUTER IMPLEMENTED SYSTEM AND METHOD FOR AUTHENTICATION OF A SECOND USER DEVICE BY A FIRST USER DEVICE. TATA CONSULTANCY SERVICES LTD, an Indian Company of Nirmal Building, 9th floor, Nariman Point, Mumbai 400 021, Maharashtra, India Inventor: NATARAJAN VIJAYARANGAN THE FOLLOWING SPECIFICATION PARTICULARLY DESCRIBES THE NATURE OF THE INVENTION AND THE MANNER IN WHICH IT IS TO BE PERFORMED. Definition of Terms used in this specification The terms 'first user device' and 'second user device' in this specification relate to mobile phones, cell phones, smart phones, personal digital assistants, laptop computers, desktop computers and palmtops. FIELD OF THE DISCLOSURE The present disclosure relates to the field of subideals. Particularly, this disclosure relates to the field of authenticating a user device using subideals. BACKGROUND A computer network is a collection of computers and other hardware components interconnected by communication channels. Communication channels allow sharing of resources and information. In a computer network, at least one process in one device is able to send/receive data to/from at least one process residing in a remote device. Further, computer networking is based on theoretical and practical applications of a plurality of fields including but not limited to mathematics, electrical engineering, electronics and telecommunications engineering, information technology and computer science and engineering. Further, a computer network can be classified based on a plurality of characteristics including: medium used to transport the data; communications protocol used; scale; topology and organizational or institutional requirements. Security in a computer network is the process of preventing and detecting unauthorized use of a computer. Security measures including prevention measures and detection measures help a user stop unauthorized users from accessing any part of his or her computer system and to determine whether or not someone attempted to break into a user's computer system. Further, network security in a computer network includes prevention and monitoring unauthorized access, misuse, modification, or denial of a computer network and network-accessible resources. Network security involves the authorization of access to data in a network, which is controlled by the network administrator. Still further, network security covers a variety of computer networks, both public and private, that are used in everyday work including businesses, government agencies and individuals. User authentication in a computer network includes the verification of the identity of a user logging onto a network. Passwords, digital certificates, smart cards and biometrics can be used to prove the identity of the user to the network. Cryptography is the practice and study of techniques for secure communication in the presence of third parties who are known as adversaries. Further, cryptography includes constructing and analyzing protocols that overcome the influence of adversaries and which are related to various aspects in information security such as data confidentiality, data integrity, and authentication. Still further, cryptography intersects the disciplines of mathematics, computer science, and electrical engineering. Modern cryptography includes encryption and decryption. In encryption, information in plain text is converted into unintelligible text. This unintelligible text is known as cipher text. In decryption, the cipher text is converted into plain text. A cryptographic key is the information that determines the functional output of a cryptographic algorithm. Without a key, the algorithm would produce no useful result. To make an algorithm produce a useful result, a cryptographic key is required. These cryptographic algorithms include digital signatures and message authentication codes. Cryptography can be broadly classified into public key cryptography and private key cryptography. Further, public key cryptography is a cryptographic system wherein two separate keys are required. One of the two keys is a secret key and the other is public. Still further, the kinds of public key cryptographic system include public key crypto systems, public key distribution systems, and digital signature systems. Additionally, Diffie-Hellman key exchange is the most widely used public key distribution system, and allows two users to securely agree on a shared secret. Major categories of public key cryptography include public key encryption and Digital signatures. In public key encryption also known as asymmetric key encryption, a message encrypted with a recipient's public key cannot be decrypted by anyone except a possessor of the matching private key. In digital signature, a message signed with a sender's private key can be verified by anyone who has access to the sender's public key, thereby proving that the sender had access to the private key. On the other hand, in a private key cryptography, same key is used for both the encryption and decryption of the message. Data Encryption Standard (DES), triple-DES (3DES), Advanced Encryption Standard [AES], Blowfish, Two fish RC2, RC34, RC5 and RC6 are the algorithms used in private key cryptography. A lot of work has been done in the field of network security and authentication. United States patent US7673141 provides a system secured acess to an application server using a challenge provider. In accordance with the United States patent US767314, the challenge provider uses a first cryptographic technique to provide a challenge to a client seeking access to an application service. The client uses a second cryptographic technique to generate a response, and provides the response to an authentication service. The authentication service grants the client access to the application service only if the challenge and response are authenticated using a first authentication technique complementary to the first cryptographic technique and a second authentication technique complementary to the second cryptographic technique, respectively. United States patent US7549044 provides a block-level storage device that implements a digital rights management (DRM) system. In accordance with the United States patent US7549044, in response to receiving a public key from an associated host system, the storage device challenges the host system to prove it has the corresponding private key to establish trust. This trust is established by encrypting a secure session key using the public key. The host system uses its private key to recover the secure session key. The storage device niay store content that has been encrypted according to a content key. In addition, the storage device may encrypt the content key using the secure session key. United States patent application No. US2009003597 provides small public-key based digital signatures for authentication. In accordance with the disclosure provided in the United States patent application No. US2009003597, authentication is allowed between two entities who have agreed on the use of a common modulus N. Further, the authentication includes generating a pseudorandom string value; generating a public key value based on the modulus N and the pseudorandom string value; generating a private key value corresponding to the public key value; receiving a verifier's public key value; generating a shared secret value based on the modulus N, the private key value and the verifier's public key value; calculating an authentication signature value using the shared secret value; and transmitting the authentication signature value for authentication. When an authentication signature is received, the public key value and the shared value are generated to calculate an authentication signature value. Thereafter, the authentication signature values are compared and authenticated. However, systems and methods provided in the aforementioned prior art documents are associated with many disadvantages. All the aforementioned prior art documents relate to public key cryptography. Further the algorithms used in public key encryption are complex when compared to the algorithms used in symmetric encryption. These complex algorithms make the system take longer time to encrypt and decrypt the messages. Still further, authenticity of the public key is not assured. Therefore there is felt a need for a system for authenticating a user in a computer network and which provides easy , yet secured access to a computer network; requires less memory space for storage of data; is not intrusive; is highly secure; and is cost effective. OBJECTS Some of the objects of the present disclosure aimed to ameliorate one or more problems of the prior art or to at least provide a useful alternative are described herein below: An object of the present disclosure is to provide a system that facilitates easy yet secured' access to a computer network. Another object of the present disclosure is to provide a system that requires less memory space for storage of data. Further object of the present disclosure is to provide a system that is not intrusive. Yet another object of the present disclosure is to provide a system that is highly secure. Another object of the present disclosure is to provide a system for authentication of a user in a computer network that is cost effective. Another object of the present disclosure is to provide a system that combines the principles of a lie triple system with Jacobi identity principles to arrive at an effective key negotiation protocol. Still another object of the present disclosure is to provide a system that enables authentication of an array of client devices/systems. Another object of the present disclosure is to provide a system that reduces computational complexities associated with matrix operations. Yet another object of the present disclosure is to provide a system that makes use of Jordan and lie algebras in an elliptic curve matrix power function, in order to perform key agreement for secure communication. Additional object of the present disclosure is to provide a system that enables negotiation of a common secret key through a secured communication channel. Other objects and advantages of the present disclosure will be more apparent from the following description when read in conjunction with the accompanying figures, which are not intended to limit the scope of the present disclosure. SUMMARY The present disclosure envisages a computer implemented system for authentication of a second user device by a first user device. The system comprises: • a selection module configured to select a vector space (G) of wavelet transformations over a field F; • a defining module configured to define a function gi(x)= g(x0) + D gi(xo), wherein D gi(x0) is a first derivative of the function g,(x); • a splitting module configured to split said first derivative D gi(x0) into gi(x) = g(x0)+A (xo) ▲x + B (xo) ▲x, wherein ▲ (x0) Ax is a first component and B (xo) ▲x is a second component, and wherein said first component is symmetric in nature and the second component is skew-symmetric in nature; • a defining module configured to define a sub ideal g(xo) in Jordan algebra and Lie algebra respectively, based on the equation g,(x) = g(x0)+A (xo) ▲x + B (x0) ▲x, wherein A=(l/2)(Dg(x0) + (Dg(xo)t) and B=(l/2)(Dg(x0) - (Dg(xo)1), and wherein gj(x) satisfies the properties of Lie algebra and Jordan algebra; • the first user device being accessible to a first user, said first user device configured to store at least one secret key (KJ and a unique sequence of subideals (Sj) derived from the function gi(x); • a second user device being accessible to a second user, said second user device configured to store said secret key (Ki) and said sequence of subideals (Si) derived from the function g,(x); wherein, said first user device is configured to verify the authenticity of the second user device using said secret keys (Kj) and said unique sequences of subideals (Si). In accordance with the present disclosure, the system includes a splitting module configured to split the equation gj(x) = g(x0)+A (xo) ▲x + B (x0) ▲x in such a way that the split components of the equation satisfy Lie algebra and Jordan algebra. In accordance with the present disclosure the first user device is a server device and includes a first communication support node and a first authentication module. In accordance with the present disclosure the first user device is a client device and includes a first communication support node and a first authentication module. In accordance with the present disclosure the second user device is a client device and includes a second communication support node and a second authentication module. In accordance with the present disclosure the first user device and second user device are connected to one another via a data communication network. In accordance with the present disclosure the second user device further includes: • the second authentication module configured to generate an authentication request for connecting to a server via the data communication network; • a combinatory module configured to combine said authentication request with at least a first subideal (Si); • the second communication support node configured to receive the combination of said authentication request and said first subideal (Si), said second communication support node further comprising: o a second verification module configured to verify said first subideal (S1), said verification module further configured to combine said authentication request and first subideal (S1i) with a second subideal (S2) selected from the unique sequence of sub ideals (Si), and transmit the combination of authentication request, first subideal (S1) and second subideal (S2) to said first user device . In accordance with the present disclosure the first user device further includes: • first authentication module configured to receive the combination of said authentication request, first subideal (Si) and second subideal (S2)from said second communication support node; • a generator module configured to generate a plurality of values including at least a 256 bit random number, a first signed response, an encryption key (Ki) and a subideal (S3); • a first transmitter configured to transmit said 256 bit random number, first signed response, encryption key (Ki) and subideal (S3) to the first communication support node communicably coupled to the second user device . In accordance with the present disclosure the second user device is further configured to receive said 256-bit random number from said first communication support node, said second user device further comprising; • a computing module configured to compute a second signed response by encrypting received 256 bit random number; • a second combinatory module configured to combine said second signed response with a fourth subideal (S4); • a second transmitter configured to transmit said second signed response and said fourth subideal back to said first authentication module of said first user device. In accordance with the present disclosure the first authentication module further comprises a first verification module configured to compare said first signed response with said second signed response, the first authentication module further configured to successfully authenticate the second user device only in the event that the first signed response is equivalent to the second signed response. In accordance with the present disclosure the vector space (G) is selected from the group of vector spaces consisting of infinite dimensional vector spaces and finite dimensional vector spaces. In accordance with the present disclosure the defining module is adapted to define the function gi(x) = g(xo) + D gj(x0) using Taylor's theorem. In accordance with the present disclosure the splitting module is adapted to split the first derivative D gi(x0) into gi(x) = g(xo)+A (x0) ▲x + B (X0) ▲X, wherein A=(l/2)(Dg(xo) + (Dg(xo)1) and B=(l/2)(Dg(xo) - (Dg(xo)t). In accordance with the present disclosure the computing module is configured to compute the signed response by encrypting the 256 bit random number using the secret key (Kj) stored in said computer enabled apparatus, as an encryption key . In accordance with the present disclosure the computing module is configured to encrypt the 256 bit random number using AES (Advanced Encryption Standard) algorithm. The present disclosure envisages a computer implemented method for authentication of a second user device by a first user device, using subideals. The computer implemented method includes the following computer implemented steps: • selecting a vector space (G) of wavelet transformations over a field F; • defining a function gj(x)= g(xo) + D gi(x0). wherein D is a first derivative of the function gj(x); • splitting said first derivative D gi(x0) into gi(x) = g(x0)+A (x0) ▲x + B (x0) ▲x, wherein ▲ (X0) AX is a first component and B (x0) ▲x is a second component, and wherein said first component is symmetric in nature and the second component is skew-symmetric in nature; • defining a sub ideal g(x) in Jordan algebra and Lie algebra respectively based on the equation g(x) = g(xo)+A (xo) ▲x + B (xo) ▲x, wherein A=(l/2)(Dg(xo) + (DgCxo)1) and B=(l/2)(Dg(x0)) - (Dg(xo)t) and wherein g(x) satisfies the properties of Lie algebra and Jordan algebra; • storing at least one unique secret key (K4) and a series of unique subideals (Sj) derived from said function gj(x), in a first user device ; • storing in a second user device , said secret key (Ki) and said sequence of unique subideals (Sj) derived from said function gi(x); • generating, at said second user device , an authentication request for connecting to a server via a data communication network; • combining, at said second user device, said authentication request with at least a first subideal (Si); • transmitting the combination of said authentication request and said first subideal (Si) to a communication support node communicably coupled to said first user device ; • at said communication support node, verifying said first subideal (Si), and combining said authentication request and first subideal (Si) with a second subideal (S2) selected from the unique sequence of subideals (Si); • generating, at said first user device , a plurality of values including at least a 256 bit random number, a signed response, an encryption key (Ki) and a subideal (S3); • receiving, at said second user device, at least said 256-bit random number; • computing, at said second user device, a second signed response by encrypting received 256 bit random number; • combining, at said second user device, said second signed response with a fourth subideal (S4) and transmitting the combination of said second signed response and the fourth sub ideal to said first user device ; and • comparing, at said first user device, said first signed response with said second signed response, and successfully authenticating said second user device only in the event that the first signed response is equivalent to the second signed response. In accordance with the present disclosure the step of defining a function gj(x) = g(x0) + D gi(x0) further includes the step of defining the function using Taylor's theorem. In accordance with the present disclosure the step of splitting said first derivative D gi(x0) further includes the step of splitting the first derivative D gi(x0) into gi(x) = g(xo)+A (xo) ▲x + B (x0) ▲x, wherein A=(l/2)(Dg(xo) + (Dg(x0)t) and B=(l/2)(Dg(x0)-(Dg(x0)t). In accordance with the present disclosure the step of transmitting the combination of said authentication request and said first subideal (S1) to a communication support node further includes the step of receiving said combination at said first user device . In accordance with the present disclosure the step of generating, at said first user device , a plurality of values including at least a 256 bit random number, a signed response, an encryption key (Kj) and a subideal (S3) further includes the step of transmitting at least said 256 bit random number to said second user device . In accordance with the present disclosure the step of computing, at said second user device, a second signed response by encrypting received 256 bit random number, further includes the step of encrypting the 256 bit random number using said secret-key (ki) as encryption key. In accordance with the present disclosure the step of computing, at said computer enabled apparatus, a second signed response by encrypting received 256 bit random number, further include the step of encrypting the 256 bit random number using AES (Advanced Encryption Standard) algorithm. BRIEF DESCRIPTION OF THE ACCOMPANYING DRAWINGS FIGURE-1 is a schematic representation of a system for a computer implemented system for authentication of a second user device by a first user device in accordance with the present disclosure; and FIGURE-2, 3 and 4 illustrate a flowchart for a computer implemented method for authentication of a second user device by a first user device in accordance with the present disclosure. DETAILED DESCRIPTION OF THE ACCOMPANYING DRAWINGS The computer implemented system for authentication of a second user by a first user will now be described with reference to the embodiments shown in the accompanying drawings which do not limit the scope and ambit of the present disclosure. The description of the disclosure relates purely to the exemplary, preferred embodiments of the present disclosure and its suggested applications. The figures and the description hereto are merely illustrative and only exemplify the computer implemented system and method for authentication of a second user by a first user and in no way limits the scope thereof. A computer network comprises at least one server and a plurality of client machines interconnected by a communication channel. The communication channel provides for sharing of resources and information between the server and clients. Network security in a computer network includes monitoring and prevention of unauthorized access and unauthorized modification of network-accessible resources. Various encryption and decryption systems and methods including algorithms are disclosed in the prior art for authentication of a user in a computer network. However, these authentication systems have certain disadvantages (explained in the background section) associated with them. Therefore, the present disclosure envisages an authentication mechanism with the aim of overcoming the drawbacks of the prior art. Definition of Subideals: Considering a Lie triple system (L), a subsystem A of L is termed to be a subideal of L if there exist subsystems A, of L such that L=A0 ) A1) A2 )An = A, where Ai is an ideal of Ai-1 and l