Skip to content

  • Twitter

  • Youtube

  • GitHub

  • Linkedin

  • Facebook

  • Instagram

  • RSS

  • Mail

Sefik Ilkin Serengil

Code wins arguments

  • Home
  • About Me
  • Publications
  • Courses
  • Talks
  • Consultancy

Category: Cryptography

A Step by Step Partially Homomorphic Encryption Example with Paillier in Python

In today’s world, data security is a crucial concern for individuals and organizations alike. Encryption is a popular technique used … More

homomorphic, paillier

A Step by Step Partially Homomorphic Encryption Example with ElGamal in Python

In this blog post, we will explore a step-by-step example of partially homomorphic encryption using ElGamal in Python. While many … More

elgamal, homomorphic, public key

A Step by Step Partially Homomorphic Encryption Example with RSA in Python

In the field of cryptography, homomorphic encryption is a powerful technique that enables computations to be performed on encrypted data … More

homomorphic, python, rsa

A Gentle Introduction to Fermat Euler Theorem

We have been commonly using the Euler’s generalized version of Fermat’s little theorem in RSA encryption algorithm. In this post, … More

euler, fermat

Twisted Edwards Curves for Digital Signatures

Edwards curves are pivotal ones in crypto field. The normal form Harold Edwards studied was x2 + y2 = c2 + … More

edwards curve, elliptic curve

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

digital signature, EdDSA, elliptic curve, python

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

edwards curve, edwards form, elliptic curve, induction

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

block cipher, dot matrix, matrix multiplication, polygraphic cipher, python

Elliptic Curve ElGamal Encryption

We often use elliptic curves for public key cryptography tasks such as key exchange and digital signature tasks. Because these … More

el gamal, elliptic curve, homomorphic, public key, symmetric encryption

Official Guide To Fermat’s Little Theorem

Fermat’s Little Theorem states that ap – a is divisible without remainder if p is a prime, and a is … More

fermat, induction

Posts navigation

Older posts
Newer posts


Licensed under a Creative Commons Attribution 4.0 International License.

Creative Commons License

You can use any content of this blog just to the extent that you cite or reference

Subscribe to sefiks.com to stay up-to-date with latest posts