primality cryptography (78 Ergebnisse)

Hardcover. Zustand: Très bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 1986. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Edition 1986. Ammareal gives back up to 15% of this item's net price to charity organizations.

Hardcover. Zustand: Très bon. Ancien livre de bibliothèque. Petite(s) trace(s) de pliure sur la couverture. Edition 2004. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slightly creased cover. Edition 2004. Ammareal gives back up to 15% of this item's net price to charity organizations.

gebundene Ausgabe. Zustand: Gut. 235 Seiten Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber. Es befindet sich neben dem Rückenschild lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 500.

Zustand: Gut. Wiley, Chichester 1987. XV, 235 S. Gr.-8°. Ppbd. / 9583 Mit Ausnahme von Direkt-Recycling Materialien erfolgt der Versand ohne Einsatz von Kunststoffen. Sprache: Deutsch.

Hardcover Sehr gut erhalten.

Taschenbuch. Zustand: Neu. Primality and Cryptography | Evangelos Kranakis | Taschenbuch | xv | Deutsch | 2013 | Vieweg & Teubner | EAN 9783322966483 | Verantwortliche Person für die EU: Springer Vieweg in Springer Science + Business Media, Abraham-Lincoln-Str. 46, 65189 Wiesbaden, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Hardcover. Zustand: New. ISBN: 9780387772677.

23 cm. original hardcover. xvi,236 pp. diagrams, tables. references. index. \"Wiley-Teubner Series in Computer Science\". -This book is the first edition, 2nd printing in a original blue hardcover. It has 252 pages and the isbn is the same as the 1991 edition. . -(very) good. 420g.

Taschenbuch. Zustand: Neu. Neuware -The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P). There is still no polynomial-time algorithm for IFP. Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of IFP.Primality Testing and Integer Factorization in Public Key Cryptography, Second Edition, provides a survey of recent progress in primality testing and integer factorization, with implications to factoring based public key cryptography. Notable new features are the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test.This volume is designed for advanced level students in computer science and mathematics, and as a secondary text or reference book; suitable for practitioners and researchers in industry.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 392 pp. Englisch.

Hardcover. Zustand: New. ISBN:9780387772677.

Hardcover. Zustand: New. ISBN:9780387772677.

hardcover. Zustand: Like New. Like New. book.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In this research, we study primality testing of arbitrary integers via number theory, randomized algorithms and optimization theories. Concerning fundamentals of modern cryptography, we focus on the cryptanalysis, cryptosystems and RSA keys, which are widely used in secure communications, e.g., banking systems and other platforms with an online security. For a given n-bit integer N, our consideration is realized as a decision problem, viz. an optimized algorithm rendering the output YES, if N is a prime, and NO otherwise. In order to design such an algorithm, we begin by examining essential ingredients from the number theory, namely, divisibility, modular arithmetic, integer representations, distributions of primes, primality testing algorithms, greatest common divisor, least common multiplication, pseudoprimes, Np-hard discrete logarithm problem, residues and others. Hereby, we give special attention to the congruence relations, Chinese remainder theorem and Fermat's little theorem towards the optimal primality testing of an integer. Finally, we anticipate optimized characterizations of Cunningham numbers in the light of randomization theory and their applications to cryptography.