Results 101 to 110 of about 6,665 (199)

Defeating the Kalka--Teicher--Tsaban linear algebra attack on the Algebraic Eraser

, 2011
The Algebraic Eraser (AE) is a public key protocol for sharing information over an insecure channel using commutative and noncommutative groups; a concrete realization is given by Colored Burau Key Agreement Protocol (CBKAP).
Goldfeld, Dorian, Gunnells, Paul E.
core  

Formal Power Series on Algebraic Cryptanalysis

, 2020
In the complexity estimation for an attack that reduces a cryptosystem to solving a system of polynomial equations, the degree of regularity and an upper bound of the first fall degree are often used in cryptanalysis. While the degree of regularity can be easily computed using a univariate formal power series under the semi-regularity assumption ...
openaire   +2 more sources

Chosen-IV Algebraic Attack on Randomized Ciphers FASTA and HERA

IACR Transactions on Symmetric Cryptology
Fully homomorphic encryption (FHE) enables computation on encrypted data without decryption, providing strong guarantees for privacy-preserving applications.
Fukang Liu, Tianning Wang, Jianqiang Ni, Daisuke Yamamoto, Guilherme T. S. Sato, Haoyang Wang, Willi Meier   +6 more
doaj   +1 more source

ESTABLISHED WAYS TO ATTACK EVEN THE BEST ENCRYPTION ALGORITHM [PDF]

Which solution is the best – public key or private key encryption? This question cannot have a very rigorous, logical and definitive answer, so that the matter be forever settled :).
Alexandru Tabusca
core  

Fully Dynamic Advanced Encryption Standard

IEEE Access
As the reliance on using electronic services increases, the use of a strong encryption algorithm becomes paramount. The AES is the most widely used cipher. However, AES uses static transformations that attackers might exploit to cryptanalyze AES. In this
Shiraz Naserelden, Norma Alias, Abdelrahman Altigani, Muhammad Iqbal Haikal Samia'An   +3 more
doaj   +1 more source

Algebraic Cryptanalysis of Block Ciphers

Proceedings of the 2019 International Conference on Wireless Communication, Network and Multimedia Engineering (WCNME 2019), 2019
Nursulu Kapalova, Kunbolat Algazy, Dilmuhanbet Dyusenbayev, Rustem Biyashev   +3 more
openaire   +1 more source

Algebraic cryptanalysis of HFE and Filter Generators.

, 2003
HFE (Hidden Fields Equations) is a public key cryptosystem using polynomial operations over finite fields. It has been proposed by Jacques Patarin at Eurocrypt 96 following the ideas of Matsumoto and Imai. It has long been regarded as a very promising cryptosystem because it can be used to produce signatures as short as 128, 100 and even 80 bits.
openaire   +2 more sources

A study of text-theoretical approach to S-box construction with image encryption applications. [PDF]

Sci Rep, 2023
Mahboob A, Nadeem M, Rasheed MW.
europepmc   +1 more source

On the quantum security of high-dimensional RSA protocol

Journal of Mathematical Cryptology
The idea of extending the classical RSA protocol using algebraic number fields was introduced by Takagi and Naito (Construction of RSA cryptosystem over the algebraic field using ideal theory and investigation of its security.
Rahmani Nour-eddine, Serraj Taoufik, Ismaili Moulay Chrif, Azizi Abdelmalek   +3 more
doaj   +1 more source

Cryptanalysis of RSA Using Algebraic and Lattice Methods

Journal of Artificial Intelligence and Engineering Applications (JAIEA)
This paper applies tools from the geometry of numbers to solve several problems in cryptanalysis. We use algebraic techniques to cryptanalyze several public key cryptosystems. This paper focuses on RSA and RSA-like schemes, and use tools from the theory of integer lattices to get our results.
Faisal Amir Harahap, Yusfrizal Yusfrizal, null Mutiara Sovina, null Ivi Lazuly   +3 more
openaire   +1 more source