---
_id: '3022'
author:
- first_name: Alexander
  full_name: May, Alexander
  last_name: May
- first_name: Joseph H.
  full_name: Silverman, Joseph H.
  last_name: Silverman
citation:
  ama: 'May A, Silverman JH. Dimension Reduction Methods for Convolution Modular Lattices.
    In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin
    Heidelberg; 2007:110-125. doi:<a href="https://doi.org/10.1007/3-540-44670-2_10">10.1007/3-540-44670-2_10</a>'
  apa: 'May, A., &#38; Silverman, J. H. (2007). Dimension Reduction Methods for Convolution
    Modular Lattices. In <i>Lecture Notes in Computer Science</i> (pp. 110–125). Berlin,
    Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/3-540-44670-2_10">https://doi.org/10.1007/3-540-44670-2_10</a>'
  bibtex: '@inbook{May_Silverman_2007, place={Berlin, Heidelberg}, title={Dimension
    Reduction Methods for Convolution Modular Lattices}, DOI={<a href="https://doi.org/10.1007/3-540-44670-2_10">10.1007/3-540-44670-2_10</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
    author={May, Alexander and Silverman, Joseph H.}, year={2007}, pages={110–125}
    }'
  chicago: 'May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods
    for Convolution Modular Lattices.” In <i>Lecture Notes in Computer Science</i>,
    110–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href="https://doi.org/10.1007/3-540-44670-2_10">https://doi.org/10.1007/3-540-44670-2_10</a>.'
  ieee: 'A. May and J. H. Silverman, “Dimension Reduction Methods for Convolution
    Modular Lattices,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2007, pp. 110–125.'
  mla: May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution
    Modular Lattices.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg,
    2007, pp. 110–25, doi:<a href="https://doi.org/10.1007/3-540-44670-2_10">10.1007/3-540-44670-2_10</a>.
  short: 'A. May, J.H. Silverman, in: Lecture Notes in Computer Science, Springer
    Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 110–125.'
date_created: 2018-06-05T08:27:10Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-44670-2_10
page: 110-125
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540424888'
  - '9783540446705'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Dimension Reduction Methods for Convolution Modular Lattices
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '3026'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
citation:
  ama: 'Blömer J. A Probabilistic Zero-Test for Expressions Involving Roots of Rational
    Numbers. In: <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg: Springer Berlin
    Heidelberg; 2007:151-162. doi:<a href="https://doi.org/10.1007/3-540-68530-8_13">10.1007/3-540-68530-8_13</a>'
  apa: 'Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots
    of Rational Numbers. In <i>Algorithms — ESA’ 98</i> (pp. 151–162). Berlin, Heidelberg:
    Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/3-540-68530-8_13">https://doi.org/10.1007/3-540-68530-8_13</a>'
  bibtex: '@inbook{Blömer_2007, place={Berlin, Heidelberg}, title={A Probabilistic
    Zero-Test for Expressions Involving Roots of Rational Numbers}, DOI={<a href="https://doi.org/10.1007/3-540-68530-8_13">10.1007/3-540-68530-8_13</a>},
    booktitle={Algorithms — ESA’ 98}, publisher={Springer Berlin Heidelberg}, author={Blömer,
    Johannes}, year={2007}, pages={151–162} }'
  chicago: 'Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving
    Roots of Rational Numbers.” In <i>Algorithms — ESA’ 98</i>, 151–62. Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2007. <a href="https://doi.org/10.1007/3-540-68530-8_13">https://doi.org/10.1007/3-540-68530-8_13</a>.'
  ieee: 'J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of
    Rational Numbers,” in <i>Algorithms — ESA’ 98</i>, Berlin, Heidelberg: Springer
    Berlin Heidelberg, 2007, pp. 151–162.'
  mla: Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots
    of Rational Numbers.” <i>Algorithms — ESA’ 98</i>, Springer Berlin Heidelberg,
    2007, pp. 151–62, doi:<a href="https://doi.org/10.1007/3-540-68530-8_13">10.1007/3-540-68530-8_13</a>.
  short: 'J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin,
    Heidelberg, 2007, pp. 151–162.'
date_created: 2018-06-05T08:28:39Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-68530-8_13
page: 151-162
place: Berlin, Heidelberg
publication: Algorithms — ESA’ 98
publication_identifier:
  isbn:
  - '9783540648482'
  - '9783540685302'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '47650'
author:
- first_name: Steffen
  full_name: Ziegert, Steffen
  last_name: Ziegert
citation:
  ama: Ziegert S. <i>Approximierbarkeit durch konstante Stichproben unter Berücksichtigung
    verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem</i>.;
    2007.
  apa: Ziegert, S. (2007). <i>Approximierbarkeit durch konstante Stichproben unter
    Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem</i>.
  bibtex: '@book{Ziegert_2007, title={Approximierbarkeit durch konstante Stichproben
    unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem},
    author={Ziegert, Steffen}, year={2007} }'
  chicago: Ziegert, Steffen. <i>Approximierbarkeit durch konstante Stichproben unter
    Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem</i>,
    2007.
  ieee: S. Ziegert, <i>Approximierbarkeit durch konstante Stichproben unter Berücksichtigung
    verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem</i>. 2007.
  mla: Ziegert, Steffen. <i>Approximierbarkeit durch konstante Stichproben unter Berücksichtigung
    verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem</i>. 2007.
  short: S. Ziegert, Approximierbarkeit durch konstante Stichproben unter Berücksichtigung
    verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem, 2007.
date_created: 2023-10-05T13:36:17Z
date_updated: 2023-10-05T13:38:45Z
department:
- _id: '34'
- _id: '64'
language:
- iso: ger
status: public
title: Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener
  Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem
type: bachelorsthesis
user_id: '41047'
year: '2007'
...
---
_id: '47651'
author:
- first_name: Manuel
  full_name: Richert, Manuel
  last_name: Richert
citation:
  ama: Richert M. <i>Sichere Kryptosysteme durch Zero-Knowledge</i>.; 2007.
  apa: Richert, M. (2007). <i>Sichere Kryptosysteme durch Zero-Knowledge</i>.
  bibtex: '@book{Richert_2007, title={Sichere Kryptosysteme durch Zero-Knowledge},
    author={Richert, Manuel}, year={2007} }'
  chicago: Richert, Manuel. <i>Sichere Kryptosysteme durch Zero-Knowledge</i>, 2007.
  ieee: M. Richert, <i>Sichere Kryptosysteme durch Zero-Knowledge</i>. 2007.
  mla: Richert, Manuel. <i>Sichere Kryptosysteme durch Zero-Knowledge</i>. 2007.
  short: M. Richert, Sichere Kryptosysteme durch Zero-Knowledge, 2007.
date_created: 2023-10-05T13:36:33Z
date_updated: 2023-10-05T13:38:45Z
department:
- _id: '34'
- _id: '64'
language:
- iso: ger
status: public
title: Sichere Kryptosysteme durch Zero-Knowledge
type: bachelorsthesis
user_id: '41047'
year: '2007'
...
---
_id: '47688'
author:
- first_name: Wiebke
  full_name: Klein, Wiebke
  last_name: Klein
citation:
  ama: Klein W. <i>Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln</i>.;
    2007.
  apa: Klein, W. (2007). <i>Angriffe auf RSA-Varianten bei partiell bekannten geheimen
    Schlüsseln</i>.
  bibtex: '@book{Klein_2007, title={Angriffe auf RSA-Varianten bei partiell bekannten
    geheimen Schlüsseln}, author={Klein, Wiebke}, year={2007} }'
  chicago: Klein, Wiebke. <i>Angriffe auf RSA-Varianten bei partiell bekannten geheimen
    Schlüsseln</i>, 2007.
  ieee: W. Klein, <i>Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln</i>.
    2007.
  mla: Klein, Wiebke. <i>Angriffe auf RSA-Varianten bei partiell bekannten geheimen
    Schlüsseln</i>. 2007.
  short: W. Klein, Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln,
    2007.
date_created: 2023-10-05T16:32:56Z
date_updated: 2023-10-05T16:42:53Z
department:
- _id: '34'
- _id: '64'
keyword:
- Diplomarbeit
language:
- iso: ger
status: public
title: Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln
type: misc
user_id: '41047'
year: '2007'
...
---
_id: '47690'
author:
- first_name: Olga
  full_name: Käthler, Olga
  last_name: Käthler
citation:
  ama: Käthler O. <i>Kryptanalyse des EAC-Protokolls biometrischer Reisepässe</i>.;
    2007.
  apa: Käthler, O. (2007). <i>Kryptanalyse des EAC-Protokolls biometrischer Reisepässe</i>.
  bibtex: '@book{Käthler_2007, title={Kryptanalyse des EAC-Protokolls biometrischer
    Reisepässe}, author={Käthler, Olga}, year={2007} }'
  chicago: Käthler, Olga. <i>Kryptanalyse des EAC-Protokolls biometrischer Reisepässe</i>,
    2007.
  ieee: O. Käthler, <i>Kryptanalyse des EAC-Protokolls biometrischer Reisepässe</i>.
    2007.
  mla: Käthler, Olga. <i>Kryptanalyse des EAC-Protokolls biometrischer Reisepässe</i>.
    2007.
  short: O. Käthler, Kryptanalyse des EAC-Protokolls biometrischer Reisepässe, 2007.
date_created: 2023-10-05T16:34:07Z
date_updated: 2023-10-05T16:42:51Z
department:
- _id: '34'
- _id: '64'
keyword:
- Diplomarbeit
language:
- iso: ger
status: public
title: Kryptanalyse des EAC-Protokolls biometrischer Reisepässe
type: misc
user_id: '41047'
year: '2007'
...
---
_id: '47687'
author:
- first_name: Benedikt
  full_name: Brieden, Benedikt
  last_name: Brieden
citation:
  ama: Brieden B. <i>Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen
    Methode</i>.; 2007.
  apa: Brieden, B. (2007). <i>Analyse von verallgemeinerten RSA Polynomen mit Hilfe
    der Coppersmithschen Methode</i>.
  bibtex: '@book{Brieden_2007, title={Analyse von verallgemeinerten RSA Polynomen
    mit Hilfe der Coppersmithschen Methode}, author={Brieden, Benedikt}, year={2007}
    }'
  chicago: Brieden, Benedikt. <i>Analyse von verallgemeinerten RSA Polynomen mit Hilfe
    der Coppersmithschen Methode</i>, 2007.
  ieee: B. Brieden, <i>Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen
    Methode</i>. 2007.
  mla: Brieden, Benedikt. <i>Analyse von verallgemeinerten RSA Polynomen mit Hilfe
    der Coppersmithschen Methode</i>. 2007.
  short: B. Brieden, Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen
    Methode, 2007.
date_created: 2023-10-05T16:32:37Z
date_updated: 2023-10-05T16:53:56Z
ddc:
- '000'
department:
- _id: '34'
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: bhenrik
  date_created: 2023-10-05T16:32:30Z
  date_updated: 2023-10-05T16:53:56Z
  file_id: '47713'
  file_name: 2007_Brieden_AnalyseVonVerallgemeinertenRSAPolynomenMitHilfeDerCoppersmithschenMethode.pdf
  file_size: 612732
  relation: main_file
file_date_updated: 2023-10-05T16:53:56Z
has_accepted_license: '1'
keyword:
- Diplomarbeit
language:
- iso: ger
oa: '1'
status: public
title: Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen
  Methode
type: misc
user_id: '41047'
year: '2007'
...
---
_id: '47689'
author:
- first_name: Daniel
  full_name: Kuntze, Daniel
  last_name: Kuntze
citation:
  ama: Kuntze D. <i>Untersuchung von Clusteringalgorithmen für die Kullback-Leibler
    Divergenz</i>.; 2007.
  apa: Kuntze, D. (2007). <i>Untersuchung von Clusteringalgorithmen für die Kullback-Leibler
    Divergenz</i>.
  bibtex: '@book{Kuntze_2007, title={Untersuchung von Clusteringalgorithmen für die
    Kullback-Leibler Divergenz}, author={Kuntze, Daniel}, year={2007} }'
  chicago: Kuntze, Daniel. <i>Untersuchung von Clusteringalgorithmen für die Kullback-Leibler
    Divergenz</i>, 2007.
  ieee: D. Kuntze, <i>Untersuchung von Clusteringalgorithmen für die Kullback-Leibler
    Divergenz</i>. 2007.
  mla: Kuntze, Daniel. <i>Untersuchung von Clusteringalgorithmen für die Kullback-Leibler
    Divergenz</i>. 2007.
  short: D. Kuntze, Untersuchung von Clusteringalgorithmen für die Kullback-Leibler
    Divergenz, 2007.
date_created: 2023-10-05T16:33:44Z
date_updated: 2023-10-05T16:54:04Z
ddc:
- '000'
department:
- _id: '34'
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: bhenrik
  date_created: 2023-10-05T16:33:38Z
  date_updated: 2023-10-05T16:54:04Z
  file_id: '47715'
  file_name: 2007_Kuntze_UntersuchungVonClusteringalgorithmenFuerDieKLD.pdf
  file_size: 1078135
  relation: main_file
file_date_updated: 2023-10-05T16:54:04Z
has_accepted_license: '1'
keyword:
- Diplomarbeit
language:
- iso: ger
oa: '1'
status: public
title: Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz
type: misc
user_id: '41047'
year: '2007'
...
---
_id: '47686'
author:
- first_name: Julia
  full_name: Borghoff, Julia
  last_name: Borghoff
citation:
  ama: Borghoff J. <i>Vergleich multivariater Varianten der Methode von Coppersmith</i>.;
    2007.
  apa: Borghoff, J. (2007). <i>Vergleich multivariater Varianten der Methode von Coppersmith</i>.
  bibtex: '@book{Borghoff_2007, title={Vergleich multivariater Varianten der Methode
    von Coppersmith}, author={Borghoff, Julia}, year={2007} }'
  chicago: Borghoff, Julia. <i>Vergleich multivariater Varianten der Methode von Coppersmith</i>,
    2007.
  ieee: J. Borghoff, <i>Vergleich multivariater Varianten der Methode von Coppersmith</i>.
    2007.
  mla: Borghoff, Julia. <i>Vergleich multivariater Varianten der Methode von Coppersmith</i>.
    2007.
  short: J. Borghoff, Vergleich multivariater Varianten der Methode von Coppersmith,
    2007.
date_created: 2023-10-05T16:31:03Z
date_updated: 2023-10-05T16:53:40Z
ddc:
- '000'
department:
- _id: '34'
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: bhenrik
  date_created: 2023-10-05T16:30:56Z
  date_updated: 2023-10-05T16:53:40Z
  file_id: '47711'
  file_name: 2007_Borghoff_VergleichMultivariaterVariantenDerMethodeVonCoppersmith.pdf
  file_size: 550560
  relation: main_file
file_date_updated: 2023-10-05T16:53:40Z
has_accepted_license: '1'
keyword:
- Diplomarbeit
language:
- iso: ger
oa: '1'
status: public
title: Vergleich multivariater Varianten der Methode von Coppersmith
type: misc
user_id: '41047'
year: '2007'
...
---
_id: '2887'
author:
- first_name: Andreas Cord
  full_name: Landwehr, Andreas Cord
  last_name: Landwehr
citation:
  ama: Landwehr AC. <i>Untersuchungen zur Sicherheit einzelner RSA Bits</i>.; 2007.
  apa: Landwehr, A. C. (2007). <i>Untersuchungen zur Sicherheit einzelner RSA Bits</i>.
  bibtex: '@book{Landwehr_2007, title={Untersuchungen zur Sicherheit einzelner RSA
    Bits}, author={Landwehr, Andreas Cord}, year={2007} }'
  chicago: Landwehr, Andreas Cord. <i>Untersuchungen zur Sicherheit einzelner RSA
    Bits</i>, 2007.
  ieee: A. C. Landwehr, <i>Untersuchungen zur Sicherheit einzelner RSA Bits</i>. 2007.
  mla: Landwehr, Andreas Cord. <i>Untersuchungen zur Sicherheit einzelner RSA Bits</i>.
    2007.
  short: A.C. Landwehr, Untersuchungen zur Sicherheit einzelner RSA Bits, 2007.
date_created: 2018-05-25T09:12:40Z
date_updated: 2023-10-05T22:10:22Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: feidens
  date_created: 2018-05-25T09:12:31Z
  date_updated: 2023-10-05T22:10:21Z
  file_id: '2888'
  file_name: 2007_CordLandwehr_UntersuchungenZurSicherheitEinzelnerRSABits.pdf
  file_size: 889440
  relation: main_file
file_date_updated: 2023-10-05T22:10:21Z
has_accepted_license: '1'
language:
- iso: ger
oa: '1'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Untersuchungen zur Sicherheit einzelner RSA Bits
type: bachelorsthesis
user_id: '41047'
year: '2007'
...
---
_id: '47653'
author:
- first_name: Jaroslaw
  full_name: Klose, Jaroslaw
  last_name: Klose
citation:
  ama: Klose J. <i>Ein erschöpfende Suche vermeidender Algorithmus für allgemeines
    k-SAT</i>.; 2007.
  apa: Klose, J. (2007). <i>Ein erschöpfende Suche vermeidender Algorithmus für allgemeines
    k-SAT</i>.
  bibtex: '@book{Klose_2007, title={Ein erschöpfende Suche vermeidender Algorithmus
    für allgemeines k-SAT}, author={Klose, Jaroslaw}, year={2007} }'
  chicago: Klose, Jaroslaw. <i>Ein erschöpfende Suche vermeidender Algorithmus für
    allgemeines k-SAT</i>, 2007.
  ieee: J. Klose, <i>Ein erschöpfende Suche vermeidender Algorithmus für allgemeines
    k-SAT</i>. 2007.
  mla: Klose, Jaroslaw. <i>Ein erschöpfende Suche vermeidender Algorithmus für allgemeines
    k-SAT</i>. 2007.
  short: J. Klose, Ein erschöpfende Suche vermeidender Algorithmus für allgemeines
    k-SAT, 2007.
date_created: 2023-10-05T13:37:05Z
date_updated: 2023-10-05T22:11:02Z
ddc:
- '000'
department:
- _id: '34'
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: bhenrik
  date_created: 2023-10-05T22:06:24Z
  date_updated: 2023-10-05T22:11:02Z
  file_id: '47793'
  file_name: 2007_Klose_EinErschoepfendeSucheVermeidenderAlgorithmusFuerAllgemeinesKSAT.pdf
  file_size: 820701
  relation: main_file
file_date_updated: 2023-10-05T22:11:02Z
has_accepted_license: '1'
language:
- iso: ger
oa: '1'
status: public
title: Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT
type: bachelorsthesis
user_id: '41047'
year: '2007'
...
---
_id: '47652'
author:
- first_name: Martin
  full_name: Niemeier, Martin
  last_name: Niemeier
citation:
  ama: Niemeier M. <i>Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen
    Lösungen</i>.; 2007.
  apa: Niemeier, M. (2007). <i>Reduktionen von CVP mit wenigen Lösungen auf CVP mit
    eindeutigen Lösungen</i>.
  bibtex: '@book{Niemeier_2007, title={Reduktionen von CVP mit wenigen Lösungen auf
    CVP mit eindeutigen Lösungen}, author={Niemeier, Martin}, year={2007} }'
  chicago: Niemeier, Martin. <i>Reduktionen von CVP mit wenigen Lösungen auf CVP mit
    eindeutigen Lösungen</i>, 2007.
  ieee: M. Niemeier, <i>Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen
    Lösungen</i>. 2007.
  mla: Niemeier, Martin. <i>Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen
    Lösungen</i>. 2007.
  short: M. Niemeier, Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen
    Lösungen, 2007.
date_created: 2023-10-05T13:36:48Z
date_updated: 2023-10-05T22:10:53Z
ddc:
- '000'
department:
- _id: '34'
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: bhenrik
  date_created: 2023-10-05T22:06:09Z
  date_updated: 2023-10-05T22:10:53Z
  file_id: '47792'
  file_name: 2007_Niemeier_ReduktionenVonCVPMitWenigenLoesungenAufCVPMitEindeutigenLoesungen.pdf
  file_size: 719476
  relation: main_file
file_date_updated: 2023-10-05T22:10:53Z
has_accepted_license: '1'
language:
- iso: ger
oa: '1'
status: public
title: Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen
type: bachelorsthesis
user_id: '41047'
year: '2007'
...
---
_id: '47654'
author:
- first_name: Stefan
  full_name: Birkner, Stefan
  last_name: Birkner
citation:
  ama: Birkner S. <i>Behandlung von Korrekturtermen in der Methode von Coppersmith</i>.;
    2007.
  apa: Birkner, S. (2007). <i>Behandlung von Korrekturtermen in der Methode von Coppersmith</i>.
  bibtex: '@book{Birkner_2007, title={Behandlung von Korrekturtermen in der Methode
    von Coppersmith}, author={Birkner, Stefan}, year={2007} }'
  chicago: Birkner, Stefan. <i>Behandlung von Korrekturtermen in der Methode von Coppersmith</i>,
    2007.
  ieee: S. Birkner, <i>Behandlung von Korrekturtermen in der Methode von Coppersmith</i>.
    2007.
  mla: Birkner, Stefan. <i>Behandlung von Korrekturtermen in der Methode von Coppersmith</i>.
    2007.
  short: S. Birkner, Behandlung von Korrekturtermen in der Methode von Coppersmith,
    2007.
date_created: 2023-10-05T13:37:30Z
date_updated: 2023-10-05T22:11:15Z
ddc:
- '000'
department:
- _id: '34'
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: bhenrik
  date_created: 2023-10-05T22:06:38Z
  date_updated: 2023-10-05T22:11:14Z
  file_id: '47794'
  file_name: 2007_Birkner_BehandlungVonKorrekturtermenInDerMethodeVonCoppersmith.pdf
  file_size: 185880
  relation: main_file
file_date_updated: 2023-10-05T22:11:14Z
has_accepted_license: '1'
language:
- iso: ger
oa: '1'
status: public
title: Behandlung von Korrekturtermen in der Methode von Coppersmith
type: bachelorsthesis
user_id: '41047'
year: '2007'
...
---
_id: '55571'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Stefanie
  full_name: ' Naewe, Stefanie'
  id: '1971'
  last_name: ' Naewe'
citation:
  ama: 'Blömer J,  Naewe S. Sampling methods for shortest vectors, closest vectors
    and successive minima. In: <i>Proceedings of the 34th ICALP</i>. Vol 4596. Lecture
    notes in Computer Science. Invited to Theoretical Computer Science. Springer Verlag;
    2007:65-77.'
  apa: Blömer, J., &#38;  Naewe, S. (2007). Sampling methods for shortest vectors,
    closest vectors and successive minima. <i>Proceedings of the 34th ICALP</i>, <i>4596</i>,
    65–77.
  bibtex: '@inproceedings{Blömer_ Naewe_2007, series={Lecture notes in Computer Science.
    Invited to Theoretical Computer Science}, title={Sampling methods for shortest
    vectors, closest vectors and successive minima}, volume={4596}, booktitle={Proceedings
    of the 34th ICALP}, publisher={Springer Verlag}, author={Blömer, Johannes and  Naewe,
    Stefanie}, year={2007}, pages={65–77}, collection={Lecture notes in Computer Science.
    Invited to Theoretical Computer Science} }'
  chicago: Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest Vectors,
    Closest Vectors and Successive Minima.” In <i>Proceedings of the 34th ICALP</i>,
    4596:65–77. Lecture Notes in Computer Science. Invited to Theoretical Computer
    Science. Springer Verlag, 2007.
  ieee: J. Blömer and S.  Naewe, “Sampling methods for shortest vectors, closest vectors
    and successive minima,” in <i>Proceedings of the 34th ICALP</i>, 2007, vol. 4596,
    pp. 65–77.
  mla: Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest Vectors,
    Closest Vectors and Successive Minima.” <i>Proceedings of the 34th ICALP</i>,
    vol. 4596, Springer Verlag, 2007, pp. 65–77.
  short: 'J. Blömer, S.  Naewe, in: Proceedings of the 34th ICALP, Springer Verlag,
    2007, pp. 65–77.'
date_created: 2024-08-08T12:14:05Z
date_updated: 2024-08-08T12:14:09Z
department:
- _id: '64'
intvolume: '      4596'
language:
- iso: eng
page: 65-77
publication: Proceedings of the 34th ICALP
publication_status: published
publisher: Springer Verlag
series_title: Lecture notes in Computer Science. Invited to Theoretical Computer Science
status: public
title: Sampling methods for shortest vectors, closest vectors and successive minima
type: conference
user_id: '49063'
volume: 4596
year: '2007'
...
---
_id: '3003'
abstract:
- lang: eng
  text: We give a brief introduction to probabilistic encryptions. This serves as
    an example how randomness plays a pivotal role in cryptographic systems that satisfy
    advanced security concepts.
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
citation:
  ama: Blömer J. Randomness and Secrecy - A Brief Introduction. <i>Journal of Universal
    Computer Science (JUCS)</i>. 2006;(6):654--671. doi:<a href="https://doi.org/10.3217/jucs-012-06-0654">10.3217/jucs-012-06-0654</a>
  apa: Blömer, J. (2006). Randomness and Secrecy - A Brief Introduction. <i>Journal
    of Universal Computer Science (J.UCS)</i>, (6), 654--671. <a href="https://doi.org/10.3217/jucs-012-06-0654">https://doi.org/10.3217/jucs-012-06-0654</a>
  bibtex: '@article{Blömer_2006, title={Randomness and Secrecy - A Brief Introduction},
    DOI={<a href="https://doi.org/10.3217/jucs-012-06-0654">10.3217/jucs-012-06-0654</a>},
    number={6}, journal={Journal of Universal Computer Science (J.UCS)}, author={Blömer,
    Johannes}, year={2006}, pages={654--671} }'
  chicago: 'Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” <i>Journal
    of Universal Computer Science (J.UCS)</i>, no. 6 (2006): 654--671. <a href="https://doi.org/10.3217/jucs-012-06-0654">https://doi.org/10.3217/jucs-012-06-0654</a>.'
  ieee: J. Blömer, “Randomness and Secrecy - A Brief Introduction,” <i>Journal of
    Universal Computer Science (J.UCS)</i>, no. 6, pp. 654--671, 2006.
  mla: Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” <i>Journal
    of Universal Computer Science (J.UCS)</i>, no. 6, 2006, pp. 654--671, doi:<a href="https://doi.org/10.3217/jucs-012-06-0654">10.3217/jucs-012-06-0654</a>.
  short: J. Blömer, Journal of Universal Computer Science (J.UCS) (2006) 654--671.
date_created: 2018-06-05T08:13:39Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.3217/jucs-012-06-0654
issue: '6'
page: 654--671
publication: Journal of Universal Computer Science (J.UCS)
publication_status: published
status: public
title: Randomness and Secrecy - A Brief Introduction
type: journal_article
user_id: '25078'
year: '2006'
...
---
_id: '3004'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Volker
  full_name: Krummel, Volker
  last_name: Krummel
citation:
  ama: 'Blömer J, Krummel V. Fault Based Collision Attacks on AES. In: <i>Lecture
    Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg;
    2006:106-120. doi:<a href="https://doi.org/10.1007/11889700_11">10.1007/11889700_11</a>'
  apa: 'Blömer, J., &#38; Krummel, V. (2006). Fault Based Collision Attacks on AES.
    In <i>Lecture Notes in Computer Science</i> (pp. 106–120). Berlin, Heidelberg:
    Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/11889700_11">https://doi.org/10.1007/11889700_11</a>'
  bibtex: '@inbook{Blömer_Krummel_2006, place={Berlin, Heidelberg}, title={Fault Based
    Collision Attacks on AES}, DOI={<a href="https://doi.org/10.1007/11889700_11">10.1007/11889700_11</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes and Krummel, Volker}, year={2006}, pages={106–120} }'
  chicago: 'Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on
    AES.” In <i>Lecture Notes in Computer Science</i>, 106–20. Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2006. <a href="https://doi.org/10.1007/11889700_11">https://doi.org/10.1007/11889700_11</a>.'
  ieee: 'J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in <i>Lecture
    Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg,
    2006, pp. 106–120.'
  mla: Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.”
    <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp.
    106–20, doi:<a href="https://doi.org/10.1007/11889700_11">10.1007/11889700_11</a>.
  short: 'J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin
    Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.'
date_created: 2018-06-05T08:14:42Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/11889700_11
page: 106-120
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540462507'
  - '9783540462514'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Fault Based Collision Attacks on AES
type: book_chapter
user_id: '25078'
year: '2006'
...
---
_id: '3005'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Martin
  full_name: Otto, Martin
  last_name: Otto
citation:
  ama: 'Blömer J, Otto M. Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.
    In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin
    Heidelberg; 2006:13-23. doi:<a href="https://doi.org/10.1007/11889700_2">10.1007/11889700_2</a>'
  apa: 'Blömer, J., &#38; Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm
    Reconsidered. In <i>Lecture Notes in Computer Science</i> (pp. 13–23). Berlin,
    Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/11889700_2">https://doi.org/10.1007/11889700_2</a>'
  bibtex: '@inbook{Blömer_Otto_2006, place={Berlin, Heidelberg}, title={Wagner’s Attack
    on a Secure CRT-RSA Algorithm Reconsidered}, DOI={<a href="https://doi.org/10.1007/11889700_2">10.1007/11889700_2</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes and Otto, Martin}, year={2006}, pages={13–23} }'
  chicago: 'Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA
    Algorithm Reconsidered.” In <i>Lecture Notes in Computer Science</i>, 13–23. Berlin,
    Heidelberg: Springer Berlin Heidelberg, 2006. <a href="https://doi.org/10.1007/11889700_2">https://doi.org/10.1007/11889700_2</a>.'
  ieee: 'J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,”
    in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin
    Heidelberg, 2006, pp. 13–23.'
  mla: Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm
    Reconsidered.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg,
    2006, pp. 13–23, doi:<a href="https://doi.org/10.1007/11889700_2">10.1007/11889700_2</a>.
  short: 'J. Blömer, M. Otto, in: Lecture Notes in Computer Science, Springer Berlin
    Heidelberg, Berlin, Heidelberg, 2006, pp. 13–23.'
date_created: 2018-06-05T08:15:48Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/11889700_2
page: 13-23
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540462507'
  - '9783540462514'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered
type: book_chapter
user_id: '25078'
year: '2006'
...
---
_id: '3007'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Martin
  full_name: Otto, Martin
  last_name: Otto
- first_name: Jean-Pierre
  full_name: Seifert, Jean-Pierre
  last_name: Seifert
citation:
  ama: 'Blömer J, Otto M, Seifert J-P. Sign Change Fault Attacks on Elliptic Curve
    Cryptosystems. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg:
    Springer Berlin Heidelberg; 2006:36-52. doi:<a href="https://doi.org/10.1007/11889700_4">10.1007/11889700_4</a>'
  apa: 'Blömer, J., Otto, M., &#38; Seifert, J.-P. (2006). Sign Change Fault Attacks
    on Elliptic Curve Cryptosystems. In <i>Lecture Notes in Computer Science</i> (pp.
    36–52). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/11889700_4">https://doi.org/10.1007/11889700_4</a>'
  bibtex: '@inbook{Blömer_Otto_Seifert_2006, place={Berlin, Heidelberg}, title={Sign
    Change Fault Attacks on Elliptic Curve Cryptosystems}, DOI={<a href="https://doi.org/10.1007/11889700_4">10.1007/11889700_4</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}, year={2006},
    pages={36–52} }'
  chicago: 'Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “Sign Change Fault
    Attacks on Elliptic Curve Cryptosystems.” In <i>Lecture Notes in Computer Science</i>,
    36–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href="https://doi.org/10.1007/11889700_4">https://doi.org/10.1007/11889700_4</a>.'
  ieee: 'J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic
    Curve Cryptosystems,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2006, pp. 36–52.'
  mla: Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.”
    <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp.
    36–52, doi:<a href="https://doi.org/10.1007/11889700_4">10.1007/11889700_4</a>.
  short: 'J. Blömer, M. Otto, J.-P. Seifert, in: Lecture Notes in Computer Science,
    Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 36–52.'
date_created: 2018-06-05T08:17:12Z
date_updated: 2022-01-06T06:58:50Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/11889700_4
file:
- access_level: closed
  content_type: application/pdf
  creator: feidens
  date_created: 2018-06-05T08:18:56Z
  date_updated: 2018-06-05T08:18:56Z
  file_id: '3009'
  file_name: SignChangeFaultAttacksOnECC.pdf
  file_size: 259146
  relation: main_file
  success: 1
file_date_updated: 2018-06-05T08:18:56Z
has_accepted_license: '1'
page: 36-52
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540462507'
  - '9783540462514'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Sign Change Fault Attacks on Elliptic Curve Cryptosystems
type: book_chapter
user_id: '25078'
year: '2006'
...
---
_id: '47649'
author:
- first_name: Rafael
  full_name: Funke, Rafael
  last_name: Funke
citation:
  ama: Funke R. <i>Implementierung und Simulation von Cache-Angriffen auf AES</i>.;
    2006.
  apa: Funke, R. (2006). <i>Implementierung und Simulation von Cache-Angriffen auf
    AES</i>.
  bibtex: '@book{Funke_2006, title={Implementierung und Simulation von Cache-Angriffen
    auf AES}, author={Funke, Rafael}, year={2006} }'
  chicago: Funke, Rafael. <i>Implementierung und Simulation von Cache-Angriffen auf
    AES</i>, 2006.
  ieee: R. Funke, <i>Implementierung und Simulation von Cache-Angriffen auf AES</i>.
    2006.
  mla: Funke, Rafael. <i>Implementierung und Simulation von Cache-Angriffen auf AES</i>.
    2006.
  short: R. Funke, Implementierung und Simulation von Cache-Angriffen auf AES, 2006.
date_created: 2023-10-05T13:35:58Z
date_updated: 2023-10-05T13:38:48Z
department:
- _id: '34'
- _id: '64'
language:
- iso: ger
status: public
title: Implementierung und Simulation von Cache-Angriffen auf AES
type: bachelorsthesis
user_id: '41047'
year: '2006'
...
---
_id: '47648'
author:
- first_name: Jonas
  full_name: Schrieb, Jonas
  last_name: Schrieb
citation:
  ama: Schrieb J. <i>Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit</i>.;
    2006.
  apa: Schrieb, J. (2006). <i>Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit</i>.
  bibtex: '@book{Schrieb_2006, title={Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit},
    author={Schrieb, Jonas}, year={2006} }'
  chicago: Schrieb, Jonas. <i>Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit</i>,
    2006.
  ieee: J. Schrieb, <i>Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit</i>.
    2006.
  mla: Schrieb, Jonas. <i>Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit</i>.
    2006.
  short: J. Schrieb, Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit, 2006.
date_created: 2023-10-05T13:35:24Z
date_updated: 2023-10-05T22:09:19Z
ddc:
- '000'
department:
- _id: '34'
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: bhenrik
  date_created: 2023-10-05T22:05:00Z
  date_updated: 2023-10-05T22:09:19Z
  file_id: '47791'
  file_name: 2006_Schrieb_VonIdentitaetsbasiertenKryptosystemenZuCCASicherheit.pdf
  file_size: 1091810
  relation: main_file
file_date_updated: 2023-10-05T22:09:19Z
has_accepted_license: '1'
language:
- iso: ger
oa: '1'
status: public
title: Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit
type: bachelorsthesis
user_id: '41047'
year: '2006'
...