Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Prikladnaya Diskretnaya Matematika, 2011, Number 4(14), Pages 28–33 (Mi pdm351)  
This article is cited in 8 scientific papers (total in 8 papers)

Mathematical Methods of Cryptography

Almost perfect ciphers and authentication codes

A. U. Zubov

M. V. Lomonosov Moscow State University, Moscow, Russia
Full-text PDF (504 kB) Citations (8)
References:
PDF
HTML
Abstract: Constructions of almost-perfect ciphers combining secrecy and authentication functions with economical key expenditure are proposed under equiprobable choice of key and plaintext.
Keywords: almost-perfect cipher, authentication code.
Document Type: Article
UDC: 519.7
Language: Russian
Citation: A. U. Zubov, “Almost perfect ciphers and authentication codes”, Prikl. Diskr. Mat., 2011, no. 4(14), 28–33
Citation in format AMSBIB
\Bibitem{Zub11}
\by A.~U.~Zubov
\paper Almost perfect ciphers and authentication codes
\jour Prikl. Diskr. Mat.
\yr 2011
\issue 4(14)
\pages 28--33
\mathnet{http://mi.mathnet.ru/pdm351}
Linking options:
  • https://www.mathnet.ru/eng/pdm351
  • https://www.mathnet.ru/eng/pdm/y2011/i4/p28
    • This publication is cited in the following 8 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:610
    Full-text PDF :260
    References:44
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024