Results 21 to 30 of about 260,900 (299)
Hermitean (semi) lattices and Rolf’s lattice
Algebra universalis, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cecilia de la Maza, Ana, Moresi, Remo
openaire +4 more sources
The polynomial learning with errors problem and the smearing condition
Journal of Mathematical Cryptology, 2022 As quantum computing advances rapidly, guaranteeing the security of cryptographic protocols resistant to quantum attacks is paramount. Some leading candidate cryptosystems use the learning with errors (LWE) problem, attractive for its simplicity and ...
Babinkostova Liljana +4 more
doaj +1 more source
Sieve algorithms for the shortest vector problem are practical
Journal of Mathematical Cryptology, 2008 The most famous lattice problem is the Shortest Vector Problem (SVP), which has many applications in cryptology. The best approximation algorithms known for SVP in high dimension rely on a subroutine for exact SVP in low dimension.
Nguyen Phong Q., Vidick Thomas
doaj +1 more source
3D Printed Elastomeric Lattices With Embedded Deformation Sensing
IEEE Access, 2020 New durable elastomeric materials are commercially available for 3D printing, enabling a new class of consumer wearable applications. The mechanical response of soft 3D printed lattices can now be tailored for improved safety and comfort by (a ...
Carolyn Carradero Santiago +6 more
doaj +1 more source
Advances in Mathematics, 2006 Revisions in exposition (partly in response to the suggestions of an anonymous referee) including many new figures. Also, Conjecture 1.4 and Theorem 1.5 are replaced by slightly more detailed statements. To appear in Adv. Math.
openaire +3 more sources
International Journal of Mathematics and Mathematical Sciences, 1993 By an Alexandrov lattice we mean a δ normal lattice of subsets of an abstract set X, such that the set of ℒ-regular countably additive bounded measures is sequentially closed in the set of ℒ-regular finitely additive bounded measures on the algebra ...
Albert Gorelishvili
doaj +1 more source
Cryptography, 2018 In this paper, we gave an attack on RSA (Rivest⁻Shamir⁻Adleman) Cryptosystem when φ ( N ) has small multiplicative inverse modulo e and the prime sum p + q is of the form p + q = 2 n k 0 + k 1 , where n is a ...
Pratha Anuradha Kameswari +1 more
doaj +1 more source
Identity-Based Linkable Ring Signatures From Lattices
IEEE Access, 2021 Linkable ring signatures is a useful cryptographic tool for constructing applications such as ones relative to electronic voting (e-voting), digital cashes (e-cashes) as well as cloud computing.
Huy Quoc Le +6 more
doaj +1 more source
Acta Crystallographica Section A Foundations and Advances, 2023 Unit cells are used to represent crystallographic lattices. Calculations measuring the differences between unit cells are used to provide metrics for measuring meaningful distances between three-dimensional crystallographic lattices. This is a surprisingly complex and computationally demanding problem. A review is presented of the current best practice
Lawrence C. Andrews +1 more
openaire +2 more sources