Zobrazeno 1 - 10
of 317
pro vyhledávání: '"Claus-Peter Schnorr"'
Autor:
Claus-Peter Schnorr, Hermann Walter, Volker Claus, Wolffried Stucky, Hans-Peter Blatt, Otto Spaniol, Gerd Kaufholz, Rainer Kemp, Wolfgang Paul, Eberhard Bertsch, Herbert Kopp, Manfred Stadel, Ulrich Schmitt, Wolfgang Weidner, Wolfgang Gräber, Dung Huynh, Rockford Ross, Michael Breder, Klaus Estenfeld, Axel Pink, Jan Messerschmidt, Hans Simon, Bernd Becker, Rolf Strothmann, Peter Auler, Johannes Arz, Paul Molitor, Reiner Kolla, Thomas Kretschmer, Franz Josef Schmitt, Ursula Becker, Reiner Marzinkewitsch, Hans Georg Osthof, Uwe Sparmann, Jürgen Sellen, Joachim Hartmann, Yonggang Guan, Gisela Sparmann, Hongzhong Wu, Elmar Schömer, Thomas Burch, Björn Schieffer, Christoph Scholl, Frank Follert, Thomas Chadzelek, Frank Schulz, Jens Eckstein, Matthias Buck, Bin Zhu, Alexander Gamkrelidze, Jörg Sauer, Timo von Oertzen, Tobias Gärtner, Christopher Durst
Publikováno v:
Festschrift zum 90. Geburtstag von Prof. Dr. Dr. h.c. mult. Günter Hotz ISBN: 9783658378219
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32e48b6842861657b3f0a0df274a2dcd
https://doi.org/10.1007/978-3-658-37822-6_1
https://doi.org/10.1007/978-3-658-37822-6_1
Autor:
Zaffora Blando, Francesca1 (AUTHOR) fzaffora@andrew.cmu.edu
Publikováno v:
Studies in History & Philosophy of Science Part A. Aug2024, Vol. 106, p196-207. 12p.
Autor:
Claus-Peter Schnorr, Rupert J. Hartung
Publikováno v:
Journal of Mathematical Cryptology, Vol 2, Iss 4, Pp 327-341 (2008)
We prove NP-hardness of equivalence and representation problems of quadratic forms under probabilistic reductions, in particular for indefinite, ternary quadratic forms with integer coefficients. We present identifications and signatures based on the
Autor:
Claus-Peter Schnorr
Publikováno v:
Information Sciences. 176:1305-1320
We enhance the security of Schnorr blind signatures against the novel one-more-forgery of C.P. Schnorr [Security of blind discrete log signatures against interactive attacks, in: ICICS 2001, LNCS, vol. 2229, 2001, Springer-Verlag, Berlin, pp. 1-12] a
Autor:
Claus-Peter Schnorr
Publikováno v:
Information and Computation. 204(1):1-25
We modify the concept of LLL-reduction of lattice bases in the sense of Lenstra, Lenstra, Lovasz, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982) 515-534 towards a faster reduction algorithm. We organize LLL-reduction in segme
Autor:
Claus-Peter Schnorr
Publikováno v:
Information Processing Letters. 79:93-98
Let G be a group of prime order q with generator g. We study hardcore subsets H⊂G of the discrete logarithm (DL) logg in the model of generic algorithms. In this model we count group operations such as multiplication and division, while computation
Autor:
Claus-Peter Schnorr, Roger Fischlin
Publikováno v:
Journal of Cryptology. 13:221-244
The RSA and Rabin encryption functions are respectively defined as EN(x) = xe mod N and EN(x) = x2 mod N , where N is a product of two large random primes p , q and e is relatively prime to ? (N) . We present a simpler and tighter proof of the result
Autor:
Claus-Peter Schnorr
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642420009
Number Theory and Cryptography
Number Theory and Cryptography
We use pruned enumeration algorithms to find lattice vectors close to a specific target vector for the prime number lattice. These algorithms generate multiplicative prime number relations modulo N that factorize a given integer N. The algorithm New
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::50e0e9d8297aada1d729fd93c3042b27
https://doi.org/10.1007/978-3-642-42001-6_6
https://doi.org/10.1007/978-3-642-42001-6_6
Autor:
Claus-Peter Schnorr, Michael Kaib
Publikováno v:
Journal of Algorithms. 21(3):565-578
We generalize the Gauss algorithm for the reduction of two-dimensional lattices from thel2-norm to arbitrary norms and extend Vallée's analysis [J. Algorithms12(1991), 556–572] to the generalized algorithm.
Autor:
Claus-Peter Schnorr
Publikováno v:
Public-Key Cryptography and Computational Number Theory: Proceedings of the International Conference organized by the Stefan Banach International Mathematical Center Warsaw, Poland, September 11-15, 2000
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b4a3fef4fccfd3d4ea267c59b5b15c1
https://doi.org/10.1515/9783110881035.257
https://doi.org/10.1515/9783110881035.257