Nondeterministic encryption with provable nonequivalence of all modifications of the cryptographic algorithm

DOI10.1007/BF02667041MaRDI QIDQ1968557zbMATH OpenFDO

Authors N. A. Moldovyan

Publication date 26 September 2000

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

Full work available at URL https://doi.org/10.1007/BF02667041

zbMATH Keywords

software encryption

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Nonnumerical algorithms (68W05)

Recommendations

• Flexible block cipher with provably inequivalent cryptalgorithm modifications
• Provably indeterminate 128-bit cipher
• An N-D cryptoscheme
• Nonmalleable Cryptography
• Nonmalleable Cryptography

Cites work

• Fast software encryption system based on local pseudorandomness
• New design principle for cryptographic modules in computer security systems

Cited in

(4)

• Provably indeterminate 128-bit cipher
• Flexible block cipher with provably inequivalent cryptalgorithm modifications
• An N-D cryptoscheme
• Nondeterministic public key cryptography and its implementation

This page was built for publication: Nondeterministic encryption with provable nonequivalence of all modifications of the cryptographic algorithm

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