In this paper we discuss PRNGs: the mechanisms used by real-world secure systems to generate cryptographic keys, initialization vectors, random nonces, and other values assumed to be random. We argue that PRNGs are their own unique type of cryptographic primitive, and should be analyzed as such. We propose a model for PRNGs, discuss possible attacks against this model, and demonstrate the applicability of the model (and our attacks) to four real-world PRNGs. We close with a discussion of lessons learned about PRNG design and use, and a few open questions.

Cryptanalytic attacks on pseudorandom number generators

The secret sharing scheme is a data security tool that provides reliability and robustness for multi-user authentication systems. This work focus on improving the counting-based secret sharing technique for higher shares security as well as simple and fast computation. The research considers resolving some originally published defects in the shares reconstruction phase by proposing a new distribution model. This distribution model has been optimized practical and efficient. Also, the shares reconstruction model reflects increasing the security of the system by shares authenticity via steganography. We have employed multimedia image-based steganography methods to store the optimized shares that is presenting comparisons for proofed remarks. The paper experimentations tests the work of the enhancements by assuming different secret sharing key sizes of 64-bit, 128-bit, and 256-bit to make sure of practical variations within the security study. The shares usability has been further optimized by testing embedding each generated share using five different techniques of image-based steganography. The results showed a significant attractive impact making the optimized counting-based secret sharing scheme considered a promising solution for multi-user authentication security applications. This optimized system has been analyzed according to the distortion security and capacity parameters showing attractive contributions opening the research direction for further research to come.

Hiding shares by multimedia image steganography for optimized counting-based secret sharing

The protection of confidential information transmitted over the Internet and restricting access to specific classified data have become a major security and privacy issue. To conceal the existence of such data, digital image steganography is employed hiding the secret in questions within a cover image, arriving at a new image that is virtually indistinguishable from the original. Thus, concealed data within the cover image is prevented from being detected via unauthorized access. In light of the above, certain aspects, such as the capacity of the cover image and the imperceptibility, need to be analyzed and addressed as they constitute the crucial assessment parameters for the performance of the steganography algorithms. In this paper, we compare the steganography algorithms of least significant bit and discrete wavelet transform in terms of efficiency and capacity of concealing multiple images within a single cover image. We cover the mechanism of the embedding and extraction algorithms for multiple numbers of images to come up with knowledgeable remarks. Furthermore, performance of these stego-algorithms has been evaluated with regard to the capacity of the cover image, imperceptibility of the data, and security.

Efficient Implementation of Multi-image Secret Hiding Based on LSB and DWT Steganography Comparisons

Typical cloud systems are often prone to inherent wide area network (WAN) latency. To address this issue fog computing is proposed that enables resource-constrained Internet-of-Things (IoT) devices, to execute deadline-sensitive tasks at the edge of the network. These devices can extend their battery lifespan by intelligently offloading computations as tasks to fog nodes (FNs) in their vicinity. However, finding an optimal offloading plan in a densely connected IoT-fog network is proven to be $\mathcal {NP}$ -Hard. Hence, in this article, we propose a matching theory-based efficient task offloading strategy called METO that aims to reduce the total system energy and number of outages (number of tasks exceeding the deadline) in an IoT-fog interconnection network. As resource allocation involves multiple criteria, their weights are derived using criteria importance though inter criteria correlation (CRITIC). Furthermore, to rank the alternatives we use the technique for order of preference by similarity to ideal solution (TOPSIS). Based on this ranking, we formulate the overall offloading problem as a one-to-many matching game and utilize the deferred acceptance algorithm (DAA) to produce a stable assignment. Simulation is performed in two different settings comprising offloading of homogeneous and heterogeneous tasks. Extensive simulations across both environments confirm that the proposed algorithm outperforms the existing schemes with respect to improved energy consumption, completion time, and execution time. Moreover, METO also shows the reduced number of outages across baselines used for comparison.

METO: Matching-Theory-Based Efficient Task Offloading in IoT-Fog Interconnection Networks

AI-Based Mobile Edge Computing for IoT: Applications, Challenges, and Future Scope

In this paper, we propose a modification for security authentication systems in mobile devices. Our enhancement is designed to secure information transformation over the internet by combining hash, cryptography and steganography mechanisms. We used the combination for authentication, to secure mobile computing to transfer data in a trusted manner. The proposed work will use hash function to store the secret password to provide increased security. The hashed password is encrypted using AES encryption then hidden inside an image to be called back for authentication whenever needed. The security services provided by this combination mechanisms can assure authenticity, confidentiality, and integrity. Results and comparisons to different options of available mobile computing methods proved that our proposed technique is a promising research direction for real mobile security.

Secure Mobile Computing Authentication Utilizing Hash, Cryptography and Steganography Combination

Securing information became essential to exchange multimedia information safely. The exchanged data need to be transformed in a well-managed, secure, and reliable manner. In this paper, we will focus on securing RGB images via cryptography during transmission among users using our effective proposal of utilizing appropriate Pseudo Random Number Generator (PRNG). We implement many techniques of PRNG involved in two consecutive crypto-processes of substitution and transposition to present secure image transformation. Our technique proposal of PRNGs selection is based on testing to encrypt RGB images to be compared with current related used approaches. The work experimentation aims to identify suitability and reliability through security measures standard parameters. The research justifies its proper PRNG selection to model our approach as attractive effective work worth remarking.

Remodeling randomness prioritization to boost-up security of RGB image encryption

Securing information became essential to exchange multimedia information safely. These exchanged data need to be transformed in a well-managed, secure and reliable manner. In this paper, the focus is securing multimedia images via cryptography during transmission among users using an effective selection from several Pseudo Random Number Generator (PRNG). This paper implements several techniques of Pseudo random number generators (PRNG) involved within consecutive crypto-processes of substitution and transposition proven secure process. The study different PRNGs are tested to encrypt images in forms of gray-scale as well as colored RGB images to be compared to current similar other approaches. The work experimentation is aiming to investigate and identify suitability and reliability through security measures standard parameters. The research is showing proper PRNG selection as attractive effective work worth remarking for image cryptography.

/pdf/varying-prng-to-improve-image-cryptography-implementation-16y4nynjbf.pdf

Budoor Obid Al-Roithy

Papers

Secure Mobile Computing Authentication Utilizing Hash, Cryptography and Steganography Combination

Remodeling randomness prioritization to boost-up security of RGB image encryption

Varying PRNG to improve image cryptography implementation