Practical complexities of probabilistic algorithms for solving Boolean polynomial systems

被引：0
|
作者：
Barbero, Stefano [1 ]
Bellini, Emanuele [2 ]
Sanna, Carlo [1 ]
Verbel, Javier [2 ]
机构：
[1] Department of Mathematical Sciences, Politecnico di Torino, Torino, Italy
[2] Cryptography Research Centre, Technology Innovation Institute, Abu Dhabi, United Arab Emirates
来源：
Discrete Applied Mathematics | 2022年 / 309卷
关键词：
Polynomials - Public key cryptography;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：13 / 31
相关论文
共 50 条
  • [1] Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
    Barbero, Stefano
    Bellini, Emanuele
    Sanna, Carlo
    Verbel, Javier
    DISCRETE APPLIED MATHEMATICS, 2022, 309 : 13 - 31
  • [2] On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables
    Meluzov, A. S.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2011, 21 (03): : 381 - 395
  • [3] A Crossbred Algorithm for Solving Boolean Polynomial Systems
    Joux, Antoine
    Vitse, Vanessa
    NUMBER-THEORETIC METHODS IN CRYPTOLOGY, 2018, 10737 : 3 - 21
  • [4] ALGORITHMS FOR SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS
    YUN, DYY
    SIAM REVIEW, 1974, 16 (01) : 141 - 141
  • [5] Analyzing Boolean Functions via Solving Parametric Polynomial Systems
    Zhenyu Huang
    Yao Sun
    Dongdai Lin
    Journal of Systems Science and Complexity, 2021, 34 : 792 - 808
  • [6] Analyzing Boolean Functions via Solving Parametric Polynomial Systems
    Huang, Zhenyu
    Sun, Yao
    Lin, Dongdai
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2021, 34 (02) : 792 - 808
  • [7] Analyzing Boolean Functions via Solving Parametric Polynomial Systems
    HUANG Zhenyu
    SUN Yao
    LIN Dongdai
    Journal of Systems Science & Complexity, 2021, 34 (02) : 792 - 808
  • [8] On the efficiency of solving Boolean polynomial systems with the characteristic set method
    Huang, Zhenyu
    Sun, Yao
    Lin, Dongdai
    JOURNAL OF SYMBOLIC COMPUTATION, 2021, 103 : 66 - 94
  • [9] Polynomial quantum computing algorithms for solving the dualization problem for positive Boolean functions
    Mezzini, Mauro
    Gomez, Fernando Cuartero
    Gonzalez, Jose Javier Paulet
    Calvo, Hernan Indibil de la Cruz
    Pascual, Vicente
    Pelayo, Fernando L.
    QUANTUM MACHINE INTELLIGENCE, 2024, 6 (02)
  • [10] Deterministic Algorithms for Solving Boolean Polynomial Equations Based on Channel Coding Theory
    Wu, Guangfu
    Lv, Yijie
    He, Daojing
    He, Jiguang
    Zhou, Huan
    Chan, Sammy
    IEEE ACCESS, 2020, 8 : 26764 - 26772
12345