Blar i Institutt for matematiske fag på emneord "Matematikk, Algebra"
Viser treff 1-7 av 7
-
Fully Homomorphic Encryption
(Master thesis, 2015)I 2009 presenterte Craig Gentry det første krypteringssystemet som klarte å utføre vilkårlig mange homomorfe operasjoner, og i prosessen lagde han også en framgangsmåte på hvordan man konstruerer et slikt system. I denne ... -
Improving on the Number Field Sieve
(Master thesis, 2015)We look at efficient methods for computing logarithms in finite fields of any type. To achieve this, we first develop methods for factoring integers and computing discrete logarithms in fields of prime order using algebraic ... -
Lineære hemmelige delingsprotokoller og sikre flerpartsberegninger
(Master thesis, 2014)Vi ser på lineære hemmelige delingsprotokoller og sikre flerpartsberegningsprotokoller. Shamirs hemmelige delingsprotokoll og en hemmelig delingsprotokoll basert på monotone utspenningsprogram blir presentert. Vi ser også ... -
Paper-based electronic voting
(Master thesis, 2015)In this thesis, we present two paper-based electronic voting systems Prêt-à-Voter and Demos. We describe these in the same systematic way with new examples. Furthermore, we implement RSA cryptosystem in Prêt-à-Voter. Then, ... -
Tau-tilting Theory in Representation Theory of Finite Dimensional Algebras
(Master thesis, 2016)Tau-tilting theory was recently introduced by Adachi, Iyama and Reiten. Their main aim was to develop a generalization of classical tilting theory where mutation is always possible. The inspiration for this came mainly ... -
Tau-tilting Theory in Representation Theory of Finite Dimensional Algebras
(Master thesis, 2016)Tau-tilting theory was recently introduced by Adachi, Iyama and Reiten. Their main aim was to develop a generalization of classical tilting theory where mutation is always possible. The inspiration for this came mainly ... -
The Extended Golay Codes as Ideals
(Master thesis, 2016)We define a multiplication on the ambient spaces of the extended binary and ternary Golay codes that results in these codes becoming left ideals in their ambient spaces. We use fixed-point-free permutation groups to define ...