A bivariate polynomial-based cryptographic hard problem and its applications

DOI10.1007/S10623-023-01229-1MaRDI QIDQ6109708zbMATH OpenOpenAlexFDO

Authors Bagher Bagherpour

Publication date 28 July 2023

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-023-01229-1

zbMATH Keywords

commitment schemescryptographic hard problemlatticespublic-key cryptographyRSA cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Bivariate polynomials modulo composites and their applications
• scientific article; zbMATH DE number 2079923
• The polynomial composition problem in \((\mathbb Z/n\mathbb Z)[X]\)
• scientific article; zbMATH DE number 2009958
• Coding and Cryptography

Cites work

• A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
• A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications
• An efficient publicly verifiable and proactive secret sharing scheme
• Analysis and improvement of Lindell's UC-secure commitment schemes
• Cryptography. Theory and practice
• DL-extractable UC-commitment schemes
• Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
• Factoring polynomials with rational coefficients
• Finding a small root of a bivariate integer equation; factoring with high bits known
• Highly-efficient universally-composable commitments based on the DDH assumption
• scientific article; zbMATH DE number 1722670 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1304185 (Why is no real title available?)
• scientific article; zbMATH DE number 708801 (Why is no real title available?)
• scientific article; zbMATH DE number 1182510 (Why is no real title available?)
• scientific article; zbMATH DE number 1759793 (Why is no real title available?)
• Lattice-based Cryptography
• Paillier-based publicly verifiable (non-interactive) secret sharing
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• The lattice-based digital signature scheme qTESLA

Cited in

(7)

• Bivariate polynomials modulo composites and their applications
• Biholomorphic Cryptosystems
• scientific article; zbMATH DE number 2079923 (Why is no real title available?)
• On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping
• Progress in Cryptology - INDOCRYPT 2003
• Revisiting RSA-polynomial problem and semiprime factorization
• A more complete cryptanalysis of the RSA-polynomial problem

This page was built for publication: A bivariate polynomial-based cryptographic hard problem and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6109708)