AI Chat AI Image Generator AI Video Text to Speech

Breaking the Hidden Irreducible Polynomials Scheme

11/05/2019

∙

by Christian Eder, et al.

∙

∙

In 2019 Gómez described a new public key cryptography scheme based on ideas from multivariate public key cryptography using hidden irreducible polynomials. We show that the scheme's design has a flaw which lets an attacker recover the private key directly from the public key.

page 1

page 2

page 3

page 4

research

∙ 06/02/2020

Probability theory and public-key cryptography

In this short note, we address a common misconception at the interface o...

0 Mariya Bessonov, et al. ∙

research

∙ 09/12/2023

Public key cryptosystems based on Iterated Functions Systems

Let f=(f_0,f_1,…, f_ν-1) be a collection of one-to-one functions from so...

0 Jacques Peyriere, et al. ∙

research

∙ 06/04/2020

Design and Hardware Implementation of a Separable Image Steganographic Scheme Using Public-key Cryptosystem

In this paper, a novel and efficient hardware implementation of steganog...

0 Salah Harb, et al. ∙

research

∙ 03/01/2021

New Public-Key Crypto-System EHT

In this note, an LWE problem with a hidden trapdoor is introduced. It is...

0 Alessandro Budroni, et al. ∙

research

∙ 03/19/2020

A model of public key cryptography using multinacci matrices

In this paper, we have proposed a Public Key Cryptography (P KC) using b...

0 Munesh Kumari, et al. ∙

research

∙ 07/20/2018

Multivariate Public Key Cryptography and Digital Signature

In this paper, algorithms for multivariate public key cryptography and d...

0 Pulugurtha Krishna Subba Rao, et al. ∙

research

∙ 11/24/2017

Image Authentication using Visual Cryptography

This report gives a novel technique of image encryption and authenticati...

0 Rahul Saranjame, et al. ∙