Results 11 to 20 of about 260,900 (299)
R-LWE-Based Distributed Key Generation and Threshold Decryption
Mathematics, 2022 Ever since the appearance of quantum computers, prime factoring and discrete logarithm-based cryptography have been questioned, giving birth to the so-called post-quantum cryptography.
Ferran Alborch +2 more
doaj +1 more source
Ideal lattices of lattices [PDF]
Pacific Journal of Mathematics, 1975 This paper shows that any compactly generated lattice is a subdirect product of subdirectly irreducible lattices which are complete and upper continuous. An example of a compactly generated lattice which cannot be subdirectly decomposed into subdirectly irreducible compactly generated lattices is given.
openaire +2 more sources
Characterizations of Right Weakly Regular Semigroups in Terms of Generalized Cubic Soft Sets
Mathematics, 2018 Cubic sets are the very useful generalization of fuzzy sets where one is allowed to extend the output through a subinterval of [ 0 , 1 ] and a number from [ 0 , 1 ] . Generalized cubic sets generalized the cubic sets with the help of cubic
Muhammad Gulistan +3 more
doaj +1 more source
Lattice-Like Total Perfect Codes
Discussiones Mathematicae Graph Theory, 2014 A contribution is made to the classification of lattice-like total perfect codes in integer lattices Λn via pairs (G, Φ) formed by abelian groups G and homomorphisms Φ: Zn → G.
Araujo Carlos, Dejter Italo
doaj +1 more source
Random Lattices versus Regular Lattices
Progress of Theoretical Physics Supplement, 1986 On etudie les avantages et desavantages potentiel d'utiliser des reseaux aleatoires plutot que des reseaux reguliers pour etudier des phenomenes non ...
Espriu, D +3 more
openaire +3 more sources
Partial categorification of Hopf algebras and representation theory of towers of \mathcalJ-trivial monoids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 This paper considers the representation theory of towers of algebras of $\mathcal{J} -trivial$ monoids. Using a very general lemma on induction, we derive a combinatorial description of the algebra and coalgebra structure on the Grothendieck rings $G_0 ...
Aladin Virmaux
doaj +1 more source
A New Post-Quantum Blind Signature From Lattice Assumptions
IEEE Access, 2018 At present, several post-quantum cryptosystems have been proposed, and lattice-based cryptography is the main candidate. Especially in the direction of digital signatures, there are now many practical lattice-based signature schemes. However, there exist
Pingyuan Zhang +4 more
doaj +1 more source
Physical Layer Network Coding Based on Integer Forcing Precoded Compute and Forward
Future Internet, 2013 In this paper, we address the implementation of physical layer network coding (PNC) based on compute and forward (CF) in relay networks. It is known that the maximum achievable rates in CF-based transmission is limited due to the channel approximations ...
M. A. Vázquez-Castro, Smrati Gupta
doaj +1 more source
Quantum-Resistant Cryptography for the Internet of Things Based on Location-Based Lattices
IEEE Access, 2021 An important enabler of the Internet of Things (IoT) is the Narrow-Band Internet of Things (NB-IoT) technology, which is a 3GPP standards compliant connectivity solution.
Ohood Saud Althobaiti, Mischa Dohler
doaj +1 more source
Security Analysis of Hybrid Attack for NTRU-Class Encryption Schemes
IEEE Access, 2023 One of the significant post-quantum cryptographic candidates is the NTRU public key cryptosystem. It operates on polynomial rings, where the parameter largely determines the security of the system.
Alla Levina +2 more
doaj +1 more source