A Survey on Code-Based Cryptography

Weger, Violetta; Gassner, Niklas; Rosenthal, Joachim

doi:10.48550/arxiv.2201.07119

Cited by 3 publications

(1 citation statement)

References 140 publications

(208 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Поэтому задача нахождения вектора веса (задача 1) может быть сведена к нахождению информационной совокупности, не пересекающейся с носителем вектора . Этот подход и его модификации (см., например, [12]) используются в теории кодирования для исправления ошибок при помощи кодов умеренной длины, если не известны более эффективные алгоритмы; а в теории асимметричных кодовых криптосистем декодирование по информационным совокупностям является наиболее эффективным способом дешифрования сообщений без знания секретного ключа [13]. Отличительной особенностью рассматриваемого здесь алгоритма декодирования по информационным совокупностям является лишь то, что матрица определена над коммутативным кольцом , а не над конечным полем .…”

Section: алгоритмы деобфускации линейных Mba-выраженийunclassified

On Simplifying Expressions with Mixed Boolean-Arithmetic

Kosolapov

2023

Model. anal. inf. sist.

View full text Add to dashboard Cite

Mixed Boolean-Arithmetic expressions (MBA-expressions) with $t$ integer $n$-bit variables are often used for program obfuscations. Obfuscation consists of replacing short expressions with longer equivalent expressions that seem to take the analyst more time to explore. The paper shows that to simplify linear MBA-expressions (reduce the number of terms), a technique similar to the technique of decoding linear codes by information sets can be applied. Based on this technique, algorithms for simplifying linear MBA-expressions are constructed: an algorithm for finding an expression of minimum length and an algorithm for reducing the length of an expression. Based on the length reduction algorithm, an algorithm is constructed that allows to estimate the resistance of an MBA-expression to simplification. We experimentally estimate the dependence of the average number of terms in a linear MBA-expression returned by simplification algorithms on $n$, the number of decoding iterations, and the power of the set of Boolean functions, by which a linear combination with a minimum number of nonzero coefficients is sought. The results of the experiments for all considered $t$ and $n$ show that if before obfuscation the linear MBA-expression contained $r=1,2,3$ terms, then the developed simplification algorithms with a probability close to one allow using the obfuscated version of this expression find an equivalent one with no more than $r$ terms. This is the main difference between the information set decoding technique and the well-known techniques for simplifying linear MBA-expressions, where the goal is to reduce the number of terms to no more than $2^t$. We also found that for randomly generated linear MBA-expressions with increasing $n$, the average number of terms in the returned expression tends to $2^t$ and does not differ from the average number of terms in the linear expression returned by known simplification algorithms. The results obtained, in particular, make it possible to determine $t$ and $n$ for which the number of terms in the simplified linear MBA-expression on average will not be less than the given one.

show abstract

Section: алгоритмы деобфускации линейных Mba-выраженийunclassified

On Simplifying Expressions with Mixed Boolean-Arithmetic

Kosolapov

2023

Model. anal. inf. sist.

View full text Add to dashboard Cite

show abstract

Generic Error SDP and Generic Error CVE

Manganiello,

Slaughter

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Analysis of Layered ROLLO-I: A BII-LRPC code-based KEM

Chee,

Jeong,

Lange

et al. 2024

IACR CiC

View full text Add to dashboard Cite

We analyze Layered ROLLO-I, a code-based cryptosystem published in IEEE Communications Letters and submitted to the Korean post-quantum cryptography competition. Four versions of Layered ROLLO-I have been proposed in the competition. We show that the first two versions do not provide the claimed security against rank decoding attacks and give reductions to small instances of the original ROLLO-I scheme, which was a candidate in the NIST competition and eliminated there due to rank decoding attacks. As a second contribution, we provide two efficient message recovery attacks, affecting every security level of the first three versions of Layered ROLLO-I and security levels 128 and 192 of the fourth version.

show abstract

A Survey on Code-Based Cryptography

Cited by 3 publications

References 140 publications

On Simplifying Expressions with Mixed Boolean-Arithmetic

On Simplifying Expressions with Mixed Boolean-Arithmetic

Generic Error SDP and Generic Error CVE

Analysis of Layered ROLLO-I: A BII-LRPC code-based KEM

Contact Info

Product

Resources

About