A course is available in video-format: https://nsk.compsciclub.ru/en/courses/cryptoanalysis/nsk/2020-spring/classes/

]]>13.02.2020-A. Kutsenko, "Self-dual bent functions: characterization and metric properties". Known properties of self-dual bent functions are considered. The obtained metric properties are described: the minimum Hamming distance between self-dual bent functions, and the spectrum of Hamming distances between functions from the Mayoran-Macfarland class. The metric regularity is proved and the metric complement of the set of self-dual bent functions is found.

20.02.2020-A. Kutsenko, "The group of automorphisms of the set of self-dual bent functions". The results obtained for isometric mappings of a set of self-dual benp functions are presented. It is proved that the automorphism groups of sets of self-dual and anti-self-dual bent functions coincide. The group of automorphisms of the set of self-dual bent functions is fully described.

27.02.2020 - A. Oblaukhov, "Metric regularity and metric complements in the Boolean cube". We present the results obtained that affect the properties of metric additions of subsets of a Boolean cube. A General view of the metric complement of a linear subspace of a Boolean cube is found. A lower estimate for the power of the maximum metrically regular set is obtained. The metric regularity of the reed-Maller codes RM(k, m) is proved for the case k>=m−3.

]]>Одной из возможных причин такой эффективности, является фактическое сокращение длинны эпизода, т.к. одно действие верхнего уровня соответсвует нескольким итерациям среды. Также причиной может быть использование семантический более простых действий на верхнем уровне, например желаемое изменение состояния.

На семинаре рассмотрим state-of-the-art методы иерархического обучения и статью в которой исследуются несколько гипотез объясняющих его хорошую работу, а так же возможность использование иерархии для ускорения исследования среды.

Докладчик: Станислав Сычев.

Язык доклада: русский.

Дата и время: 16-е марта, 18:30-20:00.

Место: Zoom.

Видео с предыдущих семинаров доступно по ссылке: http://bit.ly/MLJBSeminars

]]>Promising semantics 1.0 [1] is an auspicious solution for the problem, however, the memory model doesn't support the optimal compilation scheme of ARMv8.3's RMWs as well as global optimizations. In the talk, a new semantics--Promising 2.0-- is going to be presented.

[1] Jeehoon Kang, Chung-Kil Hur, Ori Lahav, Viktor Vafeiadis, Derek Dreyer. A promising semantics for relaxed-memory concurrency. In POPL 2017, pp. 175-189. ACM (January 2017)

17.02.2020, 17:15. Venue:room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28

The course invites you to learn more about cryptography; you'll learn some important math which stands behind the ciphers, and defines how resistant the particular cipher will be to different types of attacks.

The key topics covered in the course:

* how cryptography developed in Russia and in the Soviet Union, including the facts which used to be top secret until very recent times;

* Boolean functions and S-boxes, and how the resistance of a cipher depends on a cryptographic properties of a Boolean function;

* methods of cryptanalysis

* some special and most intriguing types of cryptographic Boolean functions: bent functions and APN-functions (Almost Perfect Nonlinear Functions)

* AI and ML for cryptography.

A video-trailer is here:

It covers all the basic constructions of Arend. It does not mention anything related to homotopy theory.

This will be the topic of the second part.

https://arend-lang.github.io/documentation/tutorial

]]>

On this seminar, we will briefly list the existing appraches and limitations of code clone detection, as well specific features of licensing of code, and will then discuss the results of a study conducted in our laboratory. In the first part of the seminar, the modification to token-based clone detection will be presented that allows developers to detect more clones of a more diverse nature, and in the second part of the seminar, the application of such clone detection for discovering possible code borrowings and license violations on a scale of popular Java code on GitHub will be demonstrated and discussed.

Speaker: Yaroslav Golubev.

Language: Russian.

Date and Time: Feburary 5th, 7:30 pm - 9 pm.

Place: Times, room 404.

Videos from previous seminars are available at: http://bit.ly/MLJBSeminars

]]>16.12.2019, 17:15. Venue:room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28

]]>tactic subsystem of Coq provides means for proof automation, which

facilitates a broad range of its application as a proof assistant. At

the same time the attempts to utilize the rich type system of Coq for

writing dependently typed programs often face certain problems. In

particular, elimination for deep dependent types (using such tactics as

inversion/destruct as well as direct pattern matching construct) can be

cumbersome. In the talk we consider some of these difficulties and

present the ways to work them around.

Speaker: Dmitrii Boulytchev

02.11.2019, 17:15.

Venue:room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28 ]]>Ссылка на статью: https://vhellendoorn.github.io/PDF/icse2019.pdf

Докладчик: Анастасия Тучина.

Язык доклада: русский.

Дата и время: 11-е декабря, 19:30-21:00.

Место: Таймс, аудитория 404.

Видео с семинаров доступно по ссылке: http://bit.ly/MLJBSeminars

]]>We will investigate parallel complexity of variants of CFL-reachability problem with interesting subclasses of context-free grammars and graphs. A Boolean circuit for this problem will be presented. We will obtain characteristic affecting the effectiveness of Boolean circuit and will observe lower and upper bounds on its value.

Speaker: Ekaterina Shemetova

02.11.2019, 17:15.

Venue: room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28

18.11.2019, 17:15.

Venue: room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg
State University, Stary Peterhof, Universitetski pr., 28

model typeclasses, synthesize proofs. Programmable type inference is one of the key ingredients

for the successful formalization of the Odd Order Theorem and is being widely used in the Mathcomp library.

On concrete examples we will show the inner workings of Coq's unification algorithm,

touch upon the questions of organizing algebraic hierarchies, and briefly compare

the language of Canonical Structures to the one of Type Classes and Unification Hints.

Presenter: Anton Trunov

11.11.2019, 17:15.

Venue: room 3248, Faculty of Mathematics and Mechanics, Saint PetersburgState University, Stary Peterhof, Universitetski pr., 28

]]>В Сочи Павел сделал обзорный доклад про автоматический анализ и генерацию юмора, а в Екатеринбурге -- о подходах и данных для генерации программного кода на основе текстов на естественном языке.

]]>NSUCRYPTO is the unique cryptographic Olympiad containing scientific mathematical problems for professionals, school and university students from any country. Its aim is to involve young researchers in solving curious and tough scientific problems of modern cryptography. From the very beginning, the concept of the Olympiad was not to focus on solving olympic tasks but on including unsolved research problems at the intersection of mathematics and cryptography. There were more than 1600 participants from 52 countries in the first five Olympiads NSUCRYPTO (2014 - 2018).

We are looking forward for the results! www.nsucrypto.nsu.ru

]]>28.10.2019, 17:15.

Venue: room 3248, Faculty of Mathematics and Mechanics, Saint PetersburgState University, Stary Peterhof, Universitetski pr., 28

]]>21.10.2019, 17:15.

State University, Stary Peterhof, Universitetski pr., 28

]]>