Results 31 to 40 of about 108,370 (316)

Tensor-based trapdoors for CVP and their application to public key cryptography [PDF]

, 1999
We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product.
Jean-Pierre Seifert, Fischlin, Roger, Roger Fischlin, Seifert, Jean-Pierre   +3 more
core   +1 more source

Additive Manufacturing of Smart Footwear Components for Healthcare Applications

Micromachines
Diabetic foot complications pose significant health risks, necessitating innovative approaches in orthotic design. This study explores the potential of additive manufacturing in producing functional footwear components with lattice-based structures for ...
Aravind Kanna Kundumani Janarthanan, Bala Vaidhyanathan   +1 more
doaj   +1 more source

Stone Lattices [PDF]

Formalized Mathematics, 2015
Summary The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the paper, the notion of a pseudocomplement in a lattice is formally introduced in Mizar, and based on this we define the notion of the skeleton and the set of dense elements in a ...
openaire   +3 more sources

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

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

Revocable Ciphertext-Policy Attribute-Based Encryption in Data Outsourcing Systems from Lattices

Jisuanji kexue yu tansuo, 2020
Attribute-based encryption mechanism is widely used in outsourcing environment because of its charac-teristics of “one-to-many” communication. However, users attributes often change dynamically.
YU Jinxia, YANG Chaochao, ZHANG Qichao, YAN Xixi
doaj   +1 more source

Coincidences and colorings of lattices and Z-modules [PDF]

, 2010
Loquias M. Coincidences and colorings of lattices and Z-modules. Bielefeld (Germany): Bielefeld University; 2010.This thesis delves into the coincidence problem for sublattices and submodules, colorings of lattices and Z-modules, shifted lattices and ...
Loquias, Manuel
core  

Travelling solitary waves in the discrete nonlinear Schrodinger equation with saturable nonlinearity: existence, stability and dynamics [PDF]

, 2007
The present work examines in detail the existence, stability and dynamics of travelling solitary waves in dynamical lattices with saturable nonlinearity.
Melvin, TRO., Kevrekidis, PG., Cuevas, J., J. Cuevas, Cuevas-Maraver, Jesús, Cuevas, J, T.R.O. Melvin, Melvin, Thomas R.O., Kevrekidis, PG, Champneys, AR, Melvin, TRO, Champneys, A. R., P.G. Kevrekidis, Kevrekidis, Panayotis G., A.R. Champneys   +14 more
core   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

FEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill, Yelyzaveta Pulnova, Elke De Zitter, Helen M. Ginn, Briony A. Yorke   +4 more
wiley   +1 more source

On the independence heuristic in the dual attack

Journal of Mathematical Cryptology
Post-quantum cryptography deals with the development and analysis of cryptographic schemes that are assumed to be secure even against attackers with access to a powerful quantum computer.
Bashiri Kaveh, Wiemers Andreas
doaj   +1 more source