Results 81 to 90 of about 458 (184)

Minimal basis of the syzygies module of leading terms

open access: yesТруды Института системного программирования РАН, 2019
Systems of polynomial equations are one of the most universal mathematical objects. Almost all the problems of cryptographic analysis can be reduced to finding solutions to systems of polynomial equations.
A. V. Sokurov
doaj   +1 more source

Random subgroups and analysis of the length-based and quotient attacks

open access: yesJournal of Mathematical Cryptology, 2008
In this paper we discuss generic properties of “random subgroups” of a given group G. It turns out that in many groups G (even in most exotic of them) the random subgroups have a simple algebraic structure and they “sit” inside G in a very particular way.
Myasnikov Alexei G., Ushakov Alexander
doaj   +1 more source

New cryptanalysis of LowMC with algebraic techniques [PDF]

open access: hybrid, 2023
Wenxiao Qiao   +4 more
openalex   +1 more source

Algebraic cryptanalysis of HFE and Filter Generators.

open access: yes, 2003
HFE (Hidden Fields Equations) is a public key cryptosystem using polynomial operations over finite fields. It has been proposed by Jacques Patarin at Eurocrypt 96 following the ideas of Matsumoto and Imai. It has long been regarded as a very promising cryptosystem because it can be used to produce signatures as short as 128, 100 and even 80 bits.
openaire   +2 more sources

Fully Dynamic Advanced Encryption Standard

open access: yesIEEE Access
As the reliance on using electronic services increases, the use of a strong encryption algorithm becomes paramount. The AES is the most widely used cipher. However, AES uses static transformations that attackers might exploit to cryptanalyze AES. In this
Shiraz Naserelden   +3 more
doaj   +1 more source

A message recovery attack on multivariate polynomial trapdoor function. [PDF]

open access: yesPeerJ Comput Sci, 2023
Ali R   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy