Cantitate/Preț
Produs
Total produse
Vezi coșul
Arithmetic of Finite Fields de Lilya Budaghyan

Arithmetic of Finite Fields: Lecture Notes in Computer Science, cartea 11321

Editat de Lilya Budaghyan, Francisco Rodríguez-Henríquez
en Limba Engleză Paperback – 31 dec 2018
This book constitutes the thoroughly refereed post-workshop proceedings of the 7th International Workshop on the Arithmetic of Finite Field, WAIFI 2018, held in Bergen, Norway, in June 2018.
The 14 revised full papers and six invited talks presented were carefully reviewed and selected from 26 submissions. The papers are organized in topical sections on invited talks; elliptic curves; hardware implementations; arithmetic and applications of finite fields and cryptography.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32317 lei

Preț vechi: 40396 lei
-20%

Puncte Express: 485

Carte tipărită la comandă

Livrare economică 16-30 octombrie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030051525
ISBN-10: 3030051528
Pagini: 320
Ilustrații: X, 309 p. 23 illus., 5 illus. in color.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:1st ed. 2018
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Pre- and post-quantum diffie-hellman from groups, actions, and isogenies.- A new family of pairing-friendly elliptic curves.- superspecial hyperelliptic curves of genus 4 over small finite fields.- Fast computation of isomorphisms between finite fields using elliptic curves.- construction of some codes suitable for both side channel and fault injection attacks.- On hardware implementation of tang-maitra boolean functions.- rapid hardware design for cryptographic modules with filtering structures over small finite fields.- Sequences with low correlation.- Vector-valued modular forms on finite upper half planes.- Normal basis exhaustive search.- On symmetry and differential properties of generalized boolean functions.- Characterizations of partially bent and plateaued functions over finite fields.- Codes of length two correcting single errors of limited size II.- Fractional jumps: complete characterisation and an explicit infinite family.- Some sextics of genera five and seven attaining the serre bound.- Direct constructions of (involutory) MDS matrices from block vandermonde and cauchy-like matrices.- Exploiting preprocessing for quantum search to break parameters for MQ cryptosystems.