Cryptanalysis of the Public Key Cryptosystem Based on the Word Problem on the Grigorchuk Groups. - George Petrides (IMACC, 2003)

Generalised Bent Criteria for Boolean Functions (II) - Constanza Riera; George Petrides; Matthew Geoffrey Parker (CoRR, 2005)

On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes. - George Petrides; Johannes Mykkeltveit (SETA, 2006)

Composition of recursions and nonlinear complexity of periodic binary sequences. - George Petrides; Johannes Mykkeltveit (Des. Codes Cryptogr., 2008)

A Novel Framework for Protocol Analysis. - Kristian Gjøsteen; George Petrides; Asgeir Steine (ProvSec, 2011)

Towards Privacy Preserving Mobile Internet Communications - How Close Can We Get? - Kristian Gjøsteen; George Petrides; Asgeir Steine (ACISP, 2013)

Rhythmic Keccak: SCA Security and Low Latency in HW. - Victor Arribas; Begül Bilgin; George Petrides; Svetla Nikova; Vincent Rijmen (IACR Cryptol. ePrint Arch., 2017)

On Non-Completeness in Threshold Implementations. - George Petrides (TIS@CCS, 2019)

Misclassification cost-sensitive ensemble learning: A unifying framework. - George Petrides; Wouter Verbeke (CoRR, 2020)

Predicting employee absenteeism for cost effective interventions. - Natalie Lawrance; George Petrides; Marie-Anne Guerry (Decis. Support Syst., 2021)

A number theoretic view on binary shift registers. - George Petrides (Cryptogr. Commun., 2022)

Cost-sensitive ensemble learning: a unifying framework. - George Petrides; Wouter Verbeke (Data Min. Knowl. Discov., 2022)

An Optimal Universal Construction for the Threshold Implementation of Bijective S-boxes. - Enrico Piccione; Samuele Andreoli; Lilya Budaghyan; Claude Carlet; Siemen Dhooghe; Svetla Nikova; George Petrides; Vincent Rijmen (IACR Cryptol. ePrint Arch., 2022)

Cost-sensitive learning for profit-driven credit scoring. - George Petrides; Darie Moldovan; Lize Coenen; Tias Guns; Wouter Verbeke (J. Oper. Res. Soc., 2022)

On decompositions of permutation polynomials into quadratic and cubic power permutations. - George Petrides (Cryptogr. Commun., 2023)

Cost-Sensitive Stacking: an Empirical Evaluation. - Natalie Lawrance; Marie-Anne Guerry; George Petrides (CoRR, 2023)

Further existence results of decompositions of permutation polynomials. - Samuele Andreoli; George Petrides (Cryptogr. Commun., 2025)