Koray Karabina: Candidate for position in Discrete Mathematics

Koray Karabina (Post Doc Fellow at University of Waterloo, Canada)
Candidate for position in Discrete Mathematics

Abstract: The efficiency of many cryptographic protocols relies on fast arithmetic and compact representation in the underlying group. I will present my recent work on obtaining compressed representations for finite field elements and speeding up certain finite field operations. I will compare these techniques with the previously-known methods, discuss some applications to pairing-based cryptography, and conclude by stating some open problems and directions for future research.