Results 11 to 20 of about 1,376,429 (167)
Multiplication lattice modules [PDF]
Let M be a lattice module over the multiplicative lattice ܮ . An ܮെ module M is called a multiplication lattice module if for every element N א ܯ there exists an element אܮ such that ൌ 1 ெ. Our objective is to investigate properties of prime elements of multiplication lattice modules.
Çallıalp, Fethi, Tekir, Ünsal
core +5 more sources
On multiplication lattice modules [PDF]
In this paper we study multiplication lattice modules. Next we characterize hollow lattices modules. We also establish maximal elements in multiplication lattices modules.
Aslan Karayiğit, Emel +2 more
core +3 more sources
A Polynomial Multiplication Accelerator for Faster Lattice Cipher Algorithm in Security Chip
Polynomial multiplication is the most computationally expensive part of the lattice-based cryptography algorithm. However, the existing acceleration schemes have problems, such as low performance and high hardware resource overhead.
Chen Chen +5 more
core +1 more source
On Neutrosophic Multiplication Module
In this article, we investigate some new results of Neutrosophic multiplication module E (shortly Ne(E)). We additionally introduce some light points about some concepts in which have relationship with Neutrosophic multiplication module. We prove that if
Faisal Al-Sharqi +2 more
core +1 more source
On finitely generated multiplication modules [PDF]
summary:We shall prove that if $M$ is a finitely generated multiplication module and $\mathop {\mathrm Ann}(M)$ is a finitely generated ideal of $R$, then there exists a distributive lattice $\bar{M}$ such that $\mathop {\mathrm Spec}(M)$ with Zariski ...
R. Nekooei, Nekooei, R., M. Hochster
core +1 more source
How to Construct the Lattice of Submodules of a Multiplicity free Module from Partial Information
In general it is a difficult problem to construct the lattice of submodules $L(M)$ of a given module $M$. In \cite{St} R. P. Stanley outlined a method for constucting a distributive lattice from a knowledge of its join irreducibles. However it is not an easy task to identify all join irreducible submodules of a given module.
openaire +2 more sources
Efficient Polynomial Multiplication Architecture for ML-KEM PQC Scheme
The Module Lattice-based Key Encapsulation Mechanism (ML-KEM) has been standardized by the National Institute of Standards and Technology (NIST) to replace the current public-key schemes.
Khalid Javeed +2 more
doaj +1 more source
Classification of multiplication modules over multiplication rings with finitely many minimal primes [PDF]
A classification of multiplication modules over multiplication rings with finitely many minimal primes is obtained. A characterisation of multiplication rings with finitely many minimal primes is given via faithful, Noetherian, distributive modules.
Bavula, Volodymyr
core +2 more sources
MiNTT: A Family of Module Lattice-Based Cryptographic Compression Functions
A cryptographic compression function is the part of a hash function most responsible for compressing input while avoiding collisions. In recent years, NIST has released a Call for Proposals for a variety of cryptographic primitives, albeit there have ...
Riley Vaughn, Mike Borowczak
doaj +1 more source
Multiplication lattice modules [PDF]
Let M be a lattice module over the multiplicative lattice L. An L-module M is called a multiplication lattice module if for every element N is an element of M there exists an element a is an element of L such that N = a1(M).
core

