جست‌وجوی استاد و پژوهشگر

Øyvind Ytrehusمشاهده پروفایل

استاد

• Coding Theory
• Error-Correcting Codes
• Information Theory
• +۷ مورد دیگر

Øyvind Ytrehus is a Professor at the Department of Informatics, Faculty of Mathematics and Natural Sciences, University of Bergen (UiB), Norway. He is actively engaged in research and academic supervision, with a focus on coding theory and its applications in communication systems. Research Interests: His primary research areas include Coding Theory , Error-Correcting Codes , Information Theory , Network Coding , Cryptography , and RFID Communication . His work bridges theoretical foundations with practical implementations in wireless and networked systems. The recent publications (2024–2008) reflect a consistent trajectory in coding for communication security, RFID systems, and iterative decoding. Key trends include the use of formally unimodular lattices for secrecy gain, LDPC and turbo codes for erasure channels, and network coding for multicast and delay optimization. His work frequently intersects with physical-layer security and energy-efficient communication. Scientific Contributions: Co-edited special issues on coding theory and applications. Authored foundational work on convolutional codes, stopping sets, and generalized Hamming weights. Contributed to RFID and inductively coupled channel modeling. Advising and Grants: He has supervised several PhD candidates, including Bjørn Møller Greve, Christian W. Otterstad, and Mohsen Toorani. While specific grants are not listed, his extensive publication record and editorial roles suggest active grant involvement in coding and communication research. Labs and Teams: While no specific lab name is mentioned, his collaborations with researchers at Simula UiB, University of Valladolid, and Lancaster University indicate participation in interdisciplinary research networks focused on coding and communication systems.

Anamaria Costacheمشاهده پروفایل

دانشیار

• Fully Homomorphic Encryption
• Privacy-Preserving Machine Learning
• Lattice-Based Cryptography
• +۳ مورد دیگر

Anamaria Costache is an Associate Professor at the Norwegian University of Science and Technology (NTNU) in the Department of Information Security and Communication Technology. Previously, she held roles including a postdoc at Royal Holloway, University of London (RHUL), a Research Scientist at Intel AI Research, and a part-time position at Intel. She earned her PhD from the University of Bristol and undergraduate/master's degrees from the University of Warwick, focusing on number theory and algebraic structures like Brauer Groups. Her research interests center on fully homomorphic encryption (FHE), privacy-preserving machine learning, lattice-based cryptography, and post-quantum security protocols. Her work is supported by Intel, addressing challenges in secure computation on encrypted data. She has authored numerous publications in top venues like CRYPTO, PKC, and IEEE conferences, focusing on FHE optimizations, biometric systems, and cryptographic security analyses. Teaching includes courses on applied cryptography, network security, and quantum-safe encryption at NTNU. She co-chairs NIKT 2019 and the WAHC workshops (2022–2024), and serves on editorial boards for journals like IACR Communications in Cryptology. She actively participates in program committees for conferences such as MathCrypt and FHE.org. Professional service includes the Lattigo Advisory Committee and contributions to the Bristol Crypto Blog. Her current projects emphasize verifiable computation over encrypted data and resilient authentication mechanisms in biometric systems.

• Coding Theory
• Cryptography
• Information Theory
• +۵ مورد دیگر

Ermes Franch is a Postdoctoral Fellow at the Department of Informatics, University of Bergen, Norway. He is actively engaged in research in coding theory and cryptography, contributing to both theoretical developments and cryptanalytic investigations. Research Interests: His work primarily focuses on coding theory , especially low-rank parity-check codes, and their applications in cryptography . He investigates algebraic constructions of error-correcting codes, decoding algorithms, and the security of post-quantum cryptographic schemes such as Integer-RLWE. His research lies at the intersection of information theory, algebra, and computer security. Publication Trends: His recent publications show a consistent focus on generalizations and algorithmic improvements in rank-metric coding, with increasing contributions to high-impact IEEE journals. The work demonstrates a trajectory toward both theoretical depth and practical relevance in secure communications. Scientific Funding and Projects: Associated with the project Sequences and Their Applications funded by the Research Council of Norway (Reference: 311646). Advising and Grants: While no formal students are listed, his collaborative publications with senior researchers like Chunlei Li and Philippe Gaborit suggest active participation in a research group. His work is supported by national research grants, indicating recognition of his contributions in the field. Labs and Research Teams: He is affiliated with the Department of Informatics at the University of Bergen, contributing to research in sequences, coding, and cryptography, likely as part of a larger research group focused on theoretical informatics and security.

• Combinatorics
• q-Matroid Theory
• Algebraic Coding Theory
• +۳ مورد دیگر

Rakhi Pratihar is a Postdoctoral Research Fellow at Inria Saclay Centre, France, affiliated with the GRACE research team. Her work bridges combinatorics, algebraic coding theory, and topological structures, focusing on rank metric codes, q-matroids, and shellable simplicial complexes. Research interests include: Decoding algorithms for rank metric codes and their cryptographic applications Generalizations of shellable q-complexes and matroid-like structures Topological and algebraic invariants (e.g., Betti numbers, Euler characteristic) of coding-theoretic objects Her publications span topics like Reed-Muller codes, Gabidulin codes, and Schur squares of Twisted Generalized Reed-Solomon codes, often exploring connections between coding theory and algebraic topology. She employs computational tools like SageMath for algebraic implementations. Rakhi collaborates with researchers such as Alain Couvreur, Sudhir R. Ghorpade, and Trygve Johnsen. Her work has been supported by institutions linked to Inria and the Simons Foundation.

• Cryptography
• Finite Fields
• Boolean Functions
• +۳ مورد دیگر

Assoc. Prof. Constanza Riera is affiliated with the Department of Computing, Mathematics, and Physics at the University of South-East Norway. Her research focuses on cryptography, finite fields, Boolean functions, quantum computing, algebraic combinatorics, and coding theory. She has published extensively on topics including differential spectra, cryptographic function design, quantum states, and algebraic structures. Her work bridges theoretical mathematics with applications in cryptography and information security. Recent articles explore properties of APN functions, c-differentials, quantum state characterization, and combinatorial designs rooted in finite fields. Notable contributions include advancements in c-differential uniformity and the application of Dillon's switching method to construct secure functions. Riera's research also delves into quantum computing, analyzing graph-based quantum states and their algebraic properties. Her interdisciplinary approach addresses both foundational mathematical problems and practical cryptographic challenges.

Mohit Palمشاهده پروفایل

پژوهشگر ارشد

• Cryptography
• Finite Fields
• Boomerang Uniformity
• +۷ مورد دیگر

Mohit Pal is a Postdoctoral Fellow at the Department of Informatics, University of Bergen, Norway. He is affiliated with the Faculty of Mathematics and Natural Sciences and conducts research under the mentorship of Prof. Lilya Budaghyan. He holds a Ph.D. in Mathematics from the Indian Institute of Technology Jammu, where he was supervised by Dr. Sartaj Ul Hasan. Education: B.Sc. in Mathematics, University of Allahabad (2011–2014) M.Sc. in Mathematics, Indian Institute of Technology Kharagpur (2014–2016) Ph.D. in Mathematics, Indian Institute of Technology Jammu (2018–2021) Visiting Student, Indian Institute of Technology Delhi (2018–2019) Visiting Student, Indian Statistical Institute Delhi (2022) His research lies at the intersection of cryptography and finite fields, focusing on boomerang uniformity, differential uniformity, APN and PN functions, permutation polynomials, and arithmetization-oriented cryptographic primitives . His work contributes to the theoretical foundations of symmetric cryptography and algebraic design of secure functions. He has published in leading journals such as Designs, Codes and Cryptography , IEEE Transactions on Information Theory , and Advances in Mathematics of Communications . His recent publications explore connections between generalized differential properties and cryptographic robustness, particularly in odd characteristic fields. Scientific Awards and Recognition: Reviewer for top-tier journals including IEEE Transactions on Information Theory , Designs, Codes and Cryptography , and Applicable Algebra in Engineering, Communication and Computing . Active participant in major international workshops such as Asiacrypt, Boolean Functions and Their Applications (BFA), and SETA. Erdős Number: 3 (via Sartaj Ul Hasan and Pantelimon Stănică). He has advised no students to date but has contributed to research mentoring through collaboration. He taught INF-143A: Applied Cryptography at the University of Bergen in 2024, instructing 84 students at undergraduate and master’s levels. His research has been supported through postdoctoral funding at the University of Bergen and prior project fellowships at IIT Jammu and Harish-Chandra Research Institute. He is currently engaged in advancing the theory of arithmetization-friendly cryptographic functions, with implications for zero-knowledge proofs and secure computation. Laboratories and Research Teams: Mohit Pal is part of the cryptography research group at the Department of Informatics, University of Bergen, collaborating closely with Prof. Lilya Budaghyan and Dr. Chunlei Li. His work integrates into broader efforts on algebraic methods in modern cryptography, particularly in the context of post-quantum and efficient cryptographic design.

Pierre Briaudمشاهده پروفایل

پژوهشگر ارشد

• Post-Quantum Cryptography
• Algebraic Cryptanalysis
• Code-Based Cryptography
• +۲ مورد دیگر

Pierre Briaud is a Postdoctoral Research Fellow in the Department of Cryptography at Simula UiB since January 2024. Previously, he was a PhD student in the COSMIQ project-team at Inria Paris from October 2020 to December 2023, supervised by Jean-Pierre Tillich. Research Interests : Post-Quantum Cryptography Algebraic Cryptanalysis Error-Correcting Codes Code-Based Cryptography Publications Trend : His recent work focuses on syndrome decoding problems and their algebraic analysis, with implications for quantum-resistant cryptographic constructions and pseudorandom generator security. Both 2023 and 2024 publications examine structural vulnerabilities in code-based cryptography. Advising & Collaborations : He was a PhD student under Jean-Pierre Tillich at Inria Paris. His research involves collaborations with institutions like Simula UiB and Inria. Labs : Affiliated with the COSMIQ project-team at Inria Paris (2020-2023) and Simula UiB's Cryptography Department (2024-present).

• Cryptography
• Coding Theory
• Bent Functions
• +۴ مورد دیگر

Oleksandr Kholosha is an Associate Professor at the Department of Informatics, University of Bergen. His research focuses on cryptography, coding theory, and discrete mathematics with an emphasis on bent functions, finite fields, and sequence design. He has collaborated extensively with experts like Tor Helleseth and Lilya Budaghyan. His work spans cryptographic primitives (stream ciphers like Pomaranch), algebraic aspects of bent functions, and analysis of pseudorandom sequences. Notable contributions include studies on Niho bent functions, correlation properties of m-sequences, and cryptanalysis techniques. Key achievements include over 30 peer-reviewed publications in top venues such as IEEE Transactions on Information Theory and Lecture Notes in Computer Science. His research addresses theoretical foundations and practical applications in information security.

Chunlei Liمشاهده پروفایل

استاد

• Cryptography
• Coding Theory
• Wireless Communications
• +۴ مورد دیگر

Chunlei Li is a Professor in the Department of Informatics at the University of Bergen, specializing in Coding Theory and Cryptography. His research focuses on signal design, error-correcting codes, cryptographic primitives, and blockchain technology. He holds a PhD from the University of Bergen (2014) and has held postdoctoral positions at the University of Stavanger and the Selmer Center. He teaches courses in algebraic coding, cybersecurity, and cryptography. His research spans waveform design for wireless communications, feedback shift register sequences, rank metric codes, homomorphic encryption, and discrete mathematics. He leads projects such as 'Sequences and Their Applications' and contributes to conferences like SETA and NISK. Supervised students include those in symmetric cryptography, sequence design, and code-based cryptography. His work emphasizes cryptographic strength, with contributions to APN functions, permutation polynomials, and decoding algorithms for rank metric codes. He has authored numerous papers on topics like differential properties of functions and blockchain-based security systems.

• Cryptography
• Cybersecurity
• Privacy-Preserving Techniques
• +۷ مورد دیگر

Sondre Rønjom is a Professor in the Department of Informatics at the University of Bergen, specializing in cryptography and cybersecurity. His research focuses on cryptanalysis of symmetric ciphers, including AES, stream ciphers, and post-quantum security protocols. He has contributed to advancements in algebraic attacks, invariant subspace techniques, and privacy-preserving technologies like ZK-SNARKs and blockchain security. Education: Completed his doctoral dissertation in 2009 titled Cryptanalysis of ciphers over finite cyclic groups . Research Interests: Explores vulnerabilities in cryptographic algorithms through methods such as differential cryptanalysis, algebraic attacks, and linear subspace analysis. His work bridges theoretical cryptography with practical applications in secure communication and data protection. Publications: Over 15 peer-reviewed articles, including seminal works on AES distinguishers, preimage attacks on Grendel, and cryptanalysis of lightweight ciphers like Robin and Zorro. His research has been featured in top-tier journals like Lecture Notes in Computer Science and IEEE Transactions on Information Theory . Grants & Collaborations: Engaged in collaborative projects with institutions worldwide, contributing to advancements in post-quantum cryptography and blockchain security protocols.

• Cryptography
• Cryptanalysis
• Algebra
• +۴ مورد دیگر

Igor Aleksandrovich Semaev is a Professor at the Department of Informatics, University of Bergen. His research focuses on cryptography, cryptanalysis, algebra, and computational problems in finite fields. He has contributed to areas such as sparse equation systems, Gröbner bases, and algorithmic security. Position: Professor Affiliation: Department of Informatics, University of Bergen Research interests include cryptanalysis of symmetric-key systems (e.g., DES), combinatorial problems in cryptography, and polynomial system solving techniques. His work often bridges algebraic methods with cryptographic applications, addressing challenges like sparse equation solutions and algorithmic complexity. Key contributions include the analysis of LFSR-based stream ciphers, probabilistic methods for Macaulay matrices, and multidimensional linear cryptanalysis. His publications span from 2005 to 2024, reflecting sustained engagement with both theoretical and applied cryptography. Notable projects include funding from the Norwegian Research Council (Project 247742) for work on Gröbner basis complexity. While no awards are explicitly mentioned, his prolific publication record highlights academic recognition. He has advised collaborative projects but no named students are listed. His work intersects with labs or teams through institutional affiliations, though specific lab details are not provided.

• Algebraic Cryptanalysis
• Post-Quantum Cryptography
• Symmetric Cryptography

Morten Øygarden is a Postdoctoral Fellow in the Department of Cryptography at Simula UiB, a joint research initiative between Simula Research Laboratory and the University of Bergen. His work bridges theoretical cryptography and practical security analysis within Norway's premier cryptographic research environment. His educational background culminates in a 2021 PhD from the University of Bergen with the thesis "Algebraic Cryptanalysis of Cryptographic Schemes with Extension Field Structure", establishing his expertise in algebraic methods for cryptanalysis. Øygarden's research focuses on Algebraic Cryptanalysis , Post-Quantum Cryptography , and Symmetric Cryptography , specializing in vulnerabilities of multivariate systems, code-based schemes, and ring-based primitives. He develops novel Gröbner basis techniques to break cryptographic assumptions underlying quantum-resistant candidates, with direct implications for NIST standardization processes. Analysis of his 2020-2024 publications reveals consistent innovation in algebraic attack methodologies, particularly against arithmetization-oriented primitives for zero-knowledge proofs and MPC-friendly ciphers. His work demonstrates exceptional depth in exploiting mathematical structures of symmetric primitives while advancing post-quantum security evaluations of multivariate and code-based systems. His publication record in top venues including CRYPTO, EUROCRYPT, and the Journal of Cryptology reflects significant contributions to cryptographic science, though specific awards or grant details are not documented in available sources.

• Cryptography
• Security analysis of cryptographic algorithms
• Fully Homomorphic Encryption
• +۱ مورد دیگر

Håvard Raddum serves as Chief Research Scientist in the Department of Cryptography at Simula UiB, a joint research entity of Simula Research Laboratory and the University of Bergen. His primary focus involves advancing cryptographic security through algorithm analysis, Fully Homomorphic Encryption applications, and hardware-level attack mitigation. Raddum's research spans cryptography with specialization in security analysis of cryptographic algorithms, practical deployment of Fully Homomorphic Encryption, and physical attacks on hardware implementations. His work addresses vulnerabilities in symmetric ciphers, multivariate schemes, and lattice-based systems through algebraic cryptanalysis, side-channel techniques, and theoretical security proofs. Analysis of his 2019-2025 publications reveals concentrated expertise in cryptanalysis across diverse primitives. Key trends include algebraic attacks on arithmetization-oriented cryptography, side-channel analysis of lightweight ciphers, error detection in lattice computations, and security evaluations of Fully Homomorphic Encryption. His research consistently bridges theoretical frameworks with practical implementation vulnerabilities.