AKLEYLEK, S. Et Al. 2010. Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity. INDOCRYPT 2010 11th International Conference on Cryptology in India .

AKLEYLEK, S., CENK, M., & ÖZBUDAK, F., (2010). Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity . INDOCRYPT 2010 11th International Conference on Cryptology in India

AKLEYLEK, SEDAT, MURAT CENK, And FERRUH ÖZBUDAK. "Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity," INDOCRYPT 2010 11th International Conference on Cryptology in India, 2010

AKLEYLEK, SEDAT Et Al. "Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity." INDOCRYPT 2010 11th International Conference on Cryptology in India , 2010

AKLEYLEK, S. CENK, M. And ÖZBUDAK, F. (2010) . "Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity." INDOCRYPT 2010 11th International Conference on Cryptology in India .

@conferencepaper{conferencepaper, author={SEDAT AKLEYLEK Et Al. }, title={Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity}, congress name={INDOCRYPT 2010 11th International Conference on Cryptology in India}, city={}, country={}, year={2010}}