Distributed signcryption scheme on hyperelliptic curve

Authors:
Indivar Gupta;N. R. Pillai;P. K. Saxena
Affiliations:
SAG, DRDO, Metcalfe House, Delhi, India;SAG, DRDO, Metcalfe House, Delhi, India;SAG, DRDO, Metcalfe House, Delhi, India
Venue:
CNIS '07 Proceedings of the Fourth IASTED International Conference on Communication, Network and Information Security
Year:
2007

Citing 6
Cited 2

Hyperelliptic cryptosystems

Journal of Cryptology
Algebraic aspects of cryptography

Algebraic aspects of cryptography
How to construct efficient signcryption schemes on elliptic curves

Information Processing Letters
Elliptic curves in cryptography

Elliptic curves in cryptography
Digital Signcryption or How to Achieve Cost(Signature & Encryption)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
An algorithm for solving the discrete log problem on hyperelliptic curves

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Distributed signcryption schemes with formal proof of security

InfoSecHiComNet'11 Proceedings of the First international conference on Security aspects in information technology
Distributed signcryption from pairings

ICISS'11 Proceedings of the 7th international conference on Information Systems Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cryptographic communication protocols frequently employ random numbers to achieve desirable properties. Often, generators for pseudo-random numbers (PRNGs) are employed. A class of PRNGs that currently gains popularity are chaotic PRNGs which are derived ...