Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleSeptember 2024
CSAIL2019 Crypto-Puzzle Solver Architecture
ACM Transactions on Reconfigurable Technology and Systems (TRETS), Volume 17, Issue 3Article No.: 44, Pages 1–32https://doi.org/10.1145/3639056tThe CSAIL2019 time-lock puzzle is an unsolved cryptographic challenge introduced by Ron Rivest in 2019, replacing the solved LCS35 puzzle. Solving these types of puzzles requires large amounts of intrinsically sequential computations, with each iteration ...
- research-articleSeptember 2024
Implementing Montgomery Multiplication to Speed-Up the Computation of Modular Exponentiation of Multi-Bit Numbers
Cybernetics and Systems Analysis (KLU-CASA), Volume 60, Issue 5Pages 826–833https://doi.org/10.1007/s10559-024-00720-4AbstractA comparison and analysis of using the developed software implementation of the MontgomeryArithmetic class for computing modular exponentiation are conducted. The performance speed of the developed Montgomery modular multiplication is compared to ...
- research-articleFebruary 2023
CSAIL2019 Crypto-Puzzle Solver Architecture
FPGA '23: Proceedings of the 2023 ACM/SIGDA International Symposium on Field Programmable Gate ArraysPages 197–207https://doi.org/10.1145/3543622.3573184The CSAIL2019 time-lock puzzle is an unsolved cryptographic challenge introduced by Ron Rivest in 2019, replacing the solved LCS35 puzzle. Solving these types of puzzles requires large amounts of intrinsically sequential computations (i.e. computations ...
- research-articleNovember 2021Best Paper
On the (In)Security of ElGamal in OpenPGP
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications SecurityPages 2066–2080https://doi.org/10.1145/3460120.3485257Roughly four decades ago, Taher ElGamal put forward what is today one of the most widely known and best understood public key encryption schemes. ElGamal encryption has been used in many different contexts, chiefly among them by the OpenPGP standard. ...
- research-articleJanuary 2021
Robust and provable secure three-factor mutual authentication scheme using a smart card
International Journal of Internet Technology and Secured Transactions (IJITST), Volume 11, Issue 5-6Pages 470–493https://doi.org/10.1504/ijitst.2021.117418The best solution to perform remote authentication verification is offered by the authentication scheme that opts a smart card. Such schemes are developed by using the combination of password and biometric identity. Biometric-based authentication schemes ...
-
- research-articleJanuary 2020
A secured modular exponentiation for RSA and CRT-RSA with dual blinding to resist power analysis attacks
International Journal of Information and Computer Security (IJICS), Volume 12, Issue 2-3Pages 112–129https://doi.org/10.1504/ijics.2020.105187Blinding has been one of the most effective approaches to resist power analysis attacks on asymmetric cryptosystems like RSA. Blinding is similar to masking in symmetric cryptosystems, but masking can be implemented in various ways like Boolean, affine, ...
- research-articleJanuary 2019
Fast and Area Efficient Implementation of RSA Algorithm
Procedia Computer Science (PROCS), Volume 165, Issue CPages 525–531https://doi.org/10.1016/j.procs.2020.01.024AbstractEfficient hardware implementations of public-key cryptosystems have been gaining interest in the past few decades. To achieve the goal, a high frequency as well as low latency Rivest-Shamir-Adleman (RSA) cryptosystem is reported in this paper. To ...
- research-articleJanuary 2018
Securing RSA against power analysis attacks through non‐uniform exponent partitioning with randomisation
IET Information Security (ISE2), Volume 12, Issue 1Pages 25–33https://doi.org/10.1049/iet-ifs.2016.0508This study presents an approach to compute randomised modular exponentiation through non‐uniform exponent partitioning. The exponent has been first partitioned into multiple parts and then shuffled by Fisher Yates method. Thereafter, every partition ...
- research-articleSeptember 2015
High-Throughput Modular Multiplication and Exponentiation Algorithms Using Multibit-Scan–Multibit-Shift Technique
IEEE Transactions on Very Large Scale Integration (VLSI) Systems (ITVL), Volume 23, Issue 9Pages 1710–1719https://doi.org/10.1109/TVLSI.2014.2355854Modular exponentiation with a large modulus and exponent is a fundamental operation in many public-key cryptosystems. This operation is usually accomplished by repeating modular multiplications. Montgomery modular multiplication has been widely used to ...
- ArticleJune 2015
Efficient Modular Exponentiation Based on Multiple Multiplications by a Common Operand
ARITH '15: Proceedings of the 2015 IEEE 22nd Symposium on Computer ArithmeticPages 144–151https://doi.org/10.1109/ARITH.2015.24The main operation in RSA encryption/decryption is the modular exponentiation, which involves a long sequence of modular squarings and multiplications. In this paper, we propose to improve modular multiplications AB, AC which have a common operand. To ...
- ArticleMay 2015
Pushing the Performance Envelope of Modular Exponentiation Across Multiple Generations of GPUs
IPDPS '15: Proceedings of the 2015 IEEE International Parallel and Distributed Processing SymposiumPages 166–176https://doi.org/10.1109/IPDPS.2015.69Multiprocessing modular exponentiation is a key operation in popular encryption schemes such as RSA, but is computationally expensive. Contexts such as handling many secure web connections in a server can demand higher rates of exponent operations than ...
- ArticleMay 2013
Toward Automatic Optimized Code Generation for Multiprecision Modular Exponentiation on a GPU
IPDPSW '13: Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD ForumPages 1700–1707https://doi.org/10.1109/IPDPSW.2013.149Multiprocessing modular exponentiation has a variety of uses, including cryptography, prime testing and computational number theory. It is also a very costly operation to compute. GPU parallelism can be used to accelerate these computations, but to use ...
- ArticleDecember 2012
An efficient key distribution scheme in cloud computing
CLOUDCOM '12: Proceedings of the 2012 IEEE 4th International Conference on Cloud Computing Technology and Science (CloudCom)Pages 557–561https://doi.org/10.1109/CloudCom.2012.6427608Cloud computing is an emerging computing paradigm in which IT resources and capacities are provided as services over the Internet. It also brings forth new challenges for security when clients want to securely outsource the computation of operations to ...
- research-articleAugust 2012
An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
IEEE Transactions on Computers (ITCO), Volume 61, Issue 8Pages 1071–1083https://doi.org/10.1109/TC.2012.84The modular exponentiation on large numbers is computationally intensive. An effective way for performing this operation consists in using Montgomery exponentiation in the Residue Number System (RNS). This paper presents an algorithmic and architectural ...
- ArticleJuly 2012
Software implementation of modular exponentiation, using advanced vector instructions architectures
WAIFI'12: Proceedings of the 4th international conference on Arithmetic of Finite FieldsPages 119–135https://doi.org/10.1007/978-3-642-31662-3_9This paper describes an algorithm for computing modular exponentiation using vector (SIMD) instructions. It demonstrates, for the first time, how such a software approach can outperform the classical scalar (ALU) implementations, on the high end x86_64 ...
- ArticleMay 2012
Generating provable primes efficiently on embedded devices
PKC'12: Proceedings of the 15th international conference on Practice and Theory in Public Key CryptographyPages 372–389https://doi.org/10.1007/978-3-642-30057-8_22This paper introduces new techniques to generate provable prime numbers efficiently on embedded devices such as smartcards, based on variants of Pocklington's and the Brillhart-Lehmer-Selfridge-Tuckerman-Wagstaff theorems. We introduce two new ...
- articleMay 2012
Constant-optimized quantum circuits for modular multiplication and exponentiation
Reversible circuits for modular multiplication Cx%M with x < M arise as components of modular exponentiation in Shor's quantum number-factoring algorithm. However, existing generic constructions focus on asymptotic gate count and circuit depth rather ...
- ArticleApril 2012
Research on Differential Power Analysis Attack on RSA Algorithm
ICEICE '12: Proceedings of the 2012 Second International Conference on Electric Information and Control Engineering - Volume 01Pages 1150–1153Power analysis attacks can recover the secret keys stored in cryptographic hardware devices by analyzing the input and output data combining with cross-correlation between the operation instruction and the power consumption during the cipher processing. ...
- research-articleMarch 2012
Amplitude demodulation-based EM analysis of different RSA implementations
This paper presents a fully numeric amplitude-demodulation based technique to enhance simple electromagnetic analyses. The technique, thanks to the removal of the clock harmonics and some noise sources, allows efficiently disclosing the leaking ...
- ArticleSeptember 2011
On the performance of GPU public-key cryptography
ASAP '11: Proceedings of the ASAP 2011 - 22nd IEEE International Conference on Application-specific Systems, Architectures and ProcessorsPages 133–140https://doi.org/10.1109/ASAP.2011.6043261Graphics processing units (GPUs) have become increasingly popular over the last years as a cost-effective means of accelerating various computationally intensive tasks. We study the particular case of modular exponentiation, the crucial operation behind ...