Symmetric encryption algorithms in a polynomial residue number system

DOI10.1155/2024/4894415zbMATH Open1541.94065MaRDI QIDQ6577838

I. Z. Yakymenko, R. V. Shevchuk, Marek Karpinski, M. M. Kasianchuk

Publication date: 24 July 2024

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

cryptanalysisresidue number systemciphertextcryptoalgorithmsymmetric cryptosystemcryptographic strength

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Cites Work

• Title not available (Why is that?)
• Residue polynomial systems
• The replacement of irreducible polynomial and affine mapping for the construction of a strong S-box
• Symmetric cryptoalgorithms in the residue number system
• Residue number system asymmetric cryptoalgorithms
• Theoretical foundations for the analytical computation of coefficients of basic numbers of Krestenson's transformation
• Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
• Fast Parallel-Prefix Architectures for Modulo 2n-1 Addition with a Single Representation of Zero
• A type of public cryptosystem using polynomials and pell sequences
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

This page was built for publication: Symmetric encryption algorithms in a polynomial residue number system

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