Shparlinski igor (60 Ergebnisse)

hardcover. Zustand: Good. Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned. Ex library copy with usual stamps & stickers.…

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

XII, 398 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Lecture Notes in Computer Science, Vol. 2227. Sprache: Englisch. …

Zustand: New.

Hardcover. Zustand: Gut. 378 S. Ex-library with stamp and library-signature in good condition, some traces of use. C-01879 9783764365103 Sprache: Englisch Gewicht in Gramm: 1150.

Karton Karton. Zustand: Sehr gut. 180 Seiten, mit Abbildungen, Zust: Gutes Exemplar. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 460.…

Zustand: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

Zustand: New. In English.

Zustand: New. In English.

Zustand: New. In English.

Zustand: New. In English.

Paperback. Zustand: Brand New. reprint edition. 252 pages. 9.40x6.20x0.70 inches. In Stock.

hardcover. Zustand: Gut. 542 Seiten; 9780792356622.3 Gewicht in Gramm: 4.

Zustand: New.

Zustand: New. Introduces techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. This work contains a number of open problems and proposals for further research. Series: Progress in Computer Science and Applied Logic. Num Pages: 182 pages, biography. BIC Classification: GPJ; PBH; URY; UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 12. Weight in Grams: 454. . 1999. Hardback. . . . . Books ship from the US and Ireland. …

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the refereed proceedings of the Workshop on Cryptography and Computational Number Theory, CCNT'99, which has been held in Singapore during the week of November 22-26, 1999. The workshop was organized by the Centre for Systems Security of the Na tional University of Singapore. We gratefully acknowledge the financial support from the Singapore National Science and Technology Board under the grant num ber RP960668/M. The idea for this workshop grew out of the recognition of the recent, rapid development in various areas of cryptography and computational number the ory. The event followed the concept of the research programs at such well-known research institutions as the Newton Institute (UK), Oberwolfach and Dagstuhl (Germany), and Luminy (France). Accordingly, there were only invited lectures at the workshop with plenty of time for informal discussions. It was hoped and successfully achieved that the meeting would encourage and stimulate further research in information and computer security as well as in the design and implementation of number theoretic cryptosystems and other related areas. Another goal of the meeting was to stimulate collaboration and more active interaction between mathematicians, computer scientists, practical cryptographers and engineers in academia, industry and government.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de grees and orders of - polynomials; - algebraic functions; - Boolean functions; - linear recurring sequences; coinciding with values of the discrete logarithm modulo a prime p at suf ficiently many points (the number of points can be as small as pI/He). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the right most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These results are used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm. For example, we prove that any unbounded fan-in Boolean circuit. of sublogarithmic depth computing the discrete logarithm modulo p must be of superpolynomial size.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The AAECC Symposia Series was started in 1983 by Alain Poli (Toulouse), who, together with R. Desq, D. Lazard, and P. Camion, organized the rst conference. Originally the acronym AAECC meant 'Applied Algebra and Error-Correcting Codes'. Over the years its meaning has shifted to 'Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes', re ecting the growing importance of complexity in both decoding algorithms and computational algebra. AAECC aims to encourage cross-fertilization between algebraic methods and their applications in computing and communications. The algebraic orientation is towards nite elds, complexity, polynomials, and graphs. The applications orientation is towards both theoretical and practical error-correction coding, and, since AAECC 13 (Hawaii, 1999), towards cryptography. AAECC was the rst symposium with papers connecting Gr obner bases with E-C codes. The balance between theoretical and practical is intended to shift regularly; at AAECC-14 the focus was on the theoretical side. The main subjects covered were: - Codes: iterative decoding, decoding methods, block codes, code construction. - Codes and algebra: algebraic curves, Gr obner bases, and AG codes. - Algebra: rings and elds, polynomials. - Codes and combinatorics: graphs and matrices, designs, arithmetic. - Cryptography. - Computational algebra: algebraic algorithms. - Sequences for communications.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 'Et moi, . si j'avait su comment en revenir. je One service mathematics bas rendemI !be n'y semis point a1J6.' human race. It bas put common sense back JulesVeme where it belongs. on tile topmost sbelf next to tile dusty canister labelled 'discarded nonsense'. The series is divergent; therefore we may be Eric T.BeIl able to do something with il O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlineari ties abound. Similarly, all kinds of pans of mathematics serve as tools for other pans and for other sci ences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One ser vice topology has rendered mathematical physics . '; 'One service logic has rendered computer science . '; 'One service category theory has rendered mathematics . .'. All arguably true. And all statements obtainable this way fonn pan of the raison d' 8tre of this series.…

Zustand: New. In English.

Zustand: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Taschenbuch. Zustand: Neu. Number Theoretic Methods in Cryptography | Complexity lower bounds | Igor Shparlinski | Taschenbuch | Progress in Computer Science and Applied Logic | ix | Englisch | 2012 | Birkhäuser | EAN 9783034897235 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Zustand: Gut. Zustand: Gut | Seiten: 378 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Zustand: New. In English.

Hardcover. Zustand: Gut. Ex-library with stamp and library-signature. GOOD condition, some traces of use. C-02089 9783764366544 Sprache: Englisch Gewicht in Gramm: 1050.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 544 | Sprache: Englisch | Produktart: Bücher | This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types and new applications of finite fields to other areas of mathematics. For completeness we in­ clude two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number gener­ ators, modular arithmetic, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod­ ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR.…

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The fields of cryptography and computational number theory have recently witnessed a rapid development, which was the subject of the CCNT workshop in Singapore in November 1999. Its aim was to stimulate further research in information and computer security as well as the design and implementation of number theoretic cryptosystems and other related areas. Another achievement of the meeting was the collaboration of mathematicians, computer scientists, practical cryptographers and engineers in academia, industry and government. The present volume comprises a selection of refereed papers originating from this event, presenting either a survey of some area or original and new results. They concern many different aspects of the field such as theory, techniques, applications and practical experience. It provides a state-of-the-art report on some number theoretical issues of significance to cryptography.…

Zustand: New. In English.

Zustand: New. In English.

Zustand: New. In English.