Search

For the asymmetric key, the Diffie Hellman Key (DHK) protocol is very efficient, but sometimes it is vulnerable against brute force attacks if the parameters are not chosen carefully. Our study aims to improve the asymmetric key scheme based on the elliptic curve cryptosystem (ECC). The sender and receiver agree on an elliptic curve based on the DHK sharing technique, but generator G is kept secret, and we generate its hash value, which is shared publicly. The authorized members can recover G using the hash value. By keeping G secret, the key protocol becomes much more robust than existing ones. Further, the proposed scheme will be applied to multiple RGB images. In this novel public key algorithm, 4D chaotic sequences are used for the diffusion of image pixels. The pixels’ values are used for permutations of images rather than the chaotic sequences, strengthening the scheme against chosen/known plain text attacks. The simulation and the security analysis of the proposed algorithm show efficiency, potential to endure the varied attacks, and prospects for real-world application.

Aiming at the security issues during the multi-types data storage and data transmission in autonomous Internet of Things (IoT) systems, this paper proposes an AI algorithm for data enhanced encryption used in the ends and the intermediate nodes of IoTs. The algorithm in this paper first constructs a three-dimensional Arnold transformation matrix for data unit value encryption in the end of IoTs, and designs a quantum logic intelligent mapping that effectively diffuses the encrypted data units to reduce the linear correlation of the image data and to improve the security performance of IoT edge data. Furthermore, the algorithm designs an AI access strategy for scrambling sequence nodes and builds a random-access route for the elements of the scrambling sequence which can reduce the calculation cost and improve the operating efficiency of IoT system in the ends and intermediate nodes. Finally, the data shared matrix is used to share the encrypted data to achieve the (k, n) threshold strategy. Experimental results prove that the algorithm has high plaintext and key sensitivity and can effectively resist brute force attacks, statistical analysis and differential attacks. The algorithm in this paper provides an AI solution for data security encryption in the ends and the intermediate nodes of autonomous IoT systems.

Cybersecurity incidents in ISP (Internet Service Provider) infrastructure have grown significantly and it is necessary to identify vulnerabilities that need immediate protection. In this environment, the firewall can filter data packets, analyzing the headers and deciding about the routing of the packet based on the established rules. This device is very essential in an ISP network because it mitigates the vulnerabilities coming from the network, maintaining a higher degree of computer security for your internal network, thus guaranteeing the availability, integrity, and confidentiality of the information. In the case study, a Mikrotik brand infrastructure was selected with a proprietary operating system called RouterOS, which will function as a core router, where the security rules will be applied to your firewall for each type of attack that will be generated against the router. , whether they are internal or external attacks on the network, avoiding causing serious security failures such as being the victim of a DoS (Denial of Service) attack, brute force attacks, etc. As a result, a 50% decrease in CPU consumption was obtained in each attack generated, thus achieving the proper functioning of the network infrastructure and guaranteeing stability and availability of the communications network.

Securing the exchange of digital images in the form of huge multimedia data over the internet with limited bandwidth emerges as a significant and sensitive issue. In this paper, a new scan pattern method for protecting color image data based on the 3D-Lorenzo chaotic map method is proposed. The scan pattern method is used for generating three different masks one for each channel of colored image. These masks considered the position of the shuffling pixels which is used as input parameters to the 3D-Lorenzo chaotic map for ciphering the image in a new technique. The experimental results demonstrate that the developed method has the benefit of quick and secure protection of brute force attacks. Hence, the performance analysis of color image encryption reveals a correlation coefficient of almost (CC

Healthcare and telemedicine industries are relying on technology that is connected to the Internet. Digital health data are more prone to cyber attacks because of the treasure trove of personal data they possess. This necessitates protection of digital medical images and their secure transmission. In this paper, an encryption technique based on DNA mutated with Lorenz and Lu chaotic attractors is employed to generate high pseudo-random key streams. The proposed chaos-DNA cryptic system operates on the integer wavelet transform (IWT) domain and a bio-inspired crossover, mutation unit for enhancing the confusion and diffusion phase in an approximation coefficient. Finally, an XOR operation is performed with a quantised chaotic set from the developed combined attractors. The algorithm attains an average entropy of 7.9973, near-zero correlation with an NPCR of 99.642%, a UACI of 33.438%, and a keyspace of 10203. Further, the experimental analyses and NIST statistical test suite have been designed such that the proposed medical image encryption technique has the potency to withstand any statistical, differential, and brute force attacks.

Image encryption converts the images into unrecognizable forms that seems like a white noise. Digital Chaos has also emerged as one of the important technique to design secure and efficient image encryption schemes. The chaos theory possesses various desirable properties required for the encrypting images like initial state sensitivity, unpredictability and behavioural complexity. However, image encryption schemes suffer from vulnerabilities like differential attack, statistical, known/chosen plaintext attack, and brute force attack. This paper proposes a novel approach to generate a pseudorandom key. This pseudo random key is combined with Logistic map (LM), cosine transformed Logistic map (CTLM) and cosine transformed Logistic-Sine Map (CTLSM), one by one, to implement three secure and efficient methods for satellite image encryption. The scheme uses the 384-bit of share key to perform encryption during the process. The proposed approaches are tested for parameters such as Entropy, Correlation Coefficient (CC), Number of Changing Pixel Rate (NPCR), Unified Averaged Changed Intensity (UACI), Avalanche effect, Bit Correct Ratio (BCR) and Peak Signal to Noise Ratio (PSNR). The work also analyses the various cryptanalytic attacks on the proposed chaos and novel Pseudo random key combinations. The results show that the proposed pseudo random key and CTLSM combination outperforms the other two combinations, and is more efficient in resisting all type of attacks as well.

Cloud service providers providing users with efficient and effective storage and transmission of data. To reduce storage costs and save bandwidth, cloud service providers are attracted to use data de-duplication feature. Cloud users are interested in using the cloud safely and privately to protect the data they share on the cloud. Therefore, they encrypt the data before uploading it to the cloud. Since the intent of encryption conflicts with the de-duplication function, the data de-duplication feature becomes a hard problem. Existing de-duplication methods are ineffective in terms of both security and efficiency. They are either vulnerable to brute force attacks that enable the attacker to retrieve files, or they are computationally expensive. That is what drives us to suggest a method for removing duplicate data that is both performance and security effective. We'll start with a description of the implementations and functionality of de-duplication strategies, then move on to the literature that proposes various approaches to de-duplication and the security and efficiency problems that existing approaches face. Via the use of the AES-CBC algorithm and hashing functions, we have proposed an enhancement to improves the performance and protection of data de-duplication for users. Without the involvement of a third party, users' keys are created in a consistent and safe manner. We prove the efficacy of the recommended solution by putting it into practice and comparison with the existing techniques.

Regional Tax Reporting Application Webserver is one of the public services for taxpayers to report their sales transactions. This application can be accessed on the domain http://sptpd.payakumbuhkota.go.id. This application is public, so the principles of information security must be applied to prevent cyber attacks. The principles of information security include confidentiality, integrity, and availability. To apply this information security principle, it is necessary to conduct vulnerability assesment of the application webserver. This study aims to improve the security of the application webserver so that the data and information in it is secure. The method used in this study is the Penetration Testing Execution Standard which is one of the methods developed by the Pentest Organization to become a standard in analyzing or auditing security systems. The results of vulnerability testing using software Acunetix, Nikto, BurpSuite and Owasp, there are seven types of vulnerabilities, namely: X-Frame Header Options is Missing, CSRF Attack, Cookie Without Only Flash, DNS Vulnerability, Ddos Attack, Bruteforce Page Login and Open Port. The vulnerability can be exploited, where the level of application vulnerability is in the medium category. The recommendations for fixing vulnerabilities can be applied by the developer, so that after repairs are made, the vulnerability level of the application webserver is in the low category and there is only one type of vulnerability, namely Brute Force Page Login.

Cryptography plays a significant role in ensuring data security and confidentiality. The security provided by a crypto system mainly depends on the secrecy of the cryptographic key. If the secret key gets compromised, then it may lead to compromise of the protected data. Biometric cryptosystem provides a solution for securing the cryptographic key by binding the secret key with user biometric data. In this paper, we have proposed a novel biometric crypto system involving key binding mechanism. New objective functions have been introduced to create helper data by binding the secret key with biometric data of the user. In the retrieval phase, local minima of the objective functions act as anchors to get the secret key. Performance evaluation shows that the proposed method achieves more than 98% success rate even in presence of limited noise in the biometric data. Further, performance metrics viz., FAR, GAR, GWDR and IWDR have been obtained for cryptographic key sizes of 256, 512, 1024 and 2048 bits. Security analysis shows that the proposed method is robust against brute force attack and correlation attack.

This paper presents a new image encryption algorithm based on 3D chaotic system and deoxyribonucleic acid (DNA) coding. It uses two keys, an external one of 128 bits long and an internal one of 64 gray values coming from the plain image. The initial conditions come from the two keys and vary from one line of the image to the other and from one image to the other and consequently the sequences of substitutions too. In general, in image encryption based on 3D chaotic systems, each chaotic variable is used independently of the others in one phase of the encryption. Here we use the zigzag process to combine the sequences from all the variables before using them simultaneously in the encryption process. DNA coding generally uses one of the 24 DNA rules and one of the 16 join operations to perform the encryption. Here we use all the 24 rules dynamically as well as the 16 join operations in the encryption. Also we apply the chaotic permutation on DNA chain. The logical DNA operations are used according to an algorithm similar to that of the Fast Walsh Transform (FWT) in those 24 DNA rules. The algorithm has been evaluated. It has good statistical properties of cipher images. The proposed system presents high sensitivity on the encryption-decryption keys and on the plain images. These latter features make the proposed algorithm very efficient, robust and resistant against brute force attacks and good for the future secure image communication.

Telepresence surgical training based on mixed reality over the Internet is exposed to various cyber-attacks. Providing an adequate level of security against such attacks becomes an essential requirement for implementing this technology. The aim of this work is to improve the security of data transmission against several potential attacks while reducing the required execution time for encryption and decryption during real-time surgical telepresence training. In this research, a cryptosystem based on an enhanced chaotic map with Markov property using the Secure Hash Algorithm with 256-bit (SHA-256) is proposed to secure data during transmission. The enhanced chaotic map governs the diffusion process for image ciphering. The proposed scheme reduces the average processing time by 23.49%, i.e., from 83.99 ms (millisecond) to 64.33 ms, compared to the current state of the art solution, which is used as a benchmark in this work. Moreover, the Peak Signal to Noise Ratio (PSNR), which is used for measuring the encryption strength, is reduced by 17.33%, i.e., from 36.13 dB (decibel) to 29.87 dB compared to the same benchmark. The proposed solution demonstrates significant improvement in securing data against brute force attack, known-plaintext attack, chosen-plaintext attack and other statistical attacks. Also, the solution reduces the processing time required for both encryption and decryption.

Telemedicine has evolved significantly for detection and diagnosis of diseases remotely, which means more frequent transmission of medical images over the network. The security of any medical image can be characterized as its integrity, confidentiality and authentication. It is these security vulnerabilities that limit the development of mobile healthcare applications, which intend to improve the efficiency of medical image communication. To address the vulnerabilities associated with medical images, we propose a texture edge map and multilevel chaotic map driven encryption framework for medical images. This technique utilizes texture maps generated by utilizing a bank of gabor filters along with multiple chaotic maps viz.: Sine, Cubic and Logistic maps for enhancing the key space, robustness and security of medical images over an insecure channel. The security, speed and reliability of the proposed technique for medical images are illustrated via experiments for key sensitivity, statistical and performance analysis. The proposed technique offers a large key space, pixel diffusion at an acceptable speed. Security analysis shows a high sensitive dependence of the encryption and decryption techniques to any subtle change in the secret key, the plain medical image and the encrypted image. Also, the proposed technique has a large enough key space to see off brute force attacks. Therefore, the proposed technique is a potential candidate for addressing security vulnerabilities of medical images over the communication networks.

The advent of the Internet in these last years encouraged a considerable traffic of digital images. In the sanitary field, precisely in telemedicine branch, medical images play a very important role for therapeutic diagnoses. Thus, it is necessary to protect medical images data before transmission over the network to preserve their security and prevent unauthorized access. In this paper, a secure algorithm for biomedical images encryption scheme based on the combination of watermarking technique and chaotic function is proposed. In the proposed method, to achieve high security level performances, a non-blind hybrid watermarking technique with audio signal, Discrete Wavelet Transform is used; smoothness is also used as selected criteria; the iterations obtained by the chaotic sequences are essential and allow a good realization of the encryption process. One of the main advantages of chaos-based encryption schemes is the generation of a large number of key spaces to resist brute force attacks from the encryption algorithm. The experimental results presented in this paper attest to the invisibility and robustness of the proposed algorithm combining watermarking and chaos-based encryption.

A new algorithm for biometric templates using a 6D-chaotic system, and 2D fractional discrete cosine transform (FrDCT) is proposed in this paper. In this technique, the $k$ biometric templates are represented into three groups. After representation, these three groups are converted into row vectors and scrambled by using keys generated by the 6D-chaotic system and after that, these row vectors are combined into three matrices. The three matrices are then mixed horizontally and divided into two halves, with the left half serving as the real part and the right half serving as the imaginary part of a complex-valued matrix (CVM). This CVM is further subjected to 2D FrDCT. The output of 2D FrDCT is separated into three parts. The robustness of the technique is further enhanced by substitution operation using keys generated by the 6D-chaotic system. Thus, the final encrypted template is obtained. The analysis like security, statistical, and attacks are given to authenticate the reliability of the proposed technique. The experimental values also show that the proposed technique is resistant to brute force attacks.

This paper presents a novel security approach called Anomalous Resource Consumption Detection (ARCD), which acts as an additional layer of protection to detect cyberattacks in embedded systems (ESs). The ARCD approach is based on the differentiation between the predefined standard resource consumption pattern and the anomalous consumption pattern of system resource utilization. The effectiveness of the proposed approach is tested in a rigorous manner by simulating four types of cyberattacks: a denial-of-service attack, a brute-force attack, a remote code execution attack, and a man-in-the-middle attack, which are executed on a Smart PiCar (used as the testbed). A septenary tuple model consisting of seven parameters, representing the embedded system’s architecture, has been created as the core of the detection mechanism. The approach’s efficiency and effectiveness has been validated in terms of range and pattern by analyzing the collected data statistically in terms of mean, median, mode, standard deviation, range, minimum, and maximum values. The results demonstrated the potential for defining a standard pattern of resource utilization and performance of the embedded system due to a significant similarity of the parameters’ values at normal states. In contrast, the attacked cases showed a definite, observable, and detectable impact on resource consumption and performance of the embedded system, causing an anomalous pattern. Thus, by merging these two findings, the ARCD approach has been developed. ARCD facilitates building secure operating systems in line with the ES’s capabilities. Furthermore, the ARCD approach can work along with existing countermeasures to augment the security of the operating system layer.

In this article, several extensions to an alternating space-time (ST) code (STC) physical layer security (PLS) scheme from the literature are proposed. These contributions include alternative orthogonal STCs as well as non-orthogonal and spatially-multiplexed (SM) STCs for improved bandwidth efficiency. Phase rotation (PR) algorithms are provided to build very large sets of unique alternative STCs for use with this scheme. Decoding methods are discussed for alternating non-orthogonal and SM STCs. Monte Carlo simulations are provided to compare bit error rate (BER) performance between different decoding methods. Secrecy system nomenclature is adapted to the alternative STCs and proposed algorithms. Information-theoretic security analysis including message and key equivocation is provided along with expected eavesdropper BER based on an assumed attack methodology. A comparison of security offered by the alternating STC PLS scheme with and without incorporation of proposed PR algorithms is performed. Substantially greater exhaustive key search attack complexity is achieved by using the PR algorithms proposed in this article.

The rapid development of the Internet leads to a surge in the amount of information transmission and brings many security problems. For multimedia information transmission, especially digital images, it is necessary to compress and encrypt at the same time. The emergence of compressive sensing solves this problem. Compressive sensing can compress and encrypt at the same time, which can not only reduce the transmission bandwidth of the network but also improve the security of the system. However, when using compressive sensing encryption, the whole measurement matrix needs to be stored, and the compressive sensing can be combined with a chaotic system, so only the generation parameters of the matrix need to be stored, and the security of the system can be further improved by using the sensitivity of the chaotic system. This paper introduces a secure and efficient image compression-encryption scheme using a new chaotic structure and compressive sensing. The chaotic map used in the scheme is generated by our new and universal chaotic structure, which not only expands the chaotic range of the chaotic system but also improves the performance of the chaotic system. After analyzing the performance comparison of traditional one-dimensional chaotic maps and some existing methods, the image compression-encryption scheme based on a new chaotic structure and compressive sensing has a good encryption effect and large keyspace, which can resist brute force attack and statistical attack.

Advancement of medical imaging in health care sector emerges new challenge of secure image transmission. Security of medical imaging is a prominent issue to keep patients information safe. In this paper an efficient and secure biomedical image encryption algorithm is proposed with two phases of encryption. In the first phase the image has to undergone a random substitution of 20 Amino Acid based Codon with one or more than alternate Codon in the form of triplets using the base DNA code (A, T, C and G) using Linear Congruential Generator. Upshot of the first phase encrypted image is divided into blocks and a logistic map is used to generate a series of unique initial condition and control parameter. Using a random ASCII character as a seed the unique initial conditions for each block is generating some Pseudo Random Number Generator. The seed is encrypted using RSA. Each block is circularly shifted using unique PRNG. These unique initial conditions and control parameters are utilized by a series of Tent Maps to perform block by block confusion in the second phase encryption using XOR operation. Keys used in both the phases are encrypted using AES technique. Proposed method is used to encrypt any biomedical and other images also. All type of security measure such as Differential attack, key space analysis to resist Brute force attack, Correlation analysis, key sensitivity test, resistance to Noise attack and plain text attack along with time analysis has been taken into consideration to test the vulnerability of the proposed algorithm. From the comparative study the proposed method outperform in many aspects than the existing methods.

Authentication is one of the cryptographic primitives that allows one entity to convince to another of the truth of an assertion without revealing any information other than that the assertion is t...

Nowadays, diagnosing patient diseases remotely is a routine and digital medical images analysis as a part of Telecare Medical Information Systems (TMIS) play a fundamental role in early diagnosing and treating most common and serious diseases such as breast cancer. In this context, altering or distorting even a single pixel of a medical image during its transmission over an unsure channel could lead to a wrong diagnosis and harm patient health, induce damaging delays. Therefore the security and privacy of the transmitted medical images must be addressed most seriously. Several techniques are proposed in the literature to address these issues using different techniques such as chaos theory, more recently, elliptic curves cryptography (ECC) or improved classical methods such as linear cryptography. In this paper, we address the security level concern of an image encryption technique combining ECC with Hill cipher (ECCHC) which has been recently proposed by Dawahdeh et al [13]. Our study rises concerns about some weaknesses and flaws of the analyzed encryption scheme against some plain-text and known plain-text attacks. In addition, and not least issue, it is found that the key length used in Dawahdeh et al. scheme is not sufficiently large to be robust against brute force attack. To fix the found flaws and to improve the encryption scheme, a generalized cryptosystem is suggested. In the enhanced version, the key matrix negotiation is redefined to a cipher that combines a modified EC Integrated Encryption Scheme (ECIES) and the linear multiplication matrix is generalized to key matrix of (2n × 2n), n > 2 to counter efficiently the exhaustive search attack. The effectiveness of the proposed version is evaluated and verified through extensive experimentation and most recent available security tools. Compared with the state-of-the art techniques, the proposed version exhibits excellent security features and can resist to various knowing attacks.

The ultimate secure choice for block cryptosystem until now is advanced encryption standard (AES). It is very difficult to implement AES for the constrained situations such as sensor networks, image encryption and RFID tags. In this article, a chaotic oscillator generated by a second order differential equation is used to produce confusion and diffusion in the plaintext message to achieve the desired secrecy. The produced chaotic sequence of random numbers from dynamical system is utilized to scramble the pixels of an image to obtain an encrypted image. Chaos based encryption technique is found secure enough to tackle chosen plaintext attacks and brute force attacks. The specific attributes of chaotic system like, sensitivity to initial conditions, randomness and uncertainty make it suitable for the design of cryptosystem. The dominance of the proposed scheme is acknowledged due to the fact of better cryptographic properties when compared with the algorithms already developed in the literature.

Cryptography (encryption/decryption) is one of the prevailing mechanisms for protection of information (data or image) in the growing era of computerized exchange. It is the art of securing data/image by changing it into an unreadable format, called cipher text/image. Encryption mechanism is said to be efficient if it offers high security and robustness against attacks, and endow with very low correlation value between cipher and the original information. Enormous techniques and corresponding survey papers are available in literature considering only a few methods or parameters into account, but there is a stern need of investigation, which thoroughly considers vast variety of techniques and compares them in the light of numerous performance metrics under the influence of wide variety of probable threats. In view of the fact, this paper has taken account of almost all traditional, modern, chaotic, and quantum-chaotic based methods under the influence of prevalent intimidation and does a comprehensive investigation based on various performance metrics. To measure the efficacy, all the mechanisms are implemented in MATLAB-2014. Chaos and Quantum based algorithms are the superlative in comparison to others presented in literature under most of the extensive threats (attacks, noises etc.) and can resist brute force attacks due to large key space. In addition, suggestions for future scope have been given.

Cube attacks are an important type of key recovery attacks against nonlinear feedback shift register (NFSR)-based cryptosystems. The key step in cube attacks closely related to key recovery is recovering superpolies. However, in the previous cube attacks including original, division property based and correlation cube attacks, the algebraic normal form of superpolies could hardly be shown to be exact due to an unavoidable failure probability or a requirement of large time complexity. In this study, the authors propose an algebraic method aiming at recovering the exact algebraic normal forms of superpolies practically. The proposed method is developed based on the degree of evaluation method proposed by Liu in Crypto 2017. As an illustration, the authors apply the proposed method to Trivium. As a result, they recover the algebraic normal forms of some superpolies for the 818-, 835-, 837- and 838-round Trivium. Based on these superpolies, the authors could mount key-recovery attacks on 818-, 835-, 837- and 838-round Trivium with the worst complexity slightly lower than a brute-force attack. Besides, for the cube proposed by Liu in Crypto 2017 as a zero-sum distinguisher for the 838-round Trivium, it is proved that its superpoly is not zero-constant. Hopefully, the proposed method would provide some new insights on cube attacks against NFSR-based ciphers.

PBKDF2 [1] is a well-known password-based key derivation function. In order to slow attackers down, PBKDF2 introduces CPU-intensive operations based on an iterated pseudorandom function (in our case HMAC-SHA-1). If we are able to speed up a SHA-1 or an HMAC implementation, we are able to speed up PBKDF2-HMAC-SHA-1. This means that a performance improvement might be exploited by regular users and attackers. Interestingly, FIPS 198-1 [2] suggests that it is possible to precompute first message block of a keyed hash function only once, store such a value and use it each time is needed [3] . Therefore the computation of first message block does not contribute to slowing attackers down, thus making the computation of second message block crucial. In this paper we focus on the latter, investigating the possibility to avoid part of the HMAC-SHA-1 operations. We show that some CPU-intensive operations may be replaced with a set of equivalent, but less onerous, instructions. We identify useless XOR operations exploiting and extending Intel optimizations [4] , and applying the Boyar-Peralta heuristic [5] . In addition, we provide an alternative method to compute the SHA-1 message scheduling function and explain why attackers might exploit these findings to speed up a brute force attack against PBKDF2.

Information security is one of the important issues in the information age, image encryption algorithms have been increasingly studied to guarantee the secure image transmission over the internet and through wireless networks. In this article, we propose a new approach for image encryption based on polar decomposition and orthogonal matrices. This scheme offers good confusion and diffusion qualities. The proposed algorithm is shown to be secure against important cryptanalytic attacks (statistical attacks, sensitivity dependence, differential attacks, brute force attacks...), theoretical analysis and computer simulations both confirm that it has a high security level.

The process of registering new students (PMB) for sharing information displayed on the website based PMB information system. However, constraints in the usage of the website are prospective students must monitor the website frequently to obtain information. If not accordingly a student is at risk of lagging behind the latest information. The research aims to expand a registration information system on the enrollment of student-based websites and developed into an Android-based application. So it is very easy for students to access PMB information, and registration through the Android application. This study designed an Android-based registration information system application using the waterfall method, brute force algorithm, integrated realtime firebase database and firebase storage cloud. The results of testing the brute force algorithm on the word search "S1 Informatics Engineering" with the input string "Informatics" carried out 8 steps of searching. These results by calculating the parameters of cyclomate complexity, region, and independent path from whitebox tests obtained the same results, the amount of 16. The results of testing blackbox method declared successful and as expected. So it can be concluded the development of an online smart register information apply the brute force algorithm is said to be feasible to implementation in the process of registering new students in accordance with the testing that has been done.

Biometric systems provide various benefits over traditional pin-based authentication systems. However, the issue of data privacy and theft is of great concern. To resolve these issues, a novel cancelable multimodal biometric system is proposed that combines multiple traits by means of a projection-based approach. The proposed approach generates a cancelable biometric feature that is used to obtain revocable and noninvertible templates. Cancelable features are generated by projecting the feature points onto a random plane obtained using a user-specific key. The point of projection is then transformed into cylindrical coordinates and a combined cancelable feature is obtained. Extensive experiments are performed over 3 chimeric multimodal databases and results reveal high performance. The average DI and EER achieved by the proposed method are 16.63 and 0.004, respectively. Also, the proposed method is successfully analyzed for privacy concerns, namely revocability, non-invertibility, and unlinkability. Moreover, the proposed system demonstrated tolerance against various security attacks like brute force attacks, attacks via record multiplicity, and substitution attacks.

The digital information is transmitted through different communication channels with ease within no time. The sphere of digital world is evolving and become one of the key aspects of our daily lives. In this regard, confidentially to this digital information which are fundamentally transmitted over insecure line of communication is one of the mandatory concerns. This digital information is placed in different databases available online. In this article, our aim is to perform cryptanalysis of Logarithmic based image encryption scheme and investigate its potential key leakages by utilizing public key to recover its private key. Moreover, we have suggested chaos-based Logarithm scheme which is more secure. The Lorenz system is utilized in an anticipated mechanism which is sensitive to initial conditions and chaotic parameters. The proposed scheme is then authenticated by using available security performance benchmarks. To measure the security against different cryptographic attacks, we utilized the statistical analyses which are entropy and the correlation between the pixels, and the differential analyses which are number of changing pixel rate (NPCR) and the unified averaged changed intensity (UACI). In order to resist the brute force attacks, key sensitivity analyses and key space analyses is also performed. The randomness of proposed encryption scheme investigated through entropy and NIST randomness suit tests. An application on digital images is investigated. Also, we have compared our modified confidentiality scheme with existing benchmarks which suggested our encryption technique is quite reasonable for digital multimedia security.