Known infinite families of APN power functions over GF(2^n): Difference between revisions
Jump to navigation
Jump to search
(Created page with "<table> <tr> <th>Family</th> <th>Exponent</th> <th>Conditions</th> <th><math>\deg(x^d)</math></th> <th>Reference</th> </tr> <tr> <td>Gold</td> <td><math>2^i + 1</math></td> <t...") |
No edit summary |
||
Line 12: | Line 12: | ||
<td><math>\gcd(i,n) = 1</math></td> | <td><math>\gcd(i,n) = 1</math></td> | ||
<td>2</td> | <td>2</td> | ||
<td> .. | <td> <ref>Robert Gold, ''Maximal recursive sequences with 3-valued recursive cross-correlation functions (corresp.)'', IEEE transactions on Information Theory, 14(1):154-156, 1968</ref><ref>Kaisa Nyberg, ''Differentially uniform mappings for cryptography'', Workshop on the Theory and Application of Cryptographic Techniques, pp. 55-64, Springer, 1993</ref> | ||
</td> | |||
</tr> | </tr> | ||
</table> | </table> |
Revision as of 00:00, 26 November 2018
Family | Exponent | Conditions | [math]\displaystyle{ \deg(x^d) }[/math] | Reference |
---|---|---|---|---|
Gold | [math]\displaystyle{ 2^i + 1 }[/math] | [math]\displaystyle{ \gcd(i,n) = 1 }[/math] | 2 | [1][2] |
- ↑ Robert Gold, Maximal recursive sequences with 3-valued recursive cross-correlation functions (corresp.), IEEE transactions on Information Theory, 14(1):154-156, 1968
- ↑ Kaisa Nyberg, Differentially uniform mappings for cryptography, Workshop on the Theory and Application of Cryptographic Techniques, pp. 55-64, Springer, 1993