Selection of Optimum Nonlinear Confusion Component of Information Confidentiality Mechanism Using Grey Theory Based Decision-Making Technique

In this age of internet communication, the security of digital information is one of the main issues. The privacy of data depends upon the encryption using some secure algorithm. The selection of robust cryptosystems to ensure confidentiality is a major concern to decrease the risk of cryptographic attacks. In this article, we have implemented a grey theory-based decision-making technique for the election of a robust cryptosystem that complies with all the cryptographic parameters. Six different already proposed encryption algorithms are selected as the alternatives of the decision-making problem and the parameters concerned for the decision are entropy, correlation coefficient, the number of pixels changing rate (NPCR), unified average changing intensity (UACI). The algorithm ranked as first by using grey-based decision-making method can be utilized for secure data encryption.

Correcting Errors in Color Image Encryption Algorithm Based on Fault Tolerance Technique

Security standards have been raised through modern multimedia communications technology, which allows for enormous progress in security. Modern multimedia communication technologies are concerned with fault tolerance technique and information security. As a primary method, there is widespread use of image encryption to protect image information security. Over the past few years, image encryption has paid more attention to combining DNA technologies in order to increase security. The objective here is to provide a new method for correcting color image encryption errors due to the uncertainty of DNA computing by using the fractional order hyperchaotic Lorenz system. To increase randomness, the proposed cryptosystem is applied to the three plain image channels: Red, Green, and Blue. Several methods were compared including the following: entropy, correlation, key sensitivity, key space, data loss attacks, speed computation, Number of Pixel changing rate (NPCR), and Unified Average Change Intensity randomness (UACI) tests. Consequently, the proposed scheme is very secure against a variety of cryptographic attacks.

Secure Storage and Sharing of Visitor Images Generated by Smart Entrance on Public Cloud

Visitor validation at entrance generates a large number of image files that need to be transmitted over to cloud for future reference. The image data needs to be protected by active and passive adversaries from performing cryptographic attacks on these data. The image data also needs to be authenticated before giving it for future use. Focusing on reliable and secure image sharing, the proposed method involves building a novel cloud platform, which aims to provide a secure storage in the public cloud. The main objective of this paper is to provide a new way of secure image data storage and transmission on cloud using cryptographic algorithms. To overcome the flaws in current system, a novel method using BigchainDB, which has advantages of blockchain technology and traditional database, is proposed for storing attributes of image.

New combination of simple additive and entropy weighting criteria for the selection of best substitution box

Substitution boxes (S-boxes) are among the most widely recognized and fundamental component of most modern block ciphers. This is on the grounds that they can give a cipher fortifying properties to oppose known and possible cryptanalytic assaults. We have suggested a novel tool to select nonlinear confusion component. This nonlinear confusion component added confusion capability which describes to make the connection among the key and the cipher as complex and engaging as possible. The confusion can be obtained by using substitution box (S-box) and complex scrambling algorithm that relies on key and the input (plaintext). Various statistical and cryptographic characteristics were introduced to measure the strength of substitution boxes (S-boxes). With the help of the present objective weight methods and ranking technique, we can select an ideal S-box among other constructed confusion component to make our encryption algorithm secure and robust against various cryptographic attacks.

Medical Image Protection Algorithm Based on Deoxyribonucleic Acid Chain of Dynamic Length

Current image encryption algorithms have various deficiencies in effectively protecting medical images with large storage capacity and high pixel correlation. This article proposed a new image protection algorithm based on the deoxyribonucleic acid chain of dynamic length, which achieved image encryption by DNA dynamic coding, generation of DNA dynamic chain, and dynamic operation of row chain and column chain. First, the original image is encoded dynamically according to the binary bit from a pixel, and the DNA sequence matrix is scrambled. Second, DNA sequence matrices are dynamically segmented into DNA chains of different lengths. After that, row and column deletion operation and transposition operation of DNA dynamic chain are carried out, respectively, which made DNA chain matrix double shuffle. Finally, the encrypted image is got after recombining DNA chains of different lengths. The proposed algorithm was tested on a list of medical images. Results showed that the proposed algorithm showed excellent security performance, and it is immune to noise attack, occlusion attack, and all common cryptographic attacks.

CONSTRUCTING AND IMPLEMENTING SOME PERFECT VERIFIABLE SECRET SHARING SCHEMES

Most of the existing public key cryptosystems are potentially vulnerable to cryptographic attacks as they rely on the problems of discrete logarithm and factorization of integers. There is now a need for algorithms that will resist attacks on quantum computers. The article describes the implementation of Shamir’s post-quantum secret sharing scheme using long arithmetic that can be applied in modern cryptographic modules. The implementation of the Pedersen – Shamir scheme is described, which allows preserving the property of the perfection of the Shamir scheme by introducing testability. The article presents graphs reflecting the influence of the verifiability property in the Shamir secret sharing scheme on the speed of its operation.

Secured Transmission of Clinical Signals Using Hyperchaotic DNA Confusion and Diffusion Transform

Secured transmission of electrophysiological signals is one of the crucial requirements in telemedicine, telemonitoring, cardiovascular disease diagnosis (CVD) and telecardiology applications. The chaotic systems have good potential in secured transmission of ECG/EEG signals due to their inherent characteristics relevant to cryptography. This article introduces a new cryptosystem for clinical signals such as electrocardiograms (ECG) and electroencephalograms (EEG) based on hyperchaotic DNA confusion and diffusion transform (HC-DNA-CDT). The algorithm uses a hyperchaotic system with cubic nonlinearity and deoxyribonucleic acid (DNA) encoding rules. The performance of the cryptosystem is evaluated for different clinical signals using different encryption/decryption quality metrics. Simulation and comparison results show that the cryptosystem yield good encryption results and is able to resist various cryptographic attacks. The proposed algorithm can also be used in picture archiving and communication systems (PACS) to provide an efficient sharing of medical image over the networks.

Fake Near Collisions Attacks

Fast Near collision attacks on the stream ciphers Grain v1 and A5/1 were presented at Eurocrypt 2018 and Asiacrypt 2019 respectively. They use the fact that the entire internal state can be split into two parts so that the second part can be recovered from the first one which can be found using the keystream prefix and some guesses of the key materials.In this paper we reevaluate the complexity of these attacks and show that actually they are inferior to previously known results. Basically, we show that their complexity is actually much higher and we point out the main problems of these papers based on information theoretic ideas. We also check that some distributions do not have the predicted entropy loss claimed by the authors. Checking cryptographic attacks with galactic complexity is difficult in general. In particular, as these attacks involve many steps it is hard to identify precisely where the attacks are flawed. But for the attack against A5/1, it could have been avoided if the author had provided a full experiment of its attack since the overall claimed complexity was lower than 232 in both time and memory.

A secured signcryption scheme for e-payment system using hyper elliptic curve

With the growing trend of Communication Technologies (ICT), buying goods through online has been increased drastically. Besides, e-payment makes online purchase easier and made our daily life more convenient. However, there exists a user privacy and data security issue in conventional e-payment systems. Thus, a hyper elliptic curve based signcryption scheme is proposed to achieve reduced computational cost. Because, most of the payment is processed on resource constraint devices like smart phone, hence an energy efficient e-payment system is in requisite. In order to ensure user authenticity, an aadhaar number (unique identity) is used to generate signcryption key. The proposed signcryption scheme can be implemented in real-time applications like e-payment system to ensure confidentiality, privacy, authenticity and integrity. The security of the system is validated through a simulation tool – AVISPA (Automated Validation of Internet Security Protocols and Applications). Further, the resistivity against various cryptographic attacks was analyzed informally and also the computational cost is estimated and compared with other related schemes.

Đề xuất S-hộp có tính chất mật mã tốt cho hoán vị của hàm băm Keccak

Tóm tắt—Keccak là hàm băm giành được chiến thắng trong cuộc thi SHA-3 của Viện Tiêu chuẩn và Công nghệ Mỹ (NIST) tổ chức. Có nhiều tấn công thám mã khai thác bậc đại số thấp trong hoán vị của hàm băm này. Chính những kết quả này mà nhóm tác giả thiết kế Keccak đã tăng số vòng từ 18 lên 24 trong hoán vị của nó. Trên cơ sở đó, bài báo tập trung phân tích tính chất đại số của hoán vị Keccak-f trong hàm băm này, sau đó đề xuất một thành phần S-hộp mới có tính chất mật mã tốt để sử dụng trong hoán vị của hàm băm Keccak.Abstract—Keccak is the winner of the SHA-3 competition of National Institute of Standards and Technology (NIST). There are many cryptographic attacks that exploit the low algebraic degree in permutation of this hash function. Due to these results, the Keccak design team increased the number of rounds from 18 to 24 in its permutation. On that basis, the paper focuses on analyzing the algebraic properties of the Keccak-f permutation in this hash function, then proposes a new S-box with good cryptographic properties used in Keccak’s permutation.