Skip to main content

Introduction

 Hello! In the previous post I started introducing myself and here I want to give you more information.

I was born in Minsk, the capital of the Republic of Belarus, in 2003. My father was always very busy at work and my mum didn't always have time for me. Nevertheless, I was a really curious child and I found myself a new really interesting friend I could always spend my free time with - Computer (I am glad my family had one). I still remember how long I had to wait looking at the windows XP emblem in front of me (Computer was quite old and demanded a lot of time to start). Nevertheless, I started my It journey there - in front of my first computer.

I've completed the Lyceum of Belarusian National Technical university and got a solid foundation in mathematics and physics. I always took part in different competitions and tried to engage everywhere. I have some experience in research works and once I had published an article in one small Belarusian scientific journal.

My first and main problem after arriving in the UK is language barrier. Although I have a good foundation, I am still not feeling confident and fluent enough. I hope I will deal with that problem this year.

After DMUIC I want to study Cyber Security. I believe it is one of the fastest growing spheres all around the world. I want to become a real professional and to use all my strong points to achieve my ambitions! DMU has been recognised for conducting world-leading cyber security research (DMU, 2021). I want to get knowledge in penetration testing, cryptography and data security. Also I would like to have a placement year in the industry to get the real experience and skills for my future career. 


References

DMU, 2021. Cyber Security BSc (Hons). [online] Dmu.ac.uk. Available at: <https://www.dmu.ac.uk/study/courses/undergraduate-courses/cyber-security-bsc-degree/cyber-security-bsc-hons.aspx> [Accessed 5 October 2021].

Comments

  1. Carrie MansfieldOctober 12, 2021 at 1:37 AM

    Nice background information here! And good to see a reference too!

    ReplyDelete

Post a Comment

Popular posts from this blog

Software review: Hashcat

In the following blogpost the way I used software called hashcat in my project is described. The example of using this software for dictionary attack is demonstrated. In my work I used information provided by Tavarez (2020) .   According to Porup (2020) hashcat is one of the most popular password crackers all around the world. Moreover, hashcat is included in the list of basic tools in Kali linux – linux distribution widely used by cybersecurity specialists. I installed Kali linux virtual machine in order to use this program and to show the example of a dictionary attack (Author's screenshot) However, before looking at the examples of using hashcat on practise, it is useful to understand in which areas hashcat is using. In plain words, hashcat is a password guesser which includes a number of features and pre-installed functionalities for cracking passwords by penetrating brute-force and dictionary attacks. The way it works is not too sophisticated, it hashes considerable numbe...
1 comment
Read more

Major project theme

Every person has heard about how important it is to have a well-built strong password. An essential number of people would agree that password hygiene is as important as the personal hygiene is, since violation of first may lead to much more serious consequences. However, the statistics show that 59% of users use their names and dates of birth as their passwords, 43% shared their passwords with other people and only 45% would change a password after a breach (O’Driscoll, 2020). The aim of this post is to show how to create strong passwords. It is necessary to know how passwords are cracked in order to properly understand what password can be referred as strong one. There are to ways to execute an attack: online and offline.  Online attack is done by trying different passwords one by one through a normal log in process. Usually, such attacks are unsuccessful since they are easy to detect and block if necessary (Burnett and Kleiman, 2006).  I think everybody encountered situatio...
2 comments
Read more