- A. Katsiotis, N. Kolokotronis, and N. Kalouptsidis, “Physical layer security via secret trellis pruning,” in proc. of 24th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, pp. 502–507, 2013.
- N. Kolokotronis and K. Limniotis, “A greedy algorithm for checking normality of cryptographic boolean functions,” in proc. of 2012 International Symposium on Information Theory and its Applications, pp. 601–605, 2012.
- N. Kolokotronis and K. Limniotis, “On the second–order nonlinearity of cubic Maiorana–McFarland boolean functions,” in proc. of 2012 International Symposium on Information Theory and its Applications, pp. 596–600, 2012.
- K. Limniotis, N. Kolokotronis, and N. Kalouptsidis, “Constructing boolean functions in odd number of variables with maximum algebraic immunity,” in proc. of 2011 IEEE International Symposium on Information Theory, pp. 2662–2666, 2011.
- N. Kalouptsidis and N. Kolokotronis, “Fast decoding of regular LDPC codes using greedy approximation algorithms,” in proc. of 2011 IEEE International Symposium on Information Theory, pp. 2011–2015, 2011.
- T. Etzion, N. Kalouptsidis, N. Kolokotronis, K. Limniotis and K. G. Paterson, “On the error linear complexity profiles of binary sequences of period 2^n,” in proc. of 2008 IEEE International Symposium on Information Theory, pp. 2400–2404, Jul. 2008.
- N. Kolokotronis, “On symplectic matrices of cubic boolean forms and connections with second order nonlinearity,” in proc. of 2008 IEEE International Symposium on Information Theory, pp. 1636-1640, Jul. 2008.
- N. Kolokotronis, K. Limniotis, and N. Kalouptsidis, “Efficient computation of the best quadratic approximations of cubic boolean functions,” in proc. of 2007 Cryptography and Coding, S. Galbraith (Eds). Springer–Verlag, Lecture Notes on Computer Science, vol. 4887, pp. 73–91, Dec. 2007.
- N. Kolokotronis, K. Limniotis, and N. Kalouptsidis, “Improved bounds on the linear complexity of keystreams obtained by filter generators,” in proc. of 2007 Information Security and Cryptology – Inscrypt, D. Pei et al. (Eds). Springer–Verlag, Lecture Notes on Computer Science, vol. 4990, pp. 246–255, Sep. 2007.
- N. Kolokotronis, K. Limniotis, and N. Kalouptsidis, “Best affine approximations of boolean functions and applications to low order approximations,” in proc. of 2007 IEEE International Symposium on Information Theory, pp. 1836–1840, Jun. 2007.
- K. Limniotis, N. Kolokotronis, and N. Kalouptsidis, “New results on the linear complexity of binary sequences,” in proc. of 2006 IEEE International Symposium on Information Theory, pp. 2003–2007, Jul. 2006.
- N. Kolokotronis, “Cryptographic properties of stream ciphers based on t–functions,” in proc. of 2006 IEEE International Symposium on Information Theory, pp. 1604–1608, Jul. 2006.
- N. Kolokotronis, K. Limniotis, and N. Kalouptsidis, “Lower bounds on sequence complexity via generalised Vandermonde determinants,” in proc. of 2006 Conference on Sequences and Their Applications, G. Gong, T. Helleseth, H.–Y. Song, and K. Yang (Eds). Springer–Verlag, Lecture Notes on Computer Science, vol. 4086, pp. 271–284, Sep. 2006.
- K. Limniotis, N. Kolokotronis, and N. Kalouptsidis, “Nonlinear complexity of binary sequences and connections with Lempel–Ziv compression,” in proc. of 2006 Conference on Sequences and Their Applications, G. Gong, T. Helleseth, H.–Y. Song, and K. Yang (Eds). Springer–Verlag, Lecture Notes on Computer Science, vol. 4086, pp. 168–179, Sep. 2006.
- P. Rizomiliotis, N. Kolokotronis, and N. Kalouptsidis, “On the quadratic span of binary sequences,” in proc. of 2003 IEEE International Symposium on Information Theory, pp. 377, Jul. 2003.
- N. Kolokotronis, G. Gatt, and N. Kalouptsidis, “On the generation of sequences simulating higher order white noise for system identification,” in proc. of 11th European Signal Processing Conference, pp. 217–220, vol. I, Sep. 2002.
- P. Rizomiliotis, N. Kolokotronis, and N. Kalouptsidis, “Construction of sequences with four–valued autocorrelation from GMW sequences,” in proc. of 2002 IEEE International Symposium on Information Theory, pp. 183, Jul. 2002.
- C. Margaritis, N. Kolokotronis, P. Papadopoulou, P. Kanellis, and D. Martakos, “A model and implementation guidelines for information security strategies in web environments,” in proc. of Advances in Information Security Management & Small Systems Security, J. Eloff, L. Labuschagne, R. Solms, and G. Dhillon (Eds). Kluwer Academic Pub., International Federation for Information Processing, pp. 13–34, vol. 72, Sep. 2001.
- N. Kolokotronis, P. Rizomiliotis, and N. Kalouptsidis, “First–order optimal approximation of binary sequences,” in proc. of 2001 Conference on Sequences and Their Applications, T. Helleseth, P. V. Kumar, and K. Yang (Eds). Springer–Verlag, Discrete Mathematics and Theoretical Computer Science, pp. 242–256, May 2001.
- P. Papadopoulou, N. Kolokotronis, P. Kanellis, and D. Martakos, “Conceptualizing and implementing an information security strategy for Internet billing systems,” in proc. of 2000 International Conference on Advances in Infrastructure for e–Business, e–Science, and e–Education on the Internet, Jul. 2000.
|
|
