Efficient Arithmetic and Compact Representations in Finite Fields
  • FENS
  • Efficient Arithmetic and Compact Representations in Finite Fields

You are here

Mathematics Seminar 
EFFICIENT ARITHMETIC AND COMPACT REPRESENTATIONS IN FINITE FIELDS

Speaker: Koray Karabina (University of Waterloo)

Date/Time: 21 February 2012, Tuesday, 11:00

Place: Sabanci University, FENS 2008

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.


Tea, coffee and cookies will be served in FENS 2008 from 10:30.