Blockchain-Based DNS Root Zone Management Decentralization for Internet of Things

Domain Name System (DNS) is a widely used infrastructure for remote control and batch management of IoT devices. As a critical Internet infrastructure, DNS is structured as a tree-like hierarchy with single root zone authority at the top, which puts the operation of DNS at risk from single point of failure. The current root zone management is lack of transparency and accountability, since only the root zone file is published as the final outcome of operations inside the root zone authority. Towards distributed root zone operation in DNS, this paper presents a blockchain-based root operation architecture—RootChain, composed of multiple root servers. On the basis of maintaining the single root authority for top-level domain (TLD), RootChain decentralizes TLD data publication by empowering delegated TLD authorities to publish authenticated data directly. The transparency and accountability of root zone operation are attained by smart-contracting the whole life cycle of TLD operation and logging all operations on the chain. RootChain is transparent to recursive/stub resolver and DNS/DNSSEC-compatible. A proof-of-concept prototype of RootChain has been implemented with Hyperledger Fabric and evaluated by experiments.

An Asymmetric Optical Cryptosystem of Double Image Encryption Based on Optical Vortex Phase Mask Using Gyrator Transform Domain

Background: Optical Vortex (OV) has attracted attention amongst many researchers. Paper proposes a nonlinear scheme of image encryption based on Optical Vortex (OV) and Double Random Phase Encoding (DRPE) in the Gyrator Transform (GT) domain under phase truncation operations. Objective: The amplitude and phase truncation operation in the image encryption generates two decryption keys and convert the method to nonlinear. It has also been proposed opto-electronically. Original image can only be decrypted with correct values of OV, GT rotation angles and Decryption Keys (DKs). Methods: A novel asymmetric image encryption scheme, using optical vortex mask has been proposed in view of amplitude and phase truncation operation. The scheme becomes more strengthened by the parameters used in the Optical Vortex (OV) and by taking the (n)th power operation in the encryption path and (n)th root operation in the decryption path. Results: It shows that for each of the encryption parameters, binary image has greater sensitivity as compared to the grayscale image. This scheme inflates the security by making use of OV-based Structured Phase Mask (SPM) as it expands the key space. The scheme has also been investigated for its robustness and its sensitivity against various attacks such as noise and occlusion attacks under number of iterations. Conclusion: This scheme provides solution to the problem of key space with the use of GT rotational angles and OV phase mask thus enhances the security. The scheme has been verified based on various security parameters such as occlusion, noise attacks, CC, entropy etc.

The new integer factorization algorithm based on Fermat’s Factorization Algorithm and Euler’s theorem

Although, Integer Factorization is one of the hard problems to break RSA, many factoring techniques are still developed. Fermat’s Factorization Algorithm (FFA) which has very high performance when prime factors are close to each other is a type of integer factorization algorithms. In fact, there are two ways to implement FFA. The first is called FFA-1, it is a process to find the integer from square root computing. Because this operation takes high computation cost, it consumes high computation time to find the result. The other method is called FFA-2 which is the different technique to find prime factors. Although the computation loops are quite large, there is no square root computing that included into the computation. In this paper, the new efficient factorization algorithm is introduced. Euler’s theorem is chosen to apply with FFA to find the addition result between two prime factors. The advantage of the proposed method is that almost of square root operations are left out from the computation while loops are not increased, they are equal to the first method. Therefore, if the proposed method is compared with the FFA-1, it implies that the computation time is decreased, because there is no the square root operation and the loops are same. On the other hand, the loops of the proposed method are less than the second method. Therefore, time is also reduced. Furthermore, the proposed method can be also selected to apply with many methods which are modified from FFA to decrease more cost.