• Corpus ID: 52260412

Public-key Cryptography on SIMD Mobile Devices

@inproceedings{Martins2014PublickeyCO,
  title={Public-key Cryptography on SIMD Mobile Devices},
  author={A. S. Martins},
  year={2014}
}
The acceleration of cryptographic applications on embedded devices is a topic of increasingly importance, due to their massive use. In this thesis, the efficiency of embedded devices when operating as cryptographic accelerators is evaluated. Single Instruction Multiple Data (SIMD) parallelism, in complement to multithreading parallelism, is exploited, as an efficient and broadly available approach, to accelerate cryptographic operations. Firstly, the throughput of modular multiplications is… 

References

SHOWING 1-10 OF 60 REFERENCES
SIMD acceleration of modular arithmetic on contemporary embedded platforms
TLDR
This contribution proposes vector processing techniques to accelerate modular multiplications in prime fields in ECC, and demonstrates implementations for the Venom (NEON) coprocessor in Qualcomm's Scorpion (ARM) CPU, as well as for the SSE2 instruction-set extensions in Intel's Atom CPU.
Elliptic Curve point multiplication on GPUs
  • S. Antão, J. Bajard, L. Sousa
  • Computer Science
    ASAP 2010 - 21st IEEE International Conference on Application-specific Systems, Architectures and Processors
  • 2010
TLDR
This paper proposes a parallel algorithm for Elliptic Curve (EC) point multiplication in order to compute EC cryptography on GPUs using the Residue Number System to extract parallelism on high precision integer arithmetic.
Exponentiation Cryptosystems on the IBM PC
  • P. Comba
  • Computer Science
    IBM Syst. J.
  • 1990
TLDR
A mixed system that combines the superior key management capabilities inherent in public key cryptosystems with the much higher bulk-encryption speed obtainable with the Data Encryption Algorithm is discussed.
Efficient Units for Data Processing and Cryptography
TLDR
The proposed structure is capable of calculating point multiplica tion and addition using only one coordinate to contain the point information, allowing for a better usage of bandwidth resources.
Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs
TLDR
To accelerate multiple-precision multiplication, a new algorithm to reduce the number of memory accesses is proposed and implemented elliptic curve point multiplication for 160-bit, 192- bit, and 224-bit NIST/SECG curves over GF(p), RSA-1024 and RSA-2048 on two 8-bit microcontrollers.
Parallel cryptographic arithmetic using a redundant Montgomery representation
  • D. Page, N. Smart
  • Computer Science, Mathematics
    IEEE Transactions on Computers
  • 2004
TLDR
It is shown that an SIMD parallel implementation of RSA can be around twice as fast as traditional sequential code, especially useful given the larger 2,048 bit RSA keys which are now being proposed for standard security levels.
Elliptic Curve Arithmetic Using SIMD
TLDR
Two techniques for parallel computing with SIMD are proposed, which significantly enhances the speed of elliptic curve scalar multiplication and one of them is evaluated based on a real implementation on a Pentium III, which incorporates the SIMD architecture.
Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor
TLDR
A description of the techniques employed at Oxford University to obtain a high speed implementation of the RSA encryption algorithm on an "off-the-shelf" digital signal processing chip and the techniques of algorithm development employed lead to a provably correct implementation.
Cox-Rower Architecture for Fast Parallel Montgomery Multiplication
TLDR
The main contribution of this paper is to provide a new RNS base extension algorithm, which can be adapted to an existing standard radix interface of RSA cryptosystem.
a full RNS implementation of RSA
We present the first implementation of RSA in the residue number system (RNS) which does not require any conversion, either from radix to RNS beforehand or RNS to radix afterward. Our solution is
...
1
2
3
4
5
...