Results 111 to 120 of about 23,629,022 (284)

Lattice Based Cryptography GGH & NTRU [PDF]

open access: yes
Developing computer processors and quantum computers requires continuous development of cryptographic algorithms. Researchers in standardization organizations keep experimenting with cryptographic algorithms and the related key sizes to recommend best ...
Soufi, Rasem
core  

Sub‐nm2 Ferroelectric Domains via Charged 180° Walls in ZrO2

open access: yesAdvanced Materials, EarlyView.
Ferroelectric ZrO2${\rm ZrO}_2$ thin films host closely spaced charged 180∘$^{\circ }$ domain walls that vertically compress polar domains beyond their lateral half‐unit‐cell limit. These head‐to‐head and tail‐to‐tail walls show distinct bulk‐like structures, natural oxygen‐mediated stabilization, and highly asymmetric mobility, highlighting new ...
Nashrah Afroze   +33 more
wiley   +1 more source

RNS-Based NTT Polynomial Multiplier for Lattice-Based Cryptography

open access: yes, 2020
: Lattice-based Cryptography is an up and coming field of cryptography that utilizes the difficulty of lattice problems to design lattice-based cryptosystems that are resistant to quantum attacks and applicable to Fully Homomorphic Encryption schemes ...

core  

LEAP: High-Performance Lattice-Based Pseudorandom Number Generator

open access: yesIACR Transactions on Symmetric Cryptology
At EUROCRYPT2012, Banerjee, Peikert, and Rosen introduced Ring Learning With Rounding (RLWR) problem and constructed lattice-based pseudorandom functions for the first time.
Yu Zhang   +4 more
doaj   +1 more source

FPGA multi-unit parallel optimization and implementation of post-quantum cryptography CRYSTALS-Kyber

open access: yesTongxin xuebao, 2022
In lattice-based post-quantum cryptography, polynomial multiplication is complicated and time-consuming.In order to improve the computational efficiency of lattice cryptography in practical applications, an FPGA multi-unit parallel optimization and ...
Bin LI   +3 more
doaj  

Some Recent Progress in Lattice-Based Cryptography [PDF]

open access: yes, 2009
The past decade in computer science has witnessed tremendous progress in the understanding of lattices , which are a rich source of seemingly hard computational problems. One of their most promising applications is to the design of cryptographic schemes that enjoy exceptionally strong security guarantees and other desirable properties. Most notably,
openaire   +2 more sources

Efficient in‐Plane Exciton Transport in a Discontinuous Layered Lead‐Bromide Perovskite

open access: yesAdvanced Materials, EarlyView.
A new class of two‐dimensional lead‐bromide perovskite based on monovalent 4‐aminomethylbenzoic acid cations is presented, featuring a discontinuous inorganic layer. Despite the discontinuous lattice, transient photoluminescence microscopy demonstrates efficient though strongly anisotropic in‐plane exciton transport.
Raquel Utrera‐Melero   +9 more
wiley   +1 more source

Breaking Bottlenecks in Solid Electrolyte Discovery With Large Artificial Intelligence Models

open access: yesAdvanced Materials, EarlyView.
Large AI models are presented as a route to break key bottlenecks in solid electrolyte discovery by linking materials databases, machine‐learning interatomic potentials, large language models, and autonomous experiments. This perspective highlights how AI can accelerate the identification of solid electrolytes with fast ion transport, stable interfaces,
Eric Jianfeng Cheng   +24 more
wiley   +1 more source

A Highly-efficient Lattice-based Post-Quantum Cryptography Processor for IoT Applications

open access: yesTransactions on Cryptographic Hardware and Embedded Systems
Lattice-Based Cryptography (LBC) schemes, like CRYSTALS-Kyber and CRYSTALS-Dilithium, have been selected to be standardized in the NIST Post-Quantum Cryptography standard.
Zewen Ye   +5 more
doaj   +1 more source

Notes on Lattice-Based Cryptography

open access: yes, 2022
Asymmetrisk kryptering er avhengig av antakelsen om at noen beregningsproblemer er vanskelige å løse. I 1994 viste Peter Shor at de to mest brukte beregningsproblemene, nemlig det diskrete logaritmeproblemet og primtallsfaktorisering, ikke lenger er vanskelige å løse når man bruker en kvantedatamaskin. Siden den gang har forskere jobbet med å finne nye
openaire   +1 more source

Home - About - Disclaimer - Privacy