Search results

Page title matches

• Bent function
  ...o <math>2^{n-1}-2^{n/2-1}</math>. The [[Walsh-Hadamard coefficients]] of a bent function are equal to <math>\pm 2^{n/2}</math>; this gives the alternative definitio ...x_1x_2+x_3x_4+\cdots+x_{2n-1}x_{2n}</math> is bent), the maximal degree of bent function of <math>2n</math> variables is <math>n</math>.
  3 KB (435 words) - 23:36, 14 February 2010
• Bent Function
  #Redirect [[Bent function]]
  27 bytes (3 words) - 10:21, 13 April 2008
• Bent function/Approval
  12 bytes (1 word) - 03:21, 13 April 2008
• Bent function/Definition
  133 bytes (19 words) - 05:05, 25 June 2008
• Bent function/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Bent function]]. Needs checking by a human.
  451 bytes (59 words) - 11:19, 11 January 2010

Page text matches

• Bent function
  ...o <math>2^{n-1}-2^{n/2-1}</math>. The [[Walsh-Hadamard coefficients]] of a bent function are equal to <math>\pm 2^{n/2}</math>; this gives the alternative definitio ...x_1x_2+x_3x_4+\cdots+x_{2n-1}x_{2n}</math> is bent), the maximal degree of bent function of <math>2n</math> variables is <math>n</math>.
  3 KB (435 words) - 23:36, 14 February 2010
• Bent Function
  #Redirect [[Bent function]]
  27 bytes (3 words) - 10:21, 13 April 2008
• Bent function/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Bent function]]. Needs checking by a human.
  451 bytes (59 words) - 11:19, 11 January 2010
• CAST (cipher)/Related Articles
  {{r|Bent function}}
  466 bytes (62 words) - 11:41, 11 January 2010
• Block cipher/Catalogs/Cipher table
  ...td>Feistel</td><td>64</td><td>40 to 128</td><td>16</td><td>4 8*32, using [[bent function]]s</td><td>key-dependent rotation</td><td></td><td></td><td></td><td>widely ...el-like</td><td>128</td><td>128,192,256</td><td>48</td><td>4 8*32, using [[bent function]]s</td><td>key-dependent rotation</td><td></td><td>candidate</td><td></td><
  7 KB (1,292 words) - 12:20, 27 July 2010
• CAST (cipher)
  ...That is, the mapping from all the input bits to any single output bit is a bent function. Such S-boxes meet the '''strict avalanche criterion''' <ref name=SAC> {{ci
  9 KB (1,452 words) - 05:49, 8 April 2024
• Block cipher
  ...That is, the mapping from all the input bits to any single output bit is a bent function. A paper on generating the S-boxes is Mister & Adams "Practical S-box Desig not only are all columns [[bent function]]s (the most nonlinear possible Boolean functions), but all linear combinat
  53 KB (8,371 words) - 05:48, 8 April 2024