Article
Refine
Year of publication
Document Type
- Article (30905) (remove)
Language
- English (15532)
- German (13366)
- Portuguese (696)
- French (387)
- Croatian (251)
- Spanish (250)
- Italian (133)
- Turkish (113)
- Multiple languages (36)
- Latin (35)
Has Fulltext
- yes (30905)
Keywords
- Deutsch (503)
- taxonomy (434)
- Literatur (299)
- Hofmannsthal, Hugo von (185)
- new species (185)
- Rezeption (178)
- Übersetzung (163)
- Filmmusik (155)
- Johann Wolfgang von Goethe (131)
- Vormärz (117)
Institute
- Medizin (5316)
- Physik (1810)
- Biowissenschaften (1133)
- Biochemie und Chemie (1110)
- Extern (1108)
- Gesellschaftswissenschaften (803)
- Frankfurt Institute for Advanced Studies (FIAS) (715)
- Geowissenschaften (589)
- Präsidium (453)
- Philosophie (448)
- Rechtswissenschaft (403)
- Informatik (400)
- Senckenbergische Naturforschende Gesellschaft (353)
- Institut für Sozialforschung (IFS) (345)
- Institut für Ökologie, Evolution und Diversität (341)
- Geschichtswissenschaften (334)
- Psychologie (299)
- E-Finance Lab e.V. (294)
- Biochemie, Chemie und Pharmazie (277)
- Biodiversität und Klima Forschungszentrum (BiK-F) (269)
- Neuere Philologien (263)
- Kulturwissenschaften (218)
- Wirtschaftswissenschaften (189)
- Pharmazie (184)
- Exzellenzcluster Makromolekulare Komplexe (179)
- Psychologie und Sportwissenschaften (157)
- Erziehungswissenschaften (148)
- MPI für Biophysik (134)
- Georg-Speyer-Haus (130)
- Universitätsbibliothek (130)
- Exzellenzcluster Die Herausbildung normativer Ordnungen (128)
- Sportwissenschaften (126)
- Geowissenschaften / Geographie (122)
- SFB 268 (119)
- Sonderforschungsbereiche / Forschungskollegs (112)
- Mathematik (110)
- Zentrum für Biomolekulare Magnetische Resonanz (BMRZ) (110)
- Geographie (103)
- Institut für Deutsche Sprache (IDS) Mannheim (99)
- Zentrum für Arzneimittelforschung, Entwicklung und Sicherheit (ZAFES) (92)
- MPI für Hirnforschung (90)
- Buchmann Institut für Molekulare Lebenswissenschaften (BMLS) (63)
- Informatik und Mathematik (56)
- Sprachwissenschaften (53)
- Deutsches Institut für Internationale Pädagogische Forschung (DIPF) (50)
- Evangelische Theologie (49)
- Fachübergreifend (41)
- ELEMENTS (40)
- Sprach- und Kulturwissenschaften (39)
- MPI für empirische Ästhetik (36)
- Sustainable Architecture for Finance in Europe (SAFE) (32)
- Ernst Strüngmann Institut (25)
- Institut für sozial-ökologische Forschung (ISOE) (24)
- Philosophie und Geschichtswissenschaften (22)
- Cornelia Goethe Centrum für Frauenstudien und die Erforschung der Geschlechterverhältnisse (CGC) (20)
- House of Finance (HoF) (20)
- Center for Membrane Proteomics (CMP) (18)
- Exzellenzcluster Herz-Lungen-System (18)
- Starker Start ins Studium: Qualitätspakt Lehre (18)
- Sigmund-Freud Institut – Forschungsinstitut fur Psychoanalyse und ihre Anwendungen (16)
- Katholische Theologie (15)
- Zentrum für Interdisziplinäre Afrikaforschung (ZIAF) (15)
- Universität des 3. Lebensalters e.V. (12)
- keine Angabe Institut (11)
- Center for Financial Studies (CFS) (9)
- Helmholtz International Center for FAIR (9)
- Institut für Wirtschaft, Arbeit, und Kultur (IWAK) (9)
- Interdisziplinäres Zentrum für Neurowissenschaften Frankfurt (IZNF) (9)
- Zentrum für Nordamerika-Forschung (ZENAF) (9)
- Zentrum für Weiterbildung (9)
- Center for Scientific Computing (CSC) (7)
- DFG-Forschergruppen (7)
- Institute for Monetary and Financial Stability (IMFS) (7)
- LOEWE-Schwerpunkt für Integrative Pilzforschung (7)
- Institute for Law and Finance (ILF) (6)
- Frobenius Institut (5)
- Goethe-Zentrum für Wissenschaftliches Rechnen (G-CSC) (5)
- Hessische Stiftung für Friedens- und Konfliktforschung (HSFK) (5)
- Hochschulrechenzentrum (5)
- Forschungszentrum Historische Geisteswissenschaften (FHG) (4)
- Interdisziplinäres Zentrum für Ostasienstudien (IZO) (4)
- LOEWE-Schwerpunkt Außergerichtliche und gerichtliche Konfliktlösung (3)
- Akademie für Bildungsforschung und Lehrerbildung (bisher: Zentrum für Lehrerbildung und Schul- und Unterrichtsforschung) (2)
- Institut für Bienenkunde (2)
- Institut für Religionsphilosophische Forschung (2)
- (1)
- Centre for Drug Research (1)
- Diagnostic Center of Acute Leukemia (1)
- Europäische Akademie der Arbeit in der Universität Frankfurt am Main (1)
- Fachübergreifende Einrichtungen (1)
- Wilhelm-Merton-Zentrum (1)
- Zentrale Einrichtung (1)
- studiumdigitale (1)
We analyse a continued fraction algorithm (abbreviated CFA) for arbitrary dimension n showing that it produces simultaneous diophantine approximations which are up to the factor 2^((n+2)/4) best possible. Given a real vector x=(x_1,...,x_{n-1},1) in R^n this CFA generates a sequence of vectors (p_1^(k),...,p_{n-1}^(k),q^(k)) in Z^n, k=1,2,... with increasing integers |q^{(k)}| satisfying for i=1,...,n-1 | x_i - p_i^(k)/q^(k) | <= 2^((n+2)/4) sqrt(1+x_i^2) |q^(k)|^(1+1/(n-1)) By a theorem of Dirichlet this bound is best possible in that the exponent 1+1/(n-1) can in general not be increased.
Parallel FFT-hashing
(1994)
We propose two families of scalable hash functions for collision resistant hashing that are highly parallel and based on the generalized fast Fourier transform (FFT). FFT hashing is based on multipermutations. This is a basic cryptographic primitive for perfect generation of diffusion and confusion which generalizes the boxes of the classic FFT. The slower FFT hash functions iterate a compression function. For the faster FFT hash functions all rounds are alike with the same number of message words entering each round.
Let b1, . . . , bm 2 IRn be an arbitrary basis of lattice L that is a block Korkin Zolotarev basis with block size ¯ and let ¸i(L) denote the successive minima of lattice L. We prove that for i = 1, . . . ,m 4 i + 3 ° 2 i 1 ¯ 1 ¯ · kbik2/¸i(L)2 · ° 2m i ¯ 1 ¯ i + 3 4 where °¯ is the Hermite constant. For ¯ = 3 we establish the optimal upper bound kb1k2/¸1(L)2 · µ3 2¶m 1 2 1 and we present block Korkin Zolotarev lattice bases for which this bound is tight. We improve the Nearest Plane Algorithm of Babai (1986) using block Korkin Zolotarev bases. Given a block Korkin Zolotarev basis b1, . . . , bm with block size ¯ and x 2 L(b1, . . . , bm) a lattice point v can be found in time ¯O(¯) satisfying kx vk2 · m° 2m ¯ 1 ¯ minu2L kx uk2.
Let G be a group of prime order q with generator g. We study hardcore subsets H is include in G of the discrete logarithm (DL) log g in the model of generic algorithms. In this model we count group operations such as multiplication, division while computations with non-group data are for free. It is known from Nechaev (1994) and Shoup (1997) that generic DL-algorithms for the entire group G must perform p2q generic steps. We show that DL-algorithms for small subsets H is include in G require m/ 2 + o(m) generic steps for almost all H of size #H = m with m <= sqrt(q). Conversely, m/2 + 1 generic steps are su±cient for all H is include in G of even size m. Our main result justifies to generate secret DL-keys from seeds that are only 1/2 * log2 q bits long.
We show that P(n)*(P(n)) for p = 2 with its geometrically induced structure maps is not an Hopf algebroid because neither the augmentation Epsilon nor the coproduct Delta are multiplicative. As a consequence the algebra structure of P(n)*(P(n)) is slightly different from what was supposed to be the case. We give formulas for Epsilon(xy) and Delta(xy) and show that the inversion of the formal group of P(n) is induced by an antimultiplicative involution Xi : P(n) -> P(n). Some consequences for multiplicative and antimultiplicative automorphisms of K(n) for p = 2 are also discussed.
The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickell and the other to Lagarias and Odlyzko, which in polynomial time solve almost all subset sum problems of sufficiently low density. Both methods rely on basis reduction algorithms to find short nonzero vectors in special lattices. The Lagarias-Odlyzko algorithm would solve almost all subset sum problems of density < 0.6463 . . . in polynomial time if it could invoke a polynomial-time algorithm for finding the shortest non-zero vector in a lattice. This paper presents two modifications of that algorithm, either one of which would solve almost all problems of density < 0.9408 . . . if it could find shortest non-zero vectors in lattices. These modifications also yield dramatic improvements in practice when they are combined with known lattice basis reduction algorithms.
Public key signature schemes are necessary for the access control to communication networks and for proving the authenticity of sensitive messages such as electronic fund transfers. Since the invention of the RSA scheme by Rivest, Shamir and Adleman (1978) research has focused on improving the e±ciency of these schemes. In this paper we present an efficient algorithm for generating public key signatures which is particularly suited for interactions between smart cards and terminals.