Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Alexander Meurer"'
Autor:
Vanessa C. S. Oliveira, Marie Altmanová, Patrik F. Viana, Tariq Ezaz, Luiz A. C. Bertollo, Petr Ráb, Thomas Liehr, Ahmed Al-Rikabi, Eliana Feldberg, Terumi Hatanaka, Sebastian Scholz, Alexander Meurer, Marcelo de Bello Cioffi
Publikováno v:
Cells, Vol 10, Iss 6, p 1397 (2021)
Although crocodilians have attracted enormous attention in other research fields, from the cytogenetic point of view, this group remains understudied. Here, we analyzed the karyotypes of eight species formally described from the Alligatoridae family
Externí odkaz:
https://doaj.org/article/a29e8100492d4366ac2f6d0152b15f5e
Publikováno v:
atp magazin. 63:76-81
Während Feldgeräte zur Steuerung und Regelung meist über digitale Feldbuslösungen angebunden werden, fristet die PLTSicherheitstechnikauch heute noch ihr Dasein im „Dornröschenschlaf“ - in analoger 4…20-mA-Technik mit vollständig separier
Publikováno v:
Thin-Walled Structures. 107:648-656
The buckling load of cylindrical shells is heavily dependent on geometric imperfections and other non-traditional imperfections such as scattering wall thicknesses or loading imperfections. In this paper, the probabilistic perturbation load approach
Autor:
Alexander Meurer
Publikováno v:
ATZelektronik worldwide. 9:16-19
Autor:
Alexander Meurer
Publikováno v:
ATZelektronik. 9:36-41
Die Verwaltung kryptographischer Schluessel und Zertifikate spielt in modernen Fahrzeugen eine zentrale Rolle, um den wachsenden Security-Anforderungen gerecht zu werden. Eine besondere Herausforderung ist die Implementierung einer Infrastruktur fuer
Publikováno v:
Post-Quantum Cryptography-5th International Workshop (PQ Crypto 2013, Limoges, France, June 4-7, 2013. Proceedings), 16-33
STARTPAGE=16;ENDPAGE=33;TITLE=Post-Quantum Cryptography-5th International Workshop (PQ Crypto 2013, Limoges, France, June 4-7, 2013. Proceedings)
Post-Quantum Cryptography ISBN: 9783642386152
PQCrypto
STARTPAGE=16;ENDPAGE=33;TITLE=Post-Quantum Cryptography-5th International Workshop (PQ Crypto 2013, Limoges, France, June 4-7, 2013. Proceedings)
Post-Quantum Cryptography ISBN: 9783642386152
PQCrypto
This paper introduces a subset-sum algorithm with heuristic asymptotic cost exponent below 0.25. The new algorithm combines the 2010 Howgrave-Graham–Joux subset-sum algorithm with a new streamlined data structure for quantum walks on Johnson graphs
Publikováno v:
Advances in Cryptology – EUROCRYPT 2012 ISBN: 9783642290107
EUROCRYPT
EUROCRYPT
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes relies on the assumption that it is hard to decode random linear codes. R
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::486983ffb4b4784cd36440792e4e1f43
https://doi.org/10.1007/978-3-642-29011-4_31
https://doi.org/10.1007/978-3-642-29011-4_31
Autor:
Alexander Meurer, Gottfried Herold
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642329272
SCN
SCN
In this paper, we revisit Shamir's well-known attack (and a variant due to Lagarias) on the basic Merkle-Hellman Knapsack cryptosystem (MH scheme). The main observation is that the superincreasing property of the secret key sequence $\boldsymbol{\mat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e19a41ba5ff598b2bd5772d01e47a03e
https://doi.org/10.1007/978-3-642-32928-9_18
https://doi.org/10.1007/978-3-642-32928-9_18
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642253843
ASIACRYPT
ASIACRYPT
Decoding random linear codes is a fundamental problem in complexity theory and lies at the heart of almost all code-based cryptography. The best attacks on the most prominent code-based cryptosystems such as McEliece directly use decoding algorithms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78dc11c9a272d8651db74f6277e77ffb
https://doi.org/10.1007/978-3-642-25385-0_6
https://doi.org/10.1007/978-3-642-25385-0_6
Publikováno v:
Advances in Cryptology – CRYPTO 2010 ISBN: 9783642146220
CRYPTO
CRYPTO
Let pk = (N, e) be an RSA public key with corresponding secret key sk = (p, q, d, dp, dq, qp-1). Assume that we obtain partial error-free information of sk, e.g., assume that we obtain half of the most significant bits of p. Then there are well-known
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c4ba392d3b8e6499d8d1966b013a9b1
https://doi.org/10.1007/978-3-642-14623-7_19
https://doi.org/10.1007/978-3-642-14623-7_19