Cryptography algorithms play a critical role in information technology against various attacks witnessed in the digital era. Many studies and algorithms are done to achieve security issues for information systems. The high complexity of computational operations characterizes the traditional cryptography algorithms. On the other hand, lightweight algorithms are the way to solve most of the security issues that encounter applying traditional cryptography in constrained devices. However, a symmetric cipher is widely applied for ensuring the security of data communication in constraint devices. In this study, we proposed a hybrid algorithm based on two cryptography algorithms PRESENT and Salsa20. Also, a 2D logistic map of a chaotic system is a

Realistic implementation of nanofluids in subsurface projects including carbon geosequestration and enhanced oil recovery requires full understanding of nanoparticles (NPs) adsorption behaviour in the porous media. The physicochemical interactions between NPs and between the NP and the porous media grain surface control the adsorption behavior of NPs. This study investigates the reversible and irreversible adsorption of silica NPs onto oil-wet and water-wet carbonate surfaces at reservoir conditions. Each carbonate sample was treated with different concentrations of silica nanofluid to investigate NP adsorption in terms of nanoparticles initial size and hydrophobicity at different temperatures, and pressures. Aggregation behaviour and the

With time progress importance of hiding information become more and more and all steganography applications is like computer games between hiding and extracting data, or like thieves and police men always thieve hides from police men in different ways to keep him out of prison. The sender always hides information in new way in order not to be understood by the attackers and only the authorized receiver can open the hiding message. This paper explores our proposed random method in detail, how chooses locations of pixel in randomly , how to choose a random bit to hide information in the chosen pixel, how it different from other approaches, how applying information hiding criteria on the proposed project, and attempts to test out in code, and

The novels that we have addressed in the research, Including those with the ideological and political ideology, It's carry a negative image for the Kurds without any attempt to understand, empathy and the separation between politics and the people, The novels were deformation of the image, Like tongue of the former authority which speaks their ideas, Such as (Freedom heads bagged, Happy sorrows Tuesdays for Jassim Alrassif, and Under the dogs skies for Salah Salah). The rest of novels (Life is a moment for Salam Ibrahim, The country night for Jassim Halawi, The rib for Hameed Aleqabi). These are novels contained a scene carries a negative image among many other social images, some positive, and can be described as neutral novels. We can

Background and Aim: due to the rapid growth of data communication and multimedia system applications, security becomes a critical issue in the communication and storage of images. This study aims to improve encryption and decryption for various types of images by decreasing time consumption and strengthening security. Methodology: An algorithm is proposed for encrypting images based on the Carlisle Adams and Stafford Tavares CAST block cipher algorithm with 3D and 2D logistic maps. A chaotic function that increases the randomness in the encrypted data and images, thereby breaking the relation sequence through the encryption procedure, is introduced. The time is decreased by using three secure and private S-Boxes rather than using si

Groupwise non-rigid image alignment is a difficult non-linear optimization problem involving many parameters and often large datasets. Previous methods have explored various metrics and optimization strategies. Good results have been previously achieved with simple metrics, requiring complex optimization, often with many unintuitive parameters that require careful tuning for each dataset. In this chapter, the problem is restructured to use a simpler, iterative optimization algorithm, with very few free parameters. The warps are refined using an iterative Levenberg-Marquardt minimization to the mean, based on updating the locations of a small number of points and incorporating a stiffness constraint. This optimization approach is eff

NeighShrink is an efficient image denoising algorithm based on the discrete wavelet
transform (DWT). Its disadvantage is to use a suboptimal universal threshold and identical
neighbouring window size in all wavelet subbands. Dengwen and Wengang proposed an
improved method, which can determine an optimal threshold and neighbouring window size
for every subband by the Stein’s unbiased risk estimate (SURE). Its denoising performance is
considerably superior to NeighShrink and also outperforms SURE-LET, which is an up-todate
denoising algorithm based on the SURE. In this paper different wavelet transform
families are used with this improved method, the results show that Haar wavelet has the
lowest performance among