shay.co blog
Posts by: Shay Ben Moshe
This post is a part of a post chain started by a colleague and a friend of mine – Ido Schacham. The purpose is to share our favorite development tools.
The rules are simple:
Copy-paste the rules. List your favorite tools, libraries, and services for web development. List obvious ones as well, they [...]
One of the problems of hash functions is collisions, they cause some security vulnerabilities which won’t be discussed in this article.
In this article I would like to find some approximations concerning collisions.
Probability for a collision
Let \(\mathbf{M}\) be the size of the range (i.e. for md5 it is \(2^{128}\) since md5 returns 128 [...]
After discussing with some friends on StartupSeeds, I came up with a generalized random sub array algorithm.
This algorithm can be implemented with different data-structures, and it’s complexity is \(O(n)\) or \(O(k\log\space k)\) for 2 specific implementations.
We need a data-structure that can contain integers.
It must have 2 methods which are add [...]
Today I came across an algorithmic problem.
I wanted to choose a random sub array of size \(k\) from an array of size \(n\), while maintaining its order.
For example, if we have the array \(\{0,1,2,3,4,5,6,7,8,9\}\) a possible result for \(k=4\) is the array \(\{1,4,7,9\}\).
I came up with an algorithm with average [...]
Yesterday I have published an article about password entropy.
Today I would like to discuss the entropy of a phrase based password.
Phrase Based Password
A phrase based password is a password assembled from several easy to remember and spell words, delimited by spaces.
As a result, such passwords are very [...]
A common and easy way to estimate the strength of a password is its entropy.
The entropy is given by \(H = L \log_2{N}\) where \(L\) is the length of the password and \(N\) is the size of the alphabet, and it is usually measured in bits.
The entropy measures the number of [...]
In this article I would like to analyze the performance of one of the best sorting algorithms I know: Quicksort.
When I first saw the algorithm I was also told that on average it has \(O(n\log n)\) time complexity, however I never saw a proof until today.
Today I read
Newton’s method is a method for finding approximations to the roots of a given function.
The method itself is very simple, you give an initial guess of the root, \(x_0\), and calculate further values using the following equation: \(x_{n+1}=x_n-\frac{f’(x_n)}{f(x_n)}\).
Generally, each term in the sequence is more accurate in comparison to the previous terms.
[...]
In this article, we will learn the benefits of persistent connection in PDO, in terms of memory usage and time of execution.
The article will only observe connection to MySQL database.
Introduction
PDO is an abstraction layer for database connections in PHP, and it became increasingly popular in the past few years.
[...]
A few days ago I thought of an algorithm to calculate square roots. In this article I would like to introduce my algorithm.
I should mention that this algorithm probably exists.
First of all, my algorithm can only find roots between a specific range (for example \(0\) to \(1\)), thus we need to decrease [...]
Categories
