Navid Nasr Esfahani, PhD candidate
David R. Cheriton School of Computer Science
The study of the relationships between similar structures has usually given rise to interesting existence results or methods of construction. The relationship between all-or-nothing transforms and orthogonal arrays or resilient functions has been already studied and presented. In this talk, a brief review of the previous results will be followed the relationship between generalizations of AONTs and other combinatorial structures and cryptographic schemes.
200 University Avenue West
Waterloo, ON N2L 3G1