Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer science --- DES (data encryption standard) --- cryptologie

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Number theory --- getallenleer

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume contains a collection of research and survey papers written by some of the most eminent mathematicians in the international community and is dedicated to Helmut Maier, whose own research has been groundbreaking and deeply influential to the field. Specific emphasis is given to topics regarding exponential and  trigonometric sums and their behavior in short intervals, anatomy of integers and cyclotomic polynomials, small gaps in sequences of sifted prime numbers, oscillation theorems for primes in arithmetic progressions, inequalities related to the distribution of primes in short intervals, the Möbius function, Euler’s totient function, the Riemann zeta function and the Riemann Hypothesis. Graduate students, research mathematicians, as well as computer scientists and engineers who are interested in pure and interdisciplinary research, will find this volume a useful resource. Contributors to this volume: Bill Allombert, Levent Alpoge, Nadine Amersi, Yuri Bilu, Régis de la Bretèche, Christian Elsholtz, John B. Friedlander, Kevin Ford, Daniel A. Goldston, Steven M. Gonek, Andrew Granville, Adam J. Harper, Glyn Harman, D. R. Heath-Brown, Aleksandar Ivić, Geoffrey Iyer, Jerzy Kaczorowski, Daniel M. Kane, Sergei Konyagin, Dimitris Koukoulopoulos, Michel L. Lapidus, Oleg Lazarev, Andrew H. Ledoan, Robert J. Lemke Oliver, Florian Luca, James Maynard, Steven J. Miller, Hugh L. Montgomery, Melvyn B. Nathanson, Ashkan Nikeghbali, Alberto Perelli, Amalia Pizarro-Madariaga, János Pintz, Paul Pollack, Carl Pomerance, Michael Th. Rassias, Maksym Radziwiłł, Joël Rivat, András Sárközy, Jeffrey Shallit, Terence Tao, Gérald Tenenbaum, László Tóth, Tamar Ziegler, Liyang Zhang.

Algebra --- Mathematics --- Physical Sciences & Mathematics --- Numerical analysis. --- Data structures (Computer science) --- Mathematics. --- Math --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Data structures (Computer science). --- Number theory. --- Number Theory. --- Numerical Analysis. --- Data Structures, Cryptology and Information Theory. --- Science --- Mathematical analysis --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science) --- Data structures (Computer scienc. --- Data Structures and Information Theory. --- Number study --- Numbers, Theory of

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume contains a collection of research and survey papers written by some of the most eminent mathematicians in the international community and is dedicated to Helmut Maier, whose own research has been groundbreaking and deeply influential to the field. Specific emphasis is given to topics regarding exponential and trigonometric sums and their behavior in short intervals, anatomy of integers and cyclotomic polynomials, small gaps in sequences of sifted prime numbers, oscillation theorems for primes in arithmetic progressions, inequalities related to the distribution of primes in short intervals, the Möbius function, Euler’s totient function, the Riemann zeta function and the Riemann Hypothesis. Graduate students, research mathematicians, as well as computer scientists and engineers who are interested in pure and interdisciplinary research, will find this volume a useful resource. Contributors to this volume: Bill Allombert, Levent Alpoge, Nadine Amersi, Yuri Bilu, Régis de la Bretèche, Christian Elsholtz, John B. Friedlander, Kevin Ford, Daniel A. Goldston, Steven M. Gonek, Andrew Granville, Adam J. Harper, Glyn Harman, D. R. Heath-Brown, Aleksandar Ivić, Geoffrey Iyer, Jerzy Kaczorowski, Daniel M. Kane, Sergei Konyagin, Dimitris Koukoulopoulos, Michel L. Lapidus, Oleg Lazarev, Andrew H. Ledoan, Robert J. Lemke Oliver, Florian Luca, James Maynard, Steven J. Miller, Hugh L. Montgomery, Melvyn B. Nathanson, Ashkan Nikeghbali, Alberto Perelli, Amalia Pizarro-Madariaga, János Pintz, Paul Pollack, Carl Pomerance, Michael Th. Rassias, Maksym Radziwiłł, Joël Rivat, András Sárközy, Jeffrey Shallit, Terence Tao, Gérald Tenenbaum, László Tóth, Tamar Ziegler, Liyang Zhang.

Number theory --- Numerical analysis --- Information systems --- Computer. Automation --- informatica --- informatietechnologie --- getallenleer --- numerieke analyse

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Zero-knowledge interactive proofsystems are a new technique which can be used as a cryptographic tool for designing provably secure protocols. Goldwasser, Micali, and Rackoff originally suggested this technique for controlling the knowledge released in an interactive proof of membership in a language, and for classification of languages [19]. In this approach, knowledge is defined in terms of complexity to convey knowledge if it gives a computational advantage to the receiver, theory, and a message is said for example by giving him the result of an intractable computation. The formal model of interacting machines is described in [19, 15, 171. A proof-system (for a language L) is an interactive protocol by which one user, the prover, attempts to convince another user, the verifier, that a given input x is in L. We assume that the verifier is a probabilistic machine which is limited to expected polynomial-time computation, while the prover is an unlimited probabilistic machine. (In cryptographic applications the prover has some trapdoor information, or knows the cleartext of a publicly known ciphertext) A correct proof-system must have the following properties: If XE L, the prover will convince the verifier to accept the pmf with very high probability. If XP L no prover, no matter what program it follows, is able to convince the verifier to accept the proof, except with vanishingly small probability.

cryptografie --- cryptologie --- Information systems --- Computer security --- Cryptography --- Data transmission systems --- Sécurité informatique --- Cryptographie --- Données --- Congresses --- Security measures --- Congrès --- Transmissions --- Sécurité --- Mesures --- Sécurité informatique --- Données --- Congrès --- Sécurité --- Data encryption (Computer science). --- Cryptology. --- Data encoding (Computer science) --- Encryption of data (Computer science)