Section: New Results
Strong normal form for large integers, boolean functions and finite automata
Participant : Jean Vuillemin.
Jean Vuillemin's recent work focusses on finding Strong Normal Form for large Integers, Boolean functions and finite Automata, with applications to circuits and software.
 is the latest version of JV’s course notes at ENS ”De l’algorithme au circuit”.
 shows that the ordered dimension of a Boolean function is a lower bound on the size of most known ordered Decision Diagrams, and that ordered decision diagrams can be efficiently constructed an operated upon.
 shows an approach to circuit protection against side-channel attacks based on a statistical analysis of power traces derived from actual measures of the circuit in operation.