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, 2010, supplement № 3, Pages 27–29 (Mi pdm218)  
Mathematical Methods of Cryptography

On weak key-scheduling algorithms relatively the related-key attack

M. A. Pudovkina

Moscow Engineering Physics Institute, Moscow
Full-text PDF (379 kB)
References:
PDF
HTML
Abstract: In this paper key-scheduling algorithms having the defined recurrent property are considered. For this class of algorithms we describe related-key attacks. The complexity of the attack is equal to the exhaustive search of one round key. It requires a little number of plaintexts.
Document Type: Article
UDC: 519.7
Language: Russian
Citation: M. A. Pudovkina, “On weak key-scheduling algorithms relatively the related-key attack”, Prikl. Diskr. Mat., 2010, supplement № 3, 27–29
Citation in format AMSBIB
\Bibitem{Pud10}
\by M.~A.~Pudovkina
\paper On weak key-scheduling algorithms relatively the related-key attack
\jour Prikl. Diskr. Mat.
\yr 2010
\pages 27--29
\issueinfo supplement № 3
\mathnet{http://mi.mathnet.ru/pdm218}
Linking options:
  • https://www.mathnet.ru/eng/pdm218
  • https://www.mathnet.ru/eng/pdm/y2010/i12/p27
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:181
    Full-text PDF :125
    References:39
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024