Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 20 for “"Code-based cryptography"”.
-
Some Notes on Code-Based Cryptography
… cryptanalytic results in several areas of coding-based cryptography. In addition, we also investigate the possibility of using convolutional codes in code-based public-key cryptography. The first algorithm that we present is an information-set decoding algorithm, aiming towards the problem of …
-
A Survey of Code-Based Cryptography
… this thesis, we analyze three quantum-resistant code-based cryptosystems. We propose a new type of attack based on mixed-integer non-convex programming for the NIST submission FuLeeca.
-
Improving the Efficiency of Code-Based Cryptography
Recent public-key cryptography is largely based on number theory problems, such as factoring or computing of discrete logarithm. These systems constitute an excellent choice in many applications, and their security is well defined and understood. One of the major drawbacks, though, is that they …
-
Code-based Cryptography: Attacking and Constructing Cryptographic Systems
… thesis discusses novel results in the area of code-based cryptography, ranging from cryptanalyses on several code-based cryptographic constructions to proposing a code-based authentication scheme based on a novel Syndrome Decoding variant.To address the looming threat of large-scale quantum …
-
Codes over Rings, Their Generic Decoding and Their Use in Code-Based Cryptography
… we study various aspects of the theory of linear codes and code-based cryptography. In the mathematical theory of channel coding, codes have been mostly studied as linear spaces over some finite field equipped with the Hamming metric. These codes have several practical properties, for example they …
-
Analysis and Decoding of Linear Lee-Metric Codes with Application to Code-Based Cryptography
Lee-metric codes are defined over integer residue rings endowed with the Lee metric. Even though the metric is one of the oldest metric considered in coding-theroy and has interesting applications in, for instance, DNA storage and code-based cryptography, it received relatively few attentions …
-
Signing with Codes
Code-based cryptography is an area of classical cryptography in which cryptographic primitives rely on hard problems and trapdoor functions related to linear error-correcting codes. Since its inception in 1978, the area has produced the McEliece and the Niederreiter cryptosystems, multiple digital …
-
Efficient code-based cryptosystems for post-quantum cryptography
… threaten the safety of these primitives. Code-based cryptography is one of several approaches resistant to quantum attacks. To date, no attack has been able to break a code-based cryptosystem in polynomial time. Despite the remarkable level of security they offer, code-based cryptosystems …
-
More Than Error Correction: Cryptography from Codes
The first code-based cryptosystem, McEliece, was invented in the very early development of public-key cryptography, yet code-based cryptosystems received little attention for decades due to their relatively large key-sizes. But recently they are re-discovered for their potentials to provide …
-
Strengthening trust in the identity life cycle
… certificates is strengthened by a blockchain based system and a 2D barcode which stores biometric information. Furthermore, simpler travel document protocols with less complex infrastructure requirements, fewer steps, and long-term post-quantum security achieved via hash-based cryptography and …
-
Graph-based and algebraic codes for error-correction and erasure recovery
Expander codes are sparse graph-based codes with good decoding algorithms. We present a linear-time decoding algorithm for (C,D, alpha, gamma) expander codes based on graphs with any expansion factor given that the minimum distances of the inner codes are bounded below. We also design graph-based …
-
A Collection of New Algorithms in Post-Quantum Cryptography
… and concepts within the topic of post-quantum cryptography. The security of Hamming weight code-based cryptography is largely based on the effectiveness of information set decoding (ISD) attacks. We introduce a modification to Stern's algorithm that reduces average decryption time by …
-
Analysis of a Lattice-Code-based Cryptosystem & a variant of the Generalised Birthday Problem
… search for post-quantum alternatives. Lattice-based and code-based cryptography are leading candidates, each with strong theoretical guarantees but different trade-offs. This thesis engages with both paradigms through two complementary directions: the study of a lattice-code scheme and the …
-
Some Notes on Post-Quantum Cryptanalysis
Cryptography as it is used today relies on a foundational level on the assumptionthat either the Integer Factoring Problem (IFP) or the DiscreteLogarithm Problem (DLP) is computationally intractable. In the 1990s PeterShor developed a quantum algorithm that solves both problems in polynomialtime. …
-
Advanced Isogeny-based Cryptosystems
Cryptography has a rich history, spanning thousands of years and evolving from ancient techniques such as the scytale and Caesar’s cipher to modern systems like RSA, DHKE, and ECDH. However, quantum computing poses a substantial threat to the security of these modern cryptosystems. To address this …
-
Constructing Code-Based Zero-Knowledge Proofs Leveraging Generic Errors and Bounded Vectors
… prompted a paradigm shift away from pre-quantum cryptography and towards post-quantum primitives, such as those that arise from the field of coding theory. Among these, zero-knowledge proofs have emerged as a dynamic tool instrumental in constructing quantum-resilient digital signature schemes. …
-
Decryption Failure Attacks on Post-Quantum Cryptography
… implementing the next generation of asymmetric cryptography, or Public-Key Cryptography (PKC).PKC, as it has been deployed until today, depends heavily on the integer factorization and the discrete logarithm problems.Unfortunately, it has been well-known since the mid-90s, that these …
-
Secure on Paper: Attacking Post-Quantum Cryptography in Practice
The transition to post-quantum cryptography is well underway. Driven by the recognition that Shor's algorithm would render all widely deployed asymmetric cryptosystems insecure in the presence of a sufficiently capable quantum computer, the cryptographic community has spent the past decade …
-
Grafy složitosti a praktické experimenty v postkvantové kryptografii
Táto práca skúma matematické problémy, ktoré tvoria základ algoritmov v súčasnej postkvantovej kryptografii, a vzťahy medzi nimi. Kvantové počítanie predstavuje hrozbu pre súčasné šifrovacie systémy, a preto je téma postkvantovej kryptografie čoraz relevantnejšia. Národný inštitút pre štandardy a …