FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4312911376> ?p ?o ?g. }

• W4312911376 endingPage "211" @default.
• W4312911376 startingPage "203" @default.
• W4312911376 abstract "The MinRank problem is investigated as a problem related to rank attacks in multivariate cryptography and the decoding of rank codes in coding theory. The Kipnis-Shamir method is one of the methods to solve the problem, and recently, significant progress has been made in its complexity estimation by Verbel et al. As this method reduces the problem to an MQ problem, which asks for a solution to a system of quadratic equations, its complexity depends on the solving degree of a quadratic system deduced from the method. A theoretical value introduced by Verbel et al. approximates the minimal solving degree of the quadratic systems in the method although their value is defined under a certain limit for the system considered. A quadratic system outside their limitation often has a larger solving degree, but the solving complexity is not always higher because it has a smaller number of variables and equations. Thus, in order to discuss the best complexity of the Kipnis-Shamir method, a theoretical value is needed to approximate the solving degree of each quadratic system deduced from the method. A quadratic system deduced from the Kipnis-Shamir method always has a multi-degree, and the solving complexity is influenced by this property. In this study, we introduce a theoretical value defined by such a multi-degree and show that it approximates the solving degree of each quadratic system. Thus, the systems deduced from the method are compared, and the best complexity is discussed. As an application, for the MinRank attack using the Kipnis-Shamir method against the multivariate signature scheme Rainbow, we show a case in which a deduced quadratic system outside Verbel et al.'s limitation is the best. In particular, the complexity estimation of the MinRank attack using the KS method against the Rainbow parameter sets I, III and V is reduced by about 172, 140 and 212 bits, respectively, from Verbel et al.'s estimation." @default.
• W4312911376 created "2023-01-05" @default.
• W4312911376 creator A5038959994 @default.
• W4312911376 creator A5044662071 @default.
• W4312911376 creator A5050958946 @default.
• W4312911376 date "2023-03-01" @default.
• W4312911376 modified "2023-10-16" @default.
• W4312911376 title "A New Analysis of the Kipnis-Shamir Method Solving the MinRank Problem" @default.
• W4312911376 cites W1516523879 @default.
• W4312911376 cites W1536729852 @default.
• W4312911376 cites W1569499052 @default.
• W4312911376 cites W1849802011 @default.
• W4312911376 cites W1906691896 @default.
• W4312911376 cites W1976677460 @default.
• W4312911376 cites W1986124084 @default.
• W4312911376 cites W2006504364 @default.
• W4312911376 cites W2093643075 @default.
• W4312911376 cites W2128687423 @default.
• W4312911376 cites W2139092268 @default.
• W4312911376 cites W2724530260 @default.
• W4312911376 cites W2960677533 @default.
• W4312911376 cites W3034712312 @default.
• W4312911376 cites W3204925326 @default.
• W4312911376 doi "https://doi.org/10.1587/transfun.2022cip0014" @default.
• W4312911376 hasPublicationYear "2023" @default.
• W4312911376 type Work @default.
• W4312911376 citedByCount "0" @default.
• W4312911376 crossrefType "journal-article" @default.
• W4312911376 hasAuthorship W4312911376A5038959994 @default.
• W4312911376 hasAuthorship W4312911376A5044662071 @default.
• W4312911376 hasAuthorship W4312911376A5050958946 @default.
• W4312911376 hasBestOaLocation W43129113761 @default.
• W4312911376 hasConcept C114614502 @default.
• W4312911376 hasConcept C121332964 @default.
• W4312911376 hasConcept C129844170 @default.
• W4312911376 hasConcept C164226766 @default.
• W4312911376 hasConcept C24890656 @default.
• W4312911376 hasConcept C2524010 @default.
• W4312911376 hasConcept C2775997480 @default.
• W4312911376 hasConcept C33923547 @default.
• W4312911376 hasConceptScore W4312911376C114614502 @default.
• W4312911376 hasConceptScore W4312911376C121332964 @default.
• W4312911376 hasConceptScore W4312911376C129844170 @default.
• W4312911376 hasConceptScore W4312911376C164226766 @default.
• W4312911376 hasConceptScore W4312911376C24890656 @default.
• W4312911376 hasConceptScore W4312911376C2524010 @default.
• W4312911376 hasConceptScore W4312911376C2775997480 @default.
• W4312911376 hasConceptScore W4312911376C33923547 @default.
• W4312911376 hasIssue "3" @default.
• W4312911376 hasLocation W43129113761 @default.
• W4312911376 hasOpenAccess W4312911376 @default.
• W4312911376 hasPrimaryLocation W43129113761 @default.
• W4312911376 hasRelatedWork W2077891058 @default.
• W4312911376 hasRelatedWork W2092057993 @default.
• W4312911376 hasRelatedWork W2327188743 @default.
• W4312911376 hasRelatedWork W3106293432 @default.
• W4312911376 hasRelatedWork W3157472482 @default.
• W4312911376 hasRelatedWork W4214694860 @default.
• W4312911376 hasRelatedWork W4226124353 @default.
• W4312911376 hasRelatedWork W4240809550 @default.
• W4312911376 hasRelatedWork W4287602408 @default.
• W4312911376 hasRelatedWork W4306290678 @default.
• W4312911376 hasVolume "E106.A" @default.
• W4312911376 isParatext "false" @default.
• W4312911376 isRetracted "false" @default.
• W4312911376 workType "article" @default.