It is thought that there are more than 100,000 different surnames in Japan alone, representing family trees and family names. It is also known that there are regional differences in the distribution of surnames, and a “surname map” is available to easily find out how a particular surname is distributed. Very interesting. Surname Map (https://www.dmuchgis.com/myojimap/) …
The Internet is full of information, and there are many cases where useful information is displayed as tables and graphs, but the problem is that they are not searchable as images. “Extract-Table” can automatically generate a table from an image of a table, which is useful when you want to convert such an image table …
If you’re responsible for an organization of users, there’s a delicate balance between security and user productivity. We’ve seen this balance in action when we dove into the different security tools and systems together. Before you start to design a security architecture, you need to define exactly what you like it to accomplish. This will depend on what your company thinks …
Defense in depth is the concept of having multiple overlapping systems of defense to protect IT systems. This ensures some amount of redundancy for defensive measures. It also helps avoid a catastrophic compromise in the event that a single system fails, or a vulnerability is discovered in one system. Think of this as having multiple lines of defense. If an attacker …
Defense in Depth/week5(IT Security: Defense against the digital dark arts) Read More »
In this section, we’ll cover ways few to harden your networks. Network hardening is the process of securing a network by reducing its potential vulnerabilities through configuration changes, and taking specific steps. We’ll do a deep dive on the best practices that an IT support specialist should know for implementing network hardening. We’ll also discuss network security protection along with network monitoring …
Securing Your Networks/week4(IT Security: Defense against the digital dark arts) Read More »
We’ll cover the three A’s of security, which are authentication, authorization, and accounting. We’ll cover exactly what they are, how they relate to each other, and their common implementations and protocols. Authentication Best Practices Let’s kick things off with authentication, and by extension identification. You should be familiar with authentication in the form of username and password problems when accessing things like …
AAA Security/week3(IT Security: Defense against the digital dark arts) Read More »
When you were little, did you and your siblings ever communicate in a secret language around your parents? It didn’t really matter what you were talking about, as long as your parents didn’t know what it was. That was the fun part, right? It may have seemed like a fun game when you were younger. But for as long as humans …
Cryptology/week2(IT Security: Defense against the digital dark arts) Read More »
To be successful at cybersecurity, sometimes you need to put yourself in the mindset of an attacker and always be one step ahead. How people attack it and how do we defend against these attacks. When you think of security, what’s the first thing you think of? It’s probably physical security, stuff like making sure your belongings are safe from potential …
Understand security threats /Week1(IT Security: Defense against the digital dark arts) Read More »
In this article, I am going to write some interesting Q&A or examples of basic Python concept. For Loop and while Returns the sum of all the divisors of a number, without including it. A divisor is a number that divides into another without a remainder. make the print_prime_factors function print all the prime factors …
Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. // by Wikipedia Big Os O(1) –> Constant- no loops O(n) –>Linear- for loops, while loops through n items O(log N) –> Logarithmic- usually searching algorithms have log n if they are sorted (Binary Search) O(n log(n)) …
