Welcome to Mwmbl! Feel free to submit a site to crawl. Please read the guidelines before editing results.
To contribute to the index you can get our Firefox Extension here. For recent crawling activity see stats.
-
https://github.com/konnectors/ldlc — found via Mwmbl
konnectors/ldlc
Connectors for LDLC shopping website
-
https://tr.wikipedia.org/wiki/LDLC_OL — found via Mwmbl
LDLC OL - Vikipedi
LDLC OL (eski adıyla Team LDLC.com ve Team LDLC), Fransız elektronik spor kulübüdür .16 Ağustos 2010, LDLC Group ve Olympique Lyonnais 'e aittir .
-
https://en.wikipedia.org/wiki/ASVEL_Basket — found via Wikipedia
ASVEL Basket
ASVEL Basket, known as LDLC ASVEL since 2018 due to sponsorship reasons, is a French professional basketball team located in the commune of Villeurbanne
-
https://haveibeenpwned.com/Breach/LDLC — found via Mwmbl
Have I Been Pwned: LDLC Data Breach
In March 2024, French retailer LDLC disclosed a data breach that impacted customers of their physical stores. The data was previously listed for sale on a…
-
http://arxiv.org/abs/1503.03292v2 — found via Mwmbl
Improving GGH Public Key Scheme Using Low Density Lattice Codes
Goldreich-Goldwasser-Halevi (GGH) public key cryptosystem is an instance of lattice-based cryptosystems whose security is based on the hardness of lattice problems. In fact, GGH cryptosystem is the lattice version of the first code-based cryptosystem, proposed by McEliece. However, it has a number of drawbacks such as; large public key length and low security level. On the other hand, Low Density Lattice Codes (LDLCs) are the practical classes of lattice codes which can achieve capacity on the additive white Gaussian noise (AWGN) channel with low complexity decoding algorithm. This paper introduces a public key cryptosystem based on LDLCs to withdraw the drawbacks of GGH cryptosystem. To reduce the key length, we employ the generator matrix of the used LDLC in Hermite normal form (HNF) as the public key. Also, by exploiting the linear decoding complexity of the used LDLC, the decryption complexity is decreased compared with GGH cryptosystem. These increased efficiencies allow us to use the bigger values of security parameters. Moreover, we exploit the special Gaussian vector whose variance is upper bounded by the Poltyrev limit as the perturbation vector. These techniques can resist the proposed scheme against the most efficient attacks to the GGH-like cryptosystems.