The problem of modern cryptography axiomatic: information, computational and information-computational approaches
Keywords:
криптографічний примітив, примітивний криптографічний протоколAbstract
The paper is considered the issue existing approaches to build the axiomatic of cryptographic transformations. Both point of view (information-theoretic and computational-theoretic)is going through. It is shown that the existing defects of the approaches can be solved by combining these approaches based on the application of the provisions of the general theory of optimal algorithms. The main cryptographic primitives and primitive cryptographic protocols built on the proposed information and computing approach are given.
References
K. ShennonTeoryiasviazy v sekretnыkhsystemakh / v kn. K. Shennon «Rabotыpoteoryyynformatsyy y kybernetyke», M., YL, 1963, s. 333-369.
Goldreich O. FoundationsofCryptography. Volume 1. BasicTools. – London: CambridgeUniversityPress, 2001. – 555 p.
V. K.Zadiraka, A. M.KudinNewModelsandMethodsforEstimatingtheCryptographicStrengthofInformationSecuritySystems/ CyberneticsandSystemsAnalysis 53 (6), 978-985.
H. Jurgensen, L. RobbinsTowardsfoundatiomsofcryptography: investigationofperfectsecrecy / Journalofuniversalcomputerscience. – V.2. - № 5. – 1996. – P.347-379.
A.C. YaoTheoryandapplicationoftrapdoorfunctions / 23rdAnnualsymposiumonfoundationsofcomputerscience, Chicago, 1982. – P. 80-91.
M. Blum, A. deSantis, S. Micali, G. PersianoNon-interactivezeroknowledge / SIAM J. COMPUT. Vol. 20, No. 6, pp. 1084-1118, December 1991.
BellareMihir, RogawayPhillipRandomOraclesarePractical: A ParadigmforDesigningEfficientProtocols (англ.) // ACM ConferenceonComputerandCommunicationsSecurity : journal. — 1993. — P. 62—73.
Morais, E., Koens, T., vanWijk, C. etal. A surveyonzeroknowledgerangeproofsandapplications. SN Appl. Sci. 1, 946 (2019). https://doi.org/10.1007/s42452-019-0989-z
