作者: Chandrashekhar Meshram , Chun-Ta Li , Sarita Gajbhiye Meshram
DOI: 10.1007/S00500-018-3112-2
关键词: CHAOS (operating system) 、 Cryptography 、 Theoretical computer science 、 Computational complexity theory 、 Computational intelligence 、 Signature (logic) 、 Time complexity 、 Chaotic 、 Computer science
摘要: Chaos has been dealt with a decent approach to reduce computational complexity while fulfilling security necessities of 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 chosen message attack. Some the intriguing arrangements presented procedures gives multi-time use offline stockpiling, which permits signer reuse pre-administered information in polynomial time, rather than one-time all past procedures.