Articoli correlati a Randomized Cunningham Numbers in Cryptography: Randomization...
Randomized Cunningham Numbers in Cryptography: Randomization theory, Cryptanalysis, RSA cryptosystem, Primality testing, Cunningham numbers, Optimization theory - Brossura
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 46,18
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiRisultati della ricerca per Randomized Cunningham Numbers in Cryptography: Randomization...
Immagini fornite dal venditore
Randomized Cunningham Numbers in Cryptography
Editore:
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 613985847X
ISBN 13: 9786139858477
Nuovo
Brossura
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 385874596
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Randomized Cunningham Numbers in Cryptography
Editore:
LAP LAMBERT Academic Publishing Jun 2018, 2018
ISBN 10: 613985847X
ISBN 13: 9786139858477
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Books on Demand GmbH, Überseering 33, 22297 Hamburg 144 pp. Englisch. Codice articolo 9786139858477
Quantità: 1 disponibili
Immagini fornite dal venditore
Randomized Cunningham Numbers in Cryptography : Randomization theory, Cryptanalysis, RSA cryptosystem, Primality testing, Cunningham numbers, Optimization theory
Editore:
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 613985847X
ISBN 13: 9786139858477
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9786139858477
Quantità: 1 disponibili