In EDS ansehen

Research of Collision Properties of the Modified UMAC Algorithm on Crypto-code Constructions

Gespeichert in:
Bibliographische Detailangaben
Titel: Research of Collision Properties of the Modified UMAC Algorithm on Crypto-code Constructions
Autoren: Yevseiev, S. (Serhii), Havrylova, A. (Alla), Korol, O. (Olha), Dmitriiev, O. (Oleh), Nesmiian, O. (Oleksii), Yufa, Y. (Yevhen), Hrebennikov, A. (Asadi)
Quelle: Eureka: Physics and Engineering
Verlagsinformationen: Scientific Route OÜ
Publikationsjahr: 2022
Bestand: neliti (Indonesia's Think Tank Database)
Schlagwörter: Indonesia, UMAC, crypto-code constructions, hybrid crypto-code constructions, collision, method of versatility
Beschreibung: The transfer of information by telecommunication channels is accompanied by message hashing to control the integrity of the data and confirm the authenticity of the data. When using a reliable hash function, it is computationally difficult to create a fake message with a pre-existing hash code, however, due to the weaknesses of specific hashing algorithms, this threat can be feasible. To increase the level of cryptographic strength of transmitted messages over telecommunication channels, there are ways to create hash codes, which, according to practical research, are imperfect in terms of the speed of their formation and the degree of cryptographic strength. The collisional properties of hashing functions formed using the modified UMAC algorithm using the methodology for assessing the universality and strict universality of hash codes are investigated. Based on the results of the research, an assessment of the impact of the proposed modifications at the last stage of the generation of authentication codes on the provision of universal hashing properties was presented. The analysis of the advantages and disadvantages that accompany the formation of the hash code by the previously known methods is carried out. The scheme of cascading generation of data integrity and authenticity control codes using the UMAC algorithm on crypto-code constructions has been improved. Schemes of algorithms for checking hash codes were developed to meet the requirements of universality and strict universality. The calculation and analysis of collision search in the set of generated hash codes was carried out according to the requirements of a universal and strictly universal class for creating hash codes
Publikationsart: article in journal/newspaper
Dateibeschreibung: application/pdf
Sprache: Indonesian
Verfügbarkeit: https://www.neliti.com/publications/554974/research-of-collision-properties-of-the-modified-umac-algorithm-on-crypto-code-c
Rights: (c) Eureka: Physics and Engineering, 2022
Dokumentencode: edsbas.C9C01B33
Datenbank: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://www.neliti.com/publications/554974/research-of-collision-properties-of-the-modified-umac-algorithm-on-crypto-code-c#
    Name: EDS - BASE (s4221598)
    Category: fullText
    Text: View record from BASE
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Yevseiev%20S
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edsbas
DbLabel: BASE
An: edsbas.C9C01B33
RelevancyScore: 925
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 925.000732421875
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Research of Collision Properties of the Modified UMAC Algorithm on Crypto-code Constructions
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Yevseiev%2C+S%2E+%28Serhii%29%22">Yevseiev, S. (Serhii)</searchLink><br /><searchLink fieldCode="AR" term="%22Havrylova%2C+A%2E+%28Alla%29%22">Havrylova, A. (Alla)</searchLink><br /><searchLink fieldCode="AR" term="%22Korol%2C+O%2E+%28Olha%29%22">Korol, O. (Olha)</searchLink><br /><searchLink fieldCode="AR" term="%22Dmitriiev%2C+O%2E+%28Oleh%29%22">Dmitriiev, O. (Oleh)</searchLink><br /><searchLink fieldCode="AR" term="%22Nesmiian%2C+O%2E+%28Oleksii%29%22">Nesmiian, O. (Oleksii)</searchLink><br /><searchLink fieldCode="AR" term="%22Yufa%2C+Y%2E+%28Yevhen%29%22">Yufa, Y. (Yevhen)</searchLink><br /><searchLink fieldCode="AR" term="%22Hrebennikov%2C+A%2E+%28Asadi%29%22">Hrebennikov, A. (Asadi)</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Eureka: Physics and Engineering
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: Scientific Route OÜ
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2022
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: neliti (Indonesia's Think Tank Database)
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Indonesia%22">Indonesia</searchLink><br /><searchLink fieldCode="DE" term="%22UMAC%22">UMAC</searchLink><br /><searchLink fieldCode="DE" term="%22crypto-code+constructions%22">crypto-code constructions</searchLink><br /><searchLink fieldCode="DE" term="%22hybrid+crypto-code+constructions%22">hybrid crypto-code constructions</searchLink><br /><searchLink fieldCode="DE" term="%22collision%22">collision</searchLink><br /><searchLink fieldCode="DE" term="%22method+of+versatility%22">method of versatility</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: The transfer of information by telecommunication channels is accompanied by message hashing to control the integrity of the data and confirm the authenticity of the data. When using a reliable hash function, it is computationally difficult to create a fake message with a pre-existing hash code, however, due to the weaknesses of specific hashing algorithms, this threat can be feasible. To increase the level of cryptographic strength of transmitted messages over telecommunication channels, there are ways to create hash codes, which, according to practical research, are imperfect in terms of the speed of their formation and the degree of cryptographic strength. The collisional properties of hashing functions formed using the modified UMAC algorithm using the methodology for assessing the universality and strict universality of hash codes are investigated. Based on the results of the research, an assessment of the impact of the proposed modifications at the last stage of the generation of authentication codes on the provision of universal hashing properties was presented. The analysis of the advantages and disadvantages that accompany the formation of the hash code by the previously known methods is carried out. The scheme of cascading generation of data integrity and authenticity control codes using the UMAC algorithm on crypto-code constructions has been improved. Schemes of algorithms for checking hash codes were developed to meet the requirements of universality and strict universality. The calculation and analysis of collision search in the set of generated hash codes was carried out according to the requirements of a universal and strictly universal class for creating hash codes
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: article in journal/newspaper
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: Indonesian
– Name: URL
  Label: Availability
  Group: URL
  Data: https://www.neliti.com/publications/554974/research-of-collision-properties-of-the-modified-umac-algorithm-on-crypto-code-c
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: (c) Eureka: Physics and Engineering, 2022
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.C9C01B33
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.C9C01B33
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: Indonesian
    Subjects:
      – SubjectFull: Indonesia
        Type: general
      – SubjectFull: UMAC
        Type: general
      – SubjectFull: crypto-code constructions
        Type: general
      – SubjectFull: hybrid crypto-code constructions
        Type: general
      – SubjectFull: collision
        Type: general
      – SubjectFull: method of versatility
        Type: general
    Titles:
      – TitleFull: Research of Collision Properties of the Modified UMAC Algorithm on Crypto-code Constructions
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Yevseiev, S. (Serhii)
      – PersonEntity:
          Name:
            NameFull: Havrylova, A. (Alla)
      – PersonEntity:
          Name:
            NameFull: Korol, O. (Olha)
      – PersonEntity:
          Name:
            NameFull: Dmitriiev, O. (Oleh)
      – PersonEntity:
          Name:
            NameFull: Nesmiian, O. (Oleksii)
      – PersonEntity:
          Name:
            NameFull: Yufa, Y. (Yevhen)
      – PersonEntity:
          Name:
            NameFull: Hrebennikov, A. (Asadi)
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2022
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
          Titles:
            – TitleFull: Eureka: Physics and Engineering
              Type: main
ResultId 1