Karel Miko is a seasoned technology executive and board member with 13 years of hands-on software engineering experience and a Master’s degree in Computer Science from Charles University in Prague. As Director of Consulting Services and longstanding leader at DCIT, a.s., he blends strategic governance with deep technical fluency in cryptography and number theory. He is an active open-source contributor to well-regarded C libraries like LibTomCrypt and LibTomMath, implementing OCBv3 encryption and the Tonelli–Shanks algorithm for modular square roots—work that demonstrates attention to correctness, portability, and cross-platform build robustness. Based in Czechia and recently joining the board of PROVYS Technologies, he bridges low-level algorithmic expertise with executive decision-making, favoring pragmatic fixes (compiler warnings, test coverage) that improve long-term maintainability.
13 years of coding experience
Master’s Degree, Computer Science, Master’s Degree, Computer Science at Charles University in Prague
LibTomCrypt is a fairly comprehensive, modular and portable cryptographic toolkit that provides developers with a vast array of well known published block ciphers, one-way hash functions, chaining modes, pseudo-random number generators, public key cryptography and a plethora of other routines.
Role in this project:
Back-end Developer
Contributions:16 reviews, 508 commits, 259 PRs in 8 years 9 months
Contributions summary:Karel contributed by implementing the OCBv3 encryption algorithm in the project. Their commits focused on integrating the algorithm, writing test code to verify the implementation and prevent index overflows. The user also fixed compiler warnings to ensure compatibility across different build environments.
LibTomMath is a free open source portable number theoretic multiple-precision integer library written entirely in C.
Role in this project:
Back-end Developer
Contributions:34 commits, 13 PRs, 34 pushes in 4 years 2 months
Contributions summary:Karel primarily contributed to the `libtommath` library by implementing and fixing core mathematical functions. They added the `bn_mp_sqrtmod_prime.c` file, which includes the Tonelli-Shanks algorithm for computing the modular square root of a prime number. Other commits addressed warnings, fixed issues related to the `fast_mp_invmod()` function, improved the build process, and added missing comments to the code base. These contributions indicate a strong focus on the core mathematical functionality of the library.
libtommathmathmpimulti-precisioninteger
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.