Edwards curves are pivotal ones in crypto field. The normal form Harold Edwards studied was x2 + y2 = c2 + … More
Author: Sefik Serengil
A Gentle Introduction to Edwards-curve Digital Signature Algorithm (EdDSA)
Elliptic curves are the most challenging topic in crypto field whereas Edwards curves are the hottest topic among elliptic curves. Elliptic … More
A Gentle Introduction to Edwards Curves
In 2007, Harold Edwards introduced a new form for elliptic curves. Thereafter, people interestingly named this form as Edwards Curves. Nowadays, … More
A Step by Step Hill Cipher Example
Hill cipher is a kind of a block cipher method. Actually, it was the first one appearing in the history. … More
Using Custom Activation Functions in Keras
Almost every day a new innovation is announced in ML field. Such an extent that number of research papers published … More
A Step by Step Adaboost Example
Adaptive boosting or shortly adaboost is awarded boosting algorithm. The principle is basic. A weak worker cannot move a heavy … More
A Step by Step Gradient Boosting Example for Classification
Gradient boosting machines might be confusing for beginners. Even though most of resources say that GBM can handle both regression … More
How Pruning Works in Decision Trees
Decision tree algorithms create understandable and readable decision rules. This is one of most important advantage of this motivation. This … More
A Gentle Introduction to LightGBM for Applied Machine Learning
It is a fact that decision tree based machine learning algorithms dominate Kaggle competitions. More than half of the winning solutions … More
A Step by Step Gradient Boosting Decision Tree Example
Adoption of decision trees is mainly based on its transparent decisions. Also, they overwhelmingly over-perform in applied machine learning studies. … More
