Constructing a CCA-secure modification of the algorithm specified in DSTU 9041:2020

DOI10.1007/S10559-026-00885-0MaRDI QIDQ7320776zbMATH OpenFDO

Authors O. Bespalov

Publication date 27 August 2026

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10559-026-00885-0

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A key recovery attack on discrete log-based schemes using a prime order subgroup
• A public key cryptosystem and a signature scheme based on discrete logarithms
• An efficient CCA-secure access control encryption for any policy
• Authenticated encryption: Relations among notions and analysis of the generic composition paradigm
• Chosen ciphertext security via BARGs
• Cryptographic properties of a new national encryption standard of Ukraine
• Improved meet-in-the-middle attacks on reduced-round Kalyna-128/256 and Kalyna-256/512
• Leveraging small message spaces for cca1 security in additively homomorphic and bgn-type encryption
• New proofs for NMAC and HMAC: security without collision resistance
• OMAC: one-key CBC MAC.
• On instantiating the algebraic group model from falsifiable assumptions
• Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
• The decision Diffie-Hellman problem
• The oracle Diffie-Hellman assumptions and an analysis of DHIES
• Updatable public key encryption with strong CCA security: security analysis and efficient generic construction

This page was built for publication: Constructing a CCA-secure modification of the algorithm specified in DSTU 9041:2020

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