How can representation theory be used in cryptography and/or coding theory?

I am studying a MSc in pure mathematics and I am currently working on things related to biset functors, but cryptography and coding theory are some of my interest areas. I know that classical representation theory (complex character theory) can be applied in group codes, but I haven't found anything related to biset functors, Burnside rings or modular representation theory.

Does anyone know if these techniques can be useful in theoretical cryptography or in coding theory?

  • $\begingroup$ does the answer address your question? if not why? $\endgroup$
    – kodlu
    Commented Jul 24, 2021 at 23:39

1 Answer 1


In “Alternating Product Ciphers: A Case for Provable Security Comparisons” by J. Pliam https://arxiv.org/abs/1307.4107

some representation theory is used. Here is a snippet of the Proof of Theorem 1

enter image description here


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.