<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="et">
	<id>http://courses.cs.taltech.ee/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Risto</id>
	<title>Kursused - Kasutaja kaastöö [et]</title>
	<link rel="self" type="application/atom+xml" href="http://courses.cs.taltech.ee/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Risto"/>
	<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/pages/Eri:Kaast%C3%B6%C3%B6/Risto"/>
	<updated>2026-11-22T21:09:45Z</updated>
	<subtitle>Kasutaja kaastöö</subtitle>
	<generator>MediaWiki 1.35.9</generator>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12333</id>
		<title>CYBERCOR-MD-2026</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12333"/>
		<updated>2026-11-08T17:57:25Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=== Building a Security Operations Center (SOC) with free tools ===&lt;br /&gt;
&lt;br /&gt;
* Day 1: Using Elasticstack-based SIEM in a SOC&lt;br /&gt;
* Day 2: Using Suricata IDS in a SOC&lt;br /&gt;
* Day 3: Building a SOC with Wazuh&lt;br /&gt;
* Day 4: Vulnerability detection and management in a SOC&lt;br /&gt;
* Day 5: Incident handling in a SOC&lt;br /&gt;
&lt;br /&gt;
=== Hardware requirements ===&lt;br /&gt;
&lt;br /&gt;
It is assumed that each training participant attends the course with a personal laptop which meets the following requirements:&lt;br /&gt;
&lt;br /&gt;
* x86-64 CPU architecture (training VM images have been created for this architecture)&lt;br /&gt;
* At least 8 logical CPUs&lt;br /&gt;
* At least 16GB of memory&lt;br /&gt;
* Virtualbox version 7 installed on the laptop (Virtualbox VM images are used for training)&lt;br /&gt;
* Host-only virtual network (e.g., 192.168.56.0/24) configured in Virtualbox&lt;br /&gt;
&lt;br /&gt;
=== Training materials ===&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/drive/folders/1r1jSlVCmvsmBfYyVreXTqvROhUzenaQ8?usp=sharing Day 1 and Day 2]&lt;br /&gt;
* [https://drive.google.com/drive/folders/1LHz2BvnGay8SqLCU4d5ympGfDix86BMg?usp=drive_link Day 3 and Day 4]&lt;br /&gt;
* Day 5&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12332</id>
		<title>CYBERCOR-MD-2026</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12332"/>
		<updated>2026-11-08T16:07:57Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=== Building a Security Operations Center (SOC) with free tools ===&lt;br /&gt;
&lt;br /&gt;
* Day 1: Using Elasticstack-based SIEM in a SOC&lt;br /&gt;
* Day 2: Using Suricata IDS in a SOC&lt;br /&gt;
* Day 3: Building a SOC with Wazuh&lt;br /&gt;
* Day 4: Vulnerability detection and management in a SOC&lt;br /&gt;
* Day 5: Incident handling in a SOC&lt;br /&gt;
&lt;br /&gt;
=== Hardware requirements ===&lt;br /&gt;
&lt;br /&gt;
It is assumed that each training participant attends the course with a personal laptop which meets the following requirements:&lt;br /&gt;
&lt;br /&gt;
* x86-64 CPU architecture (training VM images have been created for this architecture)&lt;br /&gt;
* At least 8 logical CPUs&lt;br /&gt;
* At least 16GB of memory&lt;br /&gt;
* Virtualbox version 7 installed on the laptop (Virtualbox VM images are used for training)&lt;br /&gt;
* Host-only virtual network (e.g., 192.168.56.0/24) configured in Virtualbox&lt;br /&gt;
&lt;br /&gt;
=== Training materials ===&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/drive/folders/1r1jSlVCmvsmBfYyVreXTqvROhUzenaQ8?usp=sharing Day 1 and Day 2]&lt;br /&gt;
* [https://drive.google.com/drive/folders/1LHz2BvnGay8SqLCU4d5ympGfDix86BMg?usp=drive_link Day 3]&lt;br /&gt;
* Day 4&lt;br /&gt;
* Day 5&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12331</id>
		<title>Cyber Defense Monitoring Solutions</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12331"/>
		<updated>2026-11-04T15:03:48Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Basic information ==&lt;br /&gt;
&lt;br /&gt;
* Course Code -- ITX8071&lt;br /&gt;
* Credit Points -- 6.0 EAP&lt;br /&gt;
* Course Language -- English&lt;br /&gt;
* Course Schedule -- the course will be lectured from 17:45 to 21:00 on every Wednesday of fall semester 2026. Note that some lectures might take place in MS Teams environment under the team [https://teams.microsoft.com/l/team/19%3a5d5f0c8381e446479e60341c0ff80b3a%40thread.tacv2/conversations?groupId=d803439d-d006-45de-a0db-bf35b61db566&amp;amp;tenantId=3efd4d88-9b88-4fc9-b6c0-c7ca50f1db57 &amp;quot;Cyber Defense Monitoring Solutions (ITX8071)]&amp;quot;, while remaining lectures and all labs are arranged in room ICT-401.&lt;br /&gt;
* Course Materials -- use the registration code w7Xz53c for accessing all course slides and pre-recorded lecture videos in Moodle.&lt;br /&gt;
&lt;br /&gt;
== Detailed Course Schedule ==&lt;br /&gt;
&lt;br /&gt;
* September 2 2026 (introduction to the course, lecture of module 1) -- MS Teams&lt;br /&gt;
* September 9 2026 (lab of module 1) -- room ICT-401&lt;br /&gt;
* September 16 2026 (lab of module 2) -- room ICT-401&lt;br /&gt;
* September 23 2026 (lecture of module 3) -- room ICT-401&lt;br /&gt;
* September 30 2026 (lab of module 3) -- room ICT-401&lt;br /&gt;
* October 7 2026 (lab of module 4) -- room ICT-401&lt;br /&gt;
* October 14 2026 (lecture of module 5) -- room ICT-401&lt;br /&gt;
* October 21 2026 (lab of module 5) -- room ICT-401&lt;br /&gt;
* October 28 2026 (lecture of module 6) -- room ICT-401&lt;br /&gt;
* November 4 2026 (lab of module 6) -- room ICT-401&lt;br /&gt;
* November 11 2026 (lab of module 7) -- room ICT-401&lt;br /&gt;
* November 18 2026 (lecture of module 8) -- room ICT-401&lt;br /&gt;
* November 25 2026 (lab of module 8) -- room ICT-401&lt;br /&gt;
* December 2 2026 (lecture of module 9) -- MS Teams&lt;br /&gt;
* December 9 2026 (lab of module 9) -- room ICT-401&lt;br /&gt;
&lt;br /&gt;
== Evaluation ==&lt;br /&gt;
&lt;br /&gt;
During the semester, two homework assignments are given to each student. Both assignments can yield up to 12.5 points, thus the maximum score from homework is 25 points. During the exam, three tasks are given to each student, with each task yielding up to 25 points and the whole exam up to 75 points. The final grade for a student is derived from his/her personal score:&lt;br /&gt;
&lt;br /&gt;
* score &amp;gt; 90 -- grade 5 (excellent)&lt;br /&gt;
* 80 &amp;lt; score ≤ 90 -- grade 4 (very good)&lt;br /&gt;
* 70 &amp;lt; score ≤ 80 -- grade 3 (good)&lt;br /&gt;
* 60 &amp;lt; score ≤ 70 -- grade 2 (satisfactory)&lt;br /&gt;
* 50 &amp;lt; score ≤ 60 -- grade 1 (pass)&lt;br /&gt;
* score ≤ 50 -- a student has failed to pass&lt;br /&gt;
&lt;br /&gt;
In addition to regular 100 points from homeworks and exam, extra points can be collected for active participation in the course (see the following sections).&lt;br /&gt;
&lt;br /&gt;
== Virtual machine image ==&lt;br /&gt;
&lt;br /&gt;
For course lab sessions, there is a [https://drive.google.com/file/d/1omHVnJ-yEKg2-w9E-S_IcXpitlDUhoF7/view?usp=sharing virtual machine image] which has been created with VirtualBox. When importing the image into VirtualBox, &amp;#039;&amp;#039;&amp;#039;don&amp;#039;t forget&amp;#039;&amp;#039;&amp;#039; to select the option &amp;#039;&amp;#039;&amp;#039;&amp;quot;Generate new MAC addresses for all network adapters&amp;quot;&amp;#039;&amp;#039;&amp;#039;. In order to run your virtual machine as a node of the classroom network, change the mode of the first network adapter from NAT to &amp;#039;&amp;#039;&amp;#039;Bridged Adapter&amp;#039;&amp;#039;&amp;#039;. &lt;br /&gt;
&lt;br /&gt;
Since the virtual machine is essential for doing homework assignments, it is strongly recommended to also install it on a personal laptop. In order to do that, leave the first network adapter to NAT mode, and change the mode of the second network adapter to &amp;#039;&amp;#039;&amp;#039;Host-only Adapter&amp;#039;&amp;#039;&amp;#039;. The host-only adapter is connected to a special virtual network (e.g., 192.168.56.0/24) that is not accessible from other hosts and is shared between the host computer and virtual machines. This network can be used for accessing the virtual machine from the host computer and creating setups where several virtual machines need to communicate.&lt;br /&gt;
&lt;br /&gt;
For changing the console keyboard layout of the virtual machine, use the &amp;#039;&amp;#039;&amp;#039;/usr/bin/localectl&amp;#039;&amp;#039;&amp;#039; tool. For example, &amp;#039;&amp;#039;&amp;#039;localectl set-keymap ee&amp;#039;&amp;#039;&amp;#039; sets Estonian keyboard layout for console and &amp;#039;&amp;#039;&amp;#039;localectl set-keymap us&amp;#039;&amp;#039;&amp;#039; sets US keyboard layout for console, while &amp;#039;&amp;#039;&amp;#039;localectl list-keymaps&amp;#039;&amp;#039;&amp;#039; lists all available layouts and &amp;#039;&amp;#039;&amp;#039;localectl status&amp;#039;&amp;#039;&amp;#039; shows the current settings.&lt;br /&gt;
&lt;br /&gt;
To ensure the smooth progress of the lab sessions, each lab is &amp;#039;&amp;#039;&amp;#039;independent&amp;#039;&amp;#039;&amp;#039; of the previous ones, requiring no work completed in earlier labs, and can be completed using a &amp;#039;&amp;#039;&amp;#039;newly instantiated&amp;#039;&amp;#039;&amp;#039; virtual machine from the virtual machine image.&lt;br /&gt;
&lt;br /&gt;
== Lab sessions ==&lt;br /&gt;
&lt;br /&gt;
Solutions for past lab sessions are available [https://drive.google.com/drive/folders/1-UYUgO-rnobRPRoVLwQvrivqyQbDpjEc?usp=sharing here].&lt;br /&gt;
&lt;br /&gt;
Note that the last lab of the course on December 9 2026 is a &amp;#039;&amp;#039;&amp;#039;graded lab which provides 5 extra points for participants&amp;#039;&amp;#039;&amp;#039;. During the graded lab, groups of max 3 students have to work on an assignment that is described [[itx8071-graded-lab|here]]. In order to speed up your work during the lab, you can accomplish part of the assignment in advance. &amp;#039;&amp;#039;&amp;#039;To receive points for the graded lab, the assignment solution has to be presented to the lecturers for evaluation during the lab session in ICT-401, and any other submissions are not accepted.&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
== Independent work during the semester ==&lt;br /&gt;
&lt;br /&gt;
Note that the lectures of the course are interactive discussions which assume the students have prepared themselves for the lectures.&lt;br /&gt;
For attending the course successfully, the following course materials have to be independently studied in Moodle by given deadlines:&lt;br /&gt;
&lt;br /&gt;
* lecture materials of module 2 (&amp;quot;Introduction to packet filtering with the Linux netfilter firewall&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 16 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 3 (&amp;quot;Regular expression language&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 23 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 4 (&amp;quot;Introduction to Perl regular expressions&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 7 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 5 (&amp;quot;Syslog-ng framework&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 14 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 6 (&amp;quot;Introduction to event correlation and Simple Event Correlator&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 28 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 7 (&amp;quot;Simple Event Correlator - advanced topics&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 11 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 8 (&amp;quot;Introduction to intrusion detection/prevention and Suricata IDS/IPS&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 18 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
In Moodle, lecture materials of several modules are followed by &amp;#039;&amp;#039;&amp;#039;tests which provide extra points&amp;#039;&amp;#039;&amp;#039;, with each test consisting of four multiple choice questions. The test can be taken &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039; and has to be completed &amp;#039;&amp;#039;&amp;#039;before the relevant lecture takes place&amp;#039;&amp;#039;&amp;#039;. To pass the test, at least three questions have to be answered correctly, and each successfully passed test yields &amp;#039;&amp;#039;&amp;#039;1 extra point&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
== Homework assignments ==&lt;br /&gt;
&lt;br /&gt;
* [[itx8071-task1|Task1]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;November 3 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
* [[itx8071-task2|Task2]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;December 15 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
Solutions to homework assignments should be sent to the e-mail address of the lecturer (given in the title page of each slide module). Together with the solution, full names and student codes of the authors must be listed. You should consider your solution submitted only after its reception &amp;#039;&amp;#039;&amp;#039;has been confirmed&amp;#039;&amp;#039;&amp;#039; by the lecturer. Please submit your solution from a &amp;#039;&amp;#039;&amp;#039;working&amp;#039;&amp;#039;&amp;#039; email address where you can receive confirmation and feedback. Also, as some email clients may alter the formatting of copied and pasted text, make sure that your email &amp;#039;&amp;#039;&amp;#039;accurately represents your work&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
All submitted solutions should be carefully tested final versions. Please submit the solution &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039;, and do &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; send in partial and/or untested work. It is not allowed to submit a partial solution, and use comments from the lecturer for later resubmission of improved version(s). Also, if you wish to submit multiple solutions, you must &amp;#039;&amp;#039;&amp;#039;clearly indicate&amp;#039;&amp;#039;&amp;#039; which one should be used for evaluation. If no such indication is provided, the &amp;#039;&amp;#039;&amp;#039;first solution&amp;#039;&amp;#039;&amp;#039; will be used for evaluating your work, and other solutions are not considered.&lt;br /&gt;
&lt;br /&gt;
Please note that each student can be a (co)author of only one solution (i.e., participation in more than one student group is not allowed). Also note that the list of authors can not be changed after the deadline.&lt;br /&gt;
&lt;br /&gt;
The correct solution with your score will be announced after the deadline.&lt;br /&gt;
&lt;br /&gt;
Solutions submitted after the deadline will &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; be accepted. Also, it is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; possible to redo the homework assignment after the deadline. &lt;br /&gt;
&lt;br /&gt;
== Notes about distance learning ==&lt;br /&gt;
&lt;br /&gt;
In the case you are not able to attend lectures and labs physically, the course can be taken in a distance learning setting. However, you should consider the following when opting for the distance learning path:&lt;br /&gt;
&lt;br /&gt;
* All course slides and prerecorded lecture video clips can be accessed through Moodle&lt;br /&gt;
* Lab assignments can be found at the end of each lecture slideset (slides with the title &amp;quot;Tasks&amp;quot;)&lt;br /&gt;
* Make sure that you solve all lab assignments on the course virtual machine -- examination tasks are similar to lab assignments and having a good understanding of the lab topics is essential for passing the final exam&lt;br /&gt;
* Lab assignment solutions with comments are regularly posted to the course home page -- don&amp;#039;t forget to compare your work with posted solutions!&lt;br /&gt;
* Check the course home page regularly for new homework assignments, assignment deadlines, and other important information&lt;br /&gt;
* Because homework assignments allow the students to work as a group, it is recommended to join some group by looking potential cooperation partners through the course MS Teams group&lt;br /&gt;
* Since the course is offering extra points in addition to regular ones, it is recommended to collect as many extra points as possible for improving your final grade&lt;br /&gt;
&lt;br /&gt;
== Information about the exam ==&lt;br /&gt;
&lt;br /&gt;
The exam is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted. In order to attend the exam, each student must present an ID with a photo and have at least one pen in good working order. During the exam, each student has to accomplish 3 tasks within 3 hours on paper. All paper materials such as printed course slides, paper-based notes, and hardcopy books can be freely used during the exam. &lt;br /&gt;
&lt;br /&gt;
The exam can be taken during one of the following time slots:&lt;br /&gt;
&lt;br /&gt;
* December 16 2026, 17:45-21:00, room ICT-401&lt;br /&gt;
* January 6 2027, 15:45-19:00, room ICT-701&lt;br /&gt;
* January 13 2027, 15:45-19:00, room ICT-701&lt;br /&gt;
&lt;br /&gt;
For taking the exam, &amp;#039;&amp;#039;&amp;#039;official registration in OIS&amp;#039;&amp;#039;&amp;#039; is required for one of the examination time slots.&lt;br /&gt;
&lt;br /&gt;
Note that each student can take the exam only once, and in order to get the second try for improving the result, official application for re-examination is required (see below).&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;While producing his/her final examination work, the student must consider the following:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* Since there is no defense of the written examination work, the examination work must present full and unambiguous task solutions&lt;br /&gt;
* Each task must have only one clearly presented solution; if multiple solutions are given, only the first one will be evaluated&lt;br /&gt;
* All handwriting in the examination work must be legible&lt;br /&gt;
* No spare pens are provided to students during the exam&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;The following rules apply during the exam, and failure to follow them will invalidate the examination work of the student:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* The use of Internet, digital materials, and electronic devices (computers, mobile phones, cameras, etc.) is not permitted for any purposes&lt;br /&gt;
* All electronic devices will have to be switched to silent mode and left on a designated desk for the duration of the exam&lt;br /&gt;
* Any communication between students or with persons not taking the exam is strictly prohibited&lt;br /&gt;
* While the use of printed materials is permitted, it is not allowed to share such materials between students&lt;br /&gt;
* Students can&amp;#039;t leave the examination room during the first 60 minutes and the last 30 minutes of the exam&lt;br /&gt;
* Each student can leave the examination room once during the exam for max 10 minutes (only one person can leave the room at a time)&lt;br /&gt;
* When leaving the examination room, the student has to surrender the task sheet to the lecturer (it is prohibited to take any exam-related materials outside the room)&lt;br /&gt;
* When submitting the examination work, the student must also hand over the task sheet&lt;br /&gt;
* It is strictly prohibited to take photos or make any other copies of the task sheet&lt;br /&gt;
&lt;br /&gt;
== Re-examination information ==&lt;br /&gt;
&lt;br /&gt;
Each student is granted one re-examination attempt which requires official application. The student can apply for re-examination after failing a regular exam, or for improving a low grade from a regular exam. Re-examination invalidates any previous grade or intermediate result which was obtained during the semester. During re-examination, 2 assignments have to be accomplished within 1 hour. The final grade is solely based on assignment solutions, and no work from previous exam or semester can be combined with the re-exam.&lt;br /&gt;
&lt;br /&gt;
The re-examination is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted, and all rules of the regular exam apply (see above).&lt;br /&gt;
&lt;br /&gt;
The re-exam can be taken on January 13 2027 at 15:45-17:00 in room ICT-701.&lt;br /&gt;
&lt;br /&gt;
== Plagiarism policy ==&lt;br /&gt;
&lt;br /&gt;
Please note that &amp;#039;&amp;#039;&amp;#039;plagiarized&amp;#039;&amp;#039;&amp;#039; home works and exam works will be &amp;#039;&amp;#039;&amp;#039;rejected without a review&amp;#039;&amp;#039;&amp;#039;, and the university will be &amp;#039;&amp;#039;&amp;#039;notified&amp;#039;&amp;#039;&amp;#039; of the offense. All cases of student plagiarism and other violations of academic practices will be handled according to [https://haldus.taltech.ee/sites/default/files/2020-10/Terviktekst_IT-teaduskonna%20%C3%B5ppuri%20akad%20tavade%20rikkumise%20ja%20v%C3%A4%C3%A4ritu%20k%C3%A4itumise%20menetlemise%20kord_ENG.pdf regulations of the IT faculty].&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12330</id>
		<title>CYBERCOR-MD-2026</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12330"/>
		<updated>2026-11-03T16:40:52Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=== Building a Security Operations Center (SOC) with free tools ===&lt;br /&gt;
&lt;br /&gt;
* Day 1: Using Elasticstack-based SIEM in a SOC&lt;br /&gt;
* Day 2: Using Suricata IDS in a SOC&lt;br /&gt;
* Day 3: Building a SOC with Wazuh&lt;br /&gt;
* Day 4: Vulnerability detection and management in a SOC&lt;br /&gt;
* Day 5: Incident handling in a SOC&lt;br /&gt;
&lt;br /&gt;
=== Hardware requirements ===&lt;br /&gt;
&lt;br /&gt;
It is assumed that each training participant attends the course with a personal laptop which meets the following requirements:&lt;br /&gt;
&lt;br /&gt;
* x86-64 CPU architecture (training VM images have been created for this architecture)&lt;br /&gt;
* At least 8 logical CPUs&lt;br /&gt;
* At least 16GB of memory&lt;br /&gt;
* Virtualbox version 7 installed on the laptop (Virtualbox VM images are used for training)&lt;br /&gt;
* Host-only virtual network (e.g., 192.168.56.0/24) configured in Virtualbox&lt;br /&gt;
&lt;br /&gt;
=== Training materials ===&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/drive/folders/1r1jSlVCmvsmBfYyVreXTqvROhUzenaQ8?usp=sharing Day 1 and Day 2]&lt;br /&gt;
* Day 3&lt;br /&gt;
* Day 4&lt;br /&gt;
* Day 5&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12329</id>
		<title>CYBERCOR-MD-2026</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12329"/>
		<updated>2026-11-03T16:39:53Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=== Building a Security Operations Center (SOC) with free tools ===&lt;br /&gt;
&lt;br /&gt;
* Day 1: Using Elasticstack-based SIEM in a SOC&lt;br /&gt;
* Day 2: Using Suricata IDS in a SOC&lt;br /&gt;
* Day 3: Building a SOC with Wazuh&lt;br /&gt;
* Day 4: Vulnerability detection and management in a SOC&lt;br /&gt;
* Day 5: Incident handling in a SOC&lt;br /&gt;
&lt;br /&gt;
=== Hardware requirements ===&lt;br /&gt;
&lt;br /&gt;
It is assumed that each training participant attends the course with a personal laptop which meets the following requirements:&lt;br /&gt;
&lt;br /&gt;
* x86-64 CPU architecture (training VM images have been created for this architecture)&lt;br /&gt;
* At least 8 logical CPUs&lt;br /&gt;
* At least 16GB of memory&lt;br /&gt;
* Virtualbox version 7 installed on the laptop (Virtualbox VM images are used for training)&lt;br /&gt;
* Host-only network configured in Virtualbox&lt;br /&gt;
&lt;br /&gt;
=== Training materials ===&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/drive/folders/1r1jSlVCmvsmBfYyVreXTqvROhUzenaQ8?usp=sharing Day 1 and Day 2]&lt;br /&gt;
* Day 3&lt;br /&gt;
* Day 4&lt;br /&gt;
* Day 5&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12328</id>
		<title>CYBERCOR-MD-2026</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12328"/>
		<updated>2026-11-03T16:22:55Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=== Building a Security Operations Center (SOC) with free tools: ===&lt;br /&gt;
&lt;br /&gt;
* Day 1: Using Elasticstack-based SIEM in a SOC&lt;br /&gt;
* Day 2: Using Suricata IDS in a SOC&lt;br /&gt;
* Day 3: Building a SOC with Wazuh&lt;br /&gt;
* Day 4: Vulnerability detection and management in a SOC&lt;br /&gt;
* Day 5: Incident handling in a SOC&lt;br /&gt;
&lt;br /&gt;
=== Training materials: ===&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/drive/folders/1r1jSlVCmvsmBfYyVreXTqvROhUzenaQ8?usp=sharing Day 1 and Day 2]&lt;br /&gt;
* Day 3&lt;br /&gt;
* Day 4&lt;br /&gt;
* Day 5&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12327</id>
		<title>CYBERCOR-MD-2026</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12327"/>
		<updated>2026-11-03T16:22:32Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=== Building a Security Operations Center (SOC) with free tools: ===&lt;br /&gt;
&lt;br /&gt;
* Day 1: Using Elasticstack-based SIEM in a SOC&lt;br /&gt;
* Day 2: Using Suricata IDS in a SOC&lt;br /&gt;
* Day 3: Building a SOC with Wazuh&lt;br /&gt;
* Day 4: Vulnerability detection and management in a SOC&lt;br /&gt;
* Day 5: Incident handling in a SOC&lt;br /&gt;
&lt;br /&gt;
=== Training materials: ===&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/drive/folders/1r1jSlVCmvsmBfYyVreXTqvROhUzenaQ8?usp=sharing Days 1 and 2]&lt;br /&gt;
* Day 3&lt;br /&gt;
* Day 4&lt;br /&gt;
* Day 5&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12326</id>
		<title>CYBERCOR-MD-2026</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12326"/>
		<updated>2026-11-03T16:16:14Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=== Building a Security Operations Center (SOC) with free tools ===&lt;br /&gt;
&lt;br /&gt;
* Day1: Using Elasticstack-based SIEM in a SOC&lt;br /&gt;
* Day2: Using Suricata IDS in a SOC&lt;br /&gt;
* Day3: Building a SOC with Wazuh&lt;br /&gt;
* Day4: Vulnerability detection and management in a SOC&lt;br /&gt;
* Day5: Incident handling in a SOC&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12325</id>
		<title>CYBERCOR-MD-2026</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=CYBERCOR-MD-2026&amp;diff=12325"/>
		<updated>2026-11-03T16:15:29Z</updated>

		<summary type="html">&lt;p&gt;Risto: Uus lehekülg: &amp;#039;== CYBERCOR-MD 2026 fall semester training ==  ==== Building a Security Operations Center (SOC) with free tools ====  * Day1: Using Elasticstack-based SIEM in a SOC * Day2: Using...&amp;#039;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== CYBERCOR-MD 2026 fall semester training ==&lt;br /&gt;
&lt;br /&gt;
==== Building a Security Operations Center (SOC) with free tools ====&lt;br /&gt;
&lt;br /&gt;
* Day1: Using Elasticstack-based SIEM in a SOC&lt;br /&gt;
* Day2: Using Suricata IDS in a SOC&lt;br /&gt;
* Day3: Building a SOC with Wazuh&lt;br /&gt;
* Day4: Vulnerability detection and management in a SOC&lt;br /&gt;
* Day5: Incident handling in a SOC&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Esileht&amp;diff=12324</id>
		<title>Esileht</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Esileht&amp;diff=12324"/>
		<updated>2026-11-03T16:08:05Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Avalikud loengud ja seminarid ==&lt;br /&gt;
&lt;br /&gt;
[[Public Lectures|Avalikud loengud]]&lt;br /&gt;
&lt;br /&gt;
[[Workshops|Seminarid]]&lt;br /&gt;
&lt;br /&gt;
= TTÜ tarkvarateaduse instituut - Kursused =&lt;br /&gt;
&lt;br /&gt;
=== Doktorantidele suunatud kursused ===&lt;br /&gt;
&lt;br /&gt;
=== Magistrantidele suunatud kursused ===&lt;br /&gt;
&lt;br /&gt;
* [[ITX8205  | Network forensic (ITX8205)]]&lt;br /&gt;
* [[Cyber Defense Monitoring Solutions|Cyber Defense Monitoring Solutions (ITX8071)]]&lt;br /&gt;
* [[ITC8060|Network Protocol Design (ITC8060)]]&lt;br /&gt;
* [[ITT8060|Advanced programming (ITT8060)]]&lt;br /&gt;
* [[ITI8600|Teadmispõhise tarkvaraarenduse meetodid / Methods of Knowledge Based Software Development (ITI8600)]]&lt;br /&gt;
* [[ITI8531|Software synthesis and verification (ITI8531)]]&lt;br /&gt;
* [[Malware:ITX8042:2016| Kurivara/Malware (ITX8042)]]&lt;br /&gt;
* [[Malware:ITX8060:2016| Kurivara2/Malware2 (ITX8060)]]&lt;br /&gt;
* [[ModernOS:2016 | Modern operation sytems / Kaasaegsete operatsioonisüsteemide ülevaade (ITV005)]]&lt;br /&gt;
* [[ITX8205:2015| Network Forensic (ITX8205)]]&lt;br /&gt;
* [[ITC8220-2015| Special Course on Digital Forensics I]]&lt;br /&gt;
* [[ITX8530|Tarkvaraarenduse meeskonnaprojekt: tellimus (ITX8530)]]&lt;br /&gt;
* [[ITI8740|Tarkvaaraarenduse meeskonnaprojekt (ITI8740)]]&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [[ITX8540|Tarkvaraarenduse teaduspõhine meeskonnaprojekt: startup]]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* [[ITI8610|Tarkvara töökindlus / Software Assurance (ITI8610)]]&lt;br /&gt;
* [[ITI8565|Masinõpe / Machine learning (ITI8565)]]&lt;br /&gt;
* [[Hybrid Systems ITI8580 |Hübriidsüsteemid / Hybrid Systems (ITI8580 )]]&lt;br /&gt;
* [[Data Mining (ITI8730)]]&lt;br /&gt;
* [[Advanced Algorithms and Data Structures|Algoritmide ja andmestruktuuride erikursus (ITI8590)]]&lt;br /&gt;
* [[Teadmiste formaliseerimine|Ettevalmistamisel kursus: teadmiste formaliseerimine]]&lt;br /&gt;
* [[ITS8020|Süsteemprogrammeerimine (ITS8020)]]&lt;br /&gt;
* [[ITI0021|Loogiline Programmeerimine (ITI0211)]]&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [[ITI0120|Tehisintellekti ja masinõppe alused (ITI0120)]]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* [[ITI8740|Software Development Team Project (ITI8740/ITX8522)]]&lt;br /&gt;
* [[ITX8301|MSc Seminar I (Software Engineering)]]&lt;br /&gt;
&lt;br /&gt;
=== Bakalaureuseõppe kursused ===&lt;br /&gt;
&lt;br /&gt;
* [[ITI0102|Programmeerimise algkursus (ITI0102)]]&lt;br /&gt;
* [[ITI0021|Loogiline Programmeerimine (ITI0211)]]&lt;br /&gt;
* [[ITI0050|Algoritmid ja andmestruktuurid (ITI0050)]]&lt;br /&gt;
* [[ITI0140|Programmeerimise süvendatud algkursus (ITI0140)]]&lt;br /&gt;
* [[Programmeerimise erikursus|Programmeerimise erikursus (ITV0101)]]&lt;br /&gt;
* [[Kasutajaliidesed (ITI0209)]]&lt;br /&gt;
* [[Veebirakendused (ITI0205)]]&lt;br /&gt;
* [[ITV0140|Mobiilirakendused (ITV0140)]]&lt;br /&gt;
* [[ITX0040|Andmeturve (ITX0040)]]&lt;br /&gt;
* [[ITV0050|Operatsioonisüsteemide ja arvutivõrkude administreerimine (ITV0050)]]&lt;br /&gt;
* [[Diskreetne matemaatika 2 (ITT0030) harjutused]]&lt;br /&gt;
* [[ITI0201|Robotite programmeerimine (ITI0201)]]&lt;br /&gt;
* [[ITV0200|Tarkvaraarenduse meeskonnaprojekt: tellimus (ITV0200)]]&lt;br /&gt;
* [[ITI0210|Tehisintellekti ja masinõppe alused (ITI0210)]]&lt;br /&gt;
&lt;br /&gt;
=== Muud kursused ===&lt;br /&gt;
&lt;br /&gt;
* [[SummerAI|Summer School Course on AI 2024]]&lt;br /&gt;
* [[CYBERCOR-MD-2026|CYBERCOR-MD 2026 fall semester training]]&lt;br /&gt;
&lt;br /&gt;
== courses.cs.ttu.ee varasemad kursused ==&lt;br /&gt;
&lt;br /&gt;
=== Doktorantidele suunatud kursused ===&lt;br /&gt;
&lt;br /&gt;
* [[PhD reading group (IXX9601/2/3)]]&lt;br /&gt;
* [[Cyber security PhD seminar]]&lt;br /&gt;
* [[Formal methods in  model-based testing and verification]]&lt;br /&gt;
&lt;br /&gt;
=== Magistrantidele suunatud kursused ===&lt;br /&gt;
&lt;br /&gt;
* [[ITX8301|Magistriseminar/MSc seminar (ITX8301)]]&lt;br /&gt;
* [[ITX8302|Magistriseminar/MSc seminar II (ITX8302)]]&lt;br /&gt;
* [[Machine learning|Machine Learning (ITI8565)]]&lt;br /&gt;
* [[Hybrid Systems|Hybrid Systems (ITI8580)]]&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12322</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12322"/>
		<updated>2026-11-01T22:52:34Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
=== Create SEC rules that accomplish the following event correlation task: ===&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports). &lt;br /&gt;
&lt;br /&gt;
For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour. For that purpose, the context NOISY_PORT_TCP_21 with the lifetime of 3600 seconds should be created. On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
In addition, the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy (that is, the context NOISY_PORT_TCP_21 exists):&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=47846 DPT=&amp;#039;&amp;#039;&amp;#039;445&amp;#039;&amp;#039;&amp;#039; WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6000&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6001&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6002&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;br /&gt;
&lt;br /&gt;
==== Some hints for accomplishing this assignment:====&lt;br /&gt;
&lt;br /&gt;
* Don&amp;#039;t try to solve the whole assignment with just one rule, but rather write several rules which interact.&lt;br /&gt;
* For subtask 1, use Single rules that set up contexts with appropriate actions-on-expire. To detect a noisy port, you could create a context for the tracked port with the lifetime of 900 seconds whose action-on-expire creates the context NOISY_PORT_&amp;lt;port_description&amp;gt;. In addition, you could create the second context for the tracked port with the lifetime of 30 seconds, extending its lifetime on each firewall event for the tracked port. If the second context expires, its action-on-expire should delete the first context, not allowing its expiration and the creation of the NOISY_PORT_&amp;lt;port_description&amp;gt; context. See lecture slides 12-14 of Module 7, which illustrate the use of this two-context technique for a different task.&lt;br /&gt;
* For subtask 2, see lecture slides 16-17 of Module 7 for a suitable technique. For a more advanced alternative, consider the technique from Section 6.4 of the SEC tutorial (https://simple-evcorr.github.io/SEC-tutorial.pdf). Note that the solution for subtask 2 should check for the presence of NOISY_PORT_* contexts to receive input from the solution of subtask 1.&lt;br /&gt;
* Solutions for subtasks 1 and 2 must remain fully functional when port probing is conducted from several hosts simultaneously. In particular, contexts maintained by different counting operations must not interfere with one another.&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12321</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12321"/>
		<updated>2026-11-01T22:51:35Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
=== Create SEC rules that accomplish the following event correlation task: ===&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports). &lt;br /&gt;
&lt;br /&gt;
For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour. For that purpose, the context NOISY_PORT_TCP_21 with the lifetime of 3600 seconds should be created. On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
In addition, the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy (that is, the context NOISY_PORT_TCP_21 exists):&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=47846 DPT=&amp;#039;&amp;#039;&amp;#039;445&amp;#039;&amp;#039;&amp;#039; WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6000&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6001&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6002&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;br /&gt;
&lt;br /&gt;
==== Some hints for accomplishing this assignment:====&lt;br /&gt;
&lt;br /&gt;
* Don&amp;#039;t try to solve the whole assignment with just one rule, but rather write several rules which interact.&lt;br /&gt;
* For subtask 1, use Single rules that set up contexts with appropriate actions-on-expire. To detect a noisy port, you could create a context for the tracked port with the lifetime of 900 seconds whose action-on-expire creates the context NOISY_PORT_&amp;lt;port_description&amp;gt;. In addition, you could create the second context for the tracked port with the lifetime of 30 seconds, extending its lifetime on each firewall event for the tracked port. If the second context expires, its action-on-expire should delete the first context, not allowing its expiration and the creation of the NOISY_PORT_&amp;lt;port_description&amp;gt; context. See lecture slides 12-14 of Module 7 which illustrate the use of this two-context technique for a different task.&lt;br /&gt;
* For subtask 2, see lecture slides 16-17 of Module 7 for a suitable technique. For a more advanced alternative, consider the technique from Section 6.4 of the SEC tutorial (https://simple-evcorr.github.io/SEC-tutorial.pdf). Note that the solution for subtask 2 should check for the presence of NOISY_PORT_* contexts to receive input from the solution of subtask 1.&lt;br /&gt;
* Solutions for subtasks 1 and 2 must remain fully functional when port probing is conducted from several hosts simultaneously. In particular, contexts maintained by different counting operations must not interfere with one another.&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12320</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12320"/>
		<updated>2026-10-29T19:47:11Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
=== Create SEC rules that accomplish the following event correlation task: ===&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports). &lt;br /&gt;
&lt;br /&gt;
For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour. For that purpose, the context NOISY_PORT_TCP_21 with the lifetime of 3600 seconds should be created. On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
In addition, the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy (that is, the context NOISY_PORT_TCP_21 exists):&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=47846 DPT=&amp;#039;&amp;#039;&amp;#039;445&amp;#039;&amp;#039;&amp;#039; WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6000&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6001&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6002&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;br /&gt;
&lt;br /&gt;
==== Some hints for accomplishing this assignment:====&lt;br /&gt;
&lt;br /&gt;
* Don&amp;#039;t try to solve the whole assignment with just one rule, but rather write several rules which interact.&lt;br /&gt;
* For subtask 1, use Single rules that set up contexts with appropriate actions-on-expire. To detect a noisy port, you could create a context for the tracked port with the lifetime of 900 seconds whose action-on-expire creates the context NOISY_PORT_&amp;lt;port_description&amp;gt;. In addition, you could create the second context for the tracked port with the lifetime of 30 seconds, extending its lifetime on each firewall event for the tracked port. If the second context expires, its action-on-expire should delete the first context, not allowing its expiration and the creation of the NOISY_PORT_&amp;lt;port_description&amp;gt; context. See lecture slides 12-14 which illustrate the use of this two-context technique for a different task.&lt;br /&gt;
* For subtask 2, see lecture slides 16-17 for a suitable technique. For a more advanced alternative, consider the technique from Section 6.4 of the SEC tutorial (https://simple-evcorr.github.io/SEC-tutorial.pdf). Note that the solution for subtask 2 should check for the presence of NOISY_PORT_* contexts to receive input from the solution of subtask 1.&lt;br /&gt;
* Solutions for subtasks 1 and 2 must remain fully functional when port probing is conducted from several hosts simultaneously. In particular, contexts maintained by different counting operations must not interfere with one another.&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12319</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12319"/>
		<updated>2026-10-29T19:46:49Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
=== Create SEC rules that accomplish the following event correlation task: ===&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports). For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour. For that purpose, the context NOISY_PORT_TCP_21 with the lifetime of 3600 seconds should be created. On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
In addition, the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy (that is, the context NOISY_PORT_TCP_21 exists):&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=47846 DPT=&amp;#039;&amp;#039;&amp;#039;445&amp;#039;&amp;#039;&amp;#039; WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6000&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6001&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6002&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;br /&gt;
&lt;br /&gt;
==== Some hints for accomplishing this assignment:====&lt;br /&gt;
&lt;br /&gt;
* Don&amp;#039;t try to solve the whole assignment with just one rule, but rather write several rules which interact.&lt;br /&gt;
* For subtask 1, use Single rules that set up contexts with appropriate actions-on-expire. To detect a noisy port, you could create a context for the tracked port with the lifetime of 900 seconds whose action-on-expire creates the context NOISY_PORT_&amp;lt;port_description&amp;gt;. In addition, you could create the second context for the tracked port with the lifetime of 30 seconds, extending its lifetime on each firewall event for the tracked port. If the second context expires, its action-on-expire should delete the first context, not allowing its expiration and the creation of the NOISY_PORT_&amp;lt;port_description&amp;gt; context. See lecture slides 12-14 which illustrate the use of this two-context technique for a different task.&lt;br /&gt;
* For subtask 2, see lecture slides 16-17 for a suitable technique. For a more advanced alternative, consider the technique from Section 6.4 of the SEC tutorial (https://simple-evcorr.github.io/SEC-tutorial.pdf). Note that the solution for subtask 2 should check for the presence of NOISY_PORT_* contexts to receive input from the solution of subtask 1.&lt;br /&gt;
* Solutions for subtasks 1 and 2 must remain fully functional when port probing is conducted from several hosts simultaneously. In particular, contexts maintained by different counting operations must not interfere with one another.&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12318</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12318"/>
		<updated>2026-10-29T12:03:47Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
=== Create SEC rules that accomplish the following event correlation task: ===&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour. For that purpose, the context NOISY_PORT_TCP_21 with the lifetime of 3600 seconds should be created. On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
In addition, the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy (that is, the context NOISY_PORT_TCP_21 exists):&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=47846 DPT=&amp;#039;&amp;#039;&amp;#039;445&amp;#039;&amp;#039;&amp;#039; WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6000&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6001&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6002&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;br /&gt;
&lt;br /&gt;
==== Some hints for accomplishing this assignment:====&lt;br /&gt;
&lt;br /&gt;
* Don&amp;#039;t try to solve the whole assignment with just one rule, but rather write several rules which interact.&lt;br /&gt;
* For subtask 1, use Single rules that set up contexts with appropriate actions-on-expire. To detect a noisy port, you could create a context for the tracked port with the lifetime of 900 seconds whose action-on-expire creates the context NOISY_PORT_&amp;lt;port_description&amp;gt;. In addition, you could create the second context for the tracked port with the lifetime of 30 seconds, extending its lifetime on each firewall event for the tracked port. If the second context expires, its action-on-expire should delete the first context, not allowing its expiration and the creation of the NOISY_PORT_&amp;lt;port_description&amp;gt; context. See lecture slides 12-14 which illustrate the use of this two-context technique for a different task.&lt;br /&gt;
* For subtask 2, see lecture slides 16-17 for a suitable technique. For a more advanced alternative, consider the technique from Section 6.4 of the SEC tutorial (https://simple-evcorr.github.io/SEC-tutorial.pdf). Note that the solution for subtask 2 should check for the presence of NOISY_PORT_* contexts to receive input from the solution of subtask 1.&lt;br /&gt;
* Solutions for subtasks 1 and 2 must remain fully functional when port probing is conducted from several hosts simultaneously. In particular, contexts maintained by different counting operations must not interfere with one another.&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12317</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12317"/>
		<updated>2026-10-29T12:00:23Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
=== Create SEC rules that accomplish the following event correlation task: ===&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour. For that purpose, the context NOISY_PORT_TCP_21 with the lifetime of 3600 seconds should be created. On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
In addition, the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy (that is, the context NOISY_PORT_TCP_21 exists):&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=47846 DPT=&amp;#039;&amp;#039;&amp;#039;445&amp;#039;&amp;#039;&amp;#039; WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6000&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6001&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6002&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;br /&gt;
&lt;br /&gt;
==== Some hints for accomplishing this assignment:====&lt;br /&gt;
&lt;br /&gt;
* Don&amp;#039;t try to solve the whole assignment with just one rule, but rather write several rules which interact.&lt;br /&gt;
* For subtask 1, use Single rules that set up contexts with appropriate actions-on-expire. To detect a noisy port, you could create a context for the tracked port with the lifetime of 900 seconds whose action-on-expire creates the context NOISY_PORT_&amp;lt;port_description&amp;gt;. In addition, you could create the second context for the tracked port with the lifetime of 30 seconds, extending its lifetime on each firewall event for the tracked port. If the second context expires, its action-on-expire should delete the first context, not allowing its expiration. See lecture slides 12-14 which illustrate the use of this two-context technique for a different task.&lt;br /&gt;
* For subtask 2, see lecture slides 16-17 for a suitable technique. For a more advanced alternative, consider the technique from Section 6.4 of the SEC tutorial (https://simple-evcorr.github.io/SEC-tutorial.pdf). Note that the solution for subtask 2 should check for the presence of NOISY_PORT_* contexts to receive input from the solution of subtask 1.&lt;br /&gt;
* Solutions for subtasks 1 and 2 must remain fully functional when port probing is conducted from several hosts simultaneously. In particular, contexts maintained by different counting operations must not interfere with one another.&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12316</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12316"/>
		<updated>2026-10-29T11:58:23Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
=== Create SEC rules that accomplish the following event correlation task: ===&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour. For that purpose, the context NOISY_PORT_TCP_21 with the lifetime of 3600 seconds should be created. On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
In addition, the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy (that is, the context NOISY_PORT_TCP_21 exists):&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=47846 DPT=&amp;#039;&amp;#039;&amp;#039;445&amp;#039;&amp;#039;&amp;#039; WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6000&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6001&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6002&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;br /&gt;
&lt;br /&gt;
==== Some hints for accomplishing this assignment:====&lt;br /&gt;
&lt;br /&gt;
* Don&amp;#039;t try to solve the whole assignment with just one rule, but rather write several rules which interact.&lt;br /&gt;
* For subtask 1, use Single rules that set up contexts with appropriate actions-on-expire. To detect a noisy port, you could create a context for the tracked port with the lifetime of 900 seconds whose action-on-expire creates the context NOISY_PORT_&amp;lt;port_description&amp;gt;. In addition, you could create the second context for the tracked port with the lifetime of 30 seconds, extending its lifetime on each firewall event for the tracked port. If the second context expires, its action-on-expire should delete the first context. See lecture slides 12-14 which illustrate the use of this two-context technique for a different task.&lt;br /&gt;
* For subtask 2, see lecture slides 16-17 for a suitable technique. For a more advanced alternative, consider the technique from Section 6.4 of the SEC tutorial (https://simple-evcorr.github.io/SEC-tutorial.pdf). Note that the solution for subtask 2 should check for the presence of NOISY_PORT_* contexts to receive input from the solution of subtask 1.&lt;br /&gt;
* Solutions for subtasks 1 and 2 must remain fully functional when port probing is conducted from several hosts simultaneously. In particular, contexts maintained by different counting operations must not interfere with one another.&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12315</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12315"/>
		<updated>2026-10-29T11:36:10Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
=== Create SEC rules that accomplish the following event correlation task: ===&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour (for example, by creating the context NOISY_PORT_21_TCP with the lifetime of 3600 seconds). On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
In addition, the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=34342 DPT=&amp;#039;&amp;#039;&amp;#039;80&amp;#039;&amp;#039;&amp;#039; WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=47846 DPT=&amp;#039;&amp;#039;&amp;#039;445&amp;#039;&amp;#039;&amp;#039; WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6000&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6001&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=&amp;#039;&amp;#039;&amp;#039;TCP&amp;#039;&amp;#039;&amp;#039; SPT=31959 DPT=&amp;#039;&amp;#039;&amp;#039;6002&amp;#039;&amp;#039;&amp;#039; WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;br /&gt;
&lt;br /&gt;
==== Some hints for accomplishing this assignment:====&lt;br /&gt;
&lt;br /&gt;
* Don&amp;#039;t try to solve the whole assignment with just one rule, but rather write several rules which interact.&lt;br /&gt;
* To accomplish subtask 1, use Single rules that set up contexts with specific actions-on-expire. In particular, you could consider setting up one context with the lifetime of 900 which creates the context NOISY_PORT_&amp;lt;port_description&amp;gt; at the end of its 900-second lifetime. In addition, you could consider setting up the second context with the lifetime of 30 seconds, so that this lifetime gets extended on each firewall event, and the second context would delete the first context if its 30-second lifetime should expire. See lecture slides 12-14 which illustrate the use of such a two-context technique for a different task.&lt;br /&gt;
* To accomplish subtask 2, see lecture slides 16-17 for a technique to tackle this task. As an alternative, you can consider the technique Section 6.4 of the SEC tutorial (https://simple-evcorr.github.io/SEC-tutorial.pdf). Note that the solution for subtask 2 should check for the presence of NOISY_PORT_* contexts to receive input from the solution of subtask 1.&lt;br /&gt;
* Solutions for subtasks 1 and 2 must be fully functional even when port probing is conducted from several hosts in parallel (for example, contexts maintained by different counting operations must not interfere with each other).&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12314</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12314"/>
		<updated>2026-10-29T11:28:23Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
=== Create SEC rules that accomplish the following event correlation task: ===&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour (for example, by creating the context NOISY_PORT_21_TCP with the lifetime of 3600 seconds). On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
In addition, the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=&amp;#039;&amp;#039;&amp;#039;10.1.1.7&amp;#039;&amp;#039;&amp;#039; DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=80 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=80 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=445 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6000 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6001 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6002 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;br /&gt;
&lt;br /&gt;
==== Some hints for accomplishing this assignment:====&lt;br /&gt;
&lt;br /&gt;
* Don&amp;#039;t try to solve the whole assignment with just one rule, but rather write several rules which interact.&lt;br /&gt;
* To accomplish subtask 1, use Single rules that set up contexts with specific actions-on-expire. In particular, you could consider setting up one context with the lifetime of 900 which creates the context NOISY_PORT_&amp;lt;port_description&amp;gt; at the end of its 900-second lifetime. In addition, you could consider setting up the second context with the lifetime of 30 seconds, so that this lifetime gets extended on each firewall event, and the second context would delete the first context if its 30-second lifetime should expire. See lecture slides 12-14 which illustrate the use of such a two-context technique for a different task.&lt;br /&gt;
* To accomplish subtask 2, see lecture slides 16-17 for a technique to tackle this task. As an alternative, you can consider the technique Section 6.4 of the SEC tutorial (https://simple-evcorr.github.io/SEC-tutorial.pdf). Note that the solution for subtask 2 should check for the presence of NOISY_PORT_* contexts to receive input from the solution of subtask 1.&lt;br /&gt;
* Solutions for subtasks 1 and 2 must be fully functional even when port probing is conducted from several hosts in parallel (for example, contexts maintained by different counting operations must not interfere with each other).&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12313</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12313"/>
		<updated>2026-10-29T11:26:12Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
=== Create SEC rules that accomplish the following event correlation task: ===&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour (for example, by creating the context NOISY_PORT_21_TCP with the lifetime of 3600 seconds). On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
In addition, the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=80 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=80 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=445 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6000 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6001 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6002 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;br /&gt;
&lt;br /&gt;
==== Some hints for accomplishing this assignment:====&lt;br /&gt;
&lt;br /&gt;
* Don&amp;#039;t try to solve the whole assignment with just one rule, but rather write several rules which interact.&lt;br /&gt;
* To accomplish subtask 1, use Single rules that set up contexts with specific actions-on-expire. In particular, you could consider setting up one context with the lifetime of 900 which creates the context NOISY_PORT_&amp;lt;port_description&amp;gt; at the end of its 900-second lifetime. In addition, you could consider setting up the second context with the lifetime of 30 seconds, so that this lifetime gets extended on each firewall event, and the second context would delete the first context if its 30-second lifetime should expire. See lecture slides 12-14 which illustrate the use of such a two-context technique for a different task.&lt;br /&gt;
* To accomplish subtask 2, see lecture slides 16-17 for a technique to tackle this task. As an alternative, you can consider the technique Section 6.4 of the SEC tutorial (https://simple-evcorr.github.io/SEC-tutorial.pdf). Note that the solution for subtask 2 should check for the presence of NOISY_PORT_* contexts to receive input from the solution of subtask 1.&lt;br /&gt;
* Solutions for subtasks 1 and 2 must be fully functional even when port probing is conducted from several hosts in parallel (for example, contexts maintained by different counting operations must not interfere with each other).&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12312</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12312"/>
		<updated>2026-10-29T11:25:20Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
=== Create SEC rules that accomplish the following event correlation task: ===&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour (for example, by creating the context NOISY_PORT_21_TCP with the lifetime of 3600 seconds). On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
In addition, the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=80 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=80 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=445 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6000 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6001 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6002 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;br /&gt;
&lt;br /&gt;
==== Some hints for accomplishing this assignment:====&lt;br /&gt;
&lt;br /&gt;
* Don&amp;#039;t try to solve the whole assignment with just one rule, but rather write several rules which interact.&lt;br /&gt;
* To accomplish subtask 1, use Single rules that set up contexts with specific actions-on-expire. In particular, you could consider setting up one context with the lifetime of 900 which creates the context NOISY_PORT_&amp;lt;port_description&amp;gt; at the end of its 900-second lifetime. In addition, you could consider setting up the second context with the lifetime of 30 seconds, so that this lifetime gets extended on each firewall event, and the second context would delete the first context if its 30-second lifetime should expire. See lecture slides 12-14 which illustrate the use of such a two-context technique for a different task.&lt;br /&gt;
* To accomplish subtask 2, see lecture slides 16-17 for one technique to tackle this task. As an alternative, you can consider the technique Section 6.4 of the SEC tutorial (https://simple-evcorr.github.io/SEC-tutorial.pdf). Note that the solution for subtask 2 should check for the presence of NOISY_PORT_* contexts to receive input from the solution of subtask 1.&lt;br /&gt;
* Solutions for subtasks 1 and 2 must be fully functional even when port probing is conducted from several hosts in parallel (for example, contexts maintained by different counting operations must not interfere with each other).&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12311</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12311"/>
		<updated>2026-10-29T11:01:18Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
=== Create SEC rules that accomplish the following event correlation task: ===&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour. On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
In addition, the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=80 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=80 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=445 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6000 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6001 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6002 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12310</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12310"/>
		<updated>2026-10-29T10:58:29Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
=== Create SEC rules that accomplish the following event correlation task: ===&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour. On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
Also note that the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=80 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=80 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=445 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6000 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6001 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6002 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12309</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12309"/>
		<updated>2026-10-29T10:58:09Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
==== Create SEC rules that accomplish the following event correlation task: ====&lt;br /&gt;
&lt;br /&gt;
The rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask1&amp;#039;&amp;#039;&amp;#039;: if some port has been probed repeatedly during 15 minutes, so that time between two successive probes does not exceed 30 seconds, memorize that port &lt;br /&gt;
for the following 1 hour as a &amp;quot;noisy port&amp;quot;. For example, if at 18:30:06 the local netfilter firewall starts to log events about blocked access attempts to port 21/tcp, and such events continue to appear once in 3-4 seconds until 18:45:06, then the port 21/tcp should be memorized as a noisy port for 1 hour. On the other hand, if the following 5 events are seen in 15 minutes, the port 21/tcp must not be considered noisy, since the fourth and fifth event are separated by more than 30 seconds.&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:30:06 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=21 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:27 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.2 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=21 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:30:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.29 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:31:04 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=21 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:44:46 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.84 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=21 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Subtask2&amp;#039;&amp;#039;&amp;#039;: if some host probes 5 different ports within 60 seconds, so that none of the probed ports has been memorized as noisy within the last 1 hour, send an e-mail about the offending host to root@localhost. Note that ports should be distinguished not only by port number but also by transport protocol (in other words, ports 53/tcp and 53/udp must be considered different ports).&lt;br /&gt;
&lt;br /&gt;
Also note that the detection should be done with a sliding window approach -- if the counting operation for some host has not seen enough events during 60 seconds, the 60 second detection window should be moved forward.&lt;br /&gt;
&lt;br /&gt;
After an e-mail alert has been issued about the host, disable further alerts for this host for 4 hours.&lt;br /&gt;
&lt;br /&gt;
For example, suppose the following events are observed and the port 21/tcp has been previously memorized as noisy:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 18:51:01 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=1881 DF PROTO=TCP SPT=16333 DPT=25 WINDOW=5840 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:07 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=80 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=23421 DF PROTO=TCP SPT=34342 DPT=80 WINDOW=29200 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:12 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=21 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:51:52 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=31442 DF PROTO=TCP SPT=47846 DPT=445 WINDOW=49640 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6000 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:03 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6001 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:05 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.7 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=7439 DF PROTO=TCP SPT=31959 DPT=6002 WINDOW=6280 RES=0x00 SYN URGP=0&lt;br /&gt;
 Oct 25 18:52:14 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=10.1.1.93 DST=10.13.25.59 LEN=60 TOS=0x00 PREC=0x00 TTL=62 ID=17209 DF PROTO=TCP SPT=11652 DPT=23 WINDOW=7290 RES=0x00 SYN URGP=0&lt;br /&gt;
&lt;br /&gt;
The event correlation rules must produce an alarm at Oct 25 18:52:05 about offending host 10.1.1.7, since this host has accessed five distinct ports 80/tcp, 445/tcp, 6000/tcp, 6001/tcp and 6002/tcp between Oct 25 18:51:07 and Oct 25 18:52:05 (access attempt to noisy port 21/tcp at Oct 25 18:51:12 must be ignored, while access attempt to port 25/tcp at Oct 25 18:51:01 does not fit into the 60 second window).&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12308</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12308"/>
		<updated>2026-10-29T10:54:33Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This homework assignment requires the knowledge from Modules 6 and 7. &lt;br /&gt;
&lt;br /&gt;
Create SEC rules that accomplish the following event correlation task:&lt;br /&gt;
&lt;br /&gt;
1) the rules must process netfilter firewall syslog events about blocked packets sent to local TCP and UDP ports. For example, the following two events represent accesses to local ports 23/tcp and 25/tcp which were blocked by the local firewall:&lt;br /&gt;
&lt;br /&gt;
 Oct 25 01:13:02 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.67 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=20049 DF PROTO=TCP SPT=44963 DPT=23 WINDOW=49640 RES=0x00 SYN URGP=0 &lt;br /&gt;
 Oct 25 01:13:08 localhost kernel: iptables: IN=eth0 OUT= MAC=X SRC=192.168.1.104 DST=192.168.1.107 LEN=60 TOS=0x10 PREC=0x00 TTL=64 ID=36362 DF PROTO=TCP SPT=56918 DPT=25 WINDOW=29200 RES=0x00 SYN URGP=0&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12302</id>
		<title>Cyber Defense Monitoring Solutions</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12302"/>
		<updated>2026-10-25T11:43:49Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Basic information ==&lt;br /&gt;
&lt;br /&gt;
* Course Code -- ITX8071&lt;br /&gt;
* Credit Points -- 6.0 EAP&lt;br /&gt;
* Course Language -- English&lt;br /&gt;
* Course Schedule -- the course will be lectured from 17:45 to 21:00 on every Wednesday of fall semester 2026. Note that some lectures might take place in MS Teams environment under the team [https://teams.microsoft.com/l/team/19%3a5d5f0c8381e446479e60341c0ff80b3a%40thread.tacv2/conversations?groupId=d803439d-d006-45de-a0db-bf35b61db566&amp;amp;tenantId=3efd4d88-9b88-4fc9-b6c0-c7ca50f1db57 &amp;quot;Cyber Defense Monitoring Solutions (ITX8071)]&amp;quot;, while remaining lectures and all labs are arranged in room ICT-401.&lt;br /&gt;
* Course Materials -- use the registration code w7Xz53c for accessing all course slides and pre-recorded lecture videos in Moodle.&lt;br /&gt;
&lt;br /&gt;
== Detailed Course Schedule ==&lt;br /&gt;
&lt;br /&gt;
* September 2 2026 (introduction to the course, lecture of module 1) -- MS Teams&lt;br /&gt;
* September 9 2026 (lab of module 1) -- room ICT-401&lt;br /&gt;
* September 16 2026 (lab of module 2) -- room ICT-401&lt;br /&gt;
* September 23 2026 (lecture of module 3) -- room ICT-401&lt;br /&gt;
* September 30 2026 (lab of module 3) -- room ICT-401&lt;br /&gt;
* October 7 2026 (lab of module 4) -- room ICT-401&lt;br /&gt;
* October 14 2026 (lecture of module 5) -- room ICT-401&lt;br /&gt;
* October 21 2026 (lab of module 5) -- room ICT-401&lt;br /&gt;
* October 28 2026 (lecture of module 6) -- room ICT-401&lt;br /&gt;
* November 4 2026 (lab of module 6) -- room ICT-401&lt;br /&gt;
* November 11 2026 (lab of module 7) -- room ICT-401&lt;br /&gt;
* November 18 2026 (lecture of module 8) -- room ICT-401&lt;br /&gt;
* November 25 2026 (lab of module 8) -- room ICT-401&lt;br /&gt;
* December 2 2026 (lecture of module 9) -- MS Teams&lt;br /&gt;
* December 9 2026 (lab of module 9) -- room ICT-401&lt;br /&gt;
&lt;br /&gt;
== Evaluation ==&lt;br /&gt;
&lt;br /&gt;
During the semester, two homework assignments are given to each student. Both assignments can yield up to 12.5 points, thus the maximum score from homework is 25 points. During the exam, three tasks are given to each student, with each task yielding up to 25 points and the whole exam up to 75 points. The final grade for a student is derived from his/her personal score:&lt;br /&gt;
&lt;br /&gt;
* score &amp;gt; 90 -- grade 5 (excellent)&lt;br /&gt;
* 80 &amp;lt; score ≤ 90 -- grade 4 (very good)&lt;br /&gt;
* 70 &amp;lt; score ≤ 80 -- grade 3 (good)&lt;br /&gt;
* 60 &amp;lt; score ≤ 70 -- grade 2 (satisfactory)&lt;br /&gt;
* 50 &amp;lt; score ≤ 60 -- grade 1 (pass)&lt;br /&gt;
* score ≤ 50 -- a student has failed to pass&lt;br /&gt;
&lt;br /&gt;
In addition to regular 100 points from homeworks and exam, extra points can be collected for active participation in the course (see the following sections).&lt;br /&gt;
&lt;br /&gt;
== Virtual machine image ==&lt;br /&gt;
&lt;br /&gt;
For course lab sessions, there is a [https://drive.google.com/file/d/1omHVnJ-yEKg2-w9E-S_IcXpitlDUhoF7/view?usp=sharing virtual machine image] which has been created with VirtualBox. When importing the image into VirtualBox, &amp;#039;&amp;#039;&amp;#039;don&amp;#039;t forget&amp;#039;&amp;#039;&amp;#039; to select the option &amp;#039;&amp;#039;&amp;#039;&amp;quot;Generate new MAC addresses for all network adapters&amp;quot;&amp;#039;&amp;#039;&amp;#039;. In order to run your virtual machine as a node of the classroom network, change the mode of the first network adapter from NAT to &amp;#039;&amp;#039;&amp;#039;Bridged Adapter&amp;#039;&amp;#039;&amp;#039;. &lt;br /&gt;
&lt;br /&gt;
Since the virtual machine is essential for doing homework assignments, it is strongly recommended to also install it on a personal laptop. In order to do that, leave the first network adapter to NAT mode, and change the mode of the second network adapter to &amp;#039;&amp;#039;&amp;#039;Host-only Adapter&amp;#039;&amp;#039;&amp;#039;. The host-only adapter is connected to a special virtual network (e.g., 192.168.56.0/24) that is not accessible from other hosts and is shared between the host computer and virtual machines. This network can be used for accessing the virtual machine from the host computer and creating setups where several virtual machines need to communicate.&lt;br /&gt;
&lt;br /&gt;
For changing the console keyboard layout of the virtual machine, use the &amp;#039;&amp;#039;&amp;#039;/usr/bin/localectl&amp;#039;&amp;#039;&amp;#039; tool. For example, &amp;#039;&amp;#039;&amp;#039;localectl set-keymap ee&amp;#039;&amp;#039;&amp;#039; sets Estonian keyboard layout for console and &amp;#039;&amp;#039;&amp;#039;localectl set-keymap us&amp;#039;&amp;#039;&amp;#039; sets US keyboard layout for console, while &amp;#039;&amp;#039;&amp;#039;localectl list-keymaps&amp;#039;&amp;#039;&amp;#039; lists all available layouts and &amp;#039;&amp;#039;&amp;#039;localectl status&amp;#039;&amp;#039;&amp;#039; shows the current settings.&lt;br /&gt;
&lt;br /&gt;
To ensure the smooth progress of the lab sessions, each lab is &amp;#039;&amp;#039;&amp;#039;independent&amp;#039;&amp;#039;&amp;#039; of the previous ones, requiring no work completed in earlier labs, and can be completed using a &amp;#039;&amp;#039;&amp;#039;newly instantiated&amp;#039;&amp;#039;&amp;#039; virtual machine from the virtual machine image.&lt;br /&gt;
&lt;br /&gt;
== Lab sessions ==&lt;br /&gt;
&lt;br /&gt;
Solutions for past lab sessions are available [https://drive.google.com/drive/folders/1-UYUgO-rnobRPRoVLwQvrivqyQbDpjEc?usp=sharing here].&lt;br /&gt;
&lt;br /&gt;
Note that the last lab of the course on December 9 2026 is a &amp;#039;&amp;#039;&amp;#039;graded lab which provides 5 extra points for participants&amp;#039;&amp;#039;&amp;#039;. During the graded lab, groups of max 3 students have to work on an assignment that is described [[itx8071-graded-lab|here]]. In order to speed up your work during the lab, you can accomplish part of the assignment in advance. &amp;#039;&amp;#039;&amp;#039;To receive points for the graded lab, the assignment solution has to be presented to the lecturers for evaluation during the lab session in ICT-401, and any other submissions are not accepted.&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
== Independent work during the semester ==&lt;br /&gt;
&lt;br /&gt;
Note that the lectures of the course are interactive discussions which assume the students have prepared themselves for the lectures.&lt;br /&gt;
For attending the course successfully, the following course materials have to be independently studied in Moodle by given deadlines:&lt;br /&gt;
&lt;br /&gt;
* lecture materials of module 2 (&amp;quot;Introduction to packet filtering with the Linux netfilter firewall&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 16 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 3 (&amp;quot;Regular expression language&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 23 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 4 (&amp;quot;Introduction to Perl regular expressions&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 7 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 5 (&amp;quot;Syslog-ng framework&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 14 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 6 (&amp;quot;Introduction to event correlation and Simple Event Correlator&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 28 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 7 (&amp;quot;Simple Event Correlator - advanced topics&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 11 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 8 (&amp;quot;Introduction to intrusion detection/prevention and Suricata IDS/IPS&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 18 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
In Moodle, lecture materials of several modules are followed by &amp;#039;&amp;#039;&amp;#039;tests which provide extra points&amp;#039;&amp;#039;&amp;#039;, with each test consisting of four multiple choice questions. The test can be taken &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039; and has to be completed &amp;#039;&amp;#039;&amp;#039;before the relevant lecture takes place&amp;#039;&amp;#039;&amp;#039;. To pass the test, at least three questions have to be answered correctly, and each successfully passed test yields &amp;#039;&amp;#039;&amp;#039;1 extra point&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
== Homework assignments ==&lt;br /&gt;
&lt;br /&gt;
* [[itx8071-task1|Task1]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;November 3 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
* [[itx8071-task2|Task2]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;December 15 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
Solutions to homework assignments should be sent to the e-mail address of the lecturer (given in the title page of each slide module). Together with the solution, full names and student codes of the authors must be listed. You should consider your solution submitted only after its reception &amp;#039;&amp;#039;&amp;#039;has been confirmed&amp;#039;&amp;#039;&amp;#039; by the lecturer. Please submit your solution from a &amp;#039;&amp;#039;&amp;#039;working&amp;#039;&amp;#039;&amp;#039; email address where you can receive confirmation and feedback. Also, as some email clients may alter the formatting of copied and pasted text, make sure that your email &amp;#039;&amp;#039;&amp;#039;accurately represents your work&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
All submitted solutions should be carefully tested final versions. Please submit the solution &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039;, and do &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; send in partial and/or untested work. It is not allowed to submit a partial solution, and use comments from the lecturer for later resubmission of improved version(s). Also, if you wish to submit multiple solutions, you must &amp;#039;&amp;#039;&amp;#039;clearly indicate&amp;#039;&amp;#039;&amp;#039; which one should be used for evaluation. If no such indication is provided, the &amp;#039;&amp;#039;&amp;#039;first solution&amp;#039;&amp;#039;&amp;#039; will be used for evaluating your work, and other solutions are not considered.&lt;br /&gt;
&lt;br /&gt;
Please note that each student can be a (co)author of only one solution (i.e., participation in more than one student group is not allowed). Also note that the list of authors can not be changed after the deadline.&lt;br /&gt;
&lt;br /&gt;
The correct solution with your score will be announced after the deadline.&lt;br /&gt;
&lt;br /&gt;
Solutions submitted after the deadline will &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; be accepted. Also, it is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; possible to redo the homework assignment after the deadline. &lt;br /&gt;
&lt;br /&gt;
== Notes about distance learning ==&lt;br /&gt;
&lt;br /&gt;
In the case you are not able to attend lectures and labs physically, the course can be taken in a distance learning setting. However, you should consider the following when opting for the distance learning path:&lt;br /&gt;
&lt;br /&gt;
* All course slides and prerecorded lecture video clips can be accessed through Moodle&lt;br /&gt;
* Lab assignments can be found at the end of each lecture slideset (slides with the title &amp;quot;Tasks&amp;quot;)&lt;br /&gt;
* Make sure that you solve all lab assignments on the course virtual machine -- examination tasks are similar to lab assignments and having a good understanding of the lab topics is essential for passing the final exam&lt;br /&gt;
* Lab assignment solutions with comments are regularly posted to the course home page -- don&amp;#039;t forget to compare your work with posted solutions!&lt;br /&gt;
* Check the course home page regularly for new homework assignments, assignment deadlines, and other important information&lt;br /&gt;
* Because homework assignments allow the students to work as a group, it is recommended to join some group by looking potential cooperation partners through the course MS Teams group&lt;br /&gt;
* Since the course is offering extra points in addition to regular ones, it is recommended to collect as many extra points as possible for improving your final grade&lt;br /&gt;
&lt;br /&gt;
== Information about the exam ==&lt;br /&gt;
&lt;br /&gt;
The exam is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted. In order to attend the exam, each student must present an ID with a photo and have at least one pen in good working order. During the exam, each student has to accomplish 3 tasks within 3 hours on paper. All paper materials such as printed course slides, paper-based notes, and hardcopy books can be freely used during the exam. &lt;br /&gt;
&lt;br /&gt;
Examination time slots will be announced during the semester.&lt;br /&gt;
&lt;br /&gt;
For taking the exam, &amp;#039;&amp;#039;&amp;#039;official registration in OIS&amp;#039;&amp;#039;&amp;#039; is required for one of the examination time slots.&lt;br /&gt;
&lt;br /&gt;
Note that each student can take the exam only once, and in order to get the second try for improving the result, official application for re-examination is required (see below).&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;While producing his/her final examination work, the student must consider the following:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* Since there is no defense of the written examination work, the examination work must present full and unambiguous task solutions&lt;br /&gt;
* Each task must have only one clearly presented solution; if multiple solutions are given, only the first one will be evaluated&lt;br /&gt;
* All handwriting in the examination work must be legible&lt;br /&gt;
* No spare pens are provided to students during the exam&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;The following rules apply during the exam, and failure to follow them will invalidate the examination work of the student:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* The use of Internet, digital materials, and electronic devices (computers, mobile phones, cameras, etc.) is not permitted for any purposes&lt;br /&gt;
* All electronic devices will have to be switched to silent mode and left on a designated desk for the duration of the exam&lt;br /&gt;
* Any communication between students or with persons not taking the exam is strictly prohibited&lt;br /&gt;
* While the use of printed materials is permitted, it is not allowed to share such materials between students&lt;br /&gt;
* Students can&amp;#039;t leave the examination room during the first 60 minutes and the last 30 minutes of the exam&lt;br /&gt;
* Each student can leave the examination room once during the exam for max 10 minutes (only one person can leave the room at a time)&lt;br /&gt;
* When leaving the examination room, the student has to surrender the task sheet to the lecturer (it is prohibited to take any exam-related materials outside the room)&lt;br /&gt;
* When submitting the examination work, the student must also hand over the task sheet&lt;br /&gt;
* It is strictly prohibited to take photos or make any other copies of the task sheet&lt;br /&gt;
&lt;br /&gt;
== Re-examination information ==&lt;br /&gt;
&lt;br /&gt;
Each student is granted one re-examination attempt which requires official application. The student can apply for re-examination after failing a regular exam, or for improving a low grade from a regular exam. Re-examination invalidates any previous grade or intermediate result which was obtained during the semester. During re-examination, 2 assignments have to be accomplished within 1 hour. The final grade is solely based on assignment solutions, and no work from previous exam or semester can be combined with the re-exam.&lt;br /&gt;
&lt;br /&gt;
The re-examination is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted, and all rules of the regular exam apply (see above).&lt;br /&gt;
&lt;br /&gt;
Re-examination time slot will be announced during the semester.&lt;br /&gt;
&lt;br /&gt;
== Plagiarism policy ==&lt;br /&gt;
&lt;br /&gt;
Please note that &amp;#039;&amp;#039;&amp;#039;plagiarized&amp;#039;&amp;#039;&amp;#039; home works and exam works will be &amp;#039;&amp;#039;&amp;#039;rejected without a review&amp;#039;&amp;#039;&amp;#039;, and the university will be &amp;#039;&amp;#039;&amp;#039;notified&amp;#039;&amp;#039;&amp;#039; of the offense. All cases of student plagiarism and other violations of academic practices will be handled according to [https://haldus.taltech.ee/sites/default/files/2020-10/Terviktekst_IT-teaduskonna%20%C3%B5ppuri%20akad%20tavade%20rikkumise%20ja%20v%C3%A4%C3%A4ritu%20k%C3%A4itumise%20menetlemise%20kord_ENG.pdf regulations of the IT faculty].&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12301</id>
		<title>Cyber Defense Monitoring Solutions</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12301"/>
		<updated>2026-10-25T11:42:35Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Basic information ==&lt;br /&gt;
&lt;br /&gt;
* Course Code -- ITX8071&lt;br /&gt;
* Credit Points -- 6.0 EAP&lt;br /&gt;
* Course Language -- English&lt;br /&gt;
* Course Schedule -- the course will be lectured from 17:45 to 21:00 on every Wednesday of fall semester 2026. Note that some lectures might take place in MS Teams environment under the team [https://teams.microsoft.com/l/team/19%3a5d5f0c8381e446479e60341c0ff80b3a%40thread.tacv2/conversations?groupId=d803439d-d006-45de-a0db-bf35b61db566&amp;amp;tenantId=3efd4d88-9b88-4fc9-b6c0-c7ca50f1db57 &amp;quot;Cyber Defense Monitoring Solutions (ITX8071)]&amp;quot;, while remaining lectures and all labs are arranged in room ICT-401.&lt;br /&gt;
* Course Materials -- use the registration code w7Xz53c for accessing all course slides and pre-recorded lecture videos in Moodle.&lt;br /&gt;
&lt;br /&gt;
== Detailed Course Schedule ==&lt;br /&gt;
&lt;br /&gt;
* September 2 2026 (introduction to the course, lecture of module 1) -- MS Teams&lt;br /&gt;
* September 9 2026 (lab of module 1) -- room ICT-401&lt;br /&gt;
* September 16 2026 (lab of module 2) -- room ICT-401&lt;br /&gt;
* September 23 2026 (lecture of module 3) -- room ICT-401&lt;br /&gt;
* September 30 2026 (lab of module 3) -- room ICT-401&lt;br /&gt;
* October 7 2026 (lab of module 4) -- room ICT-401&lt;br /&gt;
* October 14 2026 (lecture of module 5) -- room ICT-401&lt;br /&gt;
* October 21 2026 (lab of module 5) -- room ICT-401&lt;br /&gt;
* October 28 2026 (lecture of module 6) -- room ICT-401&lt;br /&gt;
* November 4 2026 (lab of module 6) -- room ICT-401&lt;br /&gt;
* November 11 2026 (lab of module 7) -- room ICT-401&lt;br /&gt;
* November 18 2026 (lecture of module 8) -- room ICT-401&lt;br /&gt;
* November 25 2026 (lab of module 8) -- room ICT-401&lt;br /&gt;
* December 2 2026 (lecture of module 9) -- MS Teams&lt;br /&gt;
* December 9 2026 (lab of module 9) -- room ICT-401&lt;br /&gt;
&lt;br /&gt;
== Evaluation ==&lt;br /&gt;
&lt;br /&gt;
During the semester, two homework assignments are given to each student. Both assignments can yield up to 12.5 points, thus the maximum score from homework is 25 points. During the exam, three tasks are given to each student, with each task yielding up to 25 points and the whole exam up to 75 points. The final grade for a student is derived from his/her personal score:&lt;br /&gt;
&lt;br /&gt;
* score &amp;gt; 90 -- grade 5 (excellent)&lt;br /&gt;
* 80 &amp;lt; score ≤ 90 -- grade 4 (very good)&lt;br /&gt;
* 70 &amp;lt; score ≤ 80 -- grade 3 (good)&lt;br /&gt;
* 60 &amp;lt; score ≤ 70 -- grade 2 (satisfactory)&lt;br /&gt;
* 50 &amp;lt; score ≤ 60 -- grade 1 (pass)&lt;br /&gt;
* score ≤ 50 -- a student has failed to pass&lt;br /&gt;
&lt;br /&gt;
In addition to regular 100 points from homeworks and exam, extra points can be collected for active participation in the course (see the following sections).&lt;br /&gt;
&lt;br /&gt;
== Virtual machine image ==&lt;br /&gt;
&lt;br /&gt;
For course lab sessions, there is a [https://drive.google.com/file/d/1omHVnJ-yEKg2-w9E-S_IcXpitlDUhoF7/view?usp=sharing virtual machine image] which has been created with VirtualBox. When importing the image into VirtualBox, &amp;#039;&amp;#039;&amp;#039;don&amp;#039;t forget&amp;#039;&amp;#039;&amp;#039; to select the option &amp;#039;&amp;#039;&amp;#039;&amp;quot;Generate new MAC addresses for all network adapters&amp;quot;&amp;#039;&amp;#039;&amp;#039;. In order to run your virtual machine as a node of the classroom network, change the mode of the first network adapter from NAT to &amp;#039;&amp;#039;&amp;#039;Bridged Adapter&amp;#039;&amp;#039;&amp;#039;. &lt;br /&gt;
&lt;br /&gt;
Since the virtual machine is essential for doing homework assignments, it is strongly recommended to also install it on a personal laptop. In order to do that, leave the first network adapter to NAT mode, and change the mode of the second network adapter to &amp;#039;&amp;#039;&amp;#039;Host-only Adapter&amp;#039;&amp;#039;&amp;#039;. The host-only adapter is connected to a special virtual network (e.g., 192.168.56.0/24) that is not accessible from other hosts and is shared between the host computer and virtual machines. This network can be used for accessing the virtual machine from the host computer and creating setups where several virtual machines need to communicate.&lt;br /&gt;
&lt;br /&gt;
For changing the console keyboard layout of the virtual machine, use the &amp;#039;&amp;#039;&amp;#039;/usr/bin/localectl&amp;#039;&amp;#039;&amp;#039; tool. For example, &amp;#039;&amp;#039;&amp;#039;localectl set-keymap ee&amp;#039;&amp;#039;&amp;#039; sets Estonian keyboard layout for console and &amp;#039;&amp;#039;&amp;#039;localectl set-keymap us&amp;#039;&amp;#039;&amp;#039; sets US keyboard layout for console, while &amp;#039;&amp;#039;&amp;#039;localectl list-keymaps&amp;#039;&amp;#039;&amp;#039; lists all available layouts and &amp;#039;&amp;#039;&amp;#039;localectl status&amp;#039;&amp;#039;&amp;#039; shows the current settings.&lt;br /&gt;
&lt;br /&gt;
To ensure the smooth progress of the lab sessions, each lab is &amp;#039;&amp;#039;&amp;#039;independent&amp;#039;&amp;#039;&amp;#039; of the previous ones, requiring no work completed in earlier labs, and can be completed using a &amp;#039;&amp;#039;&amp;#039;newly instantiated&amp;#039;&amp;#039;&amp;#039; virtual machine from the virtual machine image.&lt;br /&gt;
&lt;br /&gt;
== Lab sessions ==&lt;br /&gt;
&lt;br /&gt;
Solutions for past lab sessions are available [https://drive.google.com/drive/folders/1-UYUgO-rnobRPRoVLwQvrivqyQbDpjEc?usp=sharing here].&lt;br /&gt;
&lt;br /&gt;
Note that the last lab of the course on December 9 2026 is a &amp;#039;&amp;#039;&amp;#039;graded lab which provides 5 extra points for participants&amp;#039;&amp;#039;&amp;#039;. During the graded lab, groups of max 3 students have to work on an assignment that is described [[itx8071-graded-lab|here]]. In order to speed up your work during the lab, you can accomplish part of the assignment in advance. &amp;#039;&amp;#039;&amp;#039;To receive points for the graded lab, the assignment solution has to be presented to the lecturers for evaluation during the lab session in ICT-401, and any other submissions are not accepted.&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
== Independent work during the semester ==&lt;br /&gt;
&lt;br /&gt;
Note that the lectures of the course are interactive discussions which assume the students have prepared themselves for the lectures.&lt;br /&gt;
For attending the course successfully, the following course materials have to be independently studied in Moodle by given deadlines:&lt;br /&gt;
&lt;br /&gt;
* lecture materials of module 2 (&amp;quot;Introduction to packet filtering with the Linux netfilter firewall&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 16 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 3 (&amp;quot;Regular expression language&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 23 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 4 (&amp;quot;Introduction to Perl regular expressions&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 7 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 5 (&amp;quot;Syslog-ng framework&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 14 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 6 (&amp;quot;Introduction to event correlation and Simple Event Correlator&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 28 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 7 (&amp;quot;Simple Event Correlator - advanced topics&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 11 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 8 (&amp;quot;Introduction to intrusion detection/prevention and Suricata IDS/IPS&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 18 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
In Moodle, lecture materials of several modules are followed by &amp;#039;&amp;#039;&amp;#039;tests which provide extra points&amp;#039;&amp;#039;&amp;#039;, with each test consisting of four multiple choice questions. The test can be taken &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039; and has to be completed &amp;#039;&amp;#039;&amp;#039;before the relevant lecture takes place&amp;#039;&amp;#039;&amp;#039;. To pass the test, at least three questions have to be answered correctly, and each successfully passed test yields &amp;#039;&amp;#039;&amp;#039;1 extra point&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
== Homework assignments ==&lt;br /&gt;
&lt;br /&gt;
* [[itx8071-task1|Task1]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;November 3 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
* [[itx8071-task2|Task2]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;December 15 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
Solutions to homework assignments should be sent to the e-mail address of the lecturer (given in the title page of each slide module). Together with the solution, full names and student codes of the authors must be listed. You should consider your solution submitted only after its reception &amp;#039;&amp;#039;&amp;#039;has been confirmed&amp;#039;&amp;#039;&amp;#039; by the lecturer. Please submit your solution from a &amp;#039;&amp;#039;&amp;#039;working&amp;#039;&amp;#039;&amp;#039; email address where you can receive confirmation and feedback. Also, as some email clients may alter the formatting of copied and pasted text, make sure that your email &amp;#039;&amp;#039;&amp;#039;accurately&amp;#039;&amp;#039;&amp;#039; represents your work.&lt;br /&gt;
&lt;br /&gt;
All submitted solutions should be carefully tested final versions. Please submit the solution &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039;, and do &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; send in partial and/or untested work. It is not allowed to submit a partial solution, and use comments from the lecturer for later resubmission of improved version(s). Also, if you wish to submit multiple solutions, you must &amp;#039;&amp;#039;&amp;#039;clearly indicate&amp;#039;&amp;#039;&amp;#039; which one should be used for evaluation. If no such indication is provided, the &amp;#039;&amp;#039;&amp;#039;first solution&amp;#039;&amp;#039;&amp;#039; will be used for evaluating your work, and other solutions are not considered.&lt;br /&gt;
&lt;br /&gt;
Please note that each student can be a (co)author of only one solution (i.e., participation in more than one student group is not allowed). Also note that the list of authors can not be changed after the deadline.&lt;br /&gt;
&lt;br /&gt;
The correct solution with your score will be announced after the deadline.&lt;br /&gt;
&lt;br /&gt;
Solutions submitted after the deadline will &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; be accepted. Also, it is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; possible to redo the homework assignment after the deadline. &lt;br /&gt;
&lt;br /&gt;
== Notes about distance learning ==&lt;br /&gt;
&lt;br /&gt;
In the case you are not able to attend lectures and labs physically, the course can be taken in a distance learning setting. However, you should consider the following when opting for the distance learning path:&lt;br /&gt;
&lt;br /&gt;
* All course slides and prerecorded lecture video clips can be accessed through Moodle&lt;br /&gt;
* Lab assignments can be found at the end of each lecture slideset (slides with the title &amp;quot;Tasks&amp;quot;)&lt;br /&gt;
* Make sure that you solve all lab assignments on the course virtual machine -- examination tasks are similar to lab assignments and having a good understanding of the lab topics is essential for passing the final exam&lt;br /&gt;
* Lab assignment solutions with comments are regularly posted to the course home page -- don&amp;#039;t forget to compare your work with posted solutions!&lt;br /&gt;
* Check the course home page regularly for new homework assignments, assignment deadlines, and other important information&lt;br /&gt;
* Because homework assignments allow the students to work as a group, it is recommended to join some group by looking potential cooperation partners through the course MS Teams group&lt;br /&gt;
* Since the course is offering extra points in addition to regular ones, it is recommended to collect as many extra points as possible for improving your final grade&lt;br /&gt;
&lt;br /&gt;
== Information about the exam ==&lt;br /&gt;
&lt;br /&gt;
The exam is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted. In order to attend the exam, each student must present an ID with a photo and have at least one pen in good working order. During the exam, each student has to accomplish 3 tasks within 3 hours on paper. All paper materials such as printed course slides, paper-based notes, and hardcopy books can be freely used during the exam. &lt;br /&gt;
&lt;br /&gt;
Examination time slots will be announced during the semester.&lt;br /&gt;
&lt;br /&gt;
For taking the exam, &amp;#039;&amp;#039;&amp;#039;official registration in OIS&amp;#039;&amp;#039;&amp;#039; is required for one of the examination time slots.&lt;br /&gt;
&lt;br /&gt;
Note that each student can take the exam only once, and in order to get the second try for improving the result, official application for re-examination is required (see below).&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;While producing his/her final examination work, the student must consider the following:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* Since there is no defense of the written examination work, the examination work must present full and unambiguous task solutions&lt;br /&gt;
* Each task must have only one clearly presented solution; if multiple solutions are given, only the first one will be evaluated&lt;br /&gt;
* All handwriting in the examination work must be legible&lt;br /&gt;
* No spare pens are provided to students during the exam&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;The following rules apply during the exam, and failure to follow them will invalidate the examination work of the student:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* The use of Internet, digital materials, and electronic devices (computers, mobile phones, cameras, etc.) is not permitted for any purposes&lt;br /&gt;
* All electronic devices will have to be switched to silent mode and left on a designated desk for the duration of the exam&lt;br /&gt;
* Any communication between students or with persons not taking the exam is strictly prohibited&lt;br /&gt;
* While the use of printed materials is permitted, it is not allowed to share such materials between students&lt;br /&gt;
* Students can&amp;#039;t leave the examination room during the first 60 minutes and the last 30 minutes of the exam&lt;br /&gt;
* Each student can leave the examination room once during the exam for max 10 minutes (only one person can leave the room at a time)&lt;br /&gt;
* When leaving the examination room, the student has to surrender the task sheet to the lecturer (it is prohibited to take any exam-related materials outside the room)&lt;br /&gt;
* When submitting the examination work, the student must also hand over the task sheet&lt;br /&gt;
* It is strictly prohibited to take photos or make any other copies of the task sheet&lt;br /&gt;
&lt;br /&gt;
== Re-examination information ==&lt;br /&gt;
&lt;br /&gt;
Each student is granted one re-examination attempt which requires official application. The student can apply for re-examination after failing a regular exam, or for improving a low grade from a regular exam. Re-examination invalidates any previous grade or intermediate result which was obtained during the semester. During re-examination, 2 assignments have to be accomplished within 1 hour. The final grade is solely based on assignment solutions, and no work from previous exam or semester can be combined with the re-exam.&lt;br /&gt;
&lt;br /&gt;
The re-examination is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted, and all rules of the regular exam apply (see above).&lt;br /&gt;
&lt;br /&gt;
Re-examination time slot will be announced during the semester.&lt;br /&gt;
&lt;br /&gt;
== Plagiarism policy ==&lt;br /&gt;
&lt;br /&gt;
Please note that &amp;#039;&amp;#039;&amp;#039;plagiarized&amp;#039;&amp;#039;&amp;#039; home works and exam works will be &amp;#039;&amp;#039;&amp;#039;rejected without a review&amp;#039;&amp;#039;&amp;#039;, and the university will be &amp;#039;&amp;#039;&amp;#039;notified&amp;#039;&amp;#039;&amp;#039; of the offense. All cases of student plagiarism and other violations of academic practices will be handled according to [https://haldus.taltech.ee/sites/default/files/2020-10/Terviktekst_IT-teaduskonna%20%C3%B5ppuri%20akad%20tavade%20rikkumise%20ja%20v%C3%A4%C3%A4ritu%20k%C3%A4itumise%20menetlemise%20kord_ENG.pdf regulations of the IT faculty].&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12282</id>
		<title>Cyber Defense Monitoring Solutions</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12282"/>
		<updated>2026-10-04T14:32:09Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Basic information ==&lt;br /&gt;
&lt;br /&gt;
* Course Code -- ITX8071&lt;br /&gt;
* Credit Points -- 6.0 EAP&lt;br /&gt;
* Course Language -- English&lt;br /&gt;
* Course Schedule -- the course will be lectured from 17:45 to 21:00 on every Wednesday of fall semester 2026. Note that some lectures might take place in MS Teams environment under the team [https://teams.microsoft.com/l/team/19%3a5d5f0c8381e446479e60341c0ff80b3a%40thread.tacv2/conversations?groupId=d803439d-d006-45de-a0db-bf35b61db566&amp;amp;tenantId=3efd4d88-9b88-4fc9-b6c0-c7ca50f1db57 &amp;quot;Cyber Defense Monitoring Solutions (ITX8071)]&amp;quot;, while remaining lectures and all labs are arranged in room ICT-401.&lt;br /&gt;
* Course Materials -- use the registration code w7Xz53c for accessing all course slides and pre-recorded lecture videos in Moodle.&lt;br /&gt;
&lt;br /&gt;
== Detailed Course Schedule ==&lt;br /&gt;
&lt;br /&gt;
* September 2 2026 (introduction to the course, lecture of module 1) -- MS Teams&lt;br /&gt;
* September 9 2026 (lab of module 1) -- room ICT-401&lt;br /&gt;
* September 16 2026 (lab of module 2) -- room ICT-401&lt;br /&gt;
* September 23 2026 (lecture of module 3) -- room ICT-401&lt;br /&gt;
* September 30 2026 (lab of module 3) -- room ICT-401&lt;br /&gt;
* October 7 2026 (lab of module 4) -- room ICT-401&lt;br /&gt;
* October 14 2026 (lecture of module 5) -- room ICT-401&lt;br /&gt;
* October 21 2026 (lab of module 5) -- room ICT-401&lt;br /&gt;
* October 28 2026 (lecture of module 6) -- room ICT-401&lt;br /&gt;
* November 4 2026 (lab of module 6) -- room ICT-401&lt;br /&gt;
* November 11 2026 (lab of module 7) -- room ICT-401&lt;br /&gt;
* November 18 2026 (lecture of module 8) -- room ICT-401&lt;br /&gt;
* November 25 2026 (lab of module 8) -- room ICT-401&lt;br /&gt;
* December 2 2026 (lecture of module 9) -- MS Teams&lt;br /&gt;
* December 9 2026 (lab of module 9) -- room ICT-401&lt;br /&gt;
&lt;br /&gt;
== Evaluation ==&lt;br /&gt;
&lt;br /&gt;
During the semester, two homework assignments are given to each student. Both assignments can yield up to 12.5 points, thus the maximum score from homework is 25 points. During the exam, three tasks are given to each student, with each task yielding up to 25 points and the whole exam up to 75 points. The final grade for a student is derived from his/her personal score:&lt;br /&gt;
&lt;br /&gt;
* score &amp;gt; 90 -- grade 5 (excellent)&lt;br /&gt;
* 80 &amp;lt; score ≤ 90 -- grade 4 (very good)&lt;br /&gt;
* 70 &amp;lt; score ≤ 80 -- grade 3 (good)&lt;br /&gt;
* 60 &amp;lt; score ≤ 70 -- grade 2 (satisfactory)&lt;br /&gt;
* 50 &amp;lt; score ≤ 60 -- grade 1 (pass)&lt;br /&gt;
* score ≤ 50 -- a student has failed to pass&lt;br /&gt;
&lt;br /&gt;
In addition to regular 100 points from homeworks and exam, extra points can be collected for active participation in the course (see the following sections).&lt;br /&gt;
&lt;br /&gt;
== Virtual machine image ==&lt;br /&gt;
&lt;br /&gt;
For course lab sessions, there is a [https://drive.google.com/file/d/1omHVnJ-yEKg2-w9E-S_IcXpitlDUhoF7/view?usp=sharing virtual machine image] which has been created with VirtualBox. When importing the image into VirtualBox, &amp;#039;&amp;#039;&amp;#039;don&amp;#039;t forget&amp;#039;&amp;#039;&amp;#039; to select the option &amp;#039;&amp;#039;&amp;#039;&amp;quot;Generate new MAC addresses for all network adapters&amp;quot;&amp;#039;&amp;#039;&amp;#039;. In order to run your virtual machine as a node of the classroom network, change the mode of the first network adapter from NAT to &amp;#039;&amp;#039;&amp;#039;Bridged Adapter&amp;#039;&amp;#039;&amp;#039;. &lt;br /&gt;
&lt;br /&gt;
Since the virtual machine is essential for doing homework assignments, it is strongly recommended to also install it on a personal laptop. In order to do that, leave the first network adapter to NAT mode, and change the mode of the second network adapter to &amp;#039;&amp;#039;&amp;#039;Host-only Adapter&amp;#039;&amp;#039;&amp;#039;. The host-only adapter is connected to a special virtual network (e.g., 192.168.56.0/24) that is not accessible from other hosts and is shared between the host computer and virtual machines. This network can be used for accessing the virtual machine from the host computer and creating setups where several virtual machines need to communicate.&lt;br /&gt;
&lt;br /&gt;
For changing the console keyboard layout of the virtual machine, use the &amp;#039;&amp;#039;&amp;#039;/usr/bin/localectl&amp;#039;&amp;#039;&amp;#039; tool. For example, &amp;#039;&amp;#039;&amp;#039;localectl set-keymap ee&amp;#039;&amp;#039;&amp;#039; sets Estonian keyboard layout for console and &amp;#039;&amp;#039;&amp;#039;localectl set-keymap us&amp;#039;&amp;#039;&amp;#039; sets US keyboard layout for console, while &amp;#039;&amp;#039;&amp;#039;localectl list-keymaps&amp;#039;&amp;#039;&amp;#039; lists all available layouts and &amp;#039;&amp;#039;&amp;#039;localectl status&amp;#039;&amp;#039;&amp;#039; shows the current settings.&lt;br /&gt;
&lt;br /&gt;
To ensure the smooth progress of the lab sessions, each lab is &amp;#039;&amp;#039;&amp;#039;independent&amp;#039;&amp;#039;&amp;#039; of the previous ones, requiring no work completed in earlier labs, and can be completed using a &amp;#039;&amp;#039;&amp;#039;newly instantiated&amp;#039;&amp;#039;&amp;#039; virtual machine from the virtual machine image.&lt;br /&gt;
&lt;br /&gt;
== Lab sessions ==&lt;br /&gt;
&lt;br /&gt;
Solutions for past lab sessions are available [https://drive.google.com/drive/folders/1-UYUgO-rnobRPRoVLwQvrivqyQbDpjEc?usp=sharing here].&lt;br /&gt;
&lt;br /&gt;
Note that the last lab of the course on December 9 2026 is a &amp;#039;&amp;#039;&amp;#039;graded lab which provides 5 extra points for participants&amp;#039;&amp;#039;&amp;#039;. During the graded lab, groups of max 3 students have to work on an assignment that is described [[itx8071-graded-lab|here]]. In order to speed up your work during the lab, you can accomplish part of the assignment in advance. &amp;#039;&amp;#039;&amp;#039;To receive points for the graded lab, the assignment solution has to be presented to the lecturers for evaluation during the lab session in ICT-401, and any other submissions are not accepted.&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
== Independent work during the semester ==&lt;br /&gt;
&lt;br /&gt;
Note that the lectures of the course are interactive discussions which assume the students have prepared themselves for the lectures.&lt;br /&gt;
For attending the course successfully, the following course materials have to be independently studied in Moodle by given deadlines:&lt;br /&gt;
&lt;br /&gt;
* lecture materials of module 2 (&amp;quot;Introduction to packet filtering with the Linux netfilter firewall&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 16 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 3 (&amp;quot;Regular expression language&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 23 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 4 (&amp;quot;Introduction to Perl regular expressions&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 7 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 5 (&amp;quot;Syslog-ng framework&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 14 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 6 (&amp;quot;Introduction to event correlation and Simple Event Correlator&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 28 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 7 (&amp;quot;Simple Event Correlator - advanced topics&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 11 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 8 (&amp;quot;Introduction to intrusion detection/prevention and Suricata IDS/IPS&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 18 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
In Moodle, lecture materials of several modules are followed by &amp;#039;&amp;#039;&amp;#039;tests which provide extra points&amp;#039;&amp;#039;&amp;#039;, with each test consisting of four multiple choice questions. The test can be taken &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039; and has to be completed &amp;#039;&amp;#039;&amp;#039;before the relevant lecture takes place&amp;#039;&amp;#039;&amp;#039;. To pass the test, at least three questions have to be answered correctly, and each successfully passed test yields &amp;#039;&amp;#039;&amp;#039;1 extra point&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
== Homework assignments ==&lt;br /&gt;
&lt;br /&gt;
* [[itx8071-task1|Task1]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;November 3 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
* [[itx8071-task2|Task2]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;December 15 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
Solutions to homework assignments should be sent to the e-mail address of the lecturer (given in the title page of each slide module). Together with the solution, full names and student codes of the authors must be listed. You should consider your solution submitted only after its reception &amp;#039;&amp;#039;&amp;#039;has been confirmed&amp;#039;&amp;#039;&amp;#039; by the lecturer. Please submit your solution from a &amp;#039;&amp;#039;&amp;#039;working&amp;#039;&amp;#039;&amp;#039; email address where you can receive confirmation and feedback.&lt;br /&gt;
&lt;br /&gt;
All submitted solutions should be carefully tested final versions. Please submit the solution &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039;, and do &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; send in partial and/or untested work. It is not allowed to submit a partial solution, and use comments from the lecturer for later resubmission of improved version(s). Also, if you wish to submit multiple solutions, you must &amp;#039;&amp;#039;&amp;#039;clearly indicate&amp;#039;&amp;#039;&amp;#039; which one should be used for evaluation. If no such indication is provided, the &amp;#039;&amp;#039;&amp;#039;first solution&amp;#039;&amp;#039;&amp;#039; will be used for evaluating your work, and other solutions are not considered.&lt;br /&gt;
&lt;br /&gt;
Please note that each student can be a (co)author of only one solution (i.e., participation in more than one student group is not allowed). Also note that the list of authors can not be changed after the deadline.&lt;br /&gt;
&lt;br /&gt;
The correct solution with your score will be announced after the deadline.&lt;br /&gt;
&lt;br /&gt;
Solutions submitted after the deadline will &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; be accepted. Also, it is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; possible to redo the homework assignment after the deadline. &lt;br /&gt;
&lt;br /&gt;
== Notes about distance learning ==&lt;br /&gt;
&lt;br /&gt;
In the case you are not able to attend lectures and labs physically, the course can be taken in a distance learning setting. However, you should consider the following when opting for the distance learning path:&lt;br /&gt;
&lt;br /&gt;
* All course slides and prerecorded lecture video clips can be accessed through Moodle&lt;br /&gt;
* Lab assignments can be found at the end of each lecture slideset (slides with the title &amp;quot;Tasks&amp;quot;)&lt;br /&gt;
* Make sure that you solve all lab assignments on the course virtual machine -- examination tasks are similar to lab assignments and having a good understanding of the lab topics is essential for passing the final exam&lt;br /&gt;
* Lab assignment solutions with comments are regularly posted to the course home page -- don&amp;#039;t forget to compare your work with posted solutions!&lt;br /&gt;
* Check the course home page regularly for new homework assignments, assignment deadlines, and other important information&lt;br /&gt;
* Because homework assignments allow the students to work as a group, it is recommended to join some group by looking potential cooperation partners through the course MS Teams group&lt;br /&gt;
* Since the course is offering extra points in addition to regular ones, it is recommended to collect as many extra points as possible for improving your final grade&lt;br /&gt;
&lt;br /&gt;
== Information about the exam ==&lt;br /&gt;
&lt;br /&gt;
The exam is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted. In order to attend the exam, each student must present an ID with a photo and have at least one pen in good working order. During the exam, each student has to accomplish 3 tasks within 3 hours on paper. All paper materials such as printed course slides, paper-based notes, and hardcopy books can be freely used during the exam. &lt;br /&gt;
&lt;br /&gt;
Examination time slots will be announced during the semester.&lt;br /&gt;
&lt;br /&gt;
For taking the exam, &amp;#039;&amp;#039;&amp;#039;official registration in OIS&amp;#039;&amp;#039;&amp;#039; is required for one of the examination time slots.&lt;br /&gt;
&lt;br /&gt;
Note that each student can take the exam only once, and in order to get the second try for improving the result, official application for re-examination is required (see below).&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;While producing his/her final examination work, the student must consider the following:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* Since there is no defense of the written examination work, the examination work must present full and unambiguous task solutions&lt;br /&gt;
* Each task must have only one clearly presented solution; if multiple solutions are given, only the first one will be evaluated&lt;br /&gt;
* All handwriting in the examination work must be legible&lt;br /&gt;
* No spare pens are provided to students during the exam&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;The following rules apply during the exam, and failure to follow them will invalidate the examination work of the student:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* The use of Internet, digital materials, and electronic devices (computers, mobile phones, cameras, etc.) is not permitted for any purposes&lt;br /&gt;
* All electronic devices will have to be switched to silent mode and left on a designated desk for the duration of the exam&lt;br /&gt;
* Any communication between students or with persons not taking the exam is strictly prohibited&lt;br /&gt;
* While the use of printed materials is permitted, it is not allowed to share such materials between students&lt;br /&gt;
* Students can&amp;#039;t leave the examination room during the first 60 minutes and the last 30 minutes of the exam&lt;br /&gt;
* Each student can leave the examination room once during the exam for max 10 minutes (only one person can leave the room at a time)&lt;br /&gt;
* When leaving the examination room, the student has to surrender the task sheet to the lecturer (it is prohibited to take any exam-related materials outside the room)&lt;br /&gt;
* When submitting the examination work, the student must also hand over the task sheet&lt;br /&gt;
* It is strictly prohibited to take photos or make any other copies of the task sheet&lt;br /&gt;
&lt;br /&gt;
== Re-examination information ==&lt;br /&gt;
&lt;br /&gt;
Each student is granted one re-examination attempt which requires official application. The student can apply for re-examination after failing a regular exam, or for improving a low grade from a regular exam. Re-examination invalidates any previous grade or intermediate result which was obtained during the semester. During re-examination, 2 assignments have to be accomplished within 1 hour. The final grade is solely based on assignment solutions, and no work from previous exam or semester can be combined with the re-exam.&lt;br /&gt;
&lt;br /&gt;
The re-examination is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted, and all rules of the regular exam apply (see above).&lt;br /&gt;
&lt;br /&gt;
Re-examination time slot will be announced during the semester.&lt;br /&gt;
&lt;br /&gt;
== Plagiarism policy ==&lt;br /&gt;
&lt;br /&gt;
Please note that &amp;#039;&amp;#039;&amp;#039;plagiarized&amp;#039;&amp;#039;&amp;#039; home works and exam works will be &amp;#039;&amp;#039;&amp;#039;rejected without a review&amp;#039;&amp;#039;&amp;#039;, and the university will be &amp;#039;&amp;#039;&amp;#039;notified&amp;#039;&amp;#039;&amp;#039; of the offense. All cases of student plagiarism and other violations of academic practices will be handled according to [https://haldus.taltech.ee/sites/default/files/2020-10/Terviktekst_IT-teaduskonna%20%C3%B5ppuri%20akad%20tavade%20rikkumise%20ja%20v%C3%A4%C3%A4ritu%20k%C3%A4itumise%20menetlemise%20kord_ENG.pdf regulations of the IT faculty].&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12267</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12267"/>
		<updated>2026-09-28T14:49:15Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of arithmetic expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or other letters than X, Y, and Z) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix: a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
 012&lt;br /&gt;
 X&lt;br /&gt;
 -1&lt;br /&gt;
 Y+3&lt;br /&gt;
 Z^0123&lt;br /&gt;
 -0+12-Z&lt;br /&gt;
 22+90*-2/60&lt;br /&gt;
 -100+16/-2*-30&lt;br /&gt;
 X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
 1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
 1%2 (an illegal character % appears between two operands)&lt;br /&gt;
 12C (an illegal character C appears after the operand)&lt;br /&gt;
 X1Y2Z3 (an illegal operand which contains both digits and letters)&lt;br /&gt;
 X--2 (if the minus character separates two operands, it is not allowed to use the minus prefix for the second operand)&lt;br /&gt;
 X^ (the circumflex character is not followed by at least one digit)&lt;br /&gt;
 10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3+X+Y+Z   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12266</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12266"/>
		<updated>2026-09-28T14:47:50Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of arithmetic expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or other letters than X, Y, and Z) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix: a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
 012&lt;br /&gt;
 X&lt;br /&gt;
 -1&lt;br /&gt;
 Y+3&lt;br /&gt;
 Z^0123&lt;br /&gt;
 -0+12-Z&lt;br /&gt;
 22+90*-2/60&lt;br /&gt;
 -100+16/-2*-30&lt;br /&gt;
 X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
 1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
 1%2 (an illegal character % appears between two operands)&lt;br /&gt;
 12C (an illegal character C appears after the operand)&lt;br /&gt;
 X1Y2Z3 (an illegal operand which contains both digits and letters)&lt;br /&gt;
 X--2 (if the minus character separates two operands, it is not allowed to use the minus prefix for the second operand)&lt;br /&gt;
 X^- (the circumflex and minus characters are not followed by at least one digit)&lt;br /&gt;
 10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3+X+Y+Z   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12265</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12265"/>
		<updated>2026-09-28T14:39:16Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of arithmetic expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or other letters than X, Y, and Z) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix: a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
 012&lt;br /&gt;
 X&lt;br /&gt;
 -1&lt;br /&gt;
 Y+3&lt;br /&gt;
 Z^0123&lt;br /&gt;
 -0+12-Z&lt;br /&gt;
 22+90*-2/60&lt;br /&gt;
 -100+16/-2*-30&lt;br /&gt;
 X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
 1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
 1%2 (an illegal character % appears between two operands)&lt;br /&gt;
 12C (an illegal character C appears after the operand)&lt;br /&gt;
 X1Y2Z3 (an illegal operand which contains both digits and letters)&lt;br /&gt;
 X--2 (if the minus character separates two operands, it is not allowed to use the minus prefix for the second operand)&lt;br /&gt;
 10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3+X+Y+Z   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12264</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12264"/>
		<updated>2026-09-25T12:34:22Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of arithmetic expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or other letters than X, Y, and Z) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix: a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
 012&lt;br /&gt;
 X&lt;br /&gt;
 -1&lt;br /&gt;
 Y+3&lt;br /&gt;
 -0+12-Z&lt;br /&gt;
 22+90*-2/60&lt;br /&gt;
 -100+16/-2*-30&lt;br /&gt;
 X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
 1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
 1%2 (an illegal character % appears between two operands)&lt;br /&gt;
 12C (an illegal character C appears after the operand)&lt;br /&gt;
 X1Y2Z3 (an illegal operand which contains both digits and letters)&lt;br /&gt;
 X--2 (if the minus character separates two operands, it is not allowed to use the minus prefix for the second operand)&lt;br /&gt;
 10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3+X+Y+Z   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12263</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12263"/>
		<updated>2026-09-25T12:32:15Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of arithmetic expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or other letters than X, Y, and Z) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix: a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
 012&lt;br /&gt;
 X&lt;br /&gt;
 -1&lt;br /&gt;
 Y+3&lt;br /&gt;
 -0+12-Z&lt;br /&gt;
 22+90*-2/60&lt;br /&gt;
 -100+16/-2*-30&lt;br /&gt;
 X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
 1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
 1%2 (an illegal character % appears between two operands)&lt;br /&gt;
 12C (an illegal character C appears after the operand)&lt;br /&gt;
 X--2 (if the minus character separates two operands, it is not allowed to use the minus prefix for the second operand)&lt;br /&gt;
 10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3+X+Y+Z   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12262</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12262"/>
		<updated>2026-09-25T12:28:36Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of arithmetic expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or other letters than X, Y, and Z) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix: a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
 012&lt;br /&gt;
 X&lt;br /&gt;
 -1&lt;br /&gt;
 Y+3&lt;br /&gt;
 -0+12-Z&lt;br /&gt;
 22+90*-2/60&lt;br /&gt;
 -100+16/-2*-30&lt;br /&gt;
 X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
 1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
 1%2 (an illegal character % appears between two integer numbers)&lt;br /&gt;
 12C (an illegal character C appears after the integer number)&lt;br /&gt;
 12--2 (if the minus character separates two operands, it is not allowed to use the minus prefix for the second operand)&lt;br /&gt;
 10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3+X+Y+Z   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12261</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12261"/>
		<updated>2026-09-25T12:27:19Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of arithmetic expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or other letters than X, Y, and Z) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix: a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
 012&lt;br /&gt;
 X&lt;br /&gt;
 -1&lt;br /&gt;
 Y+3&lt;br /&gt;
 -0+12-Z&lt;br /&gt;
 22+90*-2/60&lt;br /&gt;
 -100+16/-2*-30&lt;br /&gt;
 X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
 1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
 1%2 (an illegal character % appears between two integer numbers)&lt;br /&gt;
 12C (an illegal character C appears after the integer number)&lt;br /&gt;
 12--2 (if the minus character separates two integer numbers, it is not allowed to use the minus prefix for the second integer)&lt;br /&gt;
 10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3+X+Y+Z   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12260</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12260"/>
		<updated>2026-09-25T12:23:41Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of integer expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or other letters than X, Y, and Z) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix: a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
 012&lt;br /&gt;
 X&lt;br /&gt;
 -1&lt;br /&gt;
 Y+3&lt;br /&gt;
 -0+12-Z&lt;br /&gt;
 22+90*-2/60&lt;br /&gt;
 -100+16/-2*-30&lt;br /&gt;
 X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
 1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
 1%2 (an illegal character % appears between two integer numbers)&lt;br /&gt;
 12C (an illegal character C appears after the integer number)&lt;br /&gt;
 12--2 (if the minus character separates two integer numbers, it is not allowed to use the minus prefix for the second integer)&lt;br /&gt;
 10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3+X+Y+Z   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12259</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12259"/>
		<updated>2026-09-25T12:19:21Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of integer expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or other letters than X, Y, and Z) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix: a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
 012&lt;br /&gt;
 X&lt;br /&gt;
 -1&lt;br /&gt;
 2+3&lt;br /&gt;
 -0+12-7&lt;br /&gt;
 22+90*-2/60&lt;br /&gt;
 -100+16/-2*-30&lt;br /&gt;
 X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
 1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
 1%2 (an illegal character % appears between two integer numbers)&lt;br /&gt;
 12C (an illegal character C appears after the integer number)&lt;br /&gt;
 12--2 (if the minus character separates two integer numbers, it is not allowed to use the minus prefix for the second integer)&lt;br /&gt;
 10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3+X+Y+Z   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12258</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12258"/>
		<updated>2026-09-25T12:18:10Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of integer expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or other letters than X, Y, and Z) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix: a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
 012&lt;br /&gt;
 -1&lt;br /&gt;
 2+3&lt;br /&gt;
 -0+12-7&lt;br /&gt;
 22+90*-2/60&lt;br /&gt;
 -100+16/-2*-30&lt;br /&gt;
 X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
 1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
 1%2 (an illegal character % appears between two integer numbers)&lt;br /&gt;
 12C (an illegal character C appears after the integer number)&lt;br /&gt;
 12--2 (if the minus character separates two integer numbers, it is not allowed to use the minus prefix for the second integer)&lt;br /&gt;
 10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3+X+Y+Z   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12257</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12257"/>
		<updated>2026-09-25T12:14:12Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of integer expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or other letters than X, Y, and Z) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix: a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
 012&lt;br /&gt;
 -1&lt;br /&gt;
 2+3&lt;br /&gt;
 -0+12-7&lt;br /&gt;
 22+90*-2/60&lt;br /&gt;
 -100+16/-2*-30&lt;br /&gt;
 X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
 1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
 1%2 (an illegal character % appears between two integer numbers)&lt;br /&gt;
 12C (an illegal character C appears after the integer number)&lt;br /&gt;
 12--2 (if the minus character separates two integer numbers, it is not allowed to use the minus prefix for the second integer)&lt;br /&gt;
 10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12256</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12256"/>
		<updated>2026-09-25T12:12:56Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of integer expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or other letters than X, Y, and Z) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix -- a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
 012&lt;br /&gt;
 -1&lt;br /&gt;
 2+3&lt;br /&gt;
 -0+12-7&lt;br /&gt;
 22+90*-2/60&lt;br /&gt;
 -100+16/-2*-30&lt;br /&gt;
 X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
 1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
 1%2 (an illegal character % appears between two integer numbers)&lt;br /&gt;
 12C (an illegal character C appears after the integer number)&lt;br /&gt;
 12--2 (if the minus character separates two integer numbers, it is not allowed to use the minus prefix for the second integer)&lt;br /&gt;
 10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12255</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12255"/>
		<updated>2026-09-25T12:11:49Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of integer expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or letters) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix -- a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
 012&lt;br /&gt;
 -1&lt;br /&gt;
 2+3&lt;br /&gt;
 -0+12-7&lt;br /&gt;
 22+90*-2/60&lt;br /&gt;
 -100+16/-2*-30&lt;br /&gt;
 X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
 1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
 1%2 (an illegal character % appears between two integer numbers)&lt;br /&gt;
 12C (an illegal character C appears after the integer number)&lt;br /&gt;
 12--2 (if the minus character separates two integer numbers, it is not allowed to use the minus prefix for the second integer)&lt;br /&gt;
 10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12254</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12254"/>
		<updated>2026-09-25T12:11:04Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of integer expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or letters) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix -- a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
012&lt;br /&gt;
-1&lt;br /&gt;
2+3&lt;br /&gt;
-0+12-7&lt;br /&gt;
22+90*-2/60&lt;br /&gt;
-100+16/-2*-30&lt;br /&gt;
X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
1%2 (an illegal character % appears between two integer numbers)&lt;br /&gt;
12C (an illegal character C appears after the integer number)&lt;br /&gt;
12--2 (if the minus character separates two integer numbers, it is not allowed to use the minus prefix for the second integer)&lt;br /&gt;
10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by operand)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable XY, as only a single letter is permitted as a variable)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12253</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12253"/>
		<updated>2026-09-25T12:09:28Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of integer expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or letters) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix -- a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
012&lt;br /&gt;
-1&lt;br /&gt;
2+3&lt;br /&gt;
-0+12-7&lt;br /&gt;
22+90*-2/60&lt;br /&gt;
-100+16/-2*-30&lt;br /&gt;
X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
1%2 (an illegal character % appears between two integer numbers)&lt;br /&gt;
12C (an illegal character C appears after the integer number)&lt;br /&gt;
12--2 (if the minus character separates two integer numbers, it is not allowed to use the minus prefix for the second integer)&lt;br /&gt;
10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must match: ===&lt;br /&gt;
&lt;br /&gt;
 1+2+3   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
=== Examples of sequences the regular expression must NOT match: ===&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by integer number)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable name XY, as only a single letter is permitted)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12252</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12252"/>
		<updated>2026-09-25T12:09:07Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
=== Please write a regular expression for matching the sequence of integer expressions which follows these rules: ===&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or letters) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix -- a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;br /&gt;
&lt;br /&gt;
For example, the following are valid sequence elements:&lt;br /&gt;
&lt;br /&gt;
012&lt;br /&gt;
-1&lt;br /&gt;
2+3&lt;br /&gt;
-0+12-7&lt;br /&gt;
22+90*-2/60&lt;br /&gt;
-100+16/-2*-30&lt;br /&gt;
X^2+3*Y^-10+1&lt;br /&gt;
&lt;br /&gt;
However, the following sequence elements are invalid:&lt;br /&gt;
&lt;br /&gt;
1 + 2 (the space character appears both before and after the plus character, but the use of spaces is illegal)&lt;br /&gt;
1%2 (an illegal character % appears between two integer numbers)&lt;br /&gt;
12C (an illegal character C appears after the integer number)&lt;br /&gt;
12--2 (if the minus character separates two integer numbers, it is not allowed to use the minus prefix for the second integer)&lt;br /&gt;
10^1 (circumflex character can only appear after X, Y, or Z)&lt;br /&gt;
&lt;br /&gt;
Please note that for accomplishing the task, &amp;#039;&amp;#039;&amp;#039;one regular expression&amp;#039;&amp;#039;&amp;#039; has to be submitted which is &amp;#039;&amp;#039;&amp;#039;suitable for use with the egrep or pcre2grep tool&amp;#039;&amp;#039;&amp;#039;. It is not acceptable to submit the solution in a fragmented way (e.g., several isolated expressions for addressing different parts of the task). Also, it is not allowed to submit programs in Java, Python, Perl (or any other language) for the solution. Finally, if the solution only works with the examples provided below but does NOT meet the task specification, it will be treated as incorrect.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==== Examples of sequences the regular expression must match: ====&lt;br /&gt;
&lt;br /&gt;
 1+2+3   (the sequence has one valid element)&lt;br /&gt;
&lt;br /&gt;
 10,X^-2+3,-20   (the sequence has three valid elements)&lt;br /&gt;
&lt;br /&gt;
 -0,2*-3+7,-X^-1,33/-11*-5,-12/6,9+Y^10,77,1-2+3-4+5  (the sequence has eight valid elements)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==== Examples of sequences the regular expression must NOT match: ====&lt;br /&gt;
&lt;br /&gt;
 22+11,   (there is a comma after the first sequence element, but the second element is missing)&lt;br /&gt;
&lt;br /&gt;
 120+,3-4   (the first sequence element contains a plus character not followed by integer number)&lt;br /&gt;
&lt;br /&gt;
 -12-33,12+-1,5*X-3   (the second sequence element contains a plus character which is followed by a negative integer, but it is not allowed to use the minus character after plus)&lt;br /&gt;
&lt;br /&gt;
 1+2,,3+4,XY   (the second sequence element is missing; the fourth sequence element is an illegal variable name XY, as only a single letter is permitted)&lt;br /&gt;
&lt;br /&gt;
 11,12,+13   (the third sequence element starts with a plus character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 12^3,2+3,55//11   (the first sequence element contains ^ after an integer number, which is not permitted; also the third element contains two consecutive slash characters, while only one is allowed)&lt;br /&gt;
&lt;br /&gt;
 1+2+3,12*,2/3   (the second sequence element ends with an asterisk character which is allowed only as a separator between two operands)&lt;br /&gt;
&lt;br /&gt;
 11,45+X, 100   (there is an illegal space character after the second separating comma)&lt;br /&gt;
&lt;br /&gt;
 60 ,-4+0  (there is an illegal space character before the first separating comma)&lt;br /&gt;
&lt;br /&gt;
 --10A   (the sequence has one element which starts with two minus characters, while only one minus is allowed; also, the element ends with an illegal character A)&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12251</id>
		<title>Itx8071-task1</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task1&amp;diff=12251"/>
		<updated>2026-09-25T12:06:49Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This homework assignment requires the knowledge from Module 3.&lt;br /&gt;
&lt;br /&gt;
==== Please write a regular expression for matching the sequence of integer expressions which follows these rules: ====&lt;br /&gt;
&lt;br /&gt;
1) The sequence consists of one or more elements. If there are two or more elements, they are separated with a comma (,) character.&lt;br /&gt;
&lt;br /&gt;
2) Each element of the sequence is an expression that can consist of digits 0 1 2 3 4 5 6 7 8 9, letters X Y Z, and the plus (+), minus (-), asterisk (*), slash (/), and circumflex (^) characters. No other characters (such as spaces or letters) are permitted in the element. The element must contain one or more operands, where operand is either an integer number or a variable. The integer number is defined as a non-empty sequence of digits. The variable is defined as a single letter X, Y, or Z. &lt;br /&gt;
&lt;br /&gt;
3) If the operand is a variable, the operand may have the following suffix -- a single circumflex (^) character, followed by an optional minus (-) character, followed by at least one digit. If the operand is an integer number, this suffix is not permitted.&lt;br /&gt;
&lt;br /&gt;
4) If the element has more than one operand, two consecutive operands must be separated with a single plus, minus, asterisk or slash character. If the asterisk or slash separates two operands, an optional minus (-) character can appear before the second (right-hand side) operand. However, if two operands are separated by plus or minus character, the minus prefix is not allowed for the second operand. Also, an optional minus (-) character can appear before the first operand in the element (in other words, the first character of the element can be either a minus, a digit, or a letter X, Y, or Z).&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12220</id>
		<title>Cyber Defense Monitoring Solutions</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12220"/>
		<updated>2026-09-05T08:53:01Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Basic information ==&lt;br /&gt;
&lt;br /&gt;
* Course Code -- ITX8071&lt;br /&gt;
* Credit Points -- 6.0 EAP&lt;br /&gt;
* Course Language -- English&lt;br /&gt;
* Course Schedule -- the course will be lectured from 17:45 to 21:00 on every Wednesday of fall semester 2026. Note that some lectures might take place in MS Teams environment under the team [https://teams.microsoft.com/l/team/19%3a5d5f0c8381e446479e60341c0ff80b3a%40thread.tacv2/conversations?groupId=d803439d-d006-45de-a0db-bf35b61db566&amp;amp;tenantId=3efd4d88-9b88-4fc9-b6c0-c7ca50f1db57 &amp;quot;Cyber Defense Monitoring Solutions (ITX8071)]&amp;quot;, while remaining lectures and all labs are arranged in room ICT-401.&lt;br /&gt;
* Course Materials -- use the registration code w7Xz53c for accessing all course slides and pre-recorded lecture videos in Moodle.&lt;br /&gt;
&lt;br /&gt;
== Detailed Course Schedule ==&lt;br /&gt;
&lt;br /&gt;
* September 2 2026 (introduction to the course, lecture of module 1) -- MS Teams&lt;br /&gt;
* September 9 2026 (lab of module 1) -- room ICT-401&lt;br /&gt;
* September 16 2026 (lab of module 2) -- room ICT-401&lt;br /&gt;
* September 23 2026 (lecture of module 3) -- room ICT-401&lt;br /&gt;
* September 30 2026 (lab of module 3) -- room ICT-401&lt;br /&gt;
* October 7 2026 (lab of module 4) -- room ICT-401&lt;br /&gt;
* October 14 2026 (lecture of module 5) -- room ICT-401&lt;br /&gt;
* October 21 2026 (lab of module 5) -- room ICT-401&lt;br /&gt;
* October 28 2026 (lecture of module 6) -- room ICT-401&lt;br /&gt;
* November 4 2026 (lab of module 6) -- room ICT-401&lt;br /&gt;
* November 11 2026 (lab of module 7) -- room ICT-401&lt;br /&gt;
* November 18 2026 (lecture of module 8) -- room ICT-401&lt;br /&gt;
* November 25 2026 (lab of module 8) -- room ICT-401&lt;br /&gt;
* December 2 2026 (lecture of module 9) -- MS Teams&lt;br /&gt;
* December 9 2026 (lab of module 9) -- room ICT-401&lt;br /&gt;
&lt;br /&gt;
== Evaluation ==&lt;br /&gt;
&lt;br /&gt;
During the semester, two homework assignments are given to each student. Both assignments can yield up to 12.5 points, thus the maximum score from homework is 25 points. During the exam, three tasks are given to each student, with each task yielding up to 25 points and the whole exam up to 75 points. The final grade for a student is derived from his/her personal score:&lt;br /&gt;
&lt;br /&gt;
* score &amp;gt; 90 -- grade 5 (excellent)&lt;br /&gt;
* 80 &amp;lt; score ≤ 90 -- grade 4 (very good)&lt;br /&gt;
* 70 &amp;lt; score ≤ 80 -- grade 3 (good)&lt;br /&gt;
* 60 &amp;lt; score ≤ 70 -- grade 2 (satisfactory)&lt;br /&gt;
* 50 &amp;lt; score ≤ 60 -- grade 1 (pass)&lt;br /&gt;
* score ≤ 50 -- a student has failed to pass&lt;br /&gt;
&lt;br /&gt;
In addition to regular 100 points from homeworks and exam, extra points can be collected for active participation in the course (see the following sections).&lt;br /&gt;
&lt;br /&gt;
== Virtual machine image ==&lt;br /&gt;
&lt;br /&gt;
For course lab sessions, there is a [https://drive.google.com/file/d/1omHVnJ-yEKg2-w9E-S_IcXpitlDUhoF7/view?usp=sharing virtual machine image] which has been created with VirtualBox. When importing the image into VirtualBox, &amp;#039;&amp;#039;&amp;#039;don&amp;#039;t forget&amp;#039;&amp;#039;&amp;#039; to select the option &amp;#039;&amp;#039;&amp;#039;&amp;quot;Generate new MAC addresses for all network adapters&amp;quot;&amp;#039;&amp;#039;&amp;#039;. In order to run your virtual machine as a node of the classroom network, change the mode of the first network adapter from NAT to &amp;#039;&amp;#039;&amp;#039;Bridged Adapter&amp;#039;&amp;#039;&amp;#039;. &lt;br /&gt;
&lt;br /&gt;
Since the virtual machine is essential for doing homework assignments, it is strongly recommended to also install it on a personal laptop. In order to do that, leave the first network adapter to NAT mode, and change the mode of the second network adapter to &amp;#039;&amp;#039;&amp;#039;Host-only Adapter&amp;#039;&amp;#039;&amp;#039;. The host-only adapter is connected to a special virtual network (e.g., 192.168.56.0/24) that is not accessible from other hosts and is shared between the host computer and virtual machines. This network can be used for accessing the virtual machine from the host computer and creating setups where several virtual machines need to communicate.&lt;br /&gt;
&lt;br /&gt;
For changing the console keyboard layout of the virtual machine, use the &amp;#039;&amp;#039;&amp;#039;/usr/bin/localectl&amp;#039;&amp;#039;&amp;#039; tool. For example, &amp;#039;&amp;#039;&amp;#039;localectl set-keymap ee&amp;#039;&amp;#039;&amp;#039; sets Estonian keyboard layout for console and &amp;#039;&amp;#039;&amp;#039;localectl set-keymap us&amp;#039;&amp;#039;&amp;#039; sets US keyboard layout for console, while &amp;#039;&amp;#039;&amp;#039;localectl list-keymaps&amp;#039;&amp;#039;&amp;#039; lists all available layouts and &amp;#039;&amp;#039;&amp;#039;localectl status&amp;#039;&amp;#039;&amp;#039; shows the current settings.&lt;br /&gt;
&lt;br /&gt;
To ensure the smooth progress of the lab sessions, each lab is &amp;#039;&amp;#039;&amp;#039;independent&amp;#039;&amp;#039;&amp;#039; of the previous ones, requiring no work completed in earlier labs, and can be completed using a &amp;#039;&amp;#039;&amp;#039;newly instantiated&amp;#039;&amp;#039;&amp;#039; virtual machine from the virtual machine image.&lt;br /&gt;
&lt;br /&gt;
== Lab sessions ==&lt;br /&gt;
&lt;br /&gt;
Solutions for past lab sessions are available [https://drive.google.com/drive/folders/1-UYUgO-rnobRPRoVLwQvrivqyQbDpjEc?usp=sharing here].&lt;br /&gt;
&lt;br /&gt;
Note that the last lab of the course on December 9 2026 is a &amp;#039;&amp;#039;&amp;#039;graded lab which provides 5 extra points for participants&amp;#039;&amp;#039;&amp;#039;. During the graded lab, groups of max 3 students have to work on an assignment that is described [[itx8071-graded-lab|here]]. In order to speed up your work during the lab, you can accomplish part of the assignment in advance. &amp;#039;&amp;#039;&amp;#039;To receive points for the graded lab, the assignment solution has to be presented to the lecturers for evaluation during the lab session in ICT-401, and any other submissions are not accepted.&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
== Independent work during the semester ==&lt;br /&gt;
&lt;br /&gt;
Note that the lectures of the course are interactive discussions which assume the students have prepared themselves for the lectures.&lt;br /&gt;
For attending the course successfully, the following course materials have to be independently studied in Moodle by given deadlines:&lt;br /&gt;
&lt;br /&gt;
* lecture materials of module 2 (&amp;quot;Introduction to packet filtering with the Linux netfilter firewall&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 16 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 3 (&amp;quot;Regular expression language&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 23 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 4 (&amp;quot;Introduction to Perl regular expressions&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 7 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 5 (&amp;quot;Syslog-ng framework&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 14 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 6 (&amp;quot;Introduction to event correlation and Simple Event Correlator&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 28 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 7 (&amp;quot;Simple Event Correlator - advanced topics&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 11 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 8 (&amp;quot;Introduction to intrusion detection/prevention and Suricata IDS/IPS&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 18 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
In Moodle, lecture materials of several modules are followed by &amp;#039;&amp;#039;&amp;#039;tests which provide extra points&amp;#039;&amp;#039;&amp;#039;, with each test consisting of four multiple choice questions. The test can be taken &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039; and has to be completed &amp;#039;&amp;#039;&amp;#039;before the relevant lecture takes place&amp;#039;&amp;#039;&amp;#039;. To pass the test, at least three questions have to be answered correctly, and each successfully passed test yields &amp;#039;&amp;#039;&amp;#039;1 extra point&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
== Homework assignments ==&lt;br /&gt;
&lt;br /&gt;
* [[itx8071-task1|Task1]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;November 3 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
* [[itx8071-task2|Task2]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;December 15 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
Solutions to homework assignments should be sent to the e-mail address of the lecturer (given in the title page of each slide module). Together with the solution, full names and student codes of the authors must be listed. You should consider your solution submitted only after its reception &amp;#039;&amp;#039;&amp;#039;has been confirmed&amp;#039;&amp;#039;&amp;#039; by the lecturer.&lt;br /&gt;
&lt;br /&gt;
All submitted solutions should be carefully tested final versions. Please submit the solution &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039;, and do &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; send in partial and/or untested work. It is not allowed to submit a partial solution, and use comments from the lecturer for later resubmission of improved version(s). Also, if you wish to submit multiple solutions, you must &amp;#039;&amp;#039;&amp;#039;clearly indicate&amp;#039;&amp;#039;&amp;#039; which one should be used for evaluation. If no such indication is provided, the &amp;#039;&amp;#039;&amp;#039;first solution&amp;#039;&amp;#039;&amp;#039; will be used for evaluating your work, and other solutions are not considered.&lt;br /&gt;
&lt;br /&gt;
Please note that each student can be a (co)author of only one solution (i.e., participation in more than one student group is not allowed). Also note that the list of authors can not be changed after the deadline.&lt;br /&gt;
&lt;br /&gt;
The correct solution with your score will be announced after the deadline.&lt;br /&gt;
&lt;br /&gt;
Solutions submitted after the deadline will &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; be accepted. Also, it is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; possible to redo the homework assignment after the deadline. &lt;br /&gt;
&lt;br /&gt;
== Notes about distance learning ==&lt;br /&gt;
&lt;br /&gt;
In the case you are not able to attend lectures and labs physically, the course can be taken in a distance learning setting. However, you should consider the following when opting for the distance learning path:&lt;br /&gt;
&lt;br /&gt;
* All course slides and prerecorded lecture video clips can be accessed through Moodle&lt;br /&gt;
* Lab assignments can be found at the end of each lecture slideset (slides with the title &amp;quot;Tasks&amp;quot;)&lt;br /&gt;
* Make sure that you solve all lab assignments on the course virtual machine -- examination tasks are similar to lab assignments and having a good understanding of the lab topics is essential for passing the final exam&lt;br /&gt;
* Lab assignment solutions with comments are regularly posted to the course home page -- don&amp;#039;t forget to compare your work with posted solutions!&lt;br /&gt;
* Check the course home page regularly for new homework assignments, assignment deadlines, and other important information&lt;br /&gt;
* Because homework assignments allow the students to work as a group, it is recommended to join some group by looking potential cooperation partners through the course MS Teams group&lt;br /&gt;
* Since the course is offering extra points in addition to regular ones, it is recommended to collect as many extra points as possible for improving your final grade&lt;br /&gt;
&lt;br /&gt;
== Information about the exam ==&lt;br /&gt;
&lt;br /&gt;
The exam is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted. In order to attend the exam, each student must present an ID with a photo and have at least one pen in good working order. During the exam, each student has to accomplish 3 tasks within 3 hours on paper. All paper materials such as printed course slides, paper-based notes, and hardcopy books can be freely used during the exam. &lt;br /&gt;
&lt;br /&gt;
Examination time slots will be announced during the semester.&lt;br /&gt;
&lt;br /&gt;
For taking the exam, &amp;#039;&amp;#039;&amp;#039;official registration in OIS&amp;#039;&amp;#039;&amp;#039; is required for one of the examination time slots.&lt;br /&gt;
&lt;br /&gt;
Note that each student can take the exam only once, and in order to get the second try for improving the result, official application for re-examination is required (see below).&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;While producing his/her final examination work, the student must consider the following:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* Since there is no defense of the written examination work, the examination work must present full and unambiguous task solutions&lt;br /&gt;
* Each task must have only one clearly presented solution; if multiple solutions are given, only the first one will be evaluated&lt;br /&gt;
* All handwriting in the examination work must be legible&lt;br /&gt;
* No spare pens are provided to students during the exam&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;The following rules apply during the exam, and failure to follow them will invalidate the examination work of the student:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* The use of Internet, digital materials, and electronic devices (computers, mobile phones, cameras, etc.) is not permitted for any purposes&lt;br /&gt;
* All electronic devices will have to be switched to silent mode and left on a designated desk for the duration of the exam&lt;br /&gt;
* Any communication between students or with persons not taking the exam is strictly prohibited&lt;br /&gt;
* While the use of printed materials is permitted, it is not allowed to share such materials between students&lt;br /&gt;
* Students can&amp;#039;t leave the examination room during the first 60 minutes and the last 30 minutes of the exam&lt;br /&gt;
* Each student can leave the examination room once during the exam for max 10 minutes (only one person can leave the room at a time)&lt;br /&gt;
* When leaving the examination room, the student has to surrender the task sheet to the lecturer (it is prohibited to take any exam-related materials outside the room)&lt;br /&gt;
* When submitting the examination work, the student must also hand over the task sheet&lt;br /&gt;
* It is strictly prohibited to take photos or make any other copies of the task sheet&lt;br /&gt;
&lt;br /&gt;
== Re-examination information ==&lt;br /&gt;
&lt;br /&gt;
Each student is granted one re-examination attempt which requires official application. The student can apply for re-examination after failing a regular exam, or for improving a low grade from a regular exam. Re-examination invalidates any previous grade or intermediate result which was obtained during the semester. During re-examination, 2 assignments have to be accomplished within 1 hour. The final grade is solely based on assignment solutions, and no work from previous exam or semester can be combined with the re-exam.&lt;br /&gt;
&lt;br /&gt;
The re-examination is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted, and all rules of the regular exam apply (see above).&lt;br /&gt;
&lt;br /&gt;
Re-examination time slot will be announced during the semester.&lt;br /&gt;
&lt;br /&gt;
== Plagiarism policy ==&lt;br /&gt;
&lt;br /&gt;
Please note that &amp;#039;&amp;#039;&amp;#039;plagiarized&amp;#039;&amp;#039;&amp;#039; home works and exam works will be &amp;#039;&amp;#039;&amp;#039;rejected without a review&amp;#039;&amp;#039;&amp;#039;, and the university will be &amp;#039;&amp;#039;&amp;#039;notified&amp;#039;&amp;#039;&amp;#039; of the offense. All cases of student plagiarism and other violations of academic practices will be handled according to [https://haldus.taltech.ee/sites/default/files/2020-10/Terviktekst_IT-teaduskonna%20%C3%B5ppuri%20akad%20tavade%20rikkumise%20ja%20v%C3%A4%C3%A4ritu%20k%C3%A4itumise%20menetlemise%20kord_ENG.pdf regulations of the IT faculty].&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12219</id>
		<title>Cyber Defense Monitoring Solutions</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12219"/>
		<updated>2026-09-05T08:50:11Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Basic information ==&lt;br /&gt;
&lt;br /&gt;
* Course Code -- ITX8071&lt;br /&gt;
* Credit Points -- 6.0 EAP&lt;br /&gt;
* Course Language -- English&lt;br /&gt;
* Course Schedule -- the course will be lectured from 17:45 to 21:00 on every Wednesday of fall semester 2026. Note that some lectures might take place in MS Teams environment under the team [https://teams.microsoft.com/l/team/19%3a5d5f0c8381e446479e60341c0ff80b3a%40thread.tacv2/conversations?groupId=d803439d-d006-45de-a0db-bf35b61db566&amp;amp;tenantId=3efd4d88-9b88-4fc9-b6c0-c7ca50f1db57 &amp;quot;Cyber Defense Monitoring Solutions (ITX8071)]&amp;quot;, while remaining lectures and all labs are arranged in room ICT-401.&lt;br /&gt;
* Course Materials -- use the registration code w7Xz53c for accessing all course slides and pre-recorded lecture videos in Moodle.&lt;br /&gt;
&lt;br /&gt;
== Detailed Course Schedule ==&lt;br /&gt;
&lt;br /&gt;
* September 2 2026 (introduction to the course, lecture of module 1) -- MS Teams&lt;br /&gt;
* September 9 2026 (lab of module 1) -- room ICT-401&lt;br /&gt;
* September 16 2026 (lab of module 2) -- room ICT-401&lt;br /&gt;
* September 23 2026 (lecture of module 3) -- room ICT-401&lt;br /&gt;
* September 30 2026 (lab of module 3) -- room ICT-401&lt;br /&gt;
* October 7 2026 (lab of module 4) -- room ICT-401&lt;br /&gt;
* October 14 2026 (lecture of module 5) -- room ICT-401&lt;br /&gt;
* October 21 2026 (lab of module 5) -- room ICT-401&lt;br /&gt;
* October 28 2026 (lecture of module 6) -- room ICT-401&lt;br /&gt;
* November 4 2026 (lab of module 6) -- room ICT-401&lt;br /&gt;
* November 11 2026 (lab of module 7) -- room ICT-401&lt;br /&gt;
* November 18 2026 (lecture of module 8) -- room ICT-401&lt;br /&gt;
* November 25 2026 (lab of module 8) -- room ICT-401&lt;br /&gt;
* December 2 2026 (lecture of module 9) -- MS Teams&lt;br /&gt;
* December 9 2026 (lab of module 9) -- room ICT-401&lt;br /&gt;
&lt;br /&gt;
== Evaluation ==&lt;br /&gt;
&lt;br /&gt;
During the semester, two homework assignments are given to each student. Both assignments can yield up to 12.5 points, thus the maximum score from homework is 25 points. During the exam, three tasks are given to each student, with each task yielding up to 25 points and the whole exam up to 75 points. The final grade for a student is derived from his/her personal score:&lt;br /&gt;
&lt;br /&gt;
* score &amp;gt; 90 -- grade 5 (excellent)&lt;br /&gt;
* 80 &amp;lt; score ≤ 90 -- grade 4 (very good)&lt;br /&gt;
* 70 &amp;lt; score ≤ 80 -- grade 3 (good)&lt;br /&gt;
* 60 &amp;lt; score ≤ 70 -- grade 2 (satisfactory)&lt;br /&gt;
* 50 &amp;lt; score ≤ 60 -- grade 1 (pass)&lt;br /&gt;
* score ≤ 50 -- a student has failed to pass&lt;br /&gt;
&lt;br /&gt;
In addition to regular 100 points from homeworks and exam, extra points can be collected for active participation in the course (see the following sections).&lt;br /&gt;
&lt;br /&gt;
== Virtual machine image ==&lt;br /&gt;
&lt;br /&gt;
For course lab sessions, there is a [https://drive.google.com/file/d/1omHVnJ-yEKg2-w9E-S_IcXpitlDUhoF7/view?usp=sharing virtual machine image] which has been created with VirtualBox. When importing the image into VirtualBox, &amp;#039;&amp;#039;&amp;#039;don&amp;#039;t forget&amp;#039;&amp;#039;&amp;#039; to select the option &amp;#039;&amp;#039;&amp;#039;&amp;quot;Generate new MAC addresses for all network adapters&amp;quot;&amp;#039;&amp;#039;&amp;#039;. In order to run your virtual machine as a node of the classroom network, change the mode of the first network adapter from NAT to &amp;#039;&amp;#039;&amp;#039;Bridged Adapter&amp;#039;&amp;#039;&amp;#039;. &lt;br /&gt;
&lt;br /&gt;
Since the virtual machine is essential for doing homework assignments, it is strongly recommended to also install it on a personal laptop. In order to do that, leave the first network adapter to NAT mode, and change the mode of the second network adapter to &amp;#039;&amp;#039;&amp;#039;Host-only Adapter&amp;#039;&amp;#039;&amp;#039;. The host-only adapter is connected to a special virtual network (e.g., 192.168.56.0/24) that is not accessible from other hosts and is shared between the host computer and virtual machines. This network can be used for accessing the virtual machine from the host computer and creating setups where several virtual machines need to communicate.&lt;br /&gt;
&lt;br /&gt;
For changing the console keyboard layout of the virtual machine, use the &amp;#039;&amp;#039;&amp;#039;/usr/bin/localectl&amp;#039;&amp;#039;&amp;#039; tool. For example, &amp;#039;&amp;#039;&amp;#039;localectl set-keymap ee&amp;#039;&amp;#039;&amp;#039; sets Estonian keyboard layout for console and &amp;#039;&amp;#039;&amp;#039;localectl set-keymap us&amp;#039;&amp;#039;&amp;#039; sets US keyboard layout for console, while &amp;#039;&amp;#039;&amp;#039;localectl list-keymaps&amp;#039;&amp;#039;&amp;#039; lists all available layouts and &amp;#039;&amp;#039;&amp;#039;localectl status&amp;#039;&amp;#039;&amp;#039; shows the current settings.&lt;br /&gt;
&lt;br /&gt;
To ensure the smooth progress of the lab sessions, each lab is &amp;#039;&amp;#039;&amp;#039;independent&amp;#039;&amp;#039;&amp;#039; of the previous ones and can be completed using a newly instantiated virtual machine from the virtual machine image.&lt;br /&gt;
&lt;br /&gt;
== Lab sessions ==&lt;br /&gt;
&lt;br /&gt;
Solutions for past lab sessions are available [https://drive.google.com/drive/folders/1-UYUgO-rnobRPRoVLwQvrivqyQbDpjEc?usp=sharing here].&lt;br /&gt;
&lt;br /&gt;
Note that the last lab of the course on December 9 2026 is a &amp;#039;&amp;#039;&amp;#039;graded lab which provides 5 extra points for participants&amp;#039;&amp;#039;&amp;#039;. During the graded lab, groups of max 3 students have to work on an assignment that is described [[itx8071-graded-lab|here]]. In order to speed up your work during the lab, you can accomplish part of the assignment in advance. &amp;#039;&amp;#039;&amp;#039;To receive points for the graded lab, the assignment solution has to be presented to the lecturers for evaluation during the lab session in ICT-401, and any other submissions are not accepted.&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
== Independent work during the semester ==&lt;br /&gt;
&lt;br /&gt;
Note that the lectures of the course are interactive discussions which assume the students have prepared themselves for the lectures.&lt;br /&gt;
For attending the course successfully, the following course materials have to be independently studied in Moodle by given deadlines:&lt;br /&gt;
&lt;br /&gt;
* lecture materials of module 2 (&amp;quot;Introduction to packet filtering with the Linux netfilter firewall&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 16 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 3 (&amp;quot;Regular expression language&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 23 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 4 (&amp;quot;Introduction to Perl regular expressions&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 7 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 5 (&amp;quot;Syslog-ng framework&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 14 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 6 (&amp;quot;Introduction to event correlation and Simple Event Correlator&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 28 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 7 (&amp;quot;Simple Event Correlator - advanced topics&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 11 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 8 (&amp;quot;Introduction to intrusion detection/prevention and Suricata IDS/IPS&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 18 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
In Moodle, lecture materials of several modules are followed by &amp;#039;&amp;#039;&amp;#039;tests which provide extra points&amp;#039;&amp;#039;&amp;#039;, with each test consisting of four multiple choice questions. The test can be taken &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039; and has to be completed &amp;#039;&amp;#039;&amp;#039;before the relevant lecture takes place&amp;#039;&amp;#039;&amp;#039;. To pass the test, at least three questions have to be answered correctly, and each successfully passed test yields &amp;#039;&amp;#039;&amp;#039;1 extra point&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
== Homework assignments ==&lt;br /&gt;
&lt;br /&gt;
* [[itx8071-task1|Task1]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;November 3 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
* [[itx8071-task2|Task2]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;December 15 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
Solutions to homework assignments should be sent to the e-mail address of the lecturer (given in the title page of each slide module). Together with the solution, full names and student codes of the authors must be listed. You should consider your solution submitted only after its reception &amp;#039;&amp;#039;&amp;#039;has been confirmed&amp;#039;&amp;#039;&amp;#039; by the lecturer.&lt;br /&gt;
&lt;br /&gt;
All submitted solutions should be carefully tested final versions. Please submit the solution &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039;, and do &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; send in partial and/or untested work. It is not allowed to submit a partial solution, and use comments from the lecturer for later resubmission of improved version(s). Also, if you wish to submit multiple solutions, you must &amp;#039;&amp;#039;&amp;#039;clearly indicate&amp;#039;&amp;#039;&amp;#039; which one should be used for evaluation. If no such indication is provided, the &amp;#039;&amp;#039;&amp;#039;first solution&amp;#039;&amp;#039;&amp;#039; will be used for evaluating your work, and other solutions are not considered.&lt;br /&gt;
&lt;br /&gt;
Please note that each student can be a (co)author of only one solution (i.e., participation in more than one student group is not allowed). Also note that the list of authors can not be changed after the deadline.&lt;br /&gt;
&lt;br /&gt;
The correct solution with your score will be announced after the deadline.&lt;br /&gt;
&lt;br /&gt;
Solutions submitted after the deadline will &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; be accepted. Also, it is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; possible to redo the homework assignment after the deadline. &lt;br /&gt;
&lt;br /&gt;
== Notes about distance learning ==&lt;br /&gt;
&lt;br /&gt;
In the case you are not able to attend lectures and labs physically, the course can be taken in a distance learning setting. However, you should consider the following when opting for the distance learning path:&lt;br /&gt;
&lt;br /&gt;
* All course slides and prerecorded lecture video clips can be accessed through Moodle&lt;br /&gt;
* Lab assignments can be found at the end of each lecture slideset (slides with the title &amp;quot;Tasks&amp;quot;)&lt;br /&gt;
* Make sure that you solve all lab assignments on the course virtual machine -- examination tasks are similar to lab assignments and having a good understanding of the lab topics is essential for passing the final exam&lt;br /&gt;
* Lab assignment solutions with comments are regularly posted to the course home page -- don&amp;#039;t forget to compare your work with posted solutions!&lt;br /&gt;
* Check the course home page regularly for new homework assignments, assignment deadlines, and other important information&lt;br /&gt;
* Because homework assignments allow the students to work as a group, it is recommended to join some group by looking potential cooperation partners through the course MS Teams group&lt;br /&gt;
* Since the course is offering extra points in addition to regular ones, it is recommended to collect as many extra points as possible for improving your final grade&lt;br /&gt;
&lt;br /&gt;
== Information about the exam ==&lt;br /&gt;
&lt;br /&gt;
The exam is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted. In order to attend the exam, each student must present an ID with a photo and have at least one pen in good working order. During the exam, each student has to accomplish 3 tasks within 3 hours on paper. All paper materials such as printed course slides, paper-based notes, and hardcopy books can be freely used during the exam. &lt;br /&gt;
&lt;br /&gt;
Examination time slots will be announced during the semester.&lt;br /&gt;
&lt;br /&gt;
For taking the exam, &amp;#039;&amp;#039;&amp;#039;official registration in OIS&amp;#039;&amp;#039;&amp;#039; is required for one of the examination time slots.&lt;br /&gt;
&lt;br /&gt;
Note that each student can take the exam only once, and in order to get the second try for improving the result, official application for re-examination is required (see below).&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;While producing his/her final examination work, the student must consider the following:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* Since there is no defense of the written examination work, the examination work must present full and unambiguous task solutions&lt;br /&gt;
* Each task must have only one clearly presented solution; if multiple solutions are given, only the first one will be evaluated&lt;br /&gt;
* All handwriting in the examination work must be legible&lt;br /&gt;
* No spare pens are provided to students during the exam&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;The following rules apply during the exam, and failure to follow them will invalidate the examination work of the student:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* The use of Internet, digital materials, and electronic devices (computers, mobile phones, cameras, etc.) is not permitted for any purposes&lt;br /&gt;
* All electronic devices will have to be switched to silent mode and left on a designated desk for the duration of the exam&lt;br /&gt;
* Any communication between students or with persons not taking the exam is strictly prohibited&lt;br /&gt;
* While the use of printed materials is permitted, it is not allowed to share such materials between students&lt;br /&gt;
* Students can&amp;#039;t leave the examination room during the first 60 minutes and the last 30 minutes of the exam&lt;br /&gt;
* Each student can leave the examination room once during the exam for max 10 minutes (only one person can leave the room at a time)&lt;br /&gt;
* When leaving the examination room, the student has to surrender the task sheet to the lecturer (it is prohibited to take any exam-related materials outside the room)&lt;br /&gt;
* When submitting the examination work, the student must also hand over the task sheet&lt;br /&gt;
* It is strictly prohibited to take photos or make any other copies of the task sheet&lt;br /&gt;
&lt;br /&gt;
== Re-examination information ==&lt;br /&gt;
&lt;br /&gt;
Each student is granted one re-examination attempt which requires official application. The student can apply for re-examination after failing a regular exam, or for improving a low grade from a regular exam. Re-examination invalidates any previous grade or intermediate result which was obtained during the semester. During re-examination, 2 assignments have to be accomplished within 1 hour. The final grade is solely based on assignment solutions, and no work from previous exam or semester can be combined with the re-exam.&lt;br /&gt;
&lt;br /&gt;
The re-examination is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted, and all rules of the regular exam apply (see above).&lt;br /&gt;
&lt;br /&gt;
Re-examination time slot will be announced during the semester.&lt;br /&gt;
&lt;br /&gt;
== Plagiarism policy ==&lt;br /&gt;
&lt;br /&gt;
Please note that &amp;#039;&amp;#039;&amp;#039;plagiarized&amp;#039;&amp;#039;&amp;#039; home works and exam works will be &amp;#039;&amp;#039;&amp;#039;rejected without a review&amp;#039;&amp;#039;&amp;#039;, and the university will be &amp;#039;&amp;#039;&amp;#039;notified&amp;#039;&amp;#039;&amp;#039; of the offense. All cases of student plagiarism and other violations of academic practices will be handled according to [https://haldus.taltech.ee/sites/default/files/2020-10/Terviktekst_IT-teaduskonna%20%C3%B5ppuri%20akad%20tavade%20rikkumise%20ja%20v%C3%A4%C3%A4ritu%20k%C3%A4itumise%20menetlemise%20kord_ENG.pdf regulations of the IT faculty].&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-graded-lab&amp;diff=12206</id>
		<title>Itx8071-graded-lab</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-graded-lab&amp;diff=12206"/>
		<updated>2026-08-22T16:23:09Z</updated>

		<summary type="html">&lt;p&gt;Risto: Lehekülg asendatud tekstiga &amp;#039;To be announced.&amp;#039;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;To be announced.&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12205</id>
		<title>Cyber Defense Monitoring Solutions</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Cyber_Defense_Monitoring_Solutions&amp;diff=12205"/>
		<updated>2026-08-22T16:19:25Z</updated>

		<summary type="html">&lt;p&gt;Risto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Basic information ==&lt;br /&gt;
&lt;br /&gt;
* Course Code -- ITX8071&lt;br /&gt;
* Credit Points -- 6.0 EAP&lt;br /&gt;
* Course Language -- English&lt;br /&gt;
* Course Schedule -- the course will be lectured from 17:45 to 21:00 on every Wednesday of fall semester 2026. Note that some lectures might take place in MS Teams environment under the team [https://teams.microsoft.com/l/team/19%3a5d5f0c8381e446479e60341c0ff80b3a%40thread.tacv2/conversations?groupId=d803439d-d006-45de-a0db-bf35b61db566&amp;amp;tenantId=3efd4d88-9b88-4fc9-b6c0-c7ca50f1db57 &amp;quot;Cyber Defense Monitoring Solutions (ITX8071)]&amp;quot;, while remaining lectures and all labs are arranged in room ICT-401.&lt;br /&gt;
* Course Materials -- use the registration code w7Xz53c for accessing all course slides and pre-recorded lecture videos in Moodle.&lt;br /&gt;
&lt;br /&gt;
== Detailed Course Schedule ==&lt;br /&gt;
&lt;br /&gt;
* September 2 2026 (introduction to the course, lecture of module 1) -- MS Teams&lt;br /&gt;
* September 9 2026 (lab of module 1) -- room ICT-401&lt;br /&gt;
* September 16 2026 (lab of module 2) -- room ICT-401&lt;br /&gt;
* September 23 2026 (lecture of module 3) -- room ICT-401&lt;br /&gt;
* September 30 2026 (lab of module 3) -- room ICT-401&lt;br /&gt;
* October 7 2026 (lab of module 4) -- room ICT-401&lt;br /&gt;
* October 14 2026 (lecture of module 5) -- room ICT-401&lt;br /&gt;
* October 21 2026 (lab of module 5) -- room ICT-401&lt;br /&gt;
* October 28 2026 (lecture of module 6) -- room ICT-401&lt;br /&gt;
* November 4 2026 (lab of module 6) -- room ICT-401&lt;br /&gt;
* November 11 2026 (lab of module 7) -- room ICT-401&lt;br /&gt;
* November 18 2026 (lecture of module 8) -- room ICT-401&lt;br /&gt;
* November 25 2026 (lab of module 8) -- room ICT-401&lt;br /&gt;
* December 2 2026 (lecture of module 9) -- MS Teams&lt;br /&gt;
* December 9 2026 (lab of module 9) -- room ICT-401&lt;br /&gt;
&lt;br /&gt;
== Evaluation ==&lt;br /&gt;
&lt;br /&gt;
During the semester, two homework assignments are given to each student. Both assignments can yield up to 12.5 points, thus the maximum score from homework is 25 points. During the exam, three tasks are given to each student, with each task yielding up to 25 points and the whole exam up to 75 points. The final grade for a student is derived from his/her personal score:&lt;br /&gt;
&lt;br /&gt;
* score &amp;gt; 90 -- grade 5 (excellent)&lt;br /&gt;
* 80 &amp;lt; score ≤ 90 -- grade 4 (very good)&lt;br /&gt;
* 70 &amp;lt; score ≤ 80 -- grade 3 (good)&lt;br /&gt;
* 60 &amp;lt; score ≤ 70 -- grade 2 (satisfactory)&lt;br /&gt;
* 50 &amp;lt; score ≤ 60 -- grade 1 (pass)&lt;br /&gt;
* score ≤ 50 -- a student has failed to pass&lt;br /&gt;
&lt;br /&gt;
In addition to regular 100 points from homeworks and exam, extra points can be collected for active participation in the course (see the following sections).&lt;br /&gt;
&lt;br /&gt;
== Virtual machine image ==&lt;br /&gt;
&lt;br /&gt;
For course lab sessions, there is a [https://drive.google.com/file/d/1omHVnJ-yEKg2-w9E-S_IcXpitlDUhoF7/view?usp=sharing virtual machine image] which has been created with VirtualBox. When importing the image into VirtualBox, &amp;#039;&amp;#039;&amp;#039;don&amp;#039;t forget&amp;#039;&amp;#039;&amp;#039; to select the option &amp;#039;&amp;#039;&amp;#039;&amp;quot;Generate new MAC addresses for all network adapters&amp;quot;&amp;#039;&amp;#039;&amp;#039;. In order to run your virtual machine as a node of the classroom network, change the mode of the first network adapter from NAT to &amp;#039;&amp;#039;&amp;#039;Bridged Adapter&amp;#039;&amp;#039;&amp;#039;. &lt;br /&gt;
&lt;br /&gt;
Since the virtual machine is essential for doing homework assignments, it is strongly recommended to also install it on a personal laptop. In order to do that, leave the first network adapter to NAT mode, and change the mode of the second network adapter to &amp;#039;&amp;#039;&amp;#039;Host-only Adapter&amp;#039;&amp;#039;&amp;#039;. The host-only adapter is connected to a special virtual network (e.g., 192.168.56.0/24) that is not accessible from other hosts and is shared between the host computer and virtual machines. This network can be used for accessing the virtual machine from the host computer and creating setups where several virtual machines need to communicate.&lt;br /&gt;
&lt;br /&gt;
For changing the console keyboard layout of the virtual machine, use the &amp;#039;&amp;#039;&amp;#039;/usr/bin/localectl&amp;#039;&amp;#039;&amp;#039; tool. For example, &amp;#039;&amp;#039;&amp;#039;localectl set-keymap ee&amp;#039;&amp;#039;&amp;#039; sets Estonian keyboard layout for console and &amp;#039;&amp;#039;&amp;#039;localectl set-keymap us&amp;#039;&amp;#039;&amp;#039; sets US keyboard layout for console, while &amp;#039;&amp;#039;&amp;#039;localectl list-keymaps&amp;#039;&amp;#039;&amp;#039; lists all available layouts and &amp;#039;&amp;#039;&amp;#039;localectl status&amp;#039;&amp;#039;&amp;#039; shows the current settings.&lt;br /&gt;
&lt;br /&gt;
== Lab sessions ==&lt;br /&gt;
&lt;br /&gt;
Solutions for past lab sessions are available [https://drive.google.com/drive/folders/1-UYUgO-rnobRPRoVLwQvrivqyQbDpjEc?usp=sharing here].&lt;br /&gt;
&lt;br /&gt;
Note that the last lab of the course on December 9 2026 is a &amp;#039;&amp;#039;&amp;#039;graded lab which provides 5 extra points for participants&amp;#039;&amp;#039;&amp;#039;. During the graded lab, groups of max 3 students have to work on an assignment that is described [[itx8071-graded-lab|here]]. In order to speed up your work during the lab, you can accomplish part of the assignment in advance. &amp;#039;&amp;#039;&amp;#039;To receive points for the graded lab, the assignment solution has to be presented to the lecturers for evaluation during the lab session in ICT-401, and any other submissions are not accepted.&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
== Independent work during the semester ==&lt;br /&gt;
&lt;br /&gt;
Note that the lectures of the course are interactive discussions which assume the students have prepared themselves for the lectures.&lt;br /&gt;
For attending the course successfully, the following course materials have to be independently studied in Moodle by given deadlines:&lt;br /&gt;
&lt;br /&gt;
* lecture materials of module 2 (&amp;quot;Introduction to packet filtering with the Linux netfilter firewall&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 16 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 3 (&amp;quot;Regular expression language&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;September 23 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 4 (&amp;quot;Introduction to Perl regular expressions&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 7 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 5 (&amp;quot;Syslog-ng framework&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 14 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 6 (&amp;quot;Introduction to event correlation and Simple Event Correlator&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;October 28 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 7 (&amp;quot;Simple Event Correlator - advanced topics&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 11 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* lecture materials of module 8 (&amp;quot;Introduction to intrusion detection/prevention and Suricata IDS/IPS&amp;quot;) by &amp;#039;&amp;#039;&amp;#039;November 18 2026&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
In Moodle, lecture materials of several modules are followed by &amp;#039;&amp;#039;&amp;#039;tests which provide extra points&amp;#039;&amp;#039;&amp;#039;, with each test consisting of four multiple choice questions. The test can be taken &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039; and has to be completed &amp;#039;&amp;#039;&amp;#039;before the relevant lecture takes place&amp;#039;&amp;#039;&amp;#039;. To pass the test, at least three questions have to be answered correctly, and each successfully passed test yields &amp;#039;&amp;#039;&amp;#039;1 extra point&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
== Homework assignments ==&lt;br /&gt;
&lt;br /&gt;
* [[itx8071-task1|Task1]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;November 3 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
* [[itx8071-task2|Task2]] -- a group work for max 3 students which must be submitted by &amp;#039;&amp;#039;&amp;#039;December 15 2026 23:59 local time&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
Solutions to homework assignments should be sent to the e-mail address of the lecturer (given in the title page of each slide module). Together with the solution, full names and student codes of the authors must be listed. You should consider your solution submitted only after its reception &amp;#039;&amp;#039;&amp;#039;has been confirmed&amp;#039;&amp;#039;&amp;#039; by the lecturer.&lt;br /&gt;
&lt;br /&gt;
All submitted solutions should be carefully tested final versions. Please submit the solution &amp;#039;&amp;#039;&amp;#039;only once&amp;#039;&amp;#039;&amp;#039;, and do &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; send in partial and/or untested work. It is not allowed to submit a partial solution, and use comments from the lecturer for later resubmission of improved version(s). Also, if you wish to submit multiple solutions, you must &amp;#039;&amp;#039;&amp;#039;clearly indicate&amp;#039;&amp;#039;&amp;#039; which one should be used for evaluation. If no such indication is provided, the &amp;#039;&amp;#039;&amp;#039;first solution&amp;#039;&amp;#039;&amp;#039; will be used for evaluating your work, and other solutions are not considered.&lt;br /&gt;
&lt;br /&gt;
Please note that each student can be a (co)author of only one solution (i.e., participation in more than one student group is not allowed). Also note that the list of authors can not be changed after the deadline.&lt;br /&gt;
&lt;br /&gt;
The correct solution with your score will be announced after the deadline.&lt;br /&gt;
&lt;br /&gt;
Solutions submitted after the deadline will &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; be accepted. Also, it is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; possible to redo the homework assignment after the deadline. &lt;br /&gt;
&lt;br /&gt;
== Notes about distance learning ==&lt;br /&gt;
&lt;br /&gt;
In the case you are not able to attend lectures and labs physically, the course can be taken in a distance learning setting. However, you should consider the following when opting for the distance learning path:&lt;br /&gt;
&lt;br /&gt;
* All course slides and prerecorded lecture video clips can be accessed through Moodle&lt;br /&gt;
* Lab assignments can be found at the end of each lecture slideset (slides with the title &amp;quot;Tasks&amp;quot;)&lt;br /&gt;
* Make sure that you solve all lab assignments on the course virtual machine -- examination tasks are similar to lab assignments and having a good understanding of the lab topics is essential for passing the final exam&lt;br /&gt;
* Lab assignment solutions with comments are regularly posted to the course home page -- don&amp;#039;t forget to compare your work with posted solutions!&lt;br /&gt;
* Check the course home page regularly for new homework assignments, assignment deadlines, and other important information&lt;br /&gt;
* Because homework assignments allow the students to work as a group, it is recommended to join some group by looking potential cooperation partners through the course MS Teams group&lt;br /&gt;
* Since the course is offering extra points in addition to regular ones, it is recommended to collect as many extra points as possible for improving your final grade&lt;br /&gt;
&lt;br /&gt;
== Information about the exam ==&lt;br /&gt;
&lt;br /&gt;
The exam is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted. In order to attend the exam, each student must present an ID with a photo and have at least one pen in good working order. During the exam, each student has to accomplish 3 tasks within 3 hours on paper. All paper materials such as printed course slides, paper-based notes, and hardcopy books can be freely used during the exam. &lt;br /&gt;
&lt;br /&gt;
Examination time slots will be announced during the semester.&lt;br /&gt;
&lt;br /&gt;
For taking the exam, &amp;#039;&amp;#039;&amp;#039;official registration in OIS&amp;#039;&amp;#039;&amp;#039; is required for one of the examination time slots.&lt;br /&gt;
&lt;br /&gt;
Note that each student can take the exam only once, and in order to get the second try for improving the result, official application for re-examination is required (see below).&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;While producing his/her final examination work, the student must consider the following:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* Since there is no defense of the written examination work, the examination work must present full and unambiguous task solutions&lt;br /&gt;
* Each task must have only one clearly presented solution; if multiple solutions are given, only the first one will be evaluated&lt;br /&gt;
* All handwriting in the examination work must be legible&lt;br /&gt;
* No spare pens are provided to students during the exam&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;The following rules apply during the exam, and failure to follow them will invalidate the examination work of the student:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
* The use of Internet, digital materials, and electronic devices (computers, mobile phones, cameras, etc.) is not permitted for any purposes&lt;br /&gt;
* All electronic devices will have to be switched to silent mode and left on a designated desk for the duration of the exam&lt;br /&gt;
* Any communication between students or with persons not taking the exam is strictly prohibited&lt;br /&gt;
* While the use of printed materials is permitted, it is not allowed to share such materials between students&lt;br /&gt;
* Students can&amp;#039;t leave the examination room during the first 60 minutes and the last 30 minutes of the exam&lt;br /&gt;
* Each student can leave the examination room once during the exam for max 10 minutes (only one person can leave the room at a time)&lt;br /&gt;
* When leaving the examination room, the student has to surrender the task sheet to the lecturer (it is prohibited to take any exam-related materials outside the room)&lt;br /&gt;
* When submitting the examination work, the student must also hand over the task sheet&lt;br /&gt;
* It is strictly prohibited to take photos or make any other copies of the task sheet&lt;br /&gt;
&lt;br /&gt;
== Re-examination information ==&lt;br /&gt;
&lt;br /&gt;
Each student is granted one re-examination attempt which requires official application. The student can apply for re-examination after failing a regular exam, or for improving a low grade from a regular exam. Re-examination invalidates any previous grade or intermediate result which was obtained during the semester. During re-examination, 2 assignments have to be accomplished within 1 hour. The final grade is solely based on assignment solutions, and no work from previous exam or semester can be combined with the re-exam.&lt;br /&gt;
&lt;br /&gt;
The re-examination is an &amp;#039;&amp;#039;&amp;#039;open-book&amp;#039;&amp;#039;&amp;#039; exam, but the use of Internet, electronic devices, and digital materials is &amp;#039;&amp;#039;&amp;#039;not&amp;#039;&amp;#039;&amp;#039; permitted, and all rules of the regular exam apply (see above).&lt;br /&gt;
&lt;br /&gt;
Re-examination time slot will be announced during the semester.&lt;br /&gt;
&lt;br /&gt;
== Plagiarism policy ==&lt;br /&gt;
&lt;br /&gt;
Please note that &amp;#039;&amp;#039;&amp;#039;plagiarized&amp;#039;&amp;#039;&amp;#039; home works and exam works will be &amp;#039;&amp;#039;&amp;#039;rejected without a review&amp;#039;&amp;#039;&amp;#039;, and the university will be &amp;#039;&amp;#039;&amp;#039;notified&amp;#039;&amp;#039;&amp;#039; of the offense. All cases of student plagiarism and other violations of academic practices will be handled according to [https://haldus.taltech.ee/sites/default/files/2020-10/Terviktekst_IT-teaduskonna%20%C3%B5ppuri%20akad%20tavade%20rikkumise%20ja%20v%C3%A4%C3%A4ritu%20k%C3%A4itumise%20menetlemise%20kord_ENG.pdf regulations of the IT faculty].&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
	<entry>
		<id>http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12204</id>
		<title>Itx8071-task2</title>
		<link rel="alternate" type="text/html" href="http://courses.cs.taltech.ee/w/index.php?title=Itx8071-task2&amp;diff=12204"/>
		<updated>2026-08-22T16:12:01Z</updated>

		<summary type="html">&lt;p&gt;Risto: Lehekülg asendatud tekstiga &amp;#039;To be announced.&amp;#039;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;To be announced.&lt;/div&gt;</summary>
		<author><name>Risto</name></author>
	</entry>
</feed>