www.netcomp.monash.edu.au/links/ Abstract. Signcryption is a public key cryptographic primitive that fulfills the functions of digital signature and public key encryption concurrently, with a cost smaller than that required by the traditional signature followed by encryption method. The concept of signcryption, together with an implementation based on the discrete logarithm problem, was proposed in 1996. In this work, we demonstrate how to implement efficient signcryption using high order (power) residues modulo an RSA composite. This contributes to the research of extending computational underpinnings of signcryption schemes to problems related to integer factorization. In the course of achieving our goal, we also show efficient protocols for user identification, and fast and compact digital signature schemes
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.