LAUSR

Chaos has been dealt with a decent approach to reduce computational complexity while fulfilling security necessities of a cryptographic techniques. In this article, we purpose an efficient online/offline ID-based short signature procedure based on extended chaotic maps and also demonstrated that it is protected under unforgeability of ID-based short signature under chosen message attack. Some of the intriguing arrangements of presented procedures is that it gives multi-time use of the offline stockpiling, which permits the signer to reuse the offline pre-administered information in polynomial time, rather than one-time use in all past online/offline signature procedures.