Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Advances in Cryptology – EUROCRYPT ’93
| Advances in Cryptology – EUROCRYPT ’93 |
| Pubbl/distr/stampa | Springer Berlin Heidelberg |
| Descrizione fisica | 1 online resource (x, 465 p.) : ill |
| Soggetto non controllato |
Computers
Cryptography Language arts & disciplines |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465813503316 |
| Springer Berlin Heidelberg | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Arithmetic of Finite Fields [[electronic resource] ] : Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010, Proceedings / / edited by M. Anwar Hasan, Tor Helleseth
| Arithmetic of Finite Fields [[electronic resource] ] : Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010, Proceedings / / edited by M. Anwar Hasan, Tor Helleseth |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (280 p. 41 illus.) |
| Disciplina | 512.32 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer science—Mathematics Discrete mathematics Algorithms Cryptography Data encryption (Computer science) Computer networks Programming Techniques Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Cryptology Computer Communication Networks |
| ISBN |
1-280-38738-6
9786613565303 3-642-13797-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited 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. |
| Record Nr. | UNISA-996465667103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Arithmetic of finite fields : Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010 : proceedings / / M. Anwar Hasan, Tor Helleseth (eds.)
| Arithmetic of finite fields : Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010 : proceedings / / M. Anwar Hasan, Tor Helleseth (eds.) |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | New York, : Springer, 2010 |
| Descrizione fisica | 1 online resource (280 p. 41 illus.) |
| Disciplina | 512.32 |
| Altri autori (Persone) |
HasanM. Anwar
HellesethTor |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Finite fields (Algebra)
Mappings (Mathematics) Curves, Algebraic |
| ISBN |
1-280-38738-6
9786613565303 3-642-13797-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited 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. |
| Record Nr. | UNINA-9910483746003321 |
| New York, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks : July 1-6, 2007, Solstrand, Norway / / edited by Tor Helleseth, P. Vijay Kumar, Øyvind Ytrehus
| Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks : July 1-6, 2007, Solstrand, Norway / / edited by Tor Helleseth, P. Vijay Kumar, Øyvind Ytrehus |
| Pubbl/distr/stampa | IEEE |
| Disciplina | 621.384 |
| Altri autori (Persone) |
HellesethTor
KumarP. V <1955-> (P. Vijay) YtrehusØyvind |
| Soggetto topico |
Wireless communication systems
Information theory Coding theory |
| ISBN | 1-5090-8478-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks
Operator-Assisted |
| Record Nr. | UNISA-996211044903316 |
| IEEE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks : July 1-6, 2007, Solstrand, Norway / / edited by Tor Helleseth, P. Vijay Kumar, Øyvind Ytrehus
| Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks : July 1-6, 2007, Solstrand, Norway / / edited by Tor Helleseth, P. Vijay Kumar, Øyvind Ytrehus |
| Pubbl/distr/stampa | IEEE |
| Disciplina | 621.384 |
| Altri autori (Persone) |
HellesethTor
KumarP. V <1955-> (P. Vijay) YtrehusØyvind |
| Soggetto topico |
Wireless communication systems
Information theory Coding theory |
| ISBN |
9781509084784
1509084789 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks
Operator-Assisted |
| Record Nr. | UNINA-9910143021803321 |
| IEEE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Sequences and Their Applications - SETA 2004 [[electronic resource] ] : Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers / / edited by Tor Helleseth, Dilip Sarwate, Hong-Yeop Song, Kyeongcheol Yang
| Sequences and Their Applications - SETA 2004 [[electronic resource] ] : Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers / / edited by Tor Helleseth, Dilip Sarwate, Hong-Yeop Song, Kyeongcheol Yang |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 451 p.) |
| Disciplina | 003.54 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Coding theory
Information theory Cryptography Data encryption (Computer science) Computer science Algorithms Numerical analysis Computer science—Mathematics Coding and Information Theory Cryptology Theory of Computation Numerical Analysis Symbolic and Algebraic Manipulation |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- A Survey of Some Recent Results on Bent Functions -- A Survey of the Merit Factor Problem for Binary Sequences -- A Survey of Feedback with Carry Shift Registers -- Univariate and Multivariate Merit Factors -- Complexity of Sequences I -- Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences -- Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences -- Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences -- A Unified View on Sequence Complexity Measures as Isometries -- Complexity of Sequences II -- One-Error Linear Complexity over F p of Sidelnikov Sequences -- On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences -- On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two -- On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences -- Perfect Sequences -- Almost-Perfect and Odd-Perfect Ternary Sequences -- Cross-Correlation Properties of Perfect Binary Sequences -- Sequence Constructions -- New Sets of Binary and Ternary Sequences with Low Correlation -- Improved p-ary Codes and Sequence Families from Galois Rings -- Quadriphase Sequences Obtained from Binary Quadratic Form Sequences -- New Families of p-Ary Sequences from Quadratic Form with Low Correlation and Large Linear Span -- Sequences over ? m -- On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers -- Distribution of r-Patterns in the Most Significant Bit of a Maximum Length Sequence over -- Sequence Generator Properties and Applications -- Algebraic Feedback Shift Registers Based on Function Fields -- New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP) -- Cryptanalysis of a Particular Case of Klimov-Shamir Pseudo-Random Generator -- Generating Functions Associated with Random Binary Sequences Consisting of Runs of Lengths 1 and 2 -- Multi-dimensional Sequences -- Multi-continued Fraction Algorithm and Generalized B-M Algorithm over F 2 -- A New Search for Optimal Binary Arrays with Minimum Peak Sidelobe Levels -- New Constructions of Quaternary Hadamard Matrices -- Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform -- Optics and OFDM Applications -- New Constructions and Bounds for 2-D Optical Orthogonal Codes -- Topics on Optical Orthogonal Codes -- Weighted Degree Trace Codes for PAPR Reduction -- Polynomials and Functions -- Which Irreducible Polynomials Divide Trinomials over GF(2)? -- Autocorrelation Properties of Resilient Functions and Three-Valued Almost-Optimal Functions Satisfying PC(p) -- Group Algebras and Correlation Immune Functions. |
| Record Nr. | UNISA-996465683103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Sequences and Their Applications -- SETA 2012 [[electronic resource] ] : 7th International Conference, SETA 2012, Waterloo, ON, Canada, June 4-8, 2012. Proceedings / / edited by Tor Helleseth, Jonathan Jedwab
| Sequences and Their Applications -- SETA 2012 [[electronic resource] ] : 7th International Conference, SETA 2012, Waterloo, ON, Canada, June 4-8, 2012. Proceedings / / edited by Tor Helleseth, Jonathan Jedwab |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XII, 339 p. 25 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Cryptography Data encryption (Computer science) Computer networks Electronic data processing—Management Coding theory Information theory Discrete Mathematics in Computer Science Cryptology Computer Communication Networks IT Operations Coding and Information Theory |
| ISBN | 3-642-30615-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Perfect sequences -- finite fields -- boolean functions -- Golomb 80th birthday session -- linear complexity -- frequency hopping -- correlation of sequences -- bounds on sequences cryptography -- aperiodic correlation -- Walsh transform. |
| Record Nr. | UNISA-996465566303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Sequences and Their Applications – SETA 2006 [[electronic resource] ] : 4th International Conference, Beijing, China, September 24-28, 2006, Proceedings / / edited by Guang Gong, Tor Helleseth, Hong-Yeop Song, Kyeongcheol Yang
| Sequences and Their Applications – SETA 2006 [[electronic resource] ] : 4th International Conference, Beijing, China, September 24-28, 2006, Proceedings / / edited by Guang Gong, Tor Helleseth, Hong-Yeop Song, Kyeongcheol Yang |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XII, 436 p.) |
| Disciplina | 515/.24 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Coding theory
Information theory Cryptography Data encryption (Computer science) Computer science Algorithms Numerical analysis Computer science—Mathematics Coding and Information Theory Cryptology Theory of Computation Numerical Analysis Symbolic and Algebraic Manipulation |
| ISBN | 3-540-44524-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Shift Register Sequences – A Retrospective Account -- The Probabilistic Theory of the Joint Linear Complexity of Multisequences -- Multi-Continued Fraction Algorithms and Their Applications to Sequences -- Codes for Optical CDMA -- Linear Complexity of Sequences -- On the Linear Complexity of Sidel’nikov Sequences over -- Linear Complexity over F p of Ternary Sidel’nikov Sequences -- Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences -- The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity -- Correlation of Sequences -- Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation -- Extended Hadamard Equivalence -- Analysis of Designing Interleaved ZCZ Sequence Families -- Stream Ciphers and Transforms -- Security of Jump Controlled Sequence Generators for Stream Ciphers -- Improved Rijndael-Like S-Box and Its Transform Domain Analysis -- Topics in Complexities of Sequences -- Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression -- On Lempel-Ziv Complexity of Sequences -- Computing the k-Error N-Adic Complexity of a Sequence of Period p n -- On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences -- Linear/Nonlinear Feedback Shift Register Sequences -- On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes -- Sequences of Period 2 N –2 -- A New Algorithm to Compute Remote Terms in Special Types of Characteristic Sequences -- Multi-sequence Synthesis -- Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis -- The Hausdorff Dimension of the Set of r-Perfect M-Multisequences -- Filtering Sequences and Pseudorandom Sequence Generators -- Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants -- Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm -- On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences -- Sequences and Combinatorics -- Nonexistence of a Kind of Generalized Perfect Binary Array -- FCSR Sequences -- On the Distinctness of Decimations of Generalized l-Sequences -- On FCSR Memory Sequences -- Periodicity and Distribution Properties of Combined FCSR Sequences -- Aperiodic Correlation and Applications -- Generalized Bounds on Partial Aperiodic Correlation of Complex Roots of Unity Sequences -- Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance -- Boolean Functions -- On Immunity Profile of Boolean Functions -- Reducing the Number of Homogeneous Linear Equations in Finding Annihilators -- The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function -- Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions -- Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity. |
| Record Nr. | UNISA-996466097103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Sequences and their applications--SETA 2004 : third international conference, Seoul, Korea, October 24-28, 2004 : revised selected papers / / Tor Helleseth ... [et al.] (eds.)
| Sequences and their applications--SETA 2004 : third international conference, Seoul, Korea, October 24-28, 2004 : revised selected papers / / Tor Helleseth ... [et al.] (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (XII, 451 p.) |
| Disciplina | 515/.24 |
| Altri autori (Persone) | HellesethTor |
| Collana | Lecture notes in computer science |
| Soggetto topico | Sequences (Mathematics) |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- A Survey of Some Recent Results on Bent Functions -- A Survey of the Merit Factor Problem for Binary Sequences -- A Survey of Feedback with Carry Shift Registers -- Univariate and Multivariate Merit Factors -- Complexity of Sequences I -- Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences -- Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences -- Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences -- A Unified View on Sequence Complexity Measures as Isometries -- Complexity of Sequences II -- One-Error Linear Complexity over F p of Sidelnikov Sequences -- On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences -- On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two -- On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences -- Perfect Sequences -- Almost-Perfect and Odd-Perfect Ternary Sequences -- Cross-Correlation Properties of Perfect Binary Sequences -- Sequence Constructions -- New Sets of Binary and Ternary Sequences with Low Correlation -- Improved p-ary Codes and Sequence Families from Galois Rings -- Quadriphase Sequences Obtained from Binary Quadratic Form Sequences -- New Families of p-Ary Sequences from Quadratic Form with Low Correlation and Large Linear Span -- Sequences over ? m -- On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers -- Distribution of r-Patterns in the Most Significant Bit of a Maximum Length Sequence over -- Sequence Generator Properties and Applications -- Algebraic Feedback Shift Registers Based on Function Fields -- New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP) -- Cryptanalysis of a Particular Case of Klimov-Shamir Pseudo-Random Generator -- Generating Functions Associated with Random Binary Sequences Consisting of Runs of Lengths 1 and 2 -- Multi-dimensional Sequences -- Multi-continued Fraction Algorithm and Generalized B-M Algorithm over F 2 -- A New Search for Optimal Binary Arrays with Minimum Peak Sidelobe Levels -- New Constructions of Quaternary Hadamard Matrices -- Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform -- Optics and OFDM Applications -- New Constructions and Bounds for 2-D Optical Orthogonal Codes -- Topics on Optical Orthogonal Codes -- Weighted Degree Trace Codes for PAPR Reduction -- Polynomials and Functions -- Which Irreducible Polynomials Divide Trinomials over GF(2)? -- Autocorrelation Properties of Resilient Functions and Three-Valued Almost-Optimal Functions Satisfying PC(p) -- Group Algebras and Correlation Immune Functions. |
| Altri titoli varianti | SETA 2004 |
| Record Nr. | UNINA-9910483254603321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||