Importo totale (1 articolo articoli):
Destinazione ordine:
shparlinski igor (213 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (213)
- Riviste e Giornali (Nessun altro risultato corrispondente a questo perfezionamento)
- Fumetti (Nessun altro risultato corrispondente a questo perfezionamento)
- Spartiti (Nessun altro risultato corrispondente a questo perfezionamento)
- Arte, Stampe e Poster (Nessun altro risultato corrispondente a questo perfezionamento)
- Fotografie (Nessun altro risultato corrispondente a questo perfezionamento)
- Mappe (Nessun altro risultato corrispondente a questo perfezionamento)
- Manoscritti e Collezionismo cartaceo (Nessun altro risultato corrispondente a questo perfezionamento)
Condizioni Maggiori informazioni
- Nuovo (181)
- Come nuovo, Ottimo o Quasi ottimo (21)
- Molto buono o Buono (8)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (3)
Legatura
Ulteriori caratteristiche
- Prima ed. (Nessun altro risultato corrispondente a questo perfezionamento)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (87)
- Non Print on Demand (155)
Lingua (2)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001. Proceedings (Lecture Notes in Computer Science)
Da: GuthrieBooks, Spring Branch, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding.
-
Cryptography and Computational Number Theory (Progress in Computer Science and Applied Logic (PCS))
Da: Midtown Scholar Bookstore, Harrisburg, PA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Very Good. no dust jacket as issued No dust jacket. Very Good hardcover with light shelfwear - NICE! Standard-sized.
-
Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic)
Da: Vintage Books and Fine Art, Oxford, MD, U.S.A.
Valutazione del venditore 4 su 5 stelle
Hardcover. Condizione: Like New. Square Tight Binding.Clean interior, save for small p/o signature to top of front paste down, else new.
-
Affare
EUR 2,70
Spedizione EUR 20,50
Spedito da Francia a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Bon. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Ammareal gives back up to 15% of this item's net price to charity organizations.
-
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. 14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001. Proceedings.
Da: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Germania
Membro dell'associazione: GIAQ ILAB VDA
Valutazione del venditore 5 su 5 stelle
EUR 12,00
Spedizione EUR 30,00
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloXII, 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.
-
Number Theoretic Methods in Cryptography : Complexity Lower Bounds
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 52,88
Spedizione EUR 2,23
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Computational and Algorithmic Problems in Finite Fields (Mathematics and its Applications)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 51,71
Spedizione EUR 3,36
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic, 17)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 51,71
Spedizione EUR 3,36
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Cryptography and Computational Number Theory (Progress in Computer Science and Applied Logic)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 51,71
Spedizione EUR 3,36
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes : 14th International Symposium, Aaecc-14 Melbourne, Australia, November 26-30, 2001 Proceedings
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 53,53
Spedizione EUR 2,23
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001. ... (Lecture Notes in Computer Science, 2227)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 52,36
Spedizione EUR 3,36
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Character Sums with Exponential Functions and Their Applications
Libro 5 di 46: Cambridge Tracts in MathematicsLingua: Inglese
Editore: Cambridge University Press, 1999
ISBN 10: 0521642639 ISBN 13: 9780521642637
Da: Better World Books: West, Reno, NV, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
-
Character Sums with Exponential Functions and their Applications (Cambridge Tracts in Mathematics)
Libro 5 di 46: Cambridge Tracts in MathematicsLingua: Inglese
Editore: Cambridge University Press, 1999
ISBN 10: 0521642639 ISBN 13: 9780521642637
Da: Labyrinth Books, Princeton, NJ, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New.
-
Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic, 17)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 59,06
Spedizione gratuita
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 57,31
Spedizione EUR 3,36
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Number Theoretic Methods in Cryptography (Paperback)
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: new. Paperback. 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. The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Computational and Algorithmic Problems in Finite Fields (Paperback)
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: new. Paperback. '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. 'Et moi, .a 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 nonlineariA ties abound. Similarly, all kinds of pans of mathematics serve as tools for other pans and for other sciA ences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One serA 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 se Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Cryptography and Computational Number Theory (Paperback)
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: new. Paperback. 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. 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 idea for this workshop grew out of the recognition of the recent, rapid development in various areas of cryptography and computational number the ory. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Number Theoretic Methods in Cryptography (Hardcover)
Lingua: Inglese
Editore: Birkhauser Verlag AG, Basel, 1999
ISBN 10: 3764358882 ISBN 13: 9783764358884
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: new. Hardcover. 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. This book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. They are based on bounds of character sums and number solutions of some polynomial equations over finite fields and residue rings. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Number Theoretic Methods in Cryptography : Complexity Lower Bounds
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 59,92
Spedizione EUR 2,23
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Cryptography and Computational Number Theory.
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
EUR 21,40
Spedizione EUR 40,00
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. 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.
-
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes : 14th International Symposium, Aaecc-14 Melbourne, Australia, November 26-30, 2001 Proceedings
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 60,06
Spedizione EUR 2,23
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Paperback)
Lingua: Inglese
Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2001
ISBN 10: 3540429115 ISBN 13: 9783540429111
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: new. Paperback. This book constitutes the refereed proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-14, held in Melbourne, Australia in November 2001. The 36 revised full papers presented together with four invited papers were carefully reviewed and selected from 61 submissions. The papers are organized in topical sections on block codes, code constructions, codes and algebra - rings and fields, codes and algebra - algebraic geometry codes, sequences, cryptography, algorithms, algorithms - decoding, and algebraic constructions. The main subjects covered were: Codes: iterative decoding, decoding methods, block codes, code construction. Codes and algebra: algebraic curves, Grobner bases, and AG codes. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Computational and Algorithmic Problems in Finite Fields (Mathematics and its Applications)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 64,27
Spedizione gratuita
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic, 17, Band 17).
Da: Antiquariat Bernhardt, Kassel, Germania
Valutazione del venditore 5 su 5 stelle
EUR 14,28
Spedizione EUR 49,90
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloKarton. Condizione: Sehr gut. Zust: Gutes Exemplar. 180 Seiten, mit Abbildungen, Englisch 460g.
-
Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 58,51
Spedizione EUR 13,80
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Cryptography and Computational Number Theory (Progress in Computer Science and Applied Logic)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 58,51
Spedizione EUR 13,80
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Computational and Algorithmic Problems in Finite Fields (Mathematics and its Applications)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 58,51
Spedizione EUR 13,80
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 14th International Symposium, AAECC-14, Melbourne, Australia, November 26-30, 2001. ... (Lecture Notes in Computer Science, 2227)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 58,51
Spedizione EUR 13,80
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Number Theoretic Methods in Cryptography: Complexity lower bounds (Progress in Computer Science and Applied Logic, 17)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 58,51
Spedizione EUR 13,80
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
