Andere Kunden interessierten sich auch für
![K Banhatti and K hyper-Banhatti indices of nanotubes]( "K Banhatti and K hyper-Banhatti indices of nanotubes")
K Banhatti and K hyper-Banhatti indices of nanotubes36,99 €![Elliptic Curve Cryptography and Coding Theory]( "Elliptic Curve Cryptography and Coding Theory")
Elliptic Curve Cryptography and Coding Theory22,99 €![Some Vedic Mathematics Sutras for Elliptic Curve Cryptography]( "Some Vedic Mathematics Sutras for Elliptic Curve Cryptography")
Some Vedic Mathematics Sutras for Elliptic Curve Cryptography62,99 €![Rational Points on Elliptic Curves]( "Rational Points on Elliptic Curves")
Rational Points on Elliptic Curves37,99 €![Rational Points on Elliptic Curves]( "Rational Points on Elliptic Curves")
Rational Points on Elliptic Curves41,99 €![Toward Absolutely Stable Numerical Scheme]( "Toward Absolutely Stable Numerical Scheme")
Toward Absolutely Stable Numerical Scheme39,99 €![Elliptic Curve Cryptography-A Network Security]( "Elliptic Curve Cryptography-A Network Security")
Elliptic Curve Cryptography-A Network Security36,99 €
Our scheme decrease the computation time 33.33% on sender side and 50% on receiver side and also 92.69% efficient for communication cost than existing schemes. It also fulfills all the security properties. The proposed Blind signcryption scheme based on Hyper Elliptic curve for Untraceable Payment System is also fulfilling all the security requirements. The results show that our proposed scheme is efficient in computation cost upto 91.66% and in communication cost upto 87.79 %. Our schemes satisfy the security properties such as message confidentiality, message integrity, authentication, non-repudiation, unforge-ability, un-traceability, forward secrecy as well as sender anonymity. Our scheme is based on hyper elliptic curve discrete logarithm problem (HECDLP), which is computationally hard for attacker and also has low parameters.