Logic minimization techniques with applications to cryptology (Q2377070): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00145-012-9124-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003858108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for the multiplicative complexity of symmetric functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shortest Linear Straight-Line Program for Computing Linear Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Very Compact S-Box for AES / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Machine Calculation of Complex Fourier Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor rank is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster and Timing-Attack Resistant AES-GCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Garbled Circuit: Free XOR Gates and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Bases for Efficient Inversion in ${{\mathbb F}{((2^2)^2)}{2}}$ and Conversion Matrices of SubBytes of AES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Computation of Linear Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of multiplications necessary to compute certain functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472066 / rank
 
Normal rank

Latest revision as of 14:47, 6 July 2024

scientific article
Language Label Description Also known as
English
Logic minimization techniques with applications to cryptology
scientific article

    Statements

    Logic minimization techniques with applications to cryptology (English)
    0 references
    0 references
    0 references
    0 references
    27 June 2013
    0 references
    0 references
    circuit complexity
    0 references
    multiplicatice complexity
    0 references
    linear component minimization
    0 references
    Short Linear Program
    0 references
    AES
    0 references
    S-box
    0 references
    0 references
    0 references