Pages that link to "Item:Q733509"
From MaRDI portal
The following pages link to An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography (Q733509):
Displaying 14 items.
- Common composites of triangular polynomial systems and hash functions (Q492031) (← links)
- Key-recovery attacks on \(\mathsf{ASASA}\) (Q2413617) (← links)
- A recombination algorithm for the decomposition of multivariate rational functions (Q2840631) (← links)
- The decidability of functional decomposition problem (Q2858322) (← links)
- High order derivatives and decomposition of multivariate polynomials (Q2883818) (← links)
- A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem (Q3346214) (← links)
- On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure (Q3457107) (← links)
- Efficient and Secure Evaluation of Multivariate Polynomials and Applications (Q3575049) (← links)
- On Multivariate Homogeneous Polynomial Decomposition (Q3589063) (← links)
- Polynomials in the Nation's Service: Using Algebra to Design the Advanced Encryption Standard (Q4469096) (← links)
- Progress in Cryptology - INDOCRYPT 2003 (Q5429131) (← links)
- (Q5435908) (← links)
- Implicit white-box implementations: white-boxing ARX ciphers (Q6097256) (← links)
- Practical attack on all parameters of the DME signature scheme (Q6637713) (← links)
