default search action
Rainer A. Rueppel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1996
- [j4]Kaisa Nyberg, Rainer A. Rueppel:
Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem. Des. Codes Cryptogr. 7(1-2): 61-81 (1996) - [c13]Xuejia Lai, Rainer A. Rueppel:
Attacks on the HKM/HFX Cryptosystem. FSE 1996: 1-14 - 1995
- [c12]Rainer A. Rueppel:
Der Krypto-Konflikt: Versuch einer Standortbestimmung. VIS 1995: 23- - 1994
- [j3]Rainer A. Rueppel, Paul C. van Oorschot
:
Modern key agreement techniques. Comput. Commun. 17(7): 458-465 (1994) - [j2]William Wolfowicz, Rainer A. Rueppel:
Guest editorial. Eur. Trans. Telecommun. 5(4): 419-420 (1994) - [c11]Kaisa Nyberg, Rainer A. Rueppel:
Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem. EUROCRYPT 1994: 182-193 - 1993
- [c10]Kaisa Nyberg, Rainer A. Rueppel:
A New Signature Scheme Based on the DSA Giving Message Recovery. CCS 1993: 58-61 - [e1]Rainer A. Rueppel:
Advances in Cryptology - EUROCRYPT '92, Workshop on the Theory and Application of of Cryptographic Techniques, Balatonfüred, Hungary, May 24-28, 1992, Proceedings. Lecture Notes in Computer Science 658, Springer 1993, ISBN 3-540-56413-6 [contents] - 1992
- [c9]Xuejia Lai, Rainer A. Rueppel, Jack Woollven:
A Fast Cryptographic Checksum Algorithm Based on Stream Ciphers. AUSCRYPT 1992: 339-348 - [c8]Yvo Desmedt, Peter Landrock, Arjen K. Lenstra, Kevin S. McCurley
The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel). EUROCRYPT 1992: 194-199 - 1991
- [c7]Rainer A. Rueppel:
A Formal Approach to Security Architectures. EUROCRYPT 1991: 387-398
1980 – 1989
- 1989
- [c6]Rainer A. Rueppel:
On the Security of Schnorr's Pseudo Random Generator. EUROCRYPT 1989: 423-428 - 1988
- [c5]Rainer A. Rueppel:
Key Agreements Based on Function Composition. EUROCRYPT 1988: 3-10 - 1987
- [j1]Rainer A. Rueppel, Othmar Staffelbach:
Products of linear recurring sequences with maximum complexity. IEEE Trans. Inf. Theory 33(1): 124-131 (1987) - [c4]Rainer A. Rueppel:
When Shift Registers Clock Themselves. EUROCRYPT 1987: 53-64 - 1986
- [i1]Rainer A. Rueppel, Othmar Staffelbach:
Products of Linear Recurring Sequence with Maximum Complexity. EUROCRYPT 1986: 30-32 - 1985
- [c3]Rainer A. Rueppel:
Correlation Immunity and the Summation Generator. CRYPTO 1985: 260-272 - [c2]Rainer A. Rueppel:
Linear Complexity and Random Sequences. EUROCRYPT 1985: 167-188 - 1984
- [b1]Rainer A. Rueppel:
New approaches to stream ciphers. ETH Zurich, Zürich, Switzerland, 1984, pp. 1-202 - [c1]James L. Massey, Rainer A. Rueppel:
Linear Ciphers and Random Sequence Generators with Multiple Clocks. EUROCRYPT 1984: 74-87
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: