Results 1 to 10 of about 53 (47)
Since the introduction of the ring-learning with errors problem, the number theoretic transform (NTT) based polynomial multiplication algorithm has been studied extensively.
Jose Maria Bermudo Mera +2 more
doaj +8 more sources
Prime, weakly prime and almost prime elements in multiplication lattice modules
In this paper, we study multiplication lattice modules. We establish a new multiplication over elements of a multiplication lattice module.With this multiplication, we characterize idempotent element, prime element, weakly prime element and almost prime ...
Ugurlu Emel Aslankarayigit +2 more
doaj +5 more sources
On minimal spectrum of multiplication lattice modules [PDF]
We study the minimal prime elements of multiplication lattice module $M$ over a $C$-lattice $L$. Moreover, we topologize the spectrum $\pi(M)$ of minimal prime elements of $M$ and study several properties of it.
Sachin Ballal, Vilas Kharat
doaj +3 more sources
On the distributivity of the lattice of radical submodules [PDF]
Let $R$ be a commutative ring with identity and $\mathcal{R}(_{R}M)$ denotes the bounded lattice of radical submodules of an $R$-module $M$. We say that $M$ is a radical distributive module, if $\mathcal{R}(_{R}M)$ is a distributive lattice.
Hossein Fazaeli Moghimi +1 more
doaj +1 more source
Intuitionistic L-fuzzy classical prime and intuitionistic L-fuzzy 2-absorbing submodules [PDF]
Let L be a complete lattice. We introduce and characterise intuitionistic L-fuzzy classical prime submodule and intuitionistic L-fuzzy 2-absorbing submodules of a unitary module M over a commutative ring R with identity.
P. K. Sharma
doaj +1 more source
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. In [16], we introduced the concept of a multiplication lattice L-module and we characterized it by principal elements.
C. S. Manjarekar, U. N. Kandale
openaire +4 more sources
In this paper, we present an instruction set coprocessor architecture for lattice-based cryptography and implement the module lattice-based post-quantum key encapsulation mechanism (KEM) Saber as a case study.
Sujoy Sinha Roy, Andrea Basso
doaj +1 more source
Implementing RLWE-based Schemes Using an RSA Co-Processor
We repurpose existing RSA/ECC co-processors for (ideal) lattice-based cryptography by exploiting the availability of fast long integer multiplication.
Martin R. Albrecht +5 more
doaj +1 more source
The asymptotic and integral closure operations in multiplicative lattice modules
This paper is primarily concerned with the integral and asymptotic closure operations on a multiplicative lattice relative to the greatest element of a lattice module having the ascending chain condition. We show that a cancellation law holds for the asymptotic closure of elements of the multiplicative lattice and we ultimately show, by means of ...
Sylvia M. Foster, Johnny A. Johnson
openaire +2 more sources
The CCA-secure lattice-based post-quantum key encapsulation scheme Saber is a candidate in the NIST’s post-quantum cryptography standardization process.
Angshuman Karmakar +3 more
doaj +1 more source

