Abstract Steganography and secret sharing are schemes to increase the security of private information against attackers. Steganography emphasizes secrecy while secret sharing distributes the secret key in shares that are conditionally classified to reconstruct the original secret. This paper introduces a counting‐based secret sharing scheme that aims to reduce the computational complexity for longer keys, thereby providing a practical steganographic approach for efficient sharing. The scheme integrates counting‐based secret sharing with integer wavelet transform (IWT) and steganography. The subscriptions created using the Hamming code are embedded in the cover image. Using this method, IWT significantly reduces the occurrence of common rounding errors. As a result, secret key extraction becomes very accurate and eliminates the need to access the original images. This design, using secret sharing based on counting, not only has simplicity and efficiency, but also features such as flexibility, scalability, and lack of central authority. In addition, high‐quality steganography was obtained for keys with lengths of 64, 256, 512, 1024, and 3072, showing an average PSNR=80.11 in different color images. This outstanding performance makes it a highly efficient alternative to previous designs, representing a groundbreaking contribution with significant public interest in the field.

CAPTCHA as "Completely Automated Public Turing test to tell Computers and Humans Apart" is becoming an essential tool to help reduce many automated security authentication attacks. This research focused on studying differences running text-based CAPTCHA vs. graphical-based CAPTCHA in a utilization applicable dominant practicality manner. The ordinary text-based CAPTCHA works simple to prevent automated submissions as thought of being relatively easy to exploit. On the other hand, graphic-based CAPTCHA can be more preferred from users side, but can be providing some complexities making clear tradeoff analysis need between its usability and security. Even though graphic-based CAPTCHA has been generally considered as improvement of text-based CAPTCHA with respect to security, its usage is still not common, raising a practicality gap needing some search for comparing the two methods side by side comprehensively involving usability applicability and cultural preference beside security. In this regard, this research contributes towards filling the gap in knowledge running thorough local experimentations for finding different CAPTCHA performance tradeoffs in terms of real statistical humanoid possibilities of practicality easiness, repetition secrecy, and configuration solving timing, that can be used as basis for conducting further techno improvement human-oriented research.

Watermarking is the process of embedding specific data to prove ownership copyright authentication. It is needed whenever media-files are used without proper permission is granted. The current watermarking challenge comes from the ownership proof especially as slight tampering occurs on the multimedia-file which injure the watermarking causing difficulty in its copyright proof. This paper proposes utilizing counting-based secret sharing strategy to allow validation of ownership RGB watermarking even if some of the image-file is interfered. We validate image watermarking partially as lightweight semi-complete verification, which is not possible in the normal random-stream watermarking schemes. Although the work is still in its early stage, it is promising research showing real attractive contribution opportunities. The work is tested and compared to other strategies in aspects of robustness, capacity, and security, providing attractive remarks worth noting. The study evaluation results showed interesting contribution believed to be pioneering.

Images are the most used e-files within normal personal life utilization affecting overall community safety and security. This research focuses on grayscale images security via resilience crypto-encryption nonviolent utilization. The work relies on flexibility XOR randomizations searching for most secure image crypto scheme testing different pseudo random number generators (PRNG) aiming to select best choice for security enhancement. The experimentations assume flexibly in selecting crypto operation as well as PRNG changings depending on e-image variations. The research implements several encryption schemes adopting substitution and transposition in variance attempts. All PRNGs are tested to encrypt the grayscale images revealing attractive prioritization remarks. The paper search anticipates to recognize an overview of enhancing cryptography of grayscale images via resilience randomization flexibility. The work PRNG and crypto-operation flexibility provided best interesting privacy intellectual image security as innovative basic crypto research track to build upon.

Steganography is a method of hiding data within a cover media so that other individuals fail to realize their existence. In this paper, a new approach for steganography in Arabic texts is proposed. The main idea is that each Arabic word may have some characters which can be extended by dasiaKashidapsila. The ranks dasialocationspsila of such characters and the inserted Kashida, construct a coding method to represent a block of secret bits. Different scenarios have been proposed based on the maximum number of Kashida possible to be inserted per word. The approach was compared to some existing Arabic text steganography approaches in terms of capacity and security. It is shown that this proposed approach outperforms the others with interesting promising results.

A new image-based steganography technique-called triple-A algorithm is proposed in this paper. It uses the same principle of LSB, where the secret is hidden in the least significant bits of the pixels, with more randomization in selection of the number of bits used and the color channels that are used. This randomization is expected to increase the security of the system and also increase the capacity. This technique can be applied to RGB images where each pixel is represented by three bytes to indicate the intensity of red, green, and blue in that pixel.

Steganography is the ability to hide information in a cover media such as text, and pictures. An improved approach is proposed to embed secret into Arabic text cover media using Kashida, an Arabic extension character. The proposed approach is maximizing the use of Kashida to hide more information, represented in binary bits, in Arabic text cover media. A stego system has been developed based on this approach. After sufficient testing and evaluation, our system shows promising performance in terms of capacity.

In this paper, we present a new algorithm for RGB image based steganography. Our algorithm introduces the concept of storing variable number of bits in each channel (R, G or B) of pixel based on the actual color values of that pixel: lower color component stores higher number of bits. Our algorithm offers very high capacity for cover media compared to other existing algorithms. We present experimental results showing the superiority of our algorithm. We also present comparative results with other similar algorithms in image based steganography.

This paper proposes a new method to compute Elliptic Curve Cryptography in Galois Fields GF(p). The method incorporates pipelining to utilize the benefit of both parallel and serial methodology used before. It allows the exploitation of the inherited independency that exists in elliptic curve point addition and doubling operations. The results showed attraction because of its improvement over many parallel and serial techniques of elliptic curve crypto-computations. 1.

New elliptic curve cryptographic processor architecture is presented that result in considerable reduction in power consumption as well as giving a range of trade-off between speed and power consumption. This is achieved by exploiting the inherent parallelism that exist in elliptic curve point addition and doubling. Further trade-off is achieved by using digit serial-parallel multipliers instead of the serial-serial multipliers used in conventional architectures. In effect, the new architecture exploits parallelism at the algorithm level as well as at the arithmetic element level. This parallelism can be exploited either to increase the speed of operation or to reduce power consumption by reducing the frequency of operation and hence the supply voltage.

A new GF(p) cryptographic processor architecture for elliptic curve encryption/decryption is proposed in this paper. The architecture takes advantage of projective coordinates to convert GF(p) inversion needed in elliptic point operations into several multiplication steps. Unlike existing sequential designs, we show that projecting into (X/Z,Y/Z) leads to a much better performance than the conventional choice of projecting into the current (X/Z/sup 2/,Y/Z/sup 3/). We also propose to use high radix modulo multipliers which give a wide range of area-time trade-offs. The proposed architecture is a significant challenger for implementing data security systems based on elliptic curve cryptography.

A high performance GF(2/sup k/) elliptic curve crypto processor architecture suitable for multimedia security is proposed. To meet the high data rates of multimedia, the new architecture exploits parallelism within elliptic curve point operations after using projective coordinates. In this paper, the decision on which projective coordinate to use is based on its efficiency with regard to its parallel implementation. Two different projective coordinates are compared here. This parallelism is exploited in the new architecture by using three separate bit-level pipelined digit serial-parallel multipliers that can operate in parallel. It is worth pointing that such multipliers are ideally suited for the repetitive multiplications inherent in elliptic curve cryptography. it is believed that such high performance architectures are needed for high end servers that need to support the security of many multimedia streams at the same time.