What is blinding in cryptography?

by | Apr 12, 2021 | Cryptography And Python, Encryption, Exclusive Articles, Featured

Blinding in Cryptography

What is blinding in cryptography?

Let’s say Alice has an input message x and Alice wants Bob to compute y = f(x). But, Alice does not want to reveal x or y to Bob. So, Alice encodes the input message x using E and calculates E(x). Alice then sends E(x) to Bob. Bob computes f(E(x)) and sends it to Alice. Now, Alice can use decoding D to obtain y from f(E(x)).

y = D(f(E(x))

This technique of computing y = f(x) without revealing x and y is called blinding. Blinding is often used to prevent side-channel attacks in public-key encryption.

In this article, we will discuss:

  • What is blinding in cryptography?

  • How is blinding used in RSA decryption?

  • How is blinding used in DSA signatures?

This article is accessible to premium members only. To access this article, please purchase The Security Buddy Premium Membership Plan.

Pages: 1 2
Facebooktwitterredditpinterestlinkedinmail

Related posts:

DSA Signature Algorithm in PythonHow to implement the DSA signature creation and verification algorithm in Python? ElGamal EncryptionHow does the ElGamal encryption work? RSA Encryption and Decryption Algorithm in PythonHow to implement the RSA encryption and decryption algorithm in Python? DSA vs RSADSA vs RSA Export and Import DSA Keys using PythonHow to export and import DSA keys using Python? Create and Verify DSA Signatures using PythonHow to create and verify DSA signatures using Python? DSA Key Generation Algorithm in PythonHow to implement the DSA key generation algorithm in Python? DSAHow does Digital Signature Algorithm (DSA) work? RSAHow does the RSA cryptosystem work? Implementing the Diffie-Hellman Key Exchange Algorithm using PythonHow to implement the Diffie-Hellman Key Exchange algorithm using Python? AES Implementation in PythonAES Implementation in Python Side Channel AttackWhat is the side-channel attack? Perfect Forward SecrecyWhat is Perfect Forward Secrecy? Encryption and Decryption in CBC modeImplementation of Cipher Block Chaining (CBC) Implementation Of RC4 Algorithm In PythonHow to implement the RC4 algorithm using Python? Diffie-Hellman Key ExchangeWhat is the Diffie-Hellman Key Exchange Protocol and how does it work?

Calculate the pseudoinverse of a matrix using Python

by | October 3, 2023 | Featured, Linear Algebra | 0 Comments

What is the pseudoinverse of a matrix? We know that if A is a square matrix with full rank, then A-1 is said to be the inverse of A if the following condition holds: $latex AA^{-1}=A^{-1}A=I $ The pseudoinverse or the Moore-Penrose inverse of a matrix is a...
Read More

Cholesky decomposition using Python

by | October 3, 2023 | Featured, Linear Algebra | 0 Comments

What is Cholesky decomposition? A square matrix A is said to have Cholesky decomposition if it can be written as a product of a lower triangular matrix and its conjugate transpose. $latex A=LL^{*} $ If all the entries of A are real numbers, then the conjugate...
Read More

Tensor Hadamard Product using Python

by | October 3, 2023 | Featured, Linear Algebra | 0 Comments

In one of our previous articles, we already discussed what the Hadamard product in linear algebra is. We discussed that if A and B are two matrices of size mxn, then the Hadamard product of A and B is another mxn matrix C such that: $latex H_{i,j}=A_{i,j} \times...
Read More

Perform tensor addition and subtraction using Python

by | October 3, 2023 | Featured, Linear Algebra | 0 Comments

We can use numpy nd-array to create a tensor in Python. We can use the following Python code to perform tensor addition and subtraction. import numpy A = numpy.random.randint(low=1, high=10, size=(3, 3, 3)) B = numpy.random.randint(low=1, high=10, size=(3, 3, 3)) C =...
Read More

How to create a tensor using Python?

by | October 3, 2023 | Featured, Linear Algebra | 0 Comments

What is a tensor? A tensor is a generalization of vectors and matrices. It is easily understood as a multidimensional array. For example, in machine learning, we can organize data in an m-way array and refer it as a data tensor. Data related to images, sounds, movies,...
Read More

How to combine NumPy arrays using horizontal stack?

by | October 3, 2023 | Featured, Linear Algebra | 0 Comments

We can use the hstack() function from the numpy module to combine two or more NumPy arrays horizontally. For example, we can use the following Python code to combine three NumPy arrays horizontally. import numpy A = numpy.array([[1, 2, 3], [4, 5, 6], [7, 8, 9]]) B =...
Read More

How to combine NumPy arrays using vertical stack?

by | October 3, 2023 | Featured, Linear Algebra | 0 Comments

Let’s say we have two or more NumPy arrays. We can combine these NumPy arrays vertically using the vstack() function from the numpy module. For example, we can use the following Python code to combine three NumPy arrays vertically. import numpy A = numpy.array([[1, 2,...
Read More

Singular Value Decomposition (SVD) using Python

by | October 3, 2023 | Featured, Linear Algebra | 0 Comments

What is Singular Value Decomposition (SVD)? Let A be an mxn rectangular matrix. Using Singular Value Decomposition (SVD), we can decompose the matrix A in the following way: $latex A_{m \times n}=U_{m \times m}S_{m \times n}V_{n \times n}^T $ Here, U is an mxm matrix....
Read More

Eigen decomposition of a square matrix using Python

by | October 3, 2023 | Featured, Linear Algebra | 0 Comments

Let A be a square matrix. Let’s say A has k eigenvalues λ1, λ2, ... λk. And the corresponding eigenvectors are X1, X2, ... Xk. $latex X_1=\begin{bmatrix} x_{11} \\ x_{21} \\ x_{31} \\ ... \\ x_{k1} \end{bmatrix} \\ X_2=\begin{bmatrix} x_{12} \\ x_{22} \\ x_{32} \\ ......
Read More

How to calculate eigenvalues and eigenvectors using Python?

by | October 3, 2023 | Featured, Linear Algebra | 0 Comments

In our previous article, we discussed what eigen values and eigenvectors of a square matrix are and how we can calculate the eigenvalues and eigenvectors of a square matrix mathematically. We discussed that if A is a square matrix, then $latex (A- \lambda I) \vec{u}=0...
Read More

Amrita Mitra

Author

Ms. Amrita Mitra is an author, who has authored the books “Cryptography And Public Key Infrastructure“, “Web Application Vulnerabilities And Prevention“, “A Guide To Cyber Security” and “Phishing: Detection, Analysis And Prevention“. She is also the founder of Asigosec Technologies, the company that owns The Security Buddy.

0 Comments

Submit a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.

Not a premium member yet?

Please follow the link below to buy The Security Buddy Premium Membership.

Buy Premium Membership

Featured Posts

Translate »