000 | 03854nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-642-13797-6 | ||
003 | DE-He213 | ||
005 | 20240423130016.0 | ||
007 | cr nn 008mamaa | ||
008 | 100626s2010 gw | s |||| 0|eng d | ||
020 |
_a9783642137976 _9978-3-642-13797-6 |
||
024 | 7 |
_a10.1007/978-3-642-13797-6 _2doi |
|
050 | 4 | _aQA76.6-76.66 | |
072 | 7 |
_aUM _2bicssc |
|
072 | 7 |
_aCOM051000 _2bisacsh |
|
072 | 7 |
_aUM _2thema |
|
082 | 0 | 4 |
_a005.11 _223 |
245 | 1 | 0 |
_aArithmetic of Finite Fields _h[electronic resource] : _bThird International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010, Proceedings / _cedited by M. Anwar Hasan, Tor Helleseth. |
250 | _a1st ed. 2010. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
300 |
_a280 p. 41 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6087 |
|
505 | 0 | _aInvited Talk 1 -- Recursive Towers of Function Fields over Finite Fields -- Efficient Finite Field Arithmetic -- High-Performance Modular Multiplication on the Cell Processor -- A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier -- Type-II Optimal Polynomial Bases -- Pseudo-random Numbers and Sequences -- Pseudorandom Vector Sequences Derived from Triangular Polynomial Systems with Constant Multipliers -- Structure of Pseudorandom Numbers Derived from Fermat Quotients -- Boolean Functions -- Distribution of Boolean Functions According to the Second-Order Nonlinearity -- Hyper-bent Boolean Functions with Multiple Trace Terms -- Invited Talk 2 -- On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings -- Functions, Equations and Modular Multiplication -- Switching Construction of Planar Functions on Finite Fields -- Solving Equation Systems by Agreeing and Learning -- Speeding Up Bipartite Modular Multiplication -- Finite Field Arithmetic for Pairing Based Cryptography -- Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography -- Delaying Mismatched Field Multiplications in Pairing Computations -- Invited Talk 3 -- Regenerating Codes for Distributed Storage Networks -- Finite Fields, Cryptography and Coding -- On Rationality of the Intersection Points of a Line with a Plane Quartic -- Reflections about a Single Checksum -- Efficient Time-Area Scalable ECC Processor Using ?-Coding Technique. | |
650 | 0 | _aComputer programming. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aCryptography. | |
650 | 0 | _aData encryption (Computer science). | |
650 | 0 | _aComputer networks . | |
650 | 1 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aCryptology. |
650 | 2 | 4 | _aComputer Communication Networks. |
700 | 1 |
_aHasan, M. Anwar. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aHelleseth, Tor. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642137969 |
776 | 0 | 8 |
_iPrinted edition: _z9783642137983 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6087 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-13797-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c184056 _d184056 |