A timing attack on a cryptosystem allows the attacker to deduce the secret key information based on the timing differences with respect to different inputs given to an encryption or decryption algorithm. Cryptosystems can take variable amounts of time to process due to performance optimizations in software, branching or conditional...
Modern cryptanalysis is generally based on the mathematical theory. However, side-channel analysis has become increasingly popular recently. The benefit of side-channel cryptanalysis is due to the fact that performers can mount attacks with low costs in terms of time and equipment and are highly successful in extracting useful results. The...
This paper discusses Java Bytecode Obfuscation techniques that make the reverse engineering task more difficult. This paper is structured as follows: Java virtual machine and Java language specifications are discussed first. Then the paper talks about different techniques for protecting software and then details one promising approach named Obfuscation. The...
Random number generation is important in many fields today. It is particularly important in the field of cryptography when generating nonce values, cryptographic keys, and other data required in many cryptographic applications. The proliferation of small, handheld devices that are typically connected to large networks via a wireless connection requires...
In recent years, the elliptic curve cryptosystems (ECC) have received attention
due to their increased security with smaller key size which brings the advantage of less
storage area and less bandwidth. Elliptic curve cryptography provides a methodology
for obtaining high-speed, efficient, and scalable implementations of network security
protocols. In addition...
In this thesis, we study the Karatsuba-Ofman Algorithm (KOA), which is a recursive multi-precision multiplication method, and improve it for certain special applications. This thesis is in two parts. In the first part, we derive an efficient algorithm from the KOA to multiply the operands having a precision of 2[superscript...
As the information-processing and telecommunications revolutions now underway will continue to change our life styles in the rest of the 21st century, our personal and economic lives rely more and more on our ability to transact over the electronic medium in a secure way. The privacy, authenticity, and integrity of...
During the last few years we have seen formidable advances in digital and mobile
communication technologies such as cordless and cellular telephones, personal
communication systems, Internet connection expansion, etc. The vast majority
of digital information used in all these applications is stored and also processed
within a computer system, and...
We describe novel methods for obtaining fast software implementations of the arithmetic operations in the finite field GF(p) and GF(p[superscript k]). In GF(p) we realize an extensive speedup in modular addition and subtraction routines and some small speedup in the modular multiplication routine with an arbitrary prime modulus p which...