World's Best Scientists 2026 revealed!
Claus-Peter Schnorr

Claus-Peter Schnorr

D-Index & Metrics

Computer Science

D-Index
42
Citations
16879
World Ranking
8148
National Ranking
397

Overview

Claus-Peter Schnorr is affiliated with Goethe University Frankfurt in Germany. Their research career is centered within this institution, contributing to the academic environment there.

Available data does not specify particular papers, co-authors, or frequent publication venues related to Claus-Peter Schnorr.

Details on book publications or awards associated with Schnorr are not provided.

No specific fields or subfields of study have been listed, nor have particular research topics been documented in the provided information.

The absence of such detailed data limits a more granular examination of Schnorr's academic profile, but the association with a recognized university indicates engagement in scholarly activity at an advanced level.

Best Publications

  • Efficient signature generation by smart cards

    C. P. Schnorr

  • Efficient identification and signatures for smart cards

    Claus P. Schnorr

  • Lattice basis reduction: improved practical algorithms and solving subset sum problems

    C. P. Schnorr;M. Euchner

  • A hierarchy of polynomial time lattice basis reduction algorithms

    C. P. Schnorr

  • RSA and Rabin functions: certain parts are as hard as the whole

    Werner Alexi;Benny Chor;Oded Goldreich;Claus P. Schnorr

  • Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice

    J. C. Lagarias;Hendrik W. Lenstra;Claus-Peter Schnorr

  • Improved low-density subset sum algorithms

    Matthijs J. Coster;Antoine Joux;Brian A. LaMacchia;Andrew M. Odlyzko

  • A unified approach to the definition of random sequences

    Claus-Peter Schnorr

  • An optimal sorting algorithm for mesh connected computers

    C P Schnorr;A Shamir

  • Attacking the Chor-Rivest cryptosystem by improved lattice reduction

    C. P. Schnorr;H. H. Hörner

  • Lattice reduction by random sampling and birthday methods

    Claus Peter Schnorr

  • Security of Signed ElGamal Encryption

    Claus-Peter Schnorr;Markus Jakobsson

  • Geometry of Numbers and Integer Programming (Summary)

    Claus-Peter Schnorr

  • Process complexity and effective random tests

    Unknown

  • The process complexity and effective random tests.

    Unknown

  • Fast signature generation with a Fiat Shamir—like scheme

    H. Ong;C. P. Schnorr

  • Security of Blind Discrete Log Signatures against Interactive Attacks

    Claus-Peter Schnorr

  • Zufälligkeit und Wahrscheinlichkeit : Eine algorithmische Begründung der Wahrscheinlichkeitstheorie

    Claus Peter Schnorr

  • Optimal Algorithms for Self-Reducible Problems.

    Claus-Peter Schnorr

  • A more efficient algorithm for lattice basis reduction

    C. P. Schnorr

  • Stronger Security Proofs for RSA and Rabin Bits

    R. Fischlin;C. P. Schnorr

  • Polynomial time algorithms for finding integer relations among real numbers

    J. Håstad;B. Just;J. C. Lagarias;C. P. Schnorr

Frequent Co-Authors

Serge Vaudenay
Serge Vaudenay École Polytechnique Fédérale de Lausanne
Adi Shamir
Adi Shamir Weizmann Institute of Science
Andrew M. Odlyzko
Andrew M. Odlyzko University of Minnesota
Johan Håstad
Johan Håstad Royal Institute of Technology
Feng Bao
Feng Bao Huawei Technologies (China)
Jacques Stern
Jacques Stern École Normale Supérieure
Robert H. Deng
Robert H. Deng Singapore Management University
Antoine Joux
Antoine Joux Université Paris Cité

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online education in Computer Science opens up a wide range of opportunities, especially for those seeking flexibility or looking to start with foundational credentials. An associate degree online can provide a solid stepping stone into the tech field, offering essential programming and IT skills that are highly valued by employers.

Cost-conscious students can pursue their goals without breaking the bank by enrolling in affordable online courses. These programs make higher education more accessible, allowing learners to manage expenses while gaining in-demand expertise.

Academic performance doesn’t have to be a barrier to a rewarding computer science career. Finding a college with low gpa admission policies ensures that motivated students still have options for quality online education, regardless of past grades.

Additionally, tech skills can complement other disciplines. For instance, those considering interdisciplinary options may look into jobs for environmental science majors that involve data analysis, modeling, or software development for environmental solutions, further expanding career pathways after earning a degree online.

Best Scientists Citing Claus-Peter Schnorr

Trending Scientists

Recently Published Articles