Computer algebra in coding theory and cryptanalysis: Polynomial system solving for decoding linear codes and algebraic cryptanalysis - Couverture souple

Bulygin, Stanislav

9783838109480: Computer algebra in coding theory and cryptanalysis: Polynomial system solving for decoding linear codes and algebraic cryptanalysis

Couverture souple

ISBN 10 : 3838109481 ISBN 13 : 9783838109480

Editeur : Sudwestdeutscher Verlag Fur Hochschulschriften AG, 2009

Afficher les exemplaires de cette �dition comportant l?ISBN

0 D'occasion

5 Neuf

De EUR 69,90

This book that represents the author's Ph.D. thesis is devoted to applying symbolic methods to the problems of decoding linear codes and of algebraic cryptanalysis. The initial problems are reformulated in terms of systems of polynomial equations over a finite field, which solution(s) should yield a way to solve the initial problems. Solutions of such systems are obtained using Gr�bner bases. The first part is devoted to an application of system solving to decoding linear codes. The original method for arbitrary linear codes, which in some sense generalizes the Newton identities method, is proposed. Since for the method to work the „field equations“ are not needed, it is possible to handle quite large codes. The second part is about the algebraic cryptanalysis of the AES. The systems usually considered in this area have many auxiliary variables that are not needed for the key recovery. Therefore, here the approach is provided where these variables are eliminated and a resulting system in key-variables only is then solved. This is shown to be effective for small scale variants of the AES especially when using several plain-/ciphertext pairs.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

� propos de l?auteur

Dr. Stanislav Bulygin was born in Kyiv, Ukraine, in 1982. He received his Ph.D. degree from the University of Kaiserslautern, Germany, in 2009. Currently he is a scientific stuff member of the Center for Advanced Security Research Darmstadt, Germany. His scientific interests include computer algebra, coding theory, algebraic cryptology.

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteur: Sudwestdeutscher Verlag Fur Hochschulschriften AG
Date d'�dition: 2009
Langue: anglais
ISBN 10: 3838109481
ISBN 13: 9783838109480
Reliure: Broch�
Nombre de pages: 136
Coordonn�es du fabricant: non disponible
Personne responsable: non disponible

R�sultats de recherche pour Computer algebra in coding theory and cryptanalysis:...

Image fournie par le vendeur

Computer algebra in coding theory and cryptanalysis

Stanislav Bulygin

Edit� par S�dwestdeutscher Verlag F�r Hochschulschriften AG Co. KG Okt 2015, 2015

ISBN 10 : 3838109481 ISBN 13 : 9783838109480

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book that represents the author's Ph.D. thesis is devoted to applying symbolic methods to the problems of decoding linear codes and of algebraic cryptanalysis. The initial problems are reformulated in terms of systems of polynomial equations over a finite field, which solution(s) should yield a way to solve the initial problems. Solutions of such systems are obtained using Gr�bner bases. The first part is devoted to an application of system solving to decoding linear codes. The original method for arbitrary linear codes, which in some sense generalizes the Newton identities method, is proposed. Since for the method to work the 'field equations' are not needed, it is possible to handle quite large codes. The second part is about the algebraic cryptanalysis of the AES. The systems usually considered in this area have many auxiliary variables that are not needed for the key recovery. Therefore, here the approach is provided where these variables are eliminated and a resulting system in key-variables only is then solved. This is shown to be effective for small scale variants of the AES especially when using several plain-/ciphertext pairs. 136 pp. Deutsch. N� de r�f. du vendeur 9783838109480

Contacter le vendeur

Acheter neuf

EUR 69,90

Exp�dition �EUR 23
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Computer algebra in coding theory and cryptanalysis

Bulygin, Stanislav

Edit� par S�dwestdeutscher Verlag f�r Hochschulschriften, 2015

ISBN 10 : 3838109481 ISBN 13 : 9783838109480

Neuf Couverture souple

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book that represents the author s Ph.D. thesis is devoted to applying symbolic methods to the problems of decoding linear codes and of algebraic cryptanalysis. The initial problems are reformulated in terms of systems of polynomial equations over a fin. N� de r�f. du vendeur 5405332

Contacter le vendeur

Acheter neuf

EUR 69,90

Exp�dition �EUR 48,99
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Computer algebra in coding theory and cryptanalysis

Stanislav Bulygin

Edit� par S�dwestdeutscher Verlag F�r Hochschulschriften Jul 2009, 2009

ISBN 10 : 3838109481 ISBN 13 : 9783838109480

Neuf Taschenbuch

impression � la demande

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book that represents the author's Ph.D. thesis is devoted to applying symbolic methods to the problems of decoding linear codes and of algebraic cryptanalysis. The initial problems are reformulated in terms of systems of polynomial equations over a finite field, which solution(s) should yield a way to solve the initial problems. Solutions of such systems are obtained using Gr�bner bases. The first part is devoted to an application of system solving to decoding linear codes. The original method for arbitrary linear codes, which in some sense generalizes the Newton identities method, is proposed. Since for the method to work the �field equations� are not needed, it is possible to handle quite large codes. The second part is about the algebraic cryptanalysis of the AES. The systems usually considered in this area have many auxiliary variables that are not needed for the key recovery. Therefore, here the approach is provided where these variables are eliminated and a resulting system in key-variables only is then solved. This is shown to be effective for small scale variants of the AES especially when using several plain-/ciphertext pairs.VDM Verlag, Dudweiler Landstra�e 99, 66123 Saarbr�cken 136 pp. Deutsch. N� de r�f. du vendeur 9783838109480

Contacter le vendeur

Acheter neuf

EUR 69,90

Exp�dition �EUR 60
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Computer algebra in coding theory and cryptanalysis : Polynomial system solving for decoding linear codes and algebraic cryptanalysis

Stanislav Bulygin

Edit� par S�dwestdeutscher Verlag F�r Hochschulschriften AG Co. KG, 2009

ISBN 10 : 3838109481 ISBN 13 : 9783838109480

Neuf Taschenbuch

impression � la demande

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book that represents the author's Ph.D. thesis is devoted to applying symbolic methods to the problems of decoding linear codes and of algebraic cryptanalysis. The initial problems are reformulated in terms of systems of polynomial equations over a finite field, which solution(s) should yield a way to solve the initial problems. Solutions of such systems are obtained using Gr�bner bases. The first part is devoted to an application of system solving to decoding linear codes. The original method for arbitrary linear codes, which in some sense generalizes the Newton identities method, is proposed. Since for the method to work the 'field equations' are not needed, it is possible to handle quite large codes. The second part is about the algebraic cryptanalysis of the AES. The systems usually considered in this area have many auxiliary variables that are not needed for the key recovery. Therefore, here the approach is provided where these variables are eliminated and a resulting system in key-variables only is then solved. This is shown to be effective for small scale variants of the AES especially when using several plain-/ciphertext pairs. N� de r�f. du vendeur 9783838109480

Contacter le vendeur