Computing Power, Key Length and Cryptanalysis. An Unending Battle?

11/02/2020
by   A. Dasso, et al.
0

There are several methods to measure computing power. On the other hand, Bit Length (BL) can be considered a metric to measure the strength of an asymmetric encryption method. We review here ways to determine the security, given an span of time, of a factoring-based encryption method, such as RSA, by establishing a relation between the processing power needed to break a given encryption and the given bit length used in the encryption. This relation would help us provide an estimation of the time span that an encryption method for a given BL will be secure from attacks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/11/2022

Delay Encryption by Cubing

Delay Encryption (often called Timed-Release Encryption) is a scheme in ...
research
04/17/2020

A review on mathematical strength and analysis of Enigma

In this review article, we discussed the Mathematics and mechanics behin...
research
12/10/2019

Analyzing the Kasiski Method Against Vigenere Cipher

The weakness of the vigenere cipher lies in its short key and is repeate...
research
12/23/2019

Encryption based on Conference Matrix

In this article, an encryption scheme based on (-1, 1) conference matrix...
research
12/06/2018

A Review of Homomorphic Encryption Libraries for Secure Computation

In this paper we provide a survey of various libraries for homomorphic e...
research
05/28/2021

Fragmentation; a Tool for Finding Information, Encryption and Data Flow in Systems

We introduce a new information-theoretic measure, fragmentation (F) whic...
research
08/23/2019

Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption

We define a pseudorandom function (PRF) F: K×X→Y to be bi-homomorphic wh...

Please sign up or login with your details

Forgot password? Click here to reset