A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function (Q669952): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Huanguo Zhang / rank
Normal rank
 
Property / author
 
Property / author: Huanguo Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11128-019-2175-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2910802016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SQUARE attack on block ciphers with low algebraic degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Linear Approximations in Linear Cryptanalysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Chosen IV Statistical Analysis of Stream Ciphers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of Ambainis lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Query Complexity of State Conversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: How low can approximate degree and quantum query complexity be for total Boolean functions? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separations in Query Complexity Based on Pointer Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum gates on hybrid qudits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum walk public-key cryptographic system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithm to solve function inversion with time-space trade-off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean function complexity. Advances and frontiers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341679 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 19:15, 18 July 2024

scientific article
Language Label Description Also known as
English
A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
scientific article

    Statements

    A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function (English)
    0 references
    0 references
    0 references
    15 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum algorithm
    0 references
    perfect nonlinear Boolean function
    0 references
    degree
    0 references
    0 references