Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
March 5, 2026Advances in Mathematics of CommunicationsOpen Access

Oracle-Based multistep strategy for solving polynomial systems over finite fields and algebraic cryptanalysis of the aradi cipher

View Full Paper
Ask AI
Bookmark
Share

Authors

RSRoberto La ScalaSTSharwan K. TiwariTechnology Innovation Institute

Discussion

Loading...

Member takes

Implication

Demonstrates a new algorithmic approach for polynomial systems in cryptanalysis, suggesting enhancements in efficiency and effectiveness.

Key Points

  • The research aims to improve the solvability of polynomial systems over finite fields and enhance cryptanalysis methods for certain ciphers.
  • Developed a multistep strategy based on a divide-and-conquer technique.
  • Introduced an oracle function to simplify polynomial systems by variable evaluation.
  • Applied depth-first search for algorithmic formulation.
  • Conducted a complexity analysis utilizing tree structures.
  • Achieved a first full-round algebraic attack on the Aradi cipher.
  • Uncovered structural features in the Aradi cipher's symbolic model.
  • Unified various multistep strategy variants through the oracle function.

Cite This Study

Scala et al. (2026) studied this question.

synapsesocial.com/papers/69a91da8d6127c7a504c0aaehttps://doi.org/10.3934/amc.2026024
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Noetherian quotients of the algebra of partial difference polynomials and Grobner bases of symmetric ideals2015 · 15 citations
  2. 2Solving systems of Boolean multivariate equations with quantum annealing2022 · 9 citations