Results 161 to 170 of about 6,665 (199)
, 2012 Some of the next articles are maybe not open access.
Related searches:
Related searches:
Some Elementary Cryptanalysis of Algebraic Cryptography
The American Mathematical Monthly, 1961openaire +3 more sources
Cryptanalysis via Algebraic Spans
2018We introduce a method for obtaining provable polynomial time solutions of problems in nonabelian algebraic cryptography. This method is widely applicable, easier to apply, and more efficient than earlier methods. After demonstrating its applicability to the major classic nonabelian protocols, we use this method to cryptanalyze the Triple Decomposition ...
Adi Ben-Zvi, Arkadius Kalka, Boaz Tsaban
openaire +1 more source
Algebraic Cryptanalysis and RFID Authentication
2015The standardization group ISO/IEC SC31/WG7 is working on a set of cryptographic suites to provide security to wireless devices including UHF RFID tags. These cryptographic suites are presented as independent parts to a single standard ISO/IEC 29167. Within this multi-part standard 29167-15 is based around very simple operations and intended to provide ...
Carlos Cid +3 more
openaire +1 more source
Algebraic Cryptanalysis of Variants of Frit
2020Frit is a cryptographic 384-bit permutation recently proposed by Simon et al. and follows a novel design approach for built-in countermeasures against fault attacks. We analyze the cryptanalytic security of Frit in different use cases and propose attacks on the full-round primitive.
Christoph Dobraunig +3 more
openaire +1 more source
Impossible Differential-Algebraic Cryptanalysis of Serpent
2009 International Conference on Multimedia Information Networking and Security, 2009Serpent is an SP Network block cipher submitted to the AES competition and chosen as one of its five finalists. The security of Serpent is widely acknowledged, especially as the best known attack so far is a differential-linear attack on only 11 rounds out of the 32 rounds of the cipher.
Zhihua Hu, Zhongping Qin, Haiqing Han
openaire +1 more source
Methods to solve algebraic equations in cryptanalysis
Tatra Mountains Mathematical Publications, 2010ABSTRACT The goal of the present paper is a survey of methods to solve equation systems common in cryptanalysis. The methods depend on the equation representation and fall into three categories: Gröbner basis algorithms, SAT-solving methods and Agreeing-Gluing algorithms.
Igor Semaev, Michal Mikuš
openaire +1 more source
Algebraic Cryptanalysis of CTRU Cryptosystem
2008CTRU, a public key cryptosystem was proposed by Gaborit, Ohler and Sole. It is analogue of NTRU, the ring of integers replaced by the ring of polynomials $\mathbb{F}_2[T]$. It attracted attention as the attacks based on either LLL algorithm or the Chinese Remainder Theorem are avoided on it, which is most common on NTRU.
openaire +1 more source