Results 1 to 10 of about 1,334 (253)

Portable Implementation of Lattice-Based Cryptography Using JavaScript

2015 Third International Symposium on Computing and Networking (CANDAR), 2015
Lattice-based cryptography has attracted a high degree of attention in the cryptologic research community. It is expected to be in wide use in the foreseeable future once large quantum computers are in sight. In addition, JavaScript is a standard programming language for Web applications. It is now supported on a wide variety of computing platforms and
Ye Yuan 0005, Chen-Mou Cheng, Shinsaku Kiyomoto, Yutaka Miyake, Tsuyoshi Takagi   +4 more
openaire   +3 more sources

LEAP: High-Performance Lattice-Based Pseudorandom Number Generator

IACR 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, Xianhui Lu, Yijian Liu, Yongjian Yin, Kunpeng Wang   +4 more
doaj   +1 more source

Some Recent Progress in Lattice-Based Cryptography [PDF]

, 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

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

Transactions 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, Ruibing Song, Hao Zhang, Donglong Chen, Ray Chak-Chung Cheung, Kejie Huang   +5 more
doaj   +1 more source

Notes on Lattice-Based Cryptography

, 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

Extended security of lattice-based cryptography

Sécurité étendue de la cryptographie fondée sur les réseaux Euclidiens La cryptographie fondée sur les réseaux euclidiens représente une alternative prometteuse à la cryptographie asymétrique utilisée actuellement, en raison de sa résistance présumée à un ordinateur quantique universel.
openaire   +2 more sources

Cryptographic Protocols for Blockchain Systems, Including Protocols for Ensuring the Quantum Stability of Blockchain Systems and Platforms

Sci
With the development of quantum computing, classical cryptosystems (RSA, ECDSA) that ensure the security of distributed ledgers face an existential threat. This paper examines protocols for protecting personal data (PD) in blockchain, taking into account
Evgeniya Ishchukova, Kirill Romanenko, Sergei Petrenko, Alexey Petrenko, Alexey Nekrasov   +4 more
doaj   +1 more source

Efficient lattice-based cryptography. [PDF]

This thesis advances practical lattice-based cryptography. We propose Swoosh, a post-quantum non-interactive key exchange analogous to the Diffie–Hellman, requiring fewer communication rounds than currently standardised schemes. We introduce Gandalf, a compact ring signature scheme tailored for small rings, reducing signature sizes by 50%.
openaire   +3 more sources

Implementing Lattice-Based Cryptography

, 2022
The thesis is about implementation of LWE/MLWE encryption schemes in C++ and the use of the Number Theoretic Transform (NTT) in order to get faster mul- tiplication operations over certain rings. We explore how much speed up we get by using NTT in our different schemes, comparing performance of our NTT im- plementation with the MulMod function of the ...
openaire   +1 more source

The condition number associated with ideal lattices from odd prime degree cyclic number fields

Journal of Mathematical Cryptology
The condition number of a generator matrix of an ideal lattice derived from the ring of integers of an algebraic number field is an important quantity associated with the equivalence between two computational problems in lattice-based cryptography, the ...
de Araujo Robson Ricardo
doaj   +1 more source