Results 121 to 130 of about 1,123 (152)
Some of the next articles are maybe not open access.
2017 12th International Conference on Computer Engineering and Systems (ICCES), 2017
Among the different cryptosystems, the Public Key Cryptosystems (PKCS) are of great usage and are used in many applications. Most of the current PKCS are based on a hard problem making the cryptanalysis of such cipher infeasible given the current computing and memory availability.
Ayman Wagih Mohsen +2 more
openaire +1 more source
Among the different cryptosystems, the Public Key Cryptosystems (PKCS) are of great usage and are used in many applications. Most of the current PKCS are based on a hard problem making the cryptanalysis of such cipher infeasible given the current computing and memory availability.
Ayman Wagih Mohsen +2 more
openaire +1 more source
Performance Characterization of Lattice-Based Cryptography Workloads
2020 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), 2020In the domain of lattice cryptography, an emerging field of post-quantum secure cryptography, very few accelerator designs exist that both sufficiently accelerate a particular lattice cryptosystem and provide enough flexibility to accommodate a variety of cryptographic schemes.
Deepika Natarajan, Ronald G. Dreslinski
openaire +1 more source
Proof of a Shuffle for Lattice-Based Cryptography
2017In this paper we present the first proof of a shuffle for lattice-based cryptography which can be used to build a universally verifiable mix-net capable of mixing votes encrypted with a post-quantum algorithm, thus achieving long-term privacy. Universal verifiability is achieved by means of the publication of a non-interactive zero knowledge proof of a
Núria Costa +2 more
openaire +1 more source
Lattice-Based Cryptography and NTRU
2021With the publication of Peter Shor’s seminal paper that factoring and discrete log computations would be entirely feasible on a quantum computer, and with advances in the building of quantum computers, there has been a focus on what is referred to as “post-quantum cryptography”.
openaire +1 more source
Towards Efficient Lattice-Based Cryptography
2011In der Kryptographie ist eine der wesentlichen Aufgaben die Suche nach schweren Instanzen eines Berechnungsproblems, von dem man weiß, dass es im Worst-Case schwer ist. In der Gitterkryptographie sind wir in der einzigartigen Situation, einen Weg gefunden zu haben wie man zufällige Instanzen auswählt, die mindestens genauso schwer wie wohluntersuchte ...
openaire +2 more sources
Efficient arithmetic for lattice-based cryptography
Proceedings of the Twelfth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis Companion, 2017Lattice-based cryptography is a promising family of post quantum algorithms. Contrary to other approaches, lattice-based primitives are extremely versatile and allow the realisation of several essential cryptographic primitives, such as encryption and digital signatures.
Elizabeth O'Sullivan +1 more
openaire +1 more source
Improvement of Lattice-Based Cryptography Using CRT
2010In this paper, we first critically analyze two existing lattice-based cryptosystems, namely GGH and Micciancio, and identify their drawbacks. Then, we introduce a method for improving the implementation of GGH using the Chinese Remainder Theorem (CRT). Furthermore, we also propose another cryptosystem optimized for CRT, drawing on the strengths of both
Thomas Plantard, Mike Rose, Willy Susilo
openaire +1 more source
Practice-Oriented Techniques in Lattice-Based Cryptography
2020In today’s computerised world, billions of people rely heavily on security systems that protect a tremendous amount of sensitive information ranging from banking information to government secrets. The algorithms currently used in such systems rely on classical cryptographic assumptions that do not provide security against powerful quantum computers. In
openaire +1 more source
Gaussian sampling in lattice-based cryptography
Le Gaussian sampling dans la cryptographie sur les réseaux euclidiens Bien que relativement récente, la cryptographie à base de réseaux euclidiens s’est distinguée sur de nombreux points, que ce soit par la richesse des constructions qu’elle permet, par sa résistance supposée à l’avènement des ordinateursquantiques ou par la rapidité ...openaire +2 more sources

