No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Simple Encryption/Decryption Application
Abstract
This paper presents an Encryption/Decryption application that is able to work with any type of file; for example: image files, data files, documentation files…etc. The method of encryption is simple enough yet powerful enough to fit the needs of students and staff in a small institution. The application uses simple key generation method of random number generation and combination. The final encryption is a binary one performed through rotation of bits and XOR operation applied on each block of data in any file using a symmetric decimal key. The key generation and Encryption are all done by the system itself after clicking the encryption button with transparency to the user. The same encryption key is also used to decrypt the encrypted binary file.
... In encryption the original data is passed through a series of procedure like, substituting, shifting and various mathematical processes to generate in a different form called cipher text. Key-based algorithms use an encryption key to encrypt the message [7]. ...
... The key-based encryption can be Symmetric Encryption which uses a single key to encrypt and decrypt the message or Asymmetric Encryption which uses two different keys -a public key to encrypt the message, and a private key to decrypt it [7]. There are several key based Encryption algorithms such as: DES, RSA, PGP, Elliptic curve, etc. [7] In this paper we have introduced a new probabilistic encryption technique using an arbitrary matrix with minimized complexity analysis and protected data extraction with enhanced security aspects. ...
... The key-based encryption can be Symmetric Encryption which uses a single key to encrypt and decrypt the message or Asymmetric Encryption which uses two different keys -a public key to encrypt the message, and a private key to decrypt it [7]. There are several key based Encryption algorithms such as: DES, RSA, PGP, Elliptic curve, etc. [7] In this paper we have introduced a new probabilistic encryption technique using an arbitrary matrix with minimized complexity analysis and protected data extraction with enhanced security aspects. * Corresponding author. ...
This paper presents a simple Encryption/Decryption technique which enables all kinds of file for encryption and decryption. The method of encryption is not only simple, but also secured enough for transmission. The technique uses simple key generation using an arbitrary matrix. The final encryption is performed through a set of operations using the generated key and original data block and vice-versa in decryption. The generation of keys along with encryption and decryption is performed by the algorithm by putting in the data block and arbitrary matrix. The encryption process can be done by modifying the arbitrary matrix and multiple key can be generated for a single data block.
... These days' passwords are not considered as reliable for this task because it is easy to guess passwords due to its short range. Moreover, if the range of password is small a brute force search can be applied to crack it [3]. So, as to protect our data various algorithms have been designed. ...
... The core of Hill-cipher [3] is matrix manipulations. It is a multi-letter cipher, developed by the mathematician Lester Hill in 1929. ...
Data security is an essential component of an organization in order to keep the information safe from various competitors. Cryptography is a technique used to avoid unauthorized access of data. It has two main components- Encryption algorithm and Key. Sometime, multiple keys can also be used for encryption. A number of cryptographic algorithms are available in market such as DES, AES, TDES and RSA. The strength of these encryption algorithms depends upon their key strength. The long key length takes more computing time to crack the code and it becomes difficult for the hacker to detect the cryptographic model. In this paper we suggest an innovation in the age-old conventional cryptographic technique of HILLCIPHER using the concept of self repetitive matrix. A numerical method has been stated, mathematically proved and later implemented in generating a random matrix of given periodicity. The method of self-repetitive matrix has then been used to simulate a communication channel with proper decompression techniques to facilitate bit saving.
... This process takes place during the transmission of information. The process scrambles the contents of the message and the original information can only be retrieve through the decryption process [2]. Decryption process is the reverse of the process at the transmitter (sender) and it takes place at the receiver [1], [3]. ...
... In the literature, various encryption methods have been proposed [1][2][3][4][5]. It has been observed in [4] that, an efficient and high throughput encryption and decryption algorithms are of high importance in the area of high-speed networking for seamless transmission of multimedia data. ...
There have been significant developments in computer networking which have result in high rate of internet and multimedia application usage. However, transmission of images and other relevant information over such network can be compromised if adequate security is not employed. Consequently, security is a technical challenge in transmission and storage of digital images. Therefore, image encryption has been noted to be an efficient means of securing digital images and various encryption methods have been proposed in the literature. One of such method is chaos based image encryption technique in which random sequence is employed. This technique is relatively an efficient means of achieving fast and reliable encryption. Nevertheless, it has limited precision which necessitate an improved scheme to be developed. This paper presents image encryption algorithm with improved precision, confidentiality and security that exploits the existing algorithms. The effectiveness of the algorithm is evaluated by comparing the plaintext and the decrypted text using MATLAB®. The simulation results show that, the proposed scheme is viable and offers a reasonable degree of security. Also, there is no loss in the quality of digital images during the process.
... Stallings (1999) is of the opinion that the main purpose of encryption is to hide the data from unauthorized parties in order to prevent them from viewing or altering the data. Some of the techniques that brought about encryption identified by (Majdi & Lin, 2013) include substitution technique, shifting technique, table references or mathematical operations. Anju et. ...
... Key-based algorithms use an Encryption key to encrypt messages. There are two general categories for key-based Encryption: Symmetric Encryption which uses a single key to encrypt and decrypt the message and Asymmetric Encryption which uses two different keys -a public key to encrypt the message, and a private key to decrypt it (Majdi & Lin, 2013). Currently, there are several types of key based Encryption algorithms such as: DES, Rivest, Shirmai and Addleman (RSA), Elliptic curve, and others but all of these algorithms depend on high mathematical manipulations (Beth & Gollmann, 1989;IBM, 1994). ...
This paper reports the implementation of an improved XOR encryption method. In this approach data to be encrypted is broken into blocks to remove pattern
recognition which is the serious defect of the traditional XOR encryption method. This approach eliminates the two way operations of compression and
decompression which is the normal way of avoiding pattern recognition in the traditional XOR encryption method, thereby reduce processing time. The approach
also outperforms other block encryption algorithms as the maximum number of characters in a block is more than what could be handled by its counterparts
when keys of the same length are used. The algorithm is implemented in Matrix Laboratory (MATLAB) programming language. The program is tested on a
machine that is runs on windows 7 operating system
... Total time during encryption/decryption of the process is known as execution time [8, 9 &10] and throughput is directly depended on execution time which is represent execution speed of whole process. The throughput of the encryption scheme is calculated as the total plaintext in bytes encrypted divided by the total execution time [10]. ...
... The more CPU time is used in the encryption process, the higher is the load of the CPU [8, 9 & 10]. The memory deals with the amount of memory space it takes for the whole process of encryption and decryption [9,10]. The presented experimental results are showing the performance of the proposed technique. ...
... Here, we will see the encryption and decryption [38] time rate of our proposed system for different image pixel sizes. Table 3 shows the results of execution time complexity. ...
This research introduces a novel cryptographic system that enhances the security of steganographic images by integrating Quantum Key Distribution (QKD) with traditional encryption. Using the E91 QKD protocol, it generates a shared secret key between parties, leveraging quantum entanglement to provide superior protection against eavesdropping. The quantum key is then hashed with the Secure Hash Algorithm (SHA) to produce a fixed-length, high-entropy key for symmetric encryption. The Advanced Encryption Standard (AES) is employed to encrypt steganographic images, which conceal critical data within digital images, adding an extra layer of security through obscurity. Experiments with images of varying resolutions (64 × 64 to 512 × 512 pixels) show consistent encryption performance. The encrypted images exhibit high randomness, with an average entropy of 7.9929. Differential attack resilience is demonstrated by a Number of Pixels Change Rate (NPCR) averaging 99.6928% and a Unified Average Changing Intensity (UACI) of 56.1549%. The average E91 protocol key generation time is 5.78 s with a key rate of 7.43 bps. Encryption and decryption times for test images are 0.00149 and 0.00175 s, respectively. This research combines quantum and classical cryptography with steganography, providing a robust security framework highly resistant to both quantum and classical threats.
... Here we will see the encryption and decryption [24] time rate of our proposed system for different image pixel sizes. ...
In this paper, we present a novel cryptographic system that integrates Quantum Key Distribution (QKD) with classical encryption techniques to secure steganographic images. Our approach leverages the E91 QKD protocol to generate a shared secret key between communicating parties, ensuring the highest level of security against eavesdropping through the principles of quantum mechanics. This key is then hashed using the Secure Hash Algorithm (SHA) to provide a fixedlength, high-entropy key, which is subsequently utilized in symmetric encryption. We explore the use of AES (Advanced Encryption Standard) algorithms for encrypting steganographic images, which hide sensitive information within digital images to provide an additional layer of security through obscurity. The combination of QKD, hashing, and symmetric encryption offers a robust security framework that mitigates various attack vectors, enhancing the confidentiality and integrity of the transmitted data. Our experimental results demonstrate the feasibility and efficiency of the proposed system, highlighting its performance in terms of key generation rates, encryption/decryption speeds, and the computational overhead introduced by the hashing and steganographic processes. By integrating quantum and classical cryptographic methods with steganography, this work provides a comprehensive security solution that is highly resistant to both quantum and classical attacks, making it suitable for applications requiring stringent security measures. This paper contributes to the ongoing research in cryptographic systems, offering insights into the practical implementation and potential benefits of hybrid quantumclassical security protocols.
... The generated series of numbers provides the illusion of being completely randomized [19]. Due to extensive years of research being invested in developing and improvising various PRNG algorithms, programs that deploy these algorithms can sometimes replicate the true random sequences [20]. However, there is always room for improvement since these number sequences are never truly in random nature. ...
Cryptography is a technique to secure data transmissions and ensure confiden-tiality, authenticity and integrity of data exchanged over the digital networks by utilizing mathematical algorithms to transform the plain text (original message) to cipher text (encrypted message) using a key or seed value. The general con-sensus regarding the use of non-deterministic true random numbers (TRN) which are generated from the physical environment such as entropy keys, at-mospheric noise, as a public or private key has received limited encour-agement due to the demanding hardware requirements needed to extract the necessary data from the environment. Therefore, this research aims at design-ing and developing a lightweight program to generate a true random number (TRNG) key using live audio recordings which is further randomized using system date and time. These TRNs can be used to replace the deterministic pseudo random number cryptographic keys that are presently used by indus-tries for a symmetric key encryption algorithm which devolves the algorithm to being conditionally secured. Using the audio based TRNG key would render the same encryption algorithm as unconditionally secured.
... Nowadays, multiple methods of encryption and decryption are used, and the majority of these algorithms are based on standard DES (Data Encryption Standard), 3DES, AES, and Blowfish (BF) methods [15][16][17][18]. The above-mentioned standard methods have similar encryption and decryption mechanisms. ...
Standard methods used in the encryption and decryption process are implemented to protect confidential data. These methods require many arithmetic and logical operations that negatively affect the performance of the encryption process. In addition, they use private keys of a specific length, in addition to the fixed length of the data block used in encryption, which may provide the possibility of penetration of these methods, thus decreasing the level of security. In this research paper, a new method of digital image cryptography is introduced. This method is based on using a color image as an image_key to generate a sophisticated matrix private key (MPK) that cannot be hacked. The proposed method uses an initial state to set the required parameters, with secret information needed to generate the private key. The data-block size is variable, and the complicity of the MPK depends on the number of selected rounds and the data-block size. The proposed method is appropriate for publication in Symmetry because it employs a symmetrical complex matrix key to encrypt and decrypt digital images. The proposed method is simple yet very efficient in terms of throughput and scalability. The experiments show that the proposed method meets the quality requirements and can speed up the encryption–decryption process compared with standard methods, including DES, 3DES, AES, and Blowfish.
... Input file and encrypted file are same in size. Required time by this method is also less than the time required by some methods such as zigzag rule, simple encryption/decryption application [4,5]. ...
This paper presents an ASCII based Encryption/Decryption application that is applicable to any type of files; for example: image files, data files, documentation files, audio files, video files etc. It introduces a method of encryption by translating ASCII value of characters of the file opened in binary mode. ASCII value of every character of the file is translated by an integer which is generated irregularly from the key. Size of the encrypted file remains same as original file and required time is also very less.
... The generated series of numbers provides the illusion of being completely randomized [19]. Due to extensive years of research being invested in developing and improvising various PRNG algorithms, programs that deploy these algorithms can sometimes replicate the true random sequences [20]. However, there is always room for improvement since these number sequences are never truly in random nature. ...
Cryptography is a technique to secure data transmissions and ensure confiden- tiality, authenticity and integrity of data exchanged over the digital networks by utilizing mathematical algorithms to transform the plain text (original message) to cipher text (encrypted message) using a key or seed value. The general con-sensus regarding the use of non-deterministic true random numbers (TRN) which are generated from the physical environment such as entropy keys, at-mospheric noise, etc., as a public or private key has received limited encour-agement due to the demanding hardware requirements needed to extract the necessary data from the environment. Therefore, this research aims at design-ing and developing a lightweight program to generate a True Random Number (TRNG) key using live audio recordings which is further randomized using system date and time. These TRNs can be used to replace the deterministic pseudo random number cryptographic keys that are presently used by indus-tries for a symmetric key encryption algorithm which devolves the algorithm to being conditionally secured. Using the audio based TRNG key would render the same encryption algorithm as unconditionally secured.
... The goal of the Encryption process is to protect the data from un authorized people. Encryption occurs when the data is passed through some substitute technique, shifting technique, table references or mathematical operations [8]. ...
In modern security models, cryptography plays a fundamental role in protecting data integrity and confidentiality in information systems. However, cryptography itself is subject to cryptanalysis attacks. To reduce the cryptanalysis attack risk Encryption/Decryption application is presents in this paper. Encryption involves several processes which is implemented in reverse order in decryption , this method ensure make hard to intruder to guess the true sequences to solve encrypted message .The algorithm involves substitution ,shifting , and folding , these process will be implemented in reverse order in decryption causes a confusion for intruder who does not know the right sequence of the algorithm. Encryption key is dynamic and generated independently for each text depending on the length of the message to be encrypted and Practical because there is no need to exchange encryption keys between sender and receiver cause the receiver knowing how to generate them. As a result, the proposed system diffusion is accomplished by using folding algorithm which rearrange the character of the message after encryption in such away that the frequency of characters will not be appear clearly. Confusion also is performed by using several keys for the same message each key should consist of 2 digits then each digit is used alone with single letter of plaintext then the remaining encryption keys used sequentially according to their generating sequence. For a small amount of data this algorithm will work very smoothly and quickly.
... The goal of the Encryption process is to protect the data from un authorized people. Encryption occurs when the data is passed through some substitute technique, shifting technique, table references or mathematical operations [8]. ...
In modern security models, cryptography plays a fundamental role in protecting data integrity and confidentiality in information systems. However, cryptography itself is subject to cryptanalysis attacks. To reduce the cryptanalysis attack risk Encryption/Decryption application is presents in this paper. Encryption involves several processes which is implemented in reverse order in decryption , this method ensure make hard to intruder to guess the true sequences to solve encrypted message .The algorithm involves substitution ,shifting , and folding , these process will be implemented in reverse order in decryption causes a confusion for intruder who does not know the right sequence of the algorithm. Encryption key is dynamic and generated independently for each text depending on the length of the message to be encrypted and Practical because there is no need to exchange encryption keys between sender and receiver cause the receiver knowing how to generate them. As a result, the proposed system diffusion is accomplished by using folding algorithm which rearrange the character of the message after encryption in such away that the frequency of characters will not be appear clearly. Confusion also is performed by using several keys for the same message each key should consist of 2 digits then each digit is used alone with single letter of plaintext then the remaining encryption keys used sequentially according to their generating sequence. For a small amount of data this algorithm will work very smoothly and quickly.
... sender + ":" + msg); context.sendBroadcast(in); To encrypt the transmitted messages between monitoring server and object XOR encryption [12] is used. To prevent sending special characters which may result in some errors, the encrypted message will be padded by value 96 which represents small 'a' character in ASCII. ...
There are many objects in various fields such as transportation, industry and health that have to be tracked. In this paper, the current location of anobject is monitored by the monitoring server. System consists of two devices work on environment of android. Object device receives the data of current location from the satellite through the sensor which is included inside the device while the monitoring server device queries the current location of presence of the object by sending a request through the GSM network to the object's device and after confirming authenticity of the sender, object transmit the current location of a device after encrypting it. The monitoring server program relies on Google map tool to show the current object location on the map.
... Encryption occurs when the data is passed through some substitute technique, shifting technique, table references or mathematical operations [3]. The process generates a different form of code. ...
Nowadays cryptography plays a major role in information security because encryption and decryption is very hard to crack. Data encryption and decryption fulfill these demands. Many researchers have proposed many encryption and decryption algorithms such as AES, DES, RSA, and others. But most of the proposed algorithms encountered some problems such as lack of robustness and significant amount of time added to packet delay to maintain the security on the communication channel between the terminals. In this paper, we enhance the security goals via encrypting and decrypting phone numbers by using a set of packs which maintains the security on the communication channels. In encryption we assign numbers for the set of packs and we convert the decimal to hexadecimal to encrypt the data and to decrypt vice versa. © 2015, International Journal of Pharmacy and Technology. All rights Reserved.
... In Paper [13], researchers suggest an efficient encryption technique based on transposition and substitution ciphers. Reversible lossless audio encryption is yet a dream to be fulfilled. ...
This research paper introduces a novel symmetric key encryption algorithm based on the Extended MSA (Modified Substitution Algorithm) method. The proposed algorithm aims to enhance data security by generating a random key matrix and applying various randomization techniques to it. The key generation process involves selecting a text key of up to 16 characters, calculating randomization and encryption numbers based on the key, and generating a 256x256x2 random key matrix. Randomization techniques such as cycling, up shift, right shift, down shift, and left shift are applied sequentially to each block of the key matrix to increase randomness. The encryption process involves encrypting data using the randomized key matrix based on specific cases of character positions. Additionally, the decryption process is described, which reverses the encryption steps. The proposed algorithm demonstrates promising results in terms of security and efficiency.
The use of cryptography is essential to ensure confidential communication across networks. Concerns about the safety of digital data as a result of its fast expansion has increased the need for the development of more sophisticated methods of cryptography. Cryptography is a procedure that rearranges and replaces content inside the information in order to scramble it, making it unintelligible to anybody other than the person who is capable of deciphering it. This becomes cryptography a sort of information security. This process is known as encoding. Cryptanalysis, sometimes known as “breaking the code,” refers to the process of deciphering a communication even when the decipherer has no idea how the information was encrypted in the first place. The use of encryption is no longer restricted to just textual information. There are algorithms for a variety of data types, including images, audio, and video, amongst others. A few of the criteria that are considered while evaluating cryptographic algorithms are throughput, speed, CPU time, battery power consumption, and memory requirements. In this work, an investigation into many commonly used algorithms like as RC6, RC4, ThreeFish, Twofish, Blowfish, AES, 3DES, and DES is carried out on the aforementioned parameters in order to locate the most effective solution. This work’s objective is to provide a comprehensive introduction to a few of the already – present cryptographic approaches and their respective work quality for a wide variety of data types, with a particular emphasis on audio file encryption.KeywordsCryptographySecurityEncryptionDecryptionCiphersCryptanalysisCryptographic algorithmAudio file encryption
In this paper, we are using Dynamic key dependent AES algorithm and standard AES (Advanced Encryption Standards) to encrypt and decrypt audio file. To analysis the quality of algorithms both algorithms are successfully tested using histogram analysis, peak signal to noise ratio (PSNR), correlation analysis and entropy.
The process of protecting the accessibility, reliability, and secrecy of information is called Information security. We see a great increase in accessing of computer databases for stored information. Increasing number of companies are storing individual and business information on computers. Most of this information is not meant for the public eyes and is very sensitive. The following paper discusses the development of a block cipher based cryptographic algorithm that uses the logical gates like XOR and other shifting operations. The results of the experiment prove the algorithm to be efficient and secure.
The present title discloses novel concept for high speed computing using essentials of Ancient Indian Vedic Mathematics, modified and implemented using VLSI-FPGA architecture for best performance. The proposed architecture aims to define highly optimized multiplier unit which allows the highly intensive units of Signal Processing, Image Processing, Data Encryption/ Decryption and most other techniques to work at full pelt. To stand at, the title is configured using Hardware Description Language (HDL) around high performance Virtex/ Kintex Series Field Programmable Gate Arrays (FPGA). After implementation the statistical data is analyzed using Synthesis and PAR using Xilinx ISE. The proposed architecture is executed at 1 MHz Frequency and concurrent architecture is developed for 2-bit, 4-bit, 8-bit, 16-bit and 32-bit.
The demand for adequate security to electronic data system grows high over the decades. Security is the one of the biggest concern in different type of networks. Due to diversify nature of network, security breaching became a common issue in different form of networks. Solutions for network security comes with concepts like cryptography in which distribution of keys have been done. Encryption and key generation became a vital tool for preventing the threats to data sharing and tool to preserve the data integrity so we are focusing on security enhancing by enhancing the level of encryption in network. This study " s main goal is to reflect the importance of security in network and provide the better encryption technique for currently implemented encryption techniques in simple and powerful method. In our research we have proposed a modular 37 and select any number and calculate inverse of the selected integer using modular 37. The symmetric key distribution should be done in the secured manner. Also, we examine the performance of our new SSK algorithm with other existing symmetric key algorithm.
In the race towards the pinnacle of evolution and development, few things have come out on top and become the crucial weapon or path towards success. Information is one such thing. With the increased importance & plausible struggles over the accumulation of information to secure dominance & success, the concept of Information Security has emerged. Information Security is the process of protecting the information from unauthorized access and/or damage or misuse. Cryptography techniques are used for the purpose of making the exchange of information secure and confidential. It converts the sensitive information into a form which can't be understood by the unintended individuals. In this paper, we have tried to come up with a new algorithm which can be put to use for cryptographic purposes. The proposed algorithm is simple yet robust and will prove hard to crack unless one is not familiar with its inner workings.
Assigning ASCII values to the plaintext alphabets during transmission of documents is very common, and as we know that the ASCII value of 'a' is less than that of 'z'. But, what would happen if the document contains more 'z' as compared to 'a'. In that case, achieving security through encryption - decryption and compression is very difficult. This paper proposes a technique of assigning codes to plain text alphabets, based on the frequency of occurrences of those alphabets by using ant colony optimization with roulette wheel selection algorithm, so that security in code generation could be achieved. Obtained codes are then applied over a particular encryption algorithm such that the cipher text generated should contain those alphabets only whose code values are near about similar to that of plain text alphabets, in order to achieve compression simultaneously. Getting all this within specified time constraint makes this paper more impressive.
Elliptic curves cryptography (ECC) algorithm is well-known powerful approach of implementing public key cryptography created by Victor Miller and Neil Koblitz. ECC is a modular arithmetic based algorithm that includes modular inversion operation in its computation, which is considered as one of the heaviest operations that can be performed by the coprocessor. Implementing ECC with projective coordinates avoided the use of inversion by replacing it with a number of parallel multiplications. A parallel hardware scheduling of ECC based Edward's projective coordinates over prime finite field (GF (p)) will be studied in this paper to perform ECC doubling operation by using parallel hardware units. The analysis showed that parallelizing Edward's projective coordinates enhanced the performance factor by even three times over the serial design as it gives a considerable enhancement for the security against power/time attacks.
Secured communication across the world in the information domain is of at most importance when many languages, several alphabets and various signs (glyphs) found their existence. Data in the form of symbolic (text) representation is the basis for the present work. For any cryptographic Process the two main parameters used are the algorithm and the key. Existing cryptographic systems divide the text into words and each word into characters where character is treated as basic unit. For each character, the corresponding bit stream is generated .The cryptographic system encrypts the bit stream and this bit stream represents a set of characters. The transformation of characters is the basis for the security system. While encrypting our emphasis is to retrieve the characters back from the transformed text. The frequency distribution of characters in the original text is reflected up to some extent in the transformed text. The complexity that is involved in the form of frequency distribution is the parameter that is addressed .But if the underlying language is highly complex then it may be difficult to determine a particular message . In fact the structure and complexity of the underlying language is an extremely important factor when trying to assess an attacker's likelihood of success. The unit of information in a given process can be represented in symbolic notation, which may correspond to a language. In case of Indic scripts the basic unit need not correspond to a character. The concept of syllable, which is the representative of a set of characters with their associative combinatorial units is the basis for the formation of text. Syllable formation inherently embedded with the pre defined rules which will be of a major concern for the cryptographic systems. The commonality among all Indic scripts is associated with syllable and at the same time the differences are found with the combinatorial system. A syllable is a set of character codes of varying size where the complexity is in terms of machine and human understandable characteristics are different. The frequency distribution of these characters in the language differs from one language to other. The transformation of these characters can be treated as a basis for any crypto analysis. The frequency distribution of characters of any script plays an important role in this process. This paper proposes a noval approach for the security of Indic scripts in terms of script complexity as a parameter, with a case study on Telugu.
An important and challenging problem is that of tracing DOS/DDOS attack source. Among many IP Traceback schemes, a recent development is DGT (Directed Geographical Traceback). Though multidirectional two dimensional DGT schemes are available, in the real scenario, three dimensional, Multidirectional DGT has potential applications. The direction ratio algorithm[DRA] has the limitation of the impossibility of ensuring sufficient unused space in the packet header for the complete DRL (Direction Ratio List) especially when the length of the path is not known apriori. In this paper that limitation is overcome using DRSA(Direction Ratio Sampling Algorithm) which works well for Three dimensional, Multi-Directional, Geographical IP traceback. This approach enables the attack path reconstruction easily possible. In conclusion, DRSA is a robust scheme of attack path reconstruction in geographical traceback.
The Data Encryption Standard (DES) was developed by an IBM team around 1974 and adopted as a national standard in 1977. Since that time, many cryptanalysts have attempted to find shortcuts for breaking the system. In this paper, we examine one such attempt, the method of differential cryptanalysis, published by Biham and Shamir. We show some of the safeguards against differential cryptanalysis that were built into the system from the beginning, with the result that more than 1015 bytes of chosen plaintext are required for this attack to succeed.