African Journal of Mathematics and Computer science Research, Dec 31, 2010
Proposed paper gives a secure key exchange scheme using block upper triangular matrices of higher... more Proposed paper gives a secure key exchange scheme using block upper triangular matrices of higher order. By using this method it is possible to generate keys of large orders without the need of large primes thereby avoiding the common ciphertext attacks. The element used for generating shared key is the element of (1, 3) block of the matrix which depends upon the elements of (1, 2) as well as on the (2, 3) blocks thereby increasing the hardness of the problem and providing greater security. Moreover our proposal is compared with the method proposed by Alvarez et al. (2009)
International Journal of Network Security, Jul 1, 2013
In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption cal... more In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption called chosen based computational Diffie Hellman (CCDH) and presented SPAKE-1 and SPAKE-2 simple password based authenticated key exchange protocols. Since then several three party password authenticated key agreement protocols have been proposed based on CCDH assumption but most of them broken. In this paper, we propose two password based simple three party key exchange protocols via twin Diffie-Hellman problem and show that the proposed protocols provide greater security and efficiency than the existing protocols. The protocols are also verified using Automated Validation of Internet Security Protocols and Applications (AVISPA) which is a push button tool for the automated validation of security protocols and the result shows that they do not have any security flaws.
Public Key Cryptosystems assure privacy as well as integrity of the transactions between two part... more Public Key Cryptosystems assure privacy as well as integrity of the transactions between two parties. The sizes of the keys play an important role. The larger the key the harder is to crack a block of encrypted data. We propose a new public key cryptosystem and a Key Exchange Protocol based on the generalization of discrete logarithm problem using Non-abelian group of block upper triangular matrices of higher order. The proposed cryptosystem is efficient in producing keys of large sizes without the need of large primes. The security of both the systems relies on the difficulty of discrete logarithms over finite fields.
International journal of computer and information technology, May 31, 2020
Achieving security is the most important goal for any digital signature scheme. The security of R... more Achieving security is the most important goal for any digital signature scheme. The security of RSA, the most widely used signature is based on the difficulty of factoring of large integers. The minimum key size required for RSA according to current technology is 1024 bits which can be increased with the advancement in technology. Representation of message in the form of matrix can reduce the key size and use of Tribonacci matrices can double the security of RSA. Recently M. Basu et.al introduced a new coding theory called Tribonacci coding theory based on Tribonacci numbers, that are the generalization of the Fibonacci numbers. In this paper we present a new and efficient digital signature scheme using Tribonacci matrices and factoring.
[email protected], 4th Sem., B.Ed., M J College Bhilai (C.G.) 490023, India1* manjusanghi13@gma... more [email protected], 4th Sem., B.Ed., M J College Bhilai (C.G.) 490023, India1* [email protected], Department of Applied Mathematics, Rungta College of Engineering & Technology, Bhilai (C. G.) 492006, India2 [email protected], Education Department M J College Bhilai (C.G.) 490023, India3 [email protected], Education Department M J College Bhilai (C.G.) 490023, India4 ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract The textbooks are crucial to learning in the traditional classroom-based setting, though their role in eLearning environment might be different. Through a categorical analysis this study investigates that if currently available learning resources provided by textbooks are suitable for e-learning purpose. An e-learning framework incorporating different stages of learning and adopting the usage of learning resources was first developed as a guide. Here, a sample ...
Abstract. The basic operation in elliptic curve cryptosystem is scalar multiplication. It is the ... more Abstract. The basic operation in elliptic curve cryptosystem is scalar multiplication. It is the computation of integer multiple of a given point on the curve. Computation of scalar multiple is faster by using signed binary representation as compared to binary representation. In this paper ‘Direct Recoding Method ’ a new modified algorithm for computation of signed binary representation is proposed. Our proposed method is efficient when compared to other standard methods such as NAF, MOF and complementary recoding method.
Simple Three Party Key Exchange Protocols via Twin Diffie-Hellman Problem
In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption cal... more In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption called chosen based computational Diffie Hellman (CCDH) and presented SPAKE-1 and SPAKE-2 simple password based authenticated key exchange protocols. Since then several three party password authenticated key agreement protocols have been proposed based on CCDH assumption but most of them broken. In this paper, we propose two password based simple three party key exchange protocols via twin Diffie-Hellman problem and show that the proposed protocols provide greater security and efficiency than the existing protocols. The protocols are also verified using Automated Validation of Internet Security Protocols and Applications (AVISPA) which is a push button tool for the automated validation of security protocols and the result shows that they do not have any security flaws.
RSA is the most widely used public key scheme for secure communication. Aboud et.al [1], proposed... more RSA is the most widely used public key scheme for secure communication. Aboud et.al [1], proposed an improved version of original RSA scheme. They generalized it so that it can be implemented in the general linear group on the ring of integers mod n. In the proposed scheme the original message and the encrypted message are h × h square matrices with entries in Z n as against the original RSA scheme which involves integer values. However, we identified a shortcoming of that scheme and proposed a new and efficient RSA public key encryption scheme. We also propose a digital signature scheme based on the new scheme.
Speeding up Computation of Scalar Multiplication in
Bhilai- 490024 (C.G.) India Abstract. The basic operation in elliptic curve cryptosystem is scala... more Bhilai- 490024 (C.G.) India Abstract. The basic operation in elliptic curve cryptosystem is scalar multiplication. It is the computation of integer multiple of a given point on the curve. Computation of scalar multiple is faster by using signed binary representation as compared to binary representation. In this paper 'Direct Recoding Method' a new modified algorithm for computation of signed binary representation is proposed. Our proposed method is efficient when compared to other standard methods such as NAF, MOF and complementary recoding method.
This paper proposes a method of batch process organization, a method of generation and transfer o... more This paper proposes a method of batch process organization, a method of generation and transfer of batch recipes using XML documents and XML schemas is introduced. The relationship between XML schema and S88 standard is analysed and synthesized. XML documents and XML schemas are designed based on structure-likely between XML and S88 process models. A complete batch process that applied for cooking area of beer factory is implemented in the result. The implemented architecture is used to create a toolbox for batch process organization.
Matrix Modification of RSA Digital Signature Scheme
Journal of Applied Security Research, 2019
Abstract Representation of message in the form of a matrix in place of integers can reduce the ke... more Abstract Representation of message in the form of a matrix in place of integers can reduce the key sizes along with the storage space without compromising the security. In this paper we propose modification of RSA digital signature scheme using square matrices of order h × h. Instead of relying on the Euler’s totient function it relies on the exponentiation modulus, which is obtained by the concept of the general linear group of order h.
International Journal of Information and Network Security (IJINS), 2012
Password based mechanism is widely used for authentication since it allows people to choose their... more Password based mechanism is widely used for authentication since it allows people to choose their own passwords without any device to generate or store them. However these protocols should resist all types of password guessing attacks due to the low entropy of passwords. Recently many three party password authenticated key exchange (3PAKE) protocols have been proposed but most of them are vulnerable to various attacks. The present paper proposes an improved G-3PAKE protocol which can resist all the known attacks along with its formal proof.
Bulletin of Electrical Engineering and Informatics, 2012
Key exchange protocols allow two or more parties communicating over a public network to establish... more Key exchange protocols allow two or more parties communicating over a public network to establish a common secret key called a session key. In 1976, Diffie and Hellman proposed the first practical key exchange (DH key exchange) protocol. In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption called chosen based computational Diffie Hellman (CCDH) and presented simple password based authenticated key exchange protocols. Since then several three party password authenticated key agreement protocols have been proposed In 2007, Lu and Cao proposed a simple 3 party authenticated key exchange (S-3PAKE) protocol. Kim and Koi found that this protocol cannot resist undetectable online password guessing attack and gave fixed STPKE’ protocol as a countermeasure using exclusive-or operation. Recently, Tallapally and Padmavathy found that STPKE’ is still vulnerable to undetectable online password guessing attack and gave a modified STPKE’ protocol. Unfortunately, we find that, although modified STPKE’ protocol can resist undetectable online password guessing attack but it is vulnerable to man in the middle attack. Also, we propose and analyze an efficient protocol against all the known attacks.
RSA cryptosystem is one of the most practical public key cryptosystems. The security of RSA is ba... more RSA cryptosystem is one of the most practical public key cryptosystems. The security of RSA is based on the difficulty of factorization of integer modulus which is the product of two large and distinct prime numbers, which is an intractable mathematical problem. The size of the modulus is atleast 1024 bits currently which needs to be increased with the development of factoring technology. However, with the increase in size their arises the problem of minimising the storage space and increasing the speed of transfer. In this paper, modification of RSA public key cryptosystem using square matrices of order h x h is proposed. Also, a variant of RSA using modulus of the form p r q is proposed along with its matrix modification.
Proposed paper gives a secure key exchange scheme using block upper triangular matrices of higher... more Proposed paper gives a secure key exchange scheme using block upper triangular matrices of higher order. By using this method it is possible to generate keys of large orders without the need of large primes thereby avoiding the common ciphertext attacks. The element used for generating shared key is the element of (1, 3) block of the matrix which depends upon the elements of (1, 2) as well as on the (2, 3) blocks thereby increasing the hardness of the problem and providing greater security. Moreover our proposal is compared with the method proposed by Alvarez et al. (2009)
Public Key Cryptosystems assure privacy as well as integrity of the transactions between two part... more Public Key Cryptosystems assure privacy as well as integrity of the transactions between two parties. The sizes of the keys play an important role. The larger the key the harder is to crack a block of encrypted data. We propose a new public key cryptosystem and a Key Exchange Protocol based on the generalization of discrete logarithm problem using Non-abelian group of block upper triangular matrices of higher order. The proposed cryptosystem is efficient in producing keys of large sizes without the need of large primes. The security of both the systems relies on the difficulty of discrete logarithms over finite fields.
In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption cal... more In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption called chosen based computational Diffie Hellman (CCDH) and presented SPAKE-1 and SPAKE-2 simple password based authenticated key exchange protocols. Since then several three party password authenticated key agreement protocols have been proposed based on CCDH assumption but most of them broken. In this paper, we propose two password based simple three party key exchange protocols via twin Diffie-Hellman problem and show that the proposed protocols provide greater security and efficiency than the existing protocols. The protocols are also verified using Automated Validation of Internet Security Protocols and Applications (AVISPA) which is a push button tool for the automated validation of security protocols and the result shows that they do not have any security flaws.
African Journal of Mathematics and Computer science Research, Dec 31, 2010
Proposed paper gives a secure key exchange scheme using block upper triangular matrices of higher... more Proposed paper gives a secure key exchange scheme using block upper triangular matrices of higher order. By using this method it is possible to generate keys of large orders without the need of large primes thereby avoiding the common ciphertext attacks. The element used for generating shared key is the element of (1, 3) block of the matrix which depends upon the elements of (1, 2) as well as on the (2, 3) blocks thereby increasing the hardness of the problem and providing greater security. Moreover our proposal is compared with the method proposed by Alvarez et al. (2009)
International Journal of Network Security, Jul 1, 2013
In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption cal... more In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption called chosen based computational Diffie Hellman (CCDH) and presented SPAKE-1 and SPAKE-2 simple password based authenticated key exchange protocols. Since then several three party password authenticated key agreement protocols have been proposed based on CCDH assumption but most of them broken. In this paper, we propose two password based simple three party key exchange protocols via twin Diffie-Hellman problem and show that the proposed protocols provide greater security and efficiency than the existing protocols. The protocols are also verified using Automated Validation of Internet Security Protocols and Applications (AVISPA) which is a push button tool for the automated validation of security protocols and the result shows that they do not have any security flaws.
Public Key Cryptosystems assure privacy as well as integrity of the transactions between two part... more Public Key Cryptosystems assure privacy as well as integrity of the transactions between two parties. The sizes of the keys play an important role. The larger the key the harder is to crack a block of encrypted data. We propose a new public key cryptosystem and a Key Exchange Protocol based on the generalization of discrete logarithm problem using Non-abelian group of block upper triangular matrices of higher order. The proposed cryptosystem is efficient in producing keys of large sizes without the need of large primes. The security of both the systems relies on the difficulty of discrete logarithms over finite fields.
International journal of computer and information technology, May 31, 2020
Achieving security is the most important goal for any digital signature scheme. The security of R... more Achieving security is the most important goal for any digital signature scheme. The security of RSA, the most widely used signature is based on the difficulty of factoring of large integers. The minimum key size required for RSA according to current technology is 1024 bits which can be increased with the advancement in technology. Representation of message in the form of matrix can reduce the key size and use of Tribonacci matrices can double the security of RSA. Recently M. Basu et.al introduced a new coding theory called Tribonacci coding theory based on Tribonacci numbers, that are the generalization of the Fibonacci numbers. In this paper we present a new and efficient digital signature scheme using Tribonacci matrices and factoring.
[email protected], 4th Sem., B.Ed., M J College Bhilai (C.G.) 490023, India1* manjusanghi13@gma... more [email protected], 4th Sem., B.Ed., M J College Bhilai (C.G.) 490023, India1* [email protected], Department of Applied Mathematics, Rungta College of Engineering & Technology, Bhilai (C. G.) 492006, India2 [email protected], Education Department M J College Bhilai (C.G.) 490023, India3 [email protected], Education Department M J College Bhilai (C.G.) 490023, India4 ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract The textbooks are crucial to learning in the traditional classroom-based setting, though their role in eLearning environment might be different. Through a categorical analysis this study investigates that if currently available learning resources provided by textbooks are suitable for e-learning purpose. An e-learning framework incorporating different stages of learning and adopting the usage of learning resources was first developed as a guide. Here, a sample ...
Abstract. The basic operation in elliptic curve cryptosystem is scalar multiplication. It is the ... more Abstract. The basic operation in elliptic curve cryptosystem is scalar multiplication. It is the computation of integer multiple of a given point on the curve. Computation of scalar multiple is faster by using signed binary representation as compared to binary representation. In this paper ‘Direct Recoding Method ’ a new modified algorithm for computation of signed binary representation is proposed. Our proposed method is efficient when compared to other standard methods such as NAF, MOF and complementary recoding method.
Simple Three Party Key Exchange Protocols via Twin Diffie-Hellman Problem
In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption cal... more In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption called chosen based computational Diffie Hellman (CCDH) and presented SPAKE-1 and SPAKE-2 simple password based authenticated key exchange protocols. Since then several three party password authenticated key agreement protocols have been proposed based on CCDH assumption but most of them broken. In this paper, we propose two password based simple three party key exchange protocols via twin Diffie-Hellman problem and show that the proposed protocols provide greater security and efficiency than the existing protocols. The protocols are also verified using Automated Validation of Internet Security Protocols and Applications (AVISPA) which is a push button tool for the automated validation of security protocols and the result shows that they do not have any security flaws.
RSA is the most widely used public key scheme for secure communication. Aboud et.al [1], proposed... more RSA is the most widely used public key scheme for secure communication. Aboud et.al [1], proposed an improved version of original RSA scheme. They generalized it so that it can be implemented in the general linear group on the ring of integers mod n. In the proposed scheme the original message and the encrypted message are h × h square matrices with entries in Z n as against the original RSA scheme which involves integer values. However, we identified a shortcoming of that scheme and proposed a new and efficient RSA public key encryption scheme. We also propose a digital signature scheme based on the new scheme.
Speeding up Computation of Scalar Multiplication in
Bhilai- 490024 (C.G.) India Abstract. The basic operation in elliptic curve cryptosystem is scala... more Bhilai- 490024 (C.G.) India Abstract. The basic operation in elliptic curve cryptosystem is scalar multiplication. It is the computation of integer multiple of a given point on the curve. Computation of scalar multiple is faster by using signed binary representation as compared to binary representation. In this paper 'Direct Recoding Method' a new modified algorithm for computation of signed binary representation is proposed. Our proposed method is efficient when compared to other standard methods such as NAF, MOF and complementary recoding method.
This paper proposes a method of batch process organization, a method of generation and transfer o... more This paper proposes a method of batch process organization, a method of generation and transfer of batch recipes using XML documents and XML schemas is introduced. The relationship between XML schema and S88 standard is analysed and synthesized. XML documents and XML schemas are designed based on structure-likely between XML and S88 process models. A complete batch process that applied for cooking area of beer factory is implemented in the result. The implemented architecture is used to create a toolbox for batch process organization.
Matrix Modification of RSA Digital Signature Scheme
Journal of Applied Security Research, 2019
Abstract Representation of message in the form of a matrix in place of integers can reduce the ke... more Abstract Representation of message in the form of a matrix in place of integers can reduce the key sizes along with the storage space without compromising the security. In this paper we propose modification of RSA digital signature scheme using square matrices of order h × h. Instead of relying on the Euler’s totient function it relies on the exponentiation modulus, which is obtained by the concept of the general linear group of order h.
International Journal of Information and Network Security (IJINS), 2012
Password based mechanism is widely used for authentication since it allows people to choose their... more Password based mechanism is widely used for authentication since it allows people to choose their own passwords without any device to generate or store them. However these protocols should resist all types of password guessing attacks due to the low entropy of passwords. Recently many three party password authenticated key exchange (3PAKE) protocols have been proposed but most of them are vulnerable to various attacks. The present paper proposes an improved G-3PAKE protocol which can resist all the known attacks along with its formal proof.
Bulletin of Electrical Engineering and Informatics, 2012
Key exchange protocols allow two or more parties communicating over a public network to establish... more Key exchange protocols allow two or more parties communicating over a public network to establish a common secret key called a session key. In 1976, Diffie and Hellman proposed the first practical key exchange (DH key exchange) protocol. In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption called chosen based computational Diffie Hellman (CCDH) and presented simple password based authenticated key exchange protocols. Since then several three party password authenticated key agreement protocols have been proposed In 2007, Lu and Cao proposed a simple 3 party authenticated key exchange (S-3PAKE) protocol. Kim and Koi found that this protocol cannot resist undetectable online password guessing attack and gave fixed STPKE’ protocol as a countermeasure using exclusive-or operation. Recently, Tallapally and Padmavathy found that STPKE’ is still vulnerable to undetectable online password guessing attack and gave a modified STPKE’ protocol. Unfortunately, we find that, although modified STPKE’ protocol can resist undetectable online password guessing attack but it is vulnerable to man in the middle attack. Also, we propose and analyze an efficient protocol against all the known attacks.
RSA cryptosystem is one of the most practical public key cryptosystems. The security of RSA is ba... more RSA cryptosystem is one of the most practical public key cryptosystems. The security of RSA is based on the difficulty of factorization of integer modulus which is the product of two large and distinct prime numbers, which is an intractable mathematical problem. The size of the modulus is atleast 1024 bits currently which needs to be increased with the development of factoring technology. However, with the increase in size their arises the problem of minimising the storage space and increasing the speed of transfer. In this paper, modification of RSA public key cryptosystem using square matrices of order h x h is proposed. Also, a variant of RSA using modulus of the form p r q is proposed along with its matrix modification.
Proposed paper gives a secure key exchange scheme using block upper triangular matrices of higher... more Proposed paper gives a secure key exchange scheme using block upper triangular matrices of higher order. By using this method it is possible to generate keys of large orders without the need of large primes thereby avoiding the common ciphertext attacks. The element used for generating shared key is the element of (1, 3) block of the matrix which depends upon the elements of (1, 2) as well as on the (2, 3) blocks thereby increasing the hardness of the problem and providing greater security. Moreover our proposal is compared with the method proposed by Alvarez et al. (2009)
Public Key Cryptosystems assure privacy as well as integrity of the transactions between two part... more Public Key Cryptosystems assure privacy as well as integrity of the transactions between two parties. The sizes of the keys play an important role. The larger the key the harder is to crack a block of encrypted data. We propose a new public key cryptosystem and a Key Exchange Protocol based on the generalization of discrete logarithm problem using Non-abelian group of block upper triangular matrices of higher order. The proposed cryptosystem is efficient in producing keys of large sizes without the need of large primes. The security of both the systems relies on the difficulty of discrete logarithms over finite fields.
In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption cal... more In 2005, Abdalla and Pointcheval suggested a new variation of the computational DH assumption called chosen based computational Diffie Hellman (CCDH) and presented SPAKE-1 and SPAKE-2 simple password based authenticated key exchange protocols. Since then several three party password authenticated key agreement protocols have been proposed based on CCDH assumption but most of them broken. In this paper, we propose two password based simple three party key exchange protocols via twin Diffie-Hellman problem and show that the proposed protocols provide greater security and efficiency than the existing protocols. The protocols are also verified using Automated Validation of Internet Security Protocols and Applications (AVISPA) which is a push button tool for the automated validation of security protocols and the result shows that they do not have any security flaws.
Uploads
Papers by Manju Sanghi