Igor e shparlinski (32 resultados)

hardcover. Condición: 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.…

Condición: 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.…

Condición: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

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. …

Condición: 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. . . . .…

Condición: New.

Condición: 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. Condición: 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.…

Condición: New.

Condición: As New. Unread book in perfect condition.

Hardback. Condición: New. 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.…

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: As New. Unread book in perfect condition.

Condición: New. In English.

Condición: New.

Condición: New.

Hardback. Condición: New. This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, 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, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc). The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presupposes only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.…

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: As New. Unread book in perfect condition.

Condición: New. This work introduces new ways of using number theoretic techniques in cryptography and related areas, such as pseudorandom number generation. In particular, it contains some rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. Series: Progress in Computer Science and Applied Logic. Num Pages: 414 pages, biography. BIC Classification: PBH; PBW; URY. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 23. Weight in Grams: 1710. . 2002. 2. Hardback. . . . .…

Hardcover. Condición: Brand New. 1st edition. 256 pages. 10.00x6.75x0.75 inches. In Stock.

Condición: New. This work introduces new ways of using number theoretic techniques in cryptography and related areas, such as pseudorandom number generation. In particular, it contains some rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. Series: Progress in Computer Science and Applied Logic. Num Pages: 414 pages, biography. BIC Classification: PBH; PBW; URY. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 23. Weight in Grams: 1710. . 2002. 2. Hardback. . . . . Books ship from the US and Ireland.…

Hardback. Condición: New. 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.…

Hardback. Condición: New. This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, 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, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc). The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presupposes only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.…

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 416 pp. Englisch.…

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 416 pp. Englisch.…