Simple solutions to complex problems

Simple solutions to complex problems

Each post is devoted to a simple solution to a complex problem.


A simple way to learn and practice FN-DSA post quantum digital signature encryptions for any person with access to internet

1 Dec 2025 2 minute read 0 comments I_g_o_r

FN-DSA is a lattice-based digital signature algorithm, based on the FIPS 206 standard, now considered by NIST for post-quantum cryptography. As of 2025, it’s progressing through the standardization pipeline. FN-DSA lets users sign and verify data (li...

A simple way to learn and practice SLH-DSA post quantum digital signature encryptions for any person with access to internet

5 Nov 2025 3 minute read 0 comments I_g_o_r

SLH-DSA is a stateless hash-based digital signature algorithm, based on the FIPS 205 standard, approved and recommended by NIST for post-quantum cryptography. SLH-DSA lets users sign and verify data (like documents, files, code, certificates, etc.) i...

A simple way to learn and practice ML-DSA post quantum digital signature encryptions for any person with access to internet

29 Oct 2025 2 minute read 0 comments I_g_o_r

ML-DSA is a module lattice digital signature post-quantum algorithm, based on the FIPS 204 standard, approved and recommended by NIST for post-quantum cryptography. ML-DSA lets users sign and verify data (like documents, files, code, certificates, et...

A simple way to learn and practice hybrid encryptions for any person with access to internet

21 Oct 2025 3 minute read 0 comments I_g_o_r

Hybrid encryptions are encryptions which use a combination of post-quantum and classic cryptographic algorithms for encryptions to address threats/risks posed by large scale fault tolerant quantum computers (LSFTQC) on the first stage of the coming p...

A simple way to understand ML-KEM post quantum encryptions

9 Oct 2025 3 minute read 11 comments I_g_o_r

Fault tolerant quantum computers pose a real current risk/threat to the current digital infrastructure, because they can break all asymmetric encryptions (RSA, ECDSA, etc.) and implementations of symmetric encryptions, which use asymmetric encryption...

A simple way to understand why some crypto experts expect 1 BTC to reach 1 million in the coming years

9 Sep 2025 1 minute read 0 comments I_g_o_r

You probably have seen videos or articles or blog posts, where some crypto experts claimed that 1 BTC will reach $1 mln in the coming years. In this post, we try to find a reasonable argument for this claim. First of all, we need to understand that U...

A simple way to manage weekly/monthly/etc changes of multiple passwords or private keys

1 Sep 2025 2 minute read 2 comments I_g_o_r

AI technology significantly speeds up data theft and passwords breaches. See [1-4]. The recent hack of gmail.com (see [3-4]) puts at risk about 2.5 billion users. Experts recommend to change passwords faster than possible data hacks. For many users,...

A simple way to check if a TLS/SSH server has post quantum or hybrid encryptions

24 Jul 2025 1 minute read 0 comments I_g_o_r

In this post we consider a simple method to check if TLS/SSH servers have post quantum or hybrid encryptions. Hybrid encryption combines classical and post-quantum (PQC) cryptography to offer a secure transition to a future with quantum computers, wh...

A simple way to protect your crypto and financial wealth in a case of kidnapping

26 May 2025 3 minute read 0 comments I_g_o_r

Deteriorating economic conditions and inequalities of wealth distributions lead many desperate people to extreme ways of getting other people wealth. In recent time, there were many attempts of kidnapping of wealthy people with purposes to extract th...

A simple way to derive the “Fortune’s formula”

19 May 2025 3 minute read 0 comments I_g_o_r

In this post we consider a simple way to derive/prove the “Fortune’s formula” (see [1]), also known as Kelly criterion (see [2]). If p -denotes a probability to win a bet (or trade, etc.), O -denotes decimal odds on a winning bet, L -denotes a share...