Repository navigation
Expand file tree
/
Copy pathindex.html
More file actions
107 lines (102 loc) · 8.72 KB
/
Copy pathindex.html
File metadata and controls
107 lines (102 loc) · 8.72 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
<!doctype html>
<html lang="en">
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1">
<title>Boolean Functions for Cryptography</title>
<meta name="description" content="Research, data and reference material on Boolean functions for cryptography — the Boolean Planet.">
<meta name="author" content="Joanne Fuller">
<link rel="canonical" href="https://booleanfunction.github.io/">
<link rel="icon" href="favicon.svg">
<link rel="stylesheet" href="style.css?v=c9669768">
<script>window.MathJax={tex:{inlineMath:[['$','$'],['\\(','\\)']]}};</script>
<script async src="https://cdn.jsdelivr.net/npm/mathjax@3.2.2/es5/tex-mml-chtml.js"></script>
<meta name="google-site-verification" content="o6ujCVw5XLwPzOo71x56H4U-ZcqMI4dI0_lqqAXOMBw">
</head>
<body>
<header class="site-head"><a class="masthead-title" href="index.html">Boolean Functions for Cryptography</a><nav class="masthead-nav" aria-label="Main"><a class="navlink active" href="index.html" aria-current="page">Home</a><a class="navlink" href="basics.html">Basics</a><details class="navgroup"><summary class="navlink">Classes</summary><div class="navmenu"><a href="equivalence-classes.html">Equivalence classes & data</a><a href="class-sizes.html">Class sizes</a><a href="connectivity.html">Connectivity</a></div></details><details class="navgroup"><summary class="navlink">Research</summary><div class="navmenu"><a href="constructions.html">Constructions & search</a><a href="sboxes.html">S-boxes & AES</a><a href="records.html">Records & open problems</a><a href="efficient-implementation.html">Efficient implementation</a></div></details><details class="navgroup"><summary class="navlink">Tools</summary><div class="navmenu"><a href="explore.html">Class Graph Explorer</a><a href="analyse.html">Function Analyser</a></div></details><a class="navlink" href="publications.html">Publications</a><a class="navlink" href="learning.html">Learning</a></nav></header>
<script>document.addEventListener('click',function(e){document.querySelectorAll('details.navgroup[open]').forEach(function(d){if(!d.contains(e.target))d.removeAttribute('open');});});document.addEventListener('keydown',function(e){if(e.key==='Escape')document.querySelectorAll('details.navgroup[open]').forEach(function(d){d.removeAttribute('open');});});document.addEventListener('toggle',function(e){var t=e.target;if(t.matches&&t.matches('details.navgroup')&&t.open)document.querySelectorAll('details.navgroup[open]').forEach(function(d){if(d!==t)d.removeAttribute('open');});},true);</script>
<main class="container">
<div class="hero">
<div class="tagline">The Boolean Planet · a world of zeros and ones</div>
<h1>Boolean Functions for Cryptography</h1>
<p>Boolean functions — built from nothing but zeros and ones — sit at the heart of
block ciphers, stream ciphers and hash functions. The strength of these systems depends
on choosing functions with the right cryptographic properties. This site collects results,
data and reference material from ongoing research into the design and analysis of
cryptographic Boolean functions.</p>
</div>
<h2>What's here</h2>
<p>A Boolean function of $n$ inputs is a map $f : \{0,1\}^n \to \{0,1\}$ — its truth
table is a string of $2^n$ bits. Despite this simple definition, finding functions that
resist all known attacks remains an open problem. Researchers measure a function against
criteria such as <strong>nonlinearity</strong>, <strong>correlation immunity</strong>,
<strong>algebraic degree</strong> and <strong>autocorrelation</strong>, and group functions
into <strong>affine equivalence classes</strong> that share these properties.</p>
<div class="prop-cards"><div class="card"><div class="num">150,357</div><div class="lbl">n = 6 equivalence classes</div></div><div class="card"><div class="num">74,542</div><div class="lbl">contain balanced functions</div></div><div class="card"><div class="num">4</div><div class="lbl">bent classes (NL = 28)</div></div><div class="card"><div class="num">n ≤ 6</div><div class="lbl">fully classified</div></div></div>
<h2>Explore</h2>
<ul>
<li><a href="basics.html"><strong>The Basics</strong></a>: a worked introduction, from truth table
to Walsh spectrum, nonlinearity and affine equivalence.</li>
<li><a href="equivalence-classes.html"><strong>Equivalence Classes</strong></a> — complete
affine equivalence class tables for $n = 3, 4, 5$, and a full summary of the 150,357 classes
for $n = 6$.</li>
<li><a href="explore.html"><strong>Class Graph Explorer</strong></a>: an interactive map of how the
classes connect for $n = 3, 4, 5$, with a hill-climbing animation.</li>
<li><a href="analyse.html"><strong>Function Analyser</strong></a>: paste any truth table (up to
10 inputs) to get its nonlinearity, degree, Walsh spectrum, algebraic immunity and class.</li>
<li><a href="class-sizes.html"><strong>Class Sizes</strong></a>: the self-mapping constant, which
counts the functions in every class, with exact counts by nonlinearity for $n = 6$.</li>
<li><a href="efficient-implementation.html"><strong>Efficient Implementation</strong></a> —
the word-packing and transform techniques that make exhaustive Boolean function research
feasible.</li>
<li><a href="constructions.html"><strong>Constructions and Search</strong></a>: a bent function
construction, the Boolean terrain, dynamic hill climbing, and the history of heuristic search at
QUT.</li>
<li><a href="sboxes.html"><strong>S-boxes and Linear Redundancy</strong></a>: why all 255 component
functions of the AES S-box are affine equivalent (check it in your browser), and a survey of
cipher S-boxes.</li>
<li><a href="publications.html"><strong>Publications</strong></a> — papers on cryptographic
Boolean function analysis and linear redundancy in the AES S-box.</li>
<li><a href="learning.html"><strong>Learning</strong></a> — references and resources for
getting into the field.</li>
</ul>
<h2>About</h2>
<p>This work began as PhD research at the Queensland University of Technology (Information
Security Research Centre) and continues today. The original <em>Boolean Planet</em> site
accompanied that research and was widely used as a reference for the $n = 6$ classification —
data that researchers have continued to draw on, including NIST's 2018 study of the
multiplicative complexity of 6-variable Boolean functions. This is its modern home.</p>
<h2>About me</h2>
<p>I completed my PhD on Boolean functions for cryptography
at the Queensland University of Technology in 2003, and since then my work has spanned:</p>
<ul>
<li><strong>Data science</strong>: I'm currently a Senior Data Scientist at Optimum, analysing
Optimum Network performance.</li>
<li><strong>Formal verification of blockchain systems</strong> at Consensys, where I co-authored
papers on deductive verification of smart contracts in Dafny
(<a href="https://arxiv.org/abs/2208.02920">arXiv 2208.02920</a>), a formal and executable
semantics of the Ethereum Virtual Machine in Dafny
(<a href="https://arxiv.org/abs/2303.00152">arXiv 2303.00152</a>), and formal verification of
the Ethereum 2.0 Beacon Chain.</li>
<li><strong>Financial econometrics</strong> at QUT's School of Economics and Finance: forecasting
volatility and electricity price spikes.</li>
<li><strong>Teaching</strong> at university and secondary level.</li>
</ul>
<p>My interest in Boolean functions never stopped. I've kept coming back to them over the years,
and I have unpublished work that I'm keen to finalise and share. This site is a first step.</p>
<p>To get in touch, please <a href="https://www.linkedin.com/in/joanne-fuller-phd-04955b1a/" rel="me noopener">message me on LinkedIn</a>.</p>
<p><strong>My research interests:</strong> cryptographic Boolean functions and their classification;
affine equivalence and invariants; cryptanalysis.</p>
<p>By <strong>Dr Joanne Fuller</strong> ·
<a href="https://orcid.org/0000-0002-5221-3505" rel="me noopener">ORCID 0000-0002-5221-3505</a> ·
<a href="https://scholar.google.com/citations?user=aCp_g7IAAAAJ&hl=en" rel="me noopener">Google Scholar</a> ·
<a href="https://www.linkedin.com/in/joanne-fuller-phd-04955b1a/" rel="me noopener">LinkedIn</a> ·
<a href="https://eprints.qut.edu.au/15828/1/Joanne_Fuller_Thesis.pdf">PhD thesis (PDF)</a></p>
</main>
<footer class="site-footer"><div class="foot-inner">
<span>© Dr Joanne Fuller · <a href="https://orcid.org/0000-0002-5221-3505" rel="me noopener">ORCID</a> · <a href="https://scholar.google.com/citations?user=aCp_g7IAAAAJ&hl=en" rel="me noopener">Google Scholar</a> · <a href="https://www.linkedin.com/in/joanne-fuller-phd-04955b1a/" rel="me noopener">LinkedIn</a></span>
<span>Content and data licensed <a href="https://creativecommons.org/licenses/by/4.0/" rel="license noopener">CC BY 4.0</a>: please <a href="equivalence-classes.html#cite">cite</a> when reusing</span>
</div></footer>
</body>
</html>