(0)

中国矿业大学学术报告

来源:计算机科学与技术学院作者: 发布时间:2018-09-12 浏览次数:10

中国矿业大学学术报告

Cryptography and sequence design (系列报告三则)

报告题目:Boolean functions and their application in cryptography and sequence design

人:Enes Pasalic 教授,博导, University of Primorska

间:2018913 上午 9:30-10:20 

点:计算机学院计B524

主办单位:计算机学院

欢迎全校师生踊跃参加!

报告摘要:This talk gives an overview of some interesting problems that requires  our deeper understanding of classical Boolean functions which in general maps n input bits to a single output bit. A collection of $m$ such mappings then constitute a vectorial Boolean function and especially when n=m (or in general when m|n one may translate some problems into the finite field theory domain. This talk will in the first place motivate our interest in these discrete structures from application point of view, mostly related to cryptography and the sequence design. On the other hand, I will briefly mention certain recent achievements in this field which might have tremendous consequences compared to classical approaches. The talk will be given at the most basic level, avoiding as much as possible heavy mathematical machinery, and therefore no previous knowledge is needed so that students are also encouraged to attend it.

个人简介:Dr. Enes Pasalic is a full professor and the leader of Cryptography group at FAMNITand IAM (University of Primorska) and is an internationally renowned researcherwhose research work encompasses the areas primarily related to cryptology and associateddiscrete mathematical structure. He is recognized as one of the world leading experts intheory of cryptographic Boolean functions in terms of their both theoretical and practicalapplications in certain cryptographic primitives.His bibliography record comprises more than 50 journal publications (where 21 articles were published in IEEE Transaction on Information Theory) and 11 articlespresented in international conferences and published in proceedings.

  

报告题目:Gbent functions and their applications

人: Samir Hodzic, 博士,  University of Primorska

间: 2018 913 上午10:20-11:00 

点:计算机学院计B524

主办单位:计算机学院

欢迎全校师生踊跃参加!

报告摘要:A natural generalization of bent functions is a class of functions from F2n to Z2k which is known as generalized bent (gbent) functions. In this talk, we discuss their application in MC-CDMA/OFDM communication systems, as well as their full characterization in terms of classical Boolean functions. Also, we consider a subclass of functions from F2n to Z2k , called Zq-bent functions (which are necessarily gbent), which essentially gives rise to even stronger structures such as vectorial bent (Boolean) functions and relative difference sets. At the end, the characterization of the Gray maps of gbent functions and certain generic construction methods are provided

个人简介:Samir Hodzic has completed her PhD on University of Primorska, FAMNIT, Koper, Slovenia. My PhD thesis (written under the supervision of Prof. Enes Pasalic) is composed out of eight scientific articles which considers three separate topics, all related to symmetric-key cryptography from both design and security perspective. The first topic of my thesis is devoted to the study of generalized bent functions, which are used in the design of OFDM and MC-CDMA communication systems. The second topic considers the analysis of stream and block ciphers from the design and cryptanalysis point of view. As a final topic, polynomials over finite fields that do not admit so-called linear structures were considered. Also, I have been working on other important problems that concern so-called Index generating functions and bent/plateaued functions, which have wide range of application. The ultimate goal of my research is to derive the most advanced/efficient characterization results and methods for construction of cryptographically significant Boolean functions used for various applications.

  

报告题目:Constructions of sparse and complete permutations

人:Nastja Cepak, 博士,  University of Primorska

间: 2018 913 上午11:00-11:40 

点:计算机学院计B524

主办单位:计算机学院

欢迎全校师生踊跃参加!

报告摘要:: In areas like cryptography, coding theory, and many others permutations play a vital role. For use in IoT devices and other applications that require fast and cheap computation, sparse permutations are especially useful. In this talk we take a look at how to construct such permutations over finite fields using linear translators and their generalisation, the Frobenius translator. We demonstrate also some constructions over vector spaces and how these can be used to generate complete permutations.

个人简介:Nastja Cepak has completed her PhD on University of Primorska, FAMNIT, Koper, Slovenia. Since 2014 she has been employed there as a young researcher and teaching assistant for abstract algebra and coding theory. Her research focuses on non-linear Boolean functions and permutations of finite fields. There are many papers which are published in IEEE Transaction on Information Theory, finite fields and their applications and so on.