Pages that link to "Item:Q2347659"

The following pages link to Polynomial-time quantum algorithms for finding the linear structures of Boolean function (Q2347659):

Displaying 18 items.

• A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function (Q669952) (← links)
• Efficient quantum algorithms of finding the roots of a polynomial function (Q1616488) (← links)
• Creating very true quantum algorithms for quantum energy based computing (Q1643461) (← links)
• Quantum algorithm to solve function inversion with time-space trade-off (Q1674561) (← links)
• Quantum algorithms on Walsh transform and Hamming distance for Boolean functions (Q1993748) (← links)
• Quantum algorithm to find invariant linear structure of \(MD\) hash functions (Q2018202) (← links)
• Quantum protocols for secure multi-party summation (Q2100807) (← links)
• Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems (Q2121215) (← links)
• Quantum algorithm for the root-finding problem (Q2329950) (← links)
• Entanglement swapping for Bell states and Greenberger-Horne-Zeilinger states in qubit systems (Q2667703) (← links)
• Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions (Q2681633) (← links)
• A quantum algorithm to estimate the Gowers \(U_2\) norm and linearity testing of Boolean functions (Q2681684) (← links)
• Linear-Time Algorithm for Quantum 2SAT (Q4568109) (← links)
• A public key cryptosystem based on data complexity under quantum environment (Q5046478) (← links)
• Two-party quantum private comparison protocol with maximally entangled seven-qubit state (Q5197361) (← links)
• (Q5368761) (← links)
• (Q5417637) (← links)
• SOFSEM 2005: Theory and Practice of Computer Science (Q5711559) (← links)