Score:2

Representation theory in cryptography/coding theory

ke flag

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?

kodlu avatar
sa flag
does the answer address your question? if not why?
Score:1
sa flag

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

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.