Results 291 to 300 of about 17,450 (322)

Differential uniformity and linearity of S-boxes by multiplicative complexity

Cryptography and Communications, 2022
Yongjin Jeon, Seungjun Baek, Hangi Kim, Giyoon Kim, Jongsung Kim   +4 more
semanticscholar   +1 more source

Multiple complexes of thrombin and heparin

Biochimica et Biophysica Acta (BBA) - Protein Structure and Molecular Enzymology, 1986
Fluorescence polarization has been used to study the interaction of thrombin and heparin, and the catalysis by heparin of the combination of thrombin and antithrombin. At low ionic strength (20 mM Tris, pH 7.4), the addition of heparins of known molecular weights to thrombin led to the formation of large complexes (defined as 'complex 1').
J R, Evington, P A, Feldman, M, Luscombe, J J, Holbrook   +3 more
openaire   +2 more sources

Complex Multiplication

2010
This is a self-contained 2010 account of the state of the art in classical complex multiplication that includes recent results on rings of integers and applications to cryptography using elliptic curves. The author is exhaustive in his treatment, giving a thorough development of the theory of elliptic functions, modular functions and quadratic number ...
openaire   +1 more source

Complex aggregation at multiple granularities

1998
Datacube queries compute simple aggregates at multiple granularities. In this paper we examine the more general and useful problem of computing a complex subquery involving multiple dependent aggregates at multiple granularities. We call such queries “multi-feature cubes.” An example is “Broken down by all combinations of month and customer, find the ...
Kenneth A. Ross, Divesh Srivastava, Damianos Chatziantoniou   +2 more
openaire   +1 more source

On the complexity of multiple bondage in graphs

Theoretical Computer Science, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Efficient complex matrix multiplication

IEEE Transactions on Computers, 1988
Multiplication of the complex numbers x and y, where \(x=a+ib\) and \(y=c+id\), requires four real multiplications, while the identity \(xy=(a(c-d)+(a-b)d)+i(b(c+d)+(a-b)d)\) requires three real multiplications instead. The author observes that this identity could be used for multiplication of complex matrices.
openaire   +1 more source

Parallel complexity of matrix multiplication

J. Supercomput., 2003
Matrix multiplication is a kernel of many numerical algorithms, thus finding efficient and parallel solution to this problem is one of the most important topics in scientific computing. In this paper, the parallel complexity of multiplying two matrices (using the standard row/column method) on parallel distributed-memory computers is studied.
openaire   +1 more source

A lower bound for differential uniformity by multiplicative complexity & bijective functions of multiplicative complexity 1 over finite fields

Cryptography and Communications, 2023
Matthias Johann Steiner
exaly  

On the Multiplicative Complexity of Boolean Functions and Bitsliced Higher-Order Masking

Workshop on Cryptographic Hardware and Embedded Systems, 2016
Dahmun Goudarzi, Matthieu Rivain
semanticscholar   +1 more source

On the complexity of quaternion multiplication

Information Processing Letters, 1975
openaire   +2 more sources