Exploiting the power of GPUs for asymmetric cryptography

R Szerwinski, T Güneysu - … and Embedded Systems–CHES 2008: 10th …, 2008 - Springer
Abstract Modern Graphics Processing Units (GPU) have reached a dimension with respect
to performance and gate count exceeding conventional Central Processing Units (CPU) by …

ABE squared: accurately benchmarking efficiency of attribute-based encryption

A de la Piedra, M Venema, G Alpár - Cryptology ePrint Archive, 2022 - eprint.iacr.org
Measuring efficiency is difficult. In the last decades, several works have contributed in the
quest to successfully determine and compare the efficiency of pairing-based attribute-based …

Efficient combination of RSA cryptography, lossy, and lossless compression steganography techniques to hide data

OF AbdelWahab, AI Hussein, HFA Hamed… - Procedia Computer …, 2021 - Elsevier
One must compress data prior to sending it to the internet since it helps minimize time and
the cost. The main aim of the essay is to develop and design a systemic and a secure …

Security audit trail analysis using inductively generated predictive rules

HS Teng, K Chen, SC Lu - Sixth Conference on Artificial Intelligence …, 1990 - computer.org
A time-based inductive learning approach to security audit trail analysis is presented. The
approach uses a time-based inductive engine to generate rule-based sequential patterns …

Palmprint verification: an implementation of biometric technology

W Shu, D Zhang - … Conference on Pattern Recognition (Cat. No …, 1998 - ieeexplore.ieee.org
As the important implementation of biometric technology, palmprint verification is one of the
most reliable personal identification methods. In this paper, a new approach to palmprint …

Scalable GF(p) Montgomery multiplier based on a digit–digit computation approach

M Morales‐Sandoval… - IET Computers & Digital …, 2016 - Wiley Online Library
This study presents a scalable hardware architecture for modular multiplication in prime
fields GF (p). A novel iterative digit–digit Montgomery multiplication (IDDMM) algorithm is …

A scalable and systolic architectures of montgomery modular multiplication for public key cryptosystems based on dsps

A Mrabet, N El-Mrabet, R Lashermes… - Journal of Hardware and …, 2017 - Springer
The arithmetic in a finite field constitutes the core of public key cryptography like RSA, ECC
or pairing-based cryptography. This paper discusses an efficient hardware implementation …

A novel accelerated implementation of RSA using parallel processing

A Rawat, K Sehgal, A Tiwari, A Sharma… - Journal of Discrete …, 2019 - Taylor & Francis
Past research has evidently proved that public key cryptosystems are usually slower than
symmetric key cryptosystems due to the reason that they use one additional cryptographic …

SMSS: Secure member selection strategy in federated learning

K Zhao, W Xi, Z Wang, J Zhao, R Wang… - IEEE Intelligent …, 2020 - ieeexplore.ieee.org
Data security and user privacy-issue have become an important field. As federated learning
(FL) could solve the problems from data security and privacy-issue, it starts to be applied in …

Parallelization of radix-2 Montgomery multiplication on multicore platform

J Han, S Wang, W Huang, Z Yu… - IEEE transactions on very …, 2013 - ieeexplore.ieee.org
Montgomery multiplication is the kernel operation in public key ciphers. Aiming at parallel
implementation of Montgomery multiplication, this brief presents an improved task …