[图书][B] Cryptanalysis of RSA and its variants
MJ Hinek - 2009 - taylorfrancis.com
Thirty years after RSA was first publicized, it remains an active research area. Although
several good surveys exist, they are either slightly outdated or only focus on one type of …
several good surveys exist, they are either slightly outdated or only focus on one type of …
Quantum-resistant public-key encryption and signature schemes with smaller key sizes
The emergence of new complex technologies, such as cloud and quantum computing, has a
complicated computational structure, which can compromise the security of traditional …
complicated computational structure, which can compromise the security of traditional …
Design of lattice‐based ElGamal encryption and signature schemes using SIS problem
The emerging technologies like quantum computing and cloud computing have a complex
computing power and can break the security of the classical cryptographic constructions …
computing power and can break the security of the classical cryptographic constructions …
On the security of multi-prime RSA
MJ Hinek - Journal of Mathematical Cryptology, 2008 - degruyter.com
Multi-prime RSA is a variant of RSA in which the modulus is the product of more than two
distinct primes. In this work we collect the strongest known algebraic attacks on multi-prime …
distinct primes. In this work we collect the strongest known algebraic attacks on multi-prime …
A lightweight and efficient secure hybrid RSA (SHRSA) messaging scheme with four-layered authentication stack
A Bhattacharjya, X Zhong, X Li - IEEE Access, 2019 - ieeexplore.ieee.org
For virtual private network and LAN-to-LAN tunnel sessions, End-to-End security is the main
constraint in private messaging scenarios. Internet Protocol Security can negotiate new keys …
constraint in private messaging scenarios. Internet Protocol Security can negotiate new keys …
On the security of some variants of RSA
MJ Hinek - 2007 - uwspace.uwaterloo.ca
The RSA cryptosystem, named after its inventors, Rivest, Shamir and Adleman, is the most
widely known and widely used public-key cryptosystem in the world today. Compared to …
widely known and widely used public-key cryptosystem in the world today. Compared to …
Hybrid RSA-based highly efficient, reliable and strong personal full mesh networked messaging scheme
A Bhattacharjya, X Zhong… - International Journal of …, 2018 - inderscienceonline.com
Efficient balancing of privacy and strong authentication in end-to-end (E2E) security
constitutes a challenging task in the field of personal messaging. Since RSA is a ubiquitous …
constitutes a challenging task in the field of personal messaging. Since RSA is a ubiquitous …
A secure hybrid RSA (SHRSA)-based lightweight and efficient personal messaging communication protocol
A Bhattacharjya, X Zhong, J Wang, X Li - Digital Twin Technologies and …, 2020 - Springer
Balancing efficiency, privacy, and security along with strong authentication in the End-to-End
(E2E) communication is a burning issue in personal messaging. Rivest–Shamir–Adleman …
(E2E) communication is a burning issue in personal messaging. Rivest–Shamir–Adleman …
[PDF][PDF] Improved lattice basis reduction algorithms and their efficient implementation on parallel systems
T Bartkewitz, IC Paar - 2009 - Citeseer
We present the first implementation of a full lattice basis reduction for graphics cards.
Existing algorithms for lattice basis reduction on CPUs offer reasonable results concerning …
Existing algorithms for lattice basis reduction on CPUs offer reasonable results concerning …
Full lattice basis reduction on graphics cards
T Bartkewitz, T Güneysu - Research in Cryptology: 4th Western European …, 2012 - Springer
Recent lattice enumeration GPU implementations are very useful to find shortest vectors
within a given lattice but are also highly dependent on a lattice basis reduction that still runs …
within a given lattice but are also highly dependent on a lattice basis reduction that still runs …