Improving Video Watermarking through Galois Field GF(2^(4)) Multiplication Tables with Diverse Irreducible Polynomials and Adaptive Techniques

Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4)),and their interaction with distinct irreducible polynomials.The primary aim is to enhance watermarking techniques for achieving imperceptibility,robustness,and efficient execution time.The research employs scene selection and adaptive thresholding techniques to streamline the watermarking process.Scene selection is used strategically to embed watermarks in the most vital frames of the video,while adaptive thresholding methods ensure that the watermarking process adheres to imperceptibility criteria,maintaining the video's visual quality.Concurrently,careful consideration is given to execution time,crucial in real-world scenarios,to balance efficiency and efficacy.The Peak Signal-to-Noise Ratio(PSNR)serves as a pivotal metric to gauge the watermark's imperceptibility and video quality.The study explores various irreducible polynomials,navigating the trade-offs between computational efficiency and watermark imperceptibility.In parallel,the study pays careful attention to the execution time,a paramount consideration in real-world scenarios,to strike a balance between efficiency and efficacy.This comprehensive analysis provides valuable insights into the interplay of GF multiplication tables,diverse irreducible polynomials,scene selection,adaptive thresholding,imperceptibility,and execution time.The evaluation of the proposed algorithm's robustness was conducted using PSNR and NC metrics,and it was subjected to assessment under the impact of five distinct attack scenarios.These findings contribute to the development of watermarking strategies that balance imperceptibility,robustness,and processing efficiency,enhancing the field's practicality and effectiveness.

Asymmetric Key Cryptosystem for Image Encryption by Elliptic Curve over Galois Field GF(2^(n))

Protecting the integrity and secrecy of digital data transmitted through the internet is a growing problem.In this paper,we introduce an asymmetric key algorithm for specifically processing images with larger bit values.To overcome the separate flaws of elliptic curve cryptography(ECC)and the Hill cipher(HC),we present an approach to picture encryption by combining these two encryption approaches.In addition,to strengthen our scheme,the group laws are defined over the rational points of a given elliptic curve(EC)over a Galois field(GF).The exclusive-or(XOR)function is used instead of matrix multiplication to encrypt and decrypt the data which also refutes the need for the inverse of the key matrix.By integrating the inverse function on the pixels of the image,we have improved system security and have a wider key space.Furthermore,through comprehensive analysis of the proposed scheme with different available analyses and standard attacks,it is confirmed that our proposed scheme provides improved speed,security,and efficiency.

Design of Nonlinear Components Over a Mordell Elliptic Curve on Galois Fields

Elliptic curve cryptography ensures more safety and reliability than other public key cryptosystems of the same key size.In recent years,the use of elliptic curves in public-key cryptography has increased due to their complexity and reliability.Different kinds of substitution boxes are proposed to address the substitution process in the cryptosystems,including dynamical,static,and elliptic curve-based methods.Conventionally,elliptic curve-based S-boxes are based on prime field GF(p)but in this manuscript;we propose a new technique of generating S-boxes based on mordell elliptic curves over the Galois field GF(2n).This technique affords a higher number of possibilities to generate S-boxes,which helps to increase the security of the cryptosystem.The robustness of the proposed S-boxes against the well-known algebraic and statistical attacks is analyzed to classify its potential to generate confusion and achieve up to the mark results compared to the various schemes.The majority logic criterion results determine that the proposed S-boxes have up to the mark cryptographic strength.

Design of systolic B^N circuits in Galois fields based on quaternary logic

The BN operation is known as an efficient basic operation in Galois fields GF （2k）, and various algorithms and implementations using binary logic signals have already been proposed. In or- der to reduce the circuit complexity and long latency of BN operations, a novel algorithm and its sys- tolic architecture are proposed based on multiple-value logic （MVL）. In the very large scale integra- tion （VLSI） realization, a kind of multiple-valued current-mode （MVCM） circuit structure is presen- ted and in which the combination of dynamic source-coupled logic （SCL） and different-pair circuits （DPCs） is employed to improve the switching speed and reduce the power dissipation. The perform- ance is evaluated by HSPICE simulation with 0.18 μm CMOS technology. The transistor numbers and the delay are superior to corresponding binary CMOS implementation. The combination of MVCM cir- cuits and relevant algorithms based on MVL seems to be potential solution for high performance a- rithmetic operationsin Galois fields GF（2k）.

Design of AB^2 in Galois Fields Based on Multiple-Valued Logic

A new AB^2 operation in Galois Field GF(24)is presented and its systolic realization based on multiple-valued logic(MVL)is proposed.The systolic structure of the operation employs multiple-valued current mode(MVCM)by using dynamic source-coupled logic(SCL)to reduce the transistor and wire counts,and the initial delay.The performance is evaluated by HSPICE simulation with 0.18.μm CMOS technology.A comparison is conducted between our proposed implementation and those reported in the literature.The transistor counts,the wire counts and the initial delay in our MVL design show savings of about 23%,45%,and 72%,in comparison with the corresponding binary CMOS implementation.The systolic architecture proposed is simple,regular,and modular,well suited for very large scale integration(VLSI)implementation.The combination of MVCM circuits and relevant algorithms based on MVL seems to be a potential solution for high performance arithmetic operations in GF(2^k).

Systolic B-1 Circuit in Galois Fields Based on a Quaternary Logic Technique

In order to improve the circuit complexity and reduce the long latency of B-1 operations,a novel B-1 operation in Galois Field GF(24)is presented and the corresponding systolic realization based on multiple-valued logic(MVL)is proposed.The systolic structure employs multiplevalued current mode(MVCM)by using dynamic source-coupled logic(SCL)to reduce the initial delay and the transistor and wire counts.The performance is evaluated by HSPICE simulation in 0.18μm CMOS technology and a comparison is conducted between our proposed implementation and those reported in the literature.The initial delay and the sum of transistors and wires in our MVL design are about 43%and 13%lower,respectively,in comparison with other corresponding binary CMOS implementations.The systolic architecture proposed is simple,regular,and modular,well suited for very large scale integration(VLSI)implementations.The combination of MVCM circuits and relevant algorithms based on MVL seems to be a potential solution for high performance arithmetic operations in GF(2k).

Fast VLSI Implementation of Modular Inversion in Galois Field GF(p)

Modular inversion is one of the key arithmetic operations in public key cryptosystems, so low-cost, high-speed hardware implementation is absolutely necessary. This paper presents an algorithm for prime fields for hardware implementation. The algorithm involves only ordinary addition/subtraction and does not need any modular operations, multiplications or divisions. All of the arithmetic operations in the algorithm can be accomplished by only one adder, so it is very suitable for fast very large scale integration (VLSI) implementation. The VLSI implementation of the algorithm is also given with good performance and low silicon penalty.

An Efficient Three-Party Authenticated Key Exchange Procedure Using Chebyshev Chaotic Maps with Client Anonymity

Internet of Things(IoT)applications can be found in various industry areas,including critical infrastructure and healthcare,and IoT is one of several technological developments.As a result,tens of billions or possibly hundreds of billions of devices will be linked together.These smart devices will be able to gather data,process it,and even come to decisions on their own.Security is the most essential thing in these situations.In IoT infrastructure,authenticated key exchange systems are crucial for preserving client and data privacy and guaranteeing the security of data-in-transit(e.g.,via client identification and provision of secure communication).It is still challenging to create secure,authenticated key exchange techniques.The majority of the early authenticated key agreement procedure depended on computationally expensive and resource-intensive pairing,hashing,or modular exponentiation processes.The focus of this paper is to propose an efficient three-party authenticated key exchange procedure(AKEP)using Chebyshev chaotic maps with client anonymity that solves all the problems mentioned above.The proposed three-party AKEP is protected from several attacks.The proposed three-party AKEP can be used in practice for mobile communications and pervasive computing applications,according to statistical experiments and low processing costs.To protect client identification when transferring data over an insecure public network,our three-party AKEP may also offer client anonymity.Finally,the presented procedure offers better security features than the procedures currently available in the literature.

k-Order Fibonacci Polynomials on AES-Like Cryptology

The Advanced Encryption Standard(AES)is the most widely used symmetric cipher today.AES has an important place in cryptology.Finite field,also known as Galois Fields,are cornerstones for understanding any cryptography.This encryption method on AES is a method that uses polynomials on Galois fields.In this paper,we generalize the AES-like cryptology on 2×2 matrices.We redefine the elements of k-order Fibonacci polynomials sequences using a certain irreducible polynomial in our cryptology algorithm.So,this cryptology algorithm is called AES-like cryptology on the k-order Fibonacci polynomial matrix.

Mordell Elliptic Curve Based Design of Nonlinear Component of Block Cipher

Elliptic curves(ECs)are deemed one of the most solid structures against modern computational attacks because of their small key size and high security.In many well-known cryptosystems,the substitution box(Sbox)is used as the only nonlinear portion of a security system.Recently,it has been shown that using dynamic S-boxes rather than static S-boxes increases the security of a cryptosystem.The conferred study also extends the practical application of ECs in designing the nonlinear components of block ciphers in symmetric key cryptography.In this study,instead of the Mordell elliptic curve(MEC)over the prime field,the Galois field has been engaged in constructing the S-boxes,the main nonlinear component of the block ciphers.Also,the proposed scheme uses the coordinates of MEC and the operation of the Galois field to generate a higher number of S-boxes with optimal nonlinearity,which increases the security of cryptosystems.The proposed S-boxes resilience against prominent algebraic and statistical attacks is evaluated to determine its potential to induce confusion and produce acceptable results compared to other schemes.Also,the majority logic criteria(MLC)are used to assess the new S-boxes usage in the image encryption application,and the outcomes indicate that they have significant cryptographic strength.

NEW SECRET SHARING SCHEME BASED ON LINEAR CODE

A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify his own share from dealer's distribution and ensure each participant to receive valid share.Another does not have a trusted center,here,each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.

Efficient FPGA implementation of AES 128 bit for IEEE 802.16e mobile WiMax standards

In an advancement of communication field, wireless technology plays a predominant role in data transmission. In the timeline of wireless domain, Wi-Fi, Bluetooth, zigbee etc are some of the standards, which are being used in today’s wireless medium. In addition, the WiMax is introduced by IEEE in IEEE 802.16 for long distance communication, specifically 802.16e standard for mobile WiMax. It is an acronym of Worldwide Interoperability for Microwave Access. It is to be deliver wireless transmission with high quality of service in a secured environment. Since, security becomes dominant design aspect of every communication, a new technique has been proposed in wireless environment. Privacy across the network and access control management is the goal in the predominant aspects in the WiMax protocol. Especially, MAC sub layer should be evaluated in the security architecture. It has been proposed on cryptography algorithm AES that require high cost. Under this scenario, we present the optimized AES 128 bit counter mode security algorithm for MAC layer of 802.16e standards. To design a efficient MAC layer, we adopt the modification of security layers data handling process. As per the efficient design strategy, the power and speed are the dominant factors in mobile device. Since we concentrate mobile WiMax, efficient design is needed for MAC Security layer. Our proposed model incorporates the modification of AES algorithm. The design has been implemented in Xilinx virtex5 device and power has been analyzed using XPower analyzer. This proposed system consumes 41% less power compare to existing system.

Topology-Transparent Transmission Scheduling Algorithms in Wireless Ad Hoc Networks

In order to maximize the average throughput and minimize the transmissionslot delay in wireless Ad Hoc networks, an optimal topology-transparent transmission schedulingalgorithm-multichannel Time-Spread Multiple Access (TSMA) is proposed. Further analysis is shownthat the maximum degree is very sensitive to the network performance for a wireless Ad Hoc networkswith N mobile nodes. Moreover, the proposed multichannel TSMA can improve the average throughput Mtimes and decrease the average transmission slot delay M times, as compared with singlechannel TSMAwhen M channels are available.

Low-Complexity Bit-Parallel Multiplier over GF（2^m） Using Dual Basis Representation

Recently, cryptographic applications based on finite fields have attracted much attention. The most demanding finite field arithmetic operation is multiplication. This investigation proposes a new multiplication algorithm over GF（2^m） using the dual basis representation. Based on the proposed algorithm, a parallel-in parallel-out systolic multiplier is presented, The architecture is optimized in order to minimize the silicon covered area （transistor count）. The experimental results reveal that the proposed bit-parallel multiplier saves about 65% space complexity and 33% time complexity as compared to the traditional multipliers for a general polynomial and dual basis of GF（2^m）.

Unified Parallel Systolic Multiplier Over GF（2^m）

In general, there are three popular basis representations, standard （canonical, polynomial） basis, normal basis, and dual basis, for representing elements in GF（2^m）. Various basis representations have their distinct advantages and have their different associated multiplication architectures. In this paper, we will present a unified systolic multiplication architecture, by employing Hankel matrix-vector multiplication, for various basis representations. For various element representation in GF（2^m）, we will show that various basis multiplications can be performed by Hankel matrix-vector multiplications. A comparison with existing and similar structures has shown that time complexities. the proposed architectures perform well both in space and