This paper is devoted to the analysis of the impact of chaos-based
techniques on block encryption ciphers. We present several chaos
based ciphers. Using the well-known principles in the cryptanalysis
we show that these ciphers do not behave worse
than the standard
ones, opening in this way a novel approach to the design of block
encryption ciphers.
This research will show a sturdy method to hide a text file into an
image using least significant bit algorithm and encrypting this text,
which allows to store English and Arabic texts with various sizes
and ensure that the text file is delivered correctly and secretly.
In our research, we used a video file as a cover media to
hide the text. This method provides a high quality in
display and authenticity in data transfer.
We chose specific frames from the video file and we apply
DWT to hide the encryption text, which ensure that the text
file is delivered correctly and secretly.
In this paper , we will define multiple orthogonal vector of Diophantine
equation on specific conditions. We will solve the Diophantine equation
with this vector in ternary number system and develop special
relationships for it , {0,1,2} , then w
e will present a new public
key cryptosystem based on multiple orthogonal vector with an example
to illustrate the system.
We testified in the last years immense jumps and many developments in all of the life domains, specially in a field of the informatics and telecommunications.
Therefor the digital information and the telecommunications and its kinds, became the ner
ve of daily life, and the basic support which are built on it most of the sciences.
Internet and networks applications are growing very fast, so the needs to protect such applications are increased.
Encryption algorithms play a main role in information security systems.
On the other side, those algorithms consume a significant amount of computing resources such as CPU time, memory, and battery power.
A comparison has been conducted for those encryption algorithms at different settings for each algorithm such as different sizes of data blocks, different data types, battery power consumption, different key size and finally encryption/decryption speed.
Simulation results are given to demonstrate the effectiveness of each algorithm.
The two main characteristics that identify and differentiate one encryption algorithm from another are its ability to secure the protected data against attacks and its speed and efficiency in doing so.
Network algorithms were from most of the topics importance, which it was very important most savants and the researchers, because a need of algorithm, a necessary matter for performance most of the processes, until the very small processes.
specially Cryptography Algorithms.
Therefor many of researches and studies has been consecrated for invention a new algorithms, which are suited with requirements of this age , as the speed and volume of data, and Information security and development of this subject.
Cryptography has a long and fascinating history.
The predominant practitioners of the art were those associated with the military, the diplomatic service and government in general.
Cryptography was used as a tool to protect national secrets and strategies.
Cryptography is the study of mathematical techniques related to aspects of information security such as confidentiality, data integrity, entity authentication, and data origin authentication.
The development subject of Cryptography Algorithms (CAs) is considered of the most important topics in the last years, because of the large and fast development in the communications, computers and networks, and the need for information security and data protection methods ( Cryptography methods)
Here we need some mathematical background, which assumes only that the reader knows the basic concept of integers (mod n). The F in GF(Q) stands for Field.
Examples of fields are complex numbers and integers mod p (p prime).
A field has a set of objects which can be combined by either of two operations (addition and multiplication) to produce other objects in the set.
There is an additive identity (‘zero’), there is a multiplicative identity i.e. ‘one’.
There is an additive inverse (minus the number), and there is a multiplicative inverse for all numbers except the additive identity i.e. except for ‘zero’.
Classical ciphers refers to encryption techniques which have become well-known over time, and generally created prior to the second half of the twentieth century (in some cases, many hundreds of years earlier).
Many classical techniques are variations of simple substitution and simple transposition.
Block ciphers can be either symmetric-key or public-key
