Securing transmission of information between legitimate transmitter and receiver sides is a great challenge for mathematicians, computer scientists and engineers in recent years. This paper aims at achieving three goals. The first of them is to introduce a novel fractional order two dimensional (2D) map having very complex chaotic behavior and distinct large positive values of Lyapunov exponents over wide range of parameters, compared with other 2D maps in literature. Secondly, a new reliable secure encryption scheme combining the associated chaotic pseudo-orbits of the proposed map with the advantages of elliptic curves in public key cryptography is suggested, for first time, and applied to colored images. The hybrid scheme is capable to confirm reliable secret keys exchange in addition to highly obscure and hide transmitted information messages. Finally, a thorough mathematical analysis of security performance and evaluation of encryption scheme immunity against all possible attacks are carried out and proved its efficiency and robustness. INDEX TERMS Chaos-based cryptography, chaotic maps, discrete fractional calculus, elliptic curves, pseudo-orbits.
In this paper, an efficient key management scheme based on public key elliptic curves signcryption (ECS) scheme for Wireless Sensor Networks (WSN) has been proposed. The proposed algorithm is compared with the scheme given in [1]. For 250 cluster node, the saving in the total number of operations, key storage requirements, energy consumptions, and communication overhead are 75%, 96%, 23.79 m Joule, and 40% respectively compared with [1]. The proposed protocol is efficient in terms of complexity, number of message exchange, computation, and storage requirements compared with [1]. The proposed key management possesses not only provided confidentiality, authentication, integrity but also unforgeability .
In this paper, a new efficient Public Key Multi-Messages Multi-Recipients Elliptic Curve Signcryption (PK-MM-MR-ECS) scheme for provable secure communications has been proposed. The main idea of the proposed PK-MM-MR-ECS scheme is to design multi-key generator to generate multi-secret keys used to encrypt the multiple message for each recipient. The MKG played an important role for the communication overhead and computational cost saving in the proposed PK-MM-MR-ECS scheme.The numerical values for saving in communication overhead using the proposed scheme are 38.24 % for two messages, two recipients and 67.97 % for three messages ,three recipients than does Zheng elliptic curve signcryption scheme with the same parameters. The proposed scheme costs 50 % and 75 % less in computation cost for two and four signcrypted messages over Zheng elliptic curve signcryption scheme respectively. ـــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ ــــــــــــــــــــــــــــــــــــــــــ recipients, the Zheng signcryption scheme will be used multiple times to signcrypts all messages to all recipients which cases large communication overhead and computational cost.Recently, Elkamchouchi et al introduced a new efficient public key multi-message signcryption schemes (PK-MMS) for secure multi-message single and multi-recipient [13][14][15]. The PK-MMS has an efficient computation time and communication overhead compared with Zheng signcryption scheme for single recipient. The main idea of the proposed PK-MM-MR-ECS scheme is to design multi-key generator to generate multi-secret keys used to encrypt the multiple message for each recipient. The saving in communication overhead using the proposed scheme are 38.24 % for two messages, two recipients and 67.97 % for three messages, three recipients than does Zheng multi-recipient signcryption scheme at the same parameters.The proposed scheme costs 50 % and 75 % less in computation cost for two and four signcrypted messages over Zheng multi-recipient signcryption scheme. The saving in communication overhead and computational cost is increased as the number of messages and recipients increases. This paper is organized as follows: section II discusses the proposed scheme. Comparison and security analysis of the proposed scheme is given in section III. Finally, a conclusion is given in section IV.
In this paper, a novel Commutative Watermarking and Partial Encryption (CWPE) algorithm based on Discrete Wavelet Transform and Discrete Cosine Transform (DWT-DCT) for watermarking and Multi-Map Wavelet Chaotic Encryption (MMW-CE) is proposed. The original host image is first decomposed into four sub-bands using (DWT), each sub-band coefficients are relocated using Arnold transform to create a noiselike version, then apply partial encryption scheme using chaotic scrambled random number pattern bitwise XOR with the scrambled horizontal coefficients only and the shuffled approximation coefficients are divided into non-overlapping and equal sized blocks. Watermark embedding process is based on extracting the (DCT) middle frequencies of the encrypted approximation coefficients blocks. Comparison based threshold of the extracted DCT mid-band coefficients, watermark bits are embedded in the coefficients
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.