Video Steganography using Curvelet Transform and Elliptic Curve Cryptography

Typically, commercial sensor nodes are equipped with MCUsclocked at a low-frequency (i.e., within the 4–12 MHz range). Consequently, executing cryptographic algorithms in those MCUs generally requires a huge amount of time. In this respect, the required energy consumption can be higher than using a separate accelerator based on a Field-programmable Gate Array (FPGA) that is switched on when needed. In this manuscript, we present the design of a cryptographic accelerator suitable for an FPGA-based sensor node and compliant with the IEEE802.15.4 standard. All the embedded resources of the target platform (Xilinx Artix-7) have been maximized in order to provide a cost-effective solution. Moreover, we have added key negotiation capabilities to the IEEE 802.15.4 security suite based on Elliptic Curve Cryptography (ECC;. Our results suggest that tailored accelerators based on FPGA can behave better in terms of energy than contemporary software solutions for motes, such as the TinyECC and NanoECC libraries. In this regard, a point multiplication (PM) can be performed between 8.58- and 15.4-times faster, 3.40- to 23.59-times faster (Elliptic Curve Diffie-Hellman, ECDH) and between 5.45- and 34.26-times faster (Elliptic Curve Integrated Encryption Scheme, ECIES). Moreover, the energy consumption was also improved with a factor of 8.96 (PM).

ABSTRACTBecause wireless sensor network (WSN), which is composed of a large number of low‐cost and resource‐constrained devices, communicates on the basis of wireless protocols such as IEEE 802.15.4, ZigBee, and DASH‐7, it is easily vulnerable to eavesdropping, illegal modification, privacy infringement and denial‐of‐service attacks. These attacks destroy the data integrity, confidentiality, and authentication of the basic WSN security requirements and then the reliability and security of the WSN‐based applications are deteriorated. There have been many research efforts to make secure WSN environments. Among these efforts, TinyECC is one of outstanding works. It provides several security protocols such as Elliptic Curve Diffie–Hellman, Elliptic Curve Digital Signature Algorithm, and Elliptic Curve Integrated Encryption Scheme, based on the Elliptic Curve Cryptography (ECC). TinyECC is basically a well‐written TinyOS‐based code and is optimized to resource‐constrained environments. The Barrett reduction, hybrid multiplication, and several optimization techniques are also used for high performance even with low‐energy consumption. However, the hybrid multiplication technique used in TinyECC is known to be not suitable for 16‐bit processor, MSP430, which is a familiar processor for sensor node. This is due to the fact that the MSP 430 processor does not provide enough number of registers for hybrid multiplication techniques. Because the multiplication operation over the finite field is a major operation of the ECC, it causes a high latency of multiplication operations and eventually degrades the performance of the ECC operation. In this paper, we propose a novel multiplication operation based on the cached operands and reordered partial products. The proposed method shows that the latency of the polynomial multiplication, which is the core operation of the ECC, is 6% smaller than previously known results. Copyright © 2012 John Wiley & Sons, Ltd.

This research presents a secure, biometric‐enabled file‐sharing platform that combines Elliptic Curve Integrated Encryption Scheme (ECIES) with ChaCha20 symmetric encryption to balance confidentiality and performance. Users register by submitting a SHA‐256–hashed username, plaintext password, and a fingerprint image (also hashed). On login, biometric verification ensures that only legitimate users gain access. When a file is uploaded, ECIES encrypts the content under the registered user’s public key, producing ciphertext stored in a protected static directory. Simultaneously, ChaCha20 encryption is executed on the same file to measure computation time. Metadata about each file—owner, filename, and access type (“Public” or “Private”)—is stored in a MySQL database. Private files are accessible only by their owner, while public files may be downloaded by any authenticated user. A performance‐comparison module captures the time taken by ECIES and ChaCha20 for each upload and generates a Matplotlib bar chart. Results demonstrate that ChaCha20 outperforms ECIES by approximately 3×–5× on average for typical file sizes (e.g., 5–20 MB), with ChaCha20 completing encryption in under 0.5 seconds versus 2–3 seconds for ECIES on mid‐range server hardware. This significant performance advantage suggests that ChaCha20 is well suited for scenarios requiring low‐latency encryption of large files. However, ECIES remains essential for secure key distribution and ensuring that only authorized recipients can decrypt content. By making ChaCha20 performance transparent through real‐time graphing, administrators can make informed decisions about adopting hybrid encryption strategies, such as using ECIES to exchange a ChaCha20 session key. The combination of biometric hashing, ECIES, and ChaCha20 provides strong authentication, data confidentiality, and efficient computation. This approach is especially applicable to environments with stringent security requirements—such as healthcare, legal, and financial sectors—where rapid, secure file sharing is critical.

Ground-roll is an interferential wave existing widely in seismic data, and it is an important step in seismic data processing to suppress ground-roll. Wavelet Transform lacks of detecting the singularities of the signal with straight line or curve, and the method can separate the different waves at the same time because of Curvelet transform simultaneously has the characteristics of frequency and direction. The experiment results show that the Curvelet transform has better effects in ground-roll suppression.

This article presents an efficient method for power quality events (PQEs) detection and classification based on Curvelet transform (CT) and optimized extreme learning machine (OELM). Initially, various PQEs signal data are extracted even under noisy and simultaneously occurred multi-event conditions to reflect the real-time conditions. Relevant features of all these extracted signals are computed by using a multi-resolution and multidirectional fast discrete CT (FDCT) approach. These features are used to classify the events accurately by the proposed OELM. In this classification strategy, a modified differential evolution (MDE) is introduced to optimize the conventional ELM to enhance its precision rate. The proposed novel approach is tested and analyzed under various noisy conditions with 20 dB, 30 dB, and 50 dB with single and multi PQEs conditions. Comparative results with other recently proposed approaches by various authors reveal that the proposed CT- and OELM-based classifier titled CT-OELM can be considered as a competitive choice for implementing in the real-time monitoring system.

The feature extraction plays a very important role in iris recognition. Recent researches on multiscale analysis provide good opportunity to extract more accurate information for iris recognition. In this work, a new directional iris texture features based on 2-D Fast Discrete Curvelet Transform (FDCT) is proposed. The proposed approach divides the normalized iris image into six sub-images and the curvelet transform is applied independently on each sub-image. The anisotropic feature vector for each sub-image is derived using the directional energies of the curvelet coefficients. These six feature vectors are combined to create the resultant feature vector. During recognition, the nearest neighbor classifier based on Euclidean distance has been used for authentication. The effectiveness of the proposed approach has been tested on two different databases namely UBIRIS and MMU1. Experimental results show the superiority of the proposed approach.

Elliptic curves cryptography was introduced independently by Victor Miller (Miller, 1986) and Neal Koblitz (Koblitz, 1987(Koblitz, ) in 1985. .At that time elliptic curve cryptography was not actually seen as a promising cryptographic technique.As time progress and further research and intensive development done especially on the implementation side, elliptic curve cryptography is now being implemented widely.Elliptic curves cryptography offers smaller key size, bandwidth savings and faster in implementations when compared to the RSA (Rivest-Shamir-Adleman) cryptography which based its security on the integer factorization problem.The most interesting feature of the elliptic curves is the group structure of the points generated by the curves, where points on the elliptic curves form a group.The security of elliptic curves cryptography relies on the elliptic curves discrete logarithm problem.The elliptic curve discrete logarithm problem is analogous to the ordinary algebraic discrete logarithm problem, l = g x , where given the l and g, it is infeasible to compute the x.Elliptic curve discrete logarithm problem deals with solving for n the relation P = nG.Given the point P and the point G, then it is very hard to find the integer n.To implement the discrete logarithm problem in elliptic curve cryptography, the main task is to compute the order of group of the curves or in other words the number of points on the curve.Computation to find the number of points on a curve, has given rise to several point counting algorithms.The Schoof and the SEA (Schoof-Elkies-Atkin) point counting algorithms will be part of the discussion in this chapter.This chapter is organized as follows: Section 2, gives some preliminaries on elliptic curves, and in section 3, elliptic curve discrete logarithm problem is discussed.Some relevant issues on elliptic curve cryptography is discussed in section 4, in which the Diffie-Hellman key exchange scheme, ElGamal elliptic curve cryptosystem and elliptic curve digital signature scheme are discussed here accompanied with some examples.Section 5 discussed the two point counting algorithms, Schoof algorithm and the SEA (Schoof-Elkies-Atkin) algorithm.Following the discussion in section 5, section 6 summaries some similarities and the differences between these two algorithms.Section 7 gives some brief literature on these two point counting algorithms.Finally, section 8 is the concluding remarks for this chapter. Elliptic curvesElliptic curves obtained their name from their relation to elliptic integrals that arise from the computation of the arc length of ellipses (Lawrence & Wade, 2006).Elliptic curves are www.intechopen.com Cryptography and Security in Computing1 1 2 3 4 2 2 4 Fig. 1.1. 2(1 ) (1 ) yx x x   www.intechopen.com

Telemedicine requires the provision of medical images over unstable networks in a secure manner. Traditional hybrid cryptographic algorithms e.g. ECC-LSB watermarking provide confidentiality, but are often limited by a large computational cost hence limiting its use to real time. This paper, in turn, offers a lightweight security architecture that integrates Least Significant Bit (LSB) watermarking, Elliptic Curve Integrated Encryption Scheme (ECIES) and the Advanced Encryption Standard in Counter Mode (AES-CTR) to provide fast and secure encryption of medical images. The red channel of every image is watermarked through LSB watermarking to store Patient Electronic Health Records (EHR), and the RGB channels are encrypted with AES-CTR independently, making it possible to perform parallel processing. ECIES is used to transfer symmetric encryption keys. The security of the proposed framework is evaluated in terms of confidentiality, integrity preservation, and resistance to common attacks. Experimental results, validated against conventional ECC-based LSB watermarking schemes, demonstrate superior image quality with MSE of 0.0022, PSNR of 74.64 dB, and UIQI of 1.0, while achieving encryption and decryption times below 0.3 seconds, throughput at 1.51MB/s and 1.91MB/s respectively which makes it suitable to the real-time telemedicine and Picture Archiving and Communication System (PACS) settings.

Digital watermarking technology means that the hidden information is embedded in digital multimedia data by way of signal processing. In this paper, we firstly analyze the Fast Discrete Curvelet Transforms (FDCT) and Discrete Wavelet Transforms (DWT) which are usually used in image processing and figure out that DWT can not approximate optimally the image which contains the line singularity. And then a new encrypted embedded algorithm is presented based on FDCT. Based on bit-plane of gray image, the algorithm makes use of the advantage of FDCT and the watermark is encrypted by Chaotic Map and Arnold Transforms (AT) which is imbedded into the proper coefficient of FDCT. The result of our experiment shows that this algorithm is robust and transparent compared with DWT.

Image fusion based on the Fourier and wavelet transform methods retain rich multispectral details but less spatial details from source images. Wavelets perform well only at linear features but not at non linear discontinuities because they do not use the geometric properties of structures. Curvelet transforms overcome such difficulties in feature representation. In this paper, we define a novel fusion rule via high pass modulation using Local Magnitude Ratio (LMR) in Fast Discrete Curvelet Transforms (FDCT) domain. For experimental study of this method Indian Remote Sensing (IRS) Resourcesat-1 LISS IV satellite sensor image of spatial resolution of 5.8m is used as low resolution (LR) multispectral image and Cartosat-1 Panchromatic (Pan) of spatial resolution 2.5m is used as high resolution (HR) Pan image. This fusion rule generates HR multispectral image at 2.5m spatial resolution. This method is quantitatively compared with Wavelet, Principal component analysis (PCA), High pass filtering(HPF), Modified Intensity-Hue-Saturation (M.IHS) and Grams-Schmidth fusion methods. Proposed method spatially outperform the other methods and retains rich multispectral details.

Multidimensional Signal, Image, and Video Processing and Coding

A promising direction for constructing cryptographically stable pseudo-random sequence generators is an application of transformations in a group of points of elliptic and hypereliptic curves. This will allow building evidence-stable crypto algorithms, the problem of finding the private key in which is associated with solving a theoretically complex elliptic curve discrete logarithm problem. This paper proposes a method for generating pseudo-random sequences of the maximal period using transformations on elliptic curves. This method consists in the application of recurrent transformations with sequential formation of elements of points group of elliptic curves. This allows providing the maximum period of pseudo-random sequences with the reduction of the problem of finding the private key to the solution of the theoretically complex elliptic curve discrete logarithm problem. The block diagram of the device for generating pseudo-random sequences and the scheme for generating the internal states of the generator are given. We also present the results of statistical testing of some generators, which show that the generated sequences are indistinguishable in a statistical sense from truly random ones.KeywordsPseudo-random sequencesElliptic curvesMaximum period

Steganography is the art and science of writing messages which is to be hide behind original cover file which may be audio, video or image. In this paper we are working on audio-video steganography which is the combination of Audio steganography and Image steganography, in this we are using computer forensics technique for authentication purpose. In this paper our aim is to hide secret information behind audio and image of video file. As we know that video is the combination of many still frames of images and audio. We can select any frame of video and audio for hiding our secret data. This paper proposed an algorithm for hiding image in selected video sequence is an image-hiding technique based on Discrete Wavelet Transform (DWT) and Singular Value Decomposition (SVD) and random LSB (Least Significant Bit) audio steganography method for hiding secret text information inside audio of the audio-video file, it reduce embedding distortion of the host audio. This paper focuses the idea of computer forensics technique which is use as a tool for authentication and data security purpose and its use in video steganography in security manner.

The elliptic curve cryptography is almost used in the literature to develop the public key cryptosystems. A new general-purpose symmetric key cryptosystem using elliptic prime curves is proposed in this paper. For a given prime number P, there are many elliptic prime curves on which each point in the quadrant (0,0) to (P-1,P-1) lays. The set of minimum number of eligible elliptic prime curves for a given prime number P constitutes a lookup table that is the secret key of the proposed cryptosystem. The sender can pick up one eligible elliptic curve for each 2n-bit plaintext block. The sender sends two integers cipher for each 2n-bit plaintext block with encryption rate = 0.8. Moreover, a small prime number can be used efficiently with high security and good robustness against brute force attack.

In mobile network, ensuring privacy to the subscriber is an obligation of the mobile operator. It is the responsibility of the operator to ensure that the private information about the subscriber like his/her identity does not get compromised. While adopting technologies with regards to issues like this, operators mostly follow specifications standardized by the third Generation Partnership Project (3GPP). In a recent technical specification published by 3GPP for 5G mobile network, an Elliptic Curve Integrated Encryption Scheme (ECIES) is adopted for identity privacy. However, this scheme does not emphasize on protecting the identity of the home network with which the subscriber is registered. This may make the subscriber vulnerable to tracking by an adversary in a visited network through his/her home network identity. In this paper, we propose an enhanced scheme called scheme for home network identity privacy. Through a formal and an informal security analysis, the proposed scheme is found to be secured. Through a performance analysis, it is found that the scheme achieves its objective of securing the home network identity of the subscriber at the expense of 47% additional computation at the UE in comparison with the execution time that is incurred by ECIES.