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...
A public key cryptosystem allows two or more parties to securely communicate
over an insecure channel without establishing a physically secure channel for key
exchange. The RSA cryptosystem is the most popular public key cryptosystem ever
invented. It is based on the difficulty of factoring large composite numbers. Once the...
Modular multiplication is a mathematical operation fundamental to the RSA cryptosystern,
a public-key cryptosystem with many applications in privacy, security, and authenticity.
However, cryptosecurity requires that the numbers involved be extremely large,
typically ranging from 512-1024 bits in length. Calculations on numbers of this magnitude
are cumbersome and lengthy; this...
Computing eigenpairs of a matrix corresponding to a specific geometry in the complex plane is an important topic in real time signal processing, pattern recognition, spectral analysis, systems theory, radar, sonar, and geophysics. We have studied the matrix sign and matrix sector function iterations to extract the eigenpairs belonging to...
We present the results of embedding a multigrid solver for Poisson's equation
into the parallel 3D Monte Carlo device simulator, PMC-3D. First we compare
the sequential multigrid implementation to the sequential Successive Overrelaxation
(SOR) Monte Carlo code used previously in PMC-3D. Depending on the convergence
threshold, we obtain significant speedups...
Today's computer and network communication systems rely on authenticated and
secure transmission of information, which requires computationally efficient and
low bandwidth cryptographic algorithms. Among these cryptographic algorithms
are the elliptic curve cryptosystems which use the arithmetic of finite fields. Furthermore,
the fields of characteristic two are preferred since they provide...
Computer and network security systems rely on the privacy and authenticity of information, which requires implementation of cryptographic functions. Software implementations of these functions are often desired because of their flexibility and cost effectiveness. In this study, we concentrate on developing high-speed and area-efficient modular multiplication and exponentiation algorithms for...
Three block ciphers are considered to determine how well they can be
implemented on existing superscalar architectures such as the Intel Pentium.
An examination of the Pentium architecture suggests that substantial
performance increases can be achieved if particular rules are followed.
Software libraries are written in high-level C language and...