429 research outputs found
First Stars: Abundance Patterns from O to Zn and Derived SNe Yields in the Early Galaxy
International audienceMost of the work reported here has been conducted within the ESO Large Programme 165.N-0276 "Galaxy Formation, Early Nucleosynthesis, and the First Stars", which has covered 4 periods 65-68, from April 2000 to November 2001, with a total of 38 nights in visitor mode. The team had R. Cayrel as PI, and 13 CoIs
The evolution of the milky way from its earliest phases: constraints on stellar nucleosynthesis
We computed the evolution of the abundances of O, Mg, Si, Ca, K, Ti, Sc, Ni, Mn, Co, Fe and Zn in the Milky Way. We made use of the most widely adopted nucleosynthesis calculations and compared the model results with observational data with the aim of imposing constraints upon stellar yields. To best fit the data in the solar neighborhood, when adopting the Woosley & Weaver (1995, ApJS, 101, 181) yields for massive stars and the Iwamoto et al. (\cite{Iwamoto99}, ApJS, 125, 439) ones for type Ia SNe, it is required that: i) the Mg yields should be increased in stars with masses from 11 to 20 Msun and decreased in masses larger than 20 Msun. The Mg yield should be also increased in SNe Ia. ii) The Si yields should be slightly increased in stars above 40 Msun, whereas those of Ti should be increased between 11 and 20 Msun and above 30 Msun. iii) The Cr and Mn yields should be increased in stars with masses in the range 11-20 Msun; iv) the Co yields in SNe Ia should be larger and smaller in stars in the range 11-20 Msun; v) the Ni yield from type Ia SNe should be decreased; vi) the Zn yield from type Ia SNe should be increased. vii) The yields of O (metallicity dependent SN models), Ca, Fe, Ni, and Zn (the solar abundance case) in massive stars from Woosley & Weaver (\cite{Woosley95}) are the best to fit the abundance patterns of these elements since they do not need any changes. We also adopted the yields by Nomoto et al. (\cite{Nomoto97}, Nucl. Phys. A, 621, 467) and Limongi & Chieffi (\cite{Limongi03}, ApJ, 592, 404) for massive stars and discuss the corrections required in these yields in order to fit the observations. Finally, the small spread in the [el/Fe] ratios in the metallicity range from [Fe/H] = -4.0 up to -3.0 dex (Cayrel et al. \cite{Cayrel03}, A&A, 416, 1117) is a clear sign that the halo of the Milky Way was well mixed even in the earliest phases of its evolution
Observational Evidence for Atmospheric Physical Characteristics Relevant to Stellar Evolution
Precision Engineering behind European Astronomy Programmes
The fields of astronomy science have presented significant precision engineering challenges. Numerous solutions for these fields of science have achieved unprecedented levels of accuracy, sensitivity and sheer scale. Notwithstanding of their importance to science understanding, many of these precision engineering developments have become key enabling technologies for wealth generation and other human well-being issues. This paper provides a brief historical overview of astronomy instruments. Later, details of critical precision engineering developments that supported the establishment of leading European astronomical instruments are illustrated. Finally, significant precision engineering demands to enable future sciences programmes are introduced
Abundances in the Uranium-rich Star CS 31082-001
The recent discovery by Cayrel et al. of U in CS 31082-001 along with Os and Ir at greatly enhanced abundances but with [Fe/H] = -2.9 strongly reinforces the argument that there are at least two kinds of Type II supernova (SN II) sources for r-nuclei. One source is the high-frequency H events responsible for heavy r-nuclei (A > 135) but not Fe. The H-yields calculated from data on other ultra-metal-poor stars and the Sun provide a template for quantitatively predicting the abundances of all other r-elements. In CS 31082-001 these should show a significant deficiency at A < 135 relative to the solar r-pattern. It is proposed that CS 31082-001 should have had a companion that exploded as an SN II H event. If the binary survived the explosion, this star should now have a compact companion, most likely a stellar-mass black hole. Comparison of abundance data with predicted values and a search for a compact companion should provide a stringent test of the proposed r-process model. The U-Th age determined by Cayrel et al. for CS 31082-001 is, to within substantial uncertainties, in accord with the r-process age determined from solar system data. The time gap between the big bang and the onset of normal star formation allows r-process chronometers to provide only a lower limit on the age of the universe
Piégeage par implantation d'hélium : Interactions dopants/défauts
Thèse sous la direction de R. Jérisian et D. Mathiot soutenue le 10 décembre 2003 - Université Louis Pasteur (Strasbourg I) - Laboratoire PHASE (PHysique et Applications des SEmi-conducteurs, UPR 292
Lithium in NGC 6397 (Gonzalez Hernandez+, 2009)
Photometric data of the dwarf and subgiant stars of the globular cluster NGC 6397. We also provide the signal-to-noise of the spectra, the 3D and 1D Halpha-based effective temperatures, 3D Li abundances, and the equivalent widths and errors: dEWa: Error of the equivalent width measurements estimated from a fitting routine that uses as free parameters the velocity shift, the continuum location, and the equivalent width of the Li line. dEWb: Error of the equivalent width associated to the signal-to-noise ratio and the wavelength dispersion of the spectra, derived using Cayrel's formula (Cayrel, 1988, IAU Symp. 132: The Impact of Very High S/N Spectroscopy on Stellar Physics, 132, 345).VizieR On-line Data Catalog: J/A+A/505/L13info:eu-repo/semantics/publishe
Post-quantum Cryptography: Lattice Identification Schemes
This survey presents an overview and a comparative analysis of the state of art in post-quantum identification schemes based on lattices. Furthermore, we propose an adaptation of the HB family of identification in a lattice context. The aspects taken into account in such comparison are performance, security, communication costs, underlying hard-problem, completeness, soundness, and key sizes.7903/04/15729748Blum, A., Kalai, A., Wasserman, H., Noise-tolerant learning, the parity problem, and the statistical query model (2003) J. ACM, 50 (4), pp. 506-519Cayrel, P.-L., Lindner, R., Rückert, M., Silva, R., Improved zero-knowledge identification with lattices (2010) ProvSec 2010, pp. 1-17Cayrel, P.-L., Lindner, R., Rückert, M., Silva, R., A lattice-based threshold ring signature scheme (2010) LatinCrypt 2010, pp. 255-272Cayrel, P.-L., Véron, P., El Yousfi Alaoui, S.M., Improved code-based identification scheme (2010) SAC 2010, , http://arxiv.org/abs/1001.3017v1Fiat, A., Shamir, A., How to prove yourself: Practical solutions to identification and signature problems (1986) CRYPTO, pp. 186-194. , volume 263 of Lecture Notes in Computer Science, (Andrew M. Odlyzko, ed.), SpringerFossorier, M.P.C., Mihaljevic, M.J., Imai, H., Cui, Y., Matsuura, K., An algorithm for solving the LPN problem and its application to security evaluation of the HB protocols for RFID authentication (2006) INDOCRYPT, pp. 48-62. , volume 4329 of Lecture Notes in Computer Science, (Rana Barua and Tanja Lange, eds.), SpringerHalevi, S., Micali, S., Practical and provably-secure commitment schemes from collision-free hashing (1996) CRYPTO, pp. 201-215. , volume 1109 of Lecture Notes in Computer Science, (Neal Koblitz, ed.), SpringerHirschhorn, P., Hoffstein, J., Howgrave-Graham, N., Whyte, W., Choosing NT- RUEncrypt parameters in light of combined lattice reduction and MITM approaches (2009) Applied Cryptography and Network Security, pp. 437-455. , SpringerHopper, N.J., Blum, M., Secure human identification protocols (2001) ASIACRYPT, pp. 52-66. , volume 2248 of Lecture Notes in Computer Science, (Colin Boyd, ed.), SpringerJuels, A., Weis, S.A., Authenticating pervasive devices with human protocols (2005) CRYPTO, pp. 293-308. , volume 3621 of Lecture Notes in Computer Science, (Victor Shoup, ed.), SpringerKatz, J., Shin, J.S., Parallel and concurrent security of the HB and HB+Protocols (2006) EUROCRYPT, pp. 73-87. , volume 4004 of Lecture Notes in Computer Science, (Serge Vaudenay, ed.), SpringerKawachi, A., Tanaka, K., Xagawa, K., Concurrently secure identification schemes based on the worst-case hardness of lattice problems (2008) ASIACRYPT '08: Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security, pp. 372-389. , Springer-Verlag, Berlin, HeidelbergLi, Z., Gong, G., Qin, Z., (2009) Secure and Efficient HB-CM Entity Authentication Protocol, , http://eprint.iacr.org/Lindner, R., Peikert, C., Better key sizes (and attacks) for LWE-based encryption (2011) CT-RSA, pp. 319-339. , volume 6558 of Lecture Notes in Computer Science, (Aggelos Kiayias, ed.), SpringerLyubashevsky, V., Lattice-based identification schemes secure under active attacks (2008) Public Key Cryptography, pp. 162-179. , volume 4939 of Lecture Notes in Computer Science, (Ronald Cramer, ed.), SpringeLyubashevsky, V., Fiat-Shamir with aborts: Applications to lattice and factoring- based signatures (2009) ASIACRYPT, pp. 598-616. , volume 5912 of Lecture Notes in Computer Science, (Mitsuru Matsui, ed.), SpringerOkamoto, T., Provably secure and practical identification schemes and corresponding signature schemes (1993) CRYPTO, pp. 31-53. , volume 740 of Lecture Notes in Computer Science, (Ernest F. Brickell, ed.), SpringerOuafi, K., Overbeck, R., Vaudenay, S., On the security of HB# against a man-in-the-middle attack (2008) ASIACRYPT, pp. 108-124. , volume 5350 of Lecture Notes in Computer Science, (Josef Pieprzyk, ed.), SpringerPeikert, C., Public-key cryptosystems from the worst-case shortest vector problem: Extended abstract (2009) STOC, pp. 333-342. , (Michael Mitzenmacher, ed.), ACMRegev, O., On lattices, learning with errors, random linear codes, and cryptography (2009) J. ACM, 566Rückert, M., Schneider, M., Estimating the security of lattice-based cryptosystems (2010) IACR Cryptology EPrint Archive, 137Shor, P.W., Polynominal time algorithms for discrete logarithms and factoring on a quantum computer (1994) ANTS, p. 289. , volume 877 of Lecture Notes in Computer Science, (Leonard M. Adleman and Ming-Deh A. Huang, eds.), SpringerSilva, R., Campello, A., Dahab, R., LWE-based identification schemes (2011) CoRR, , abs/1109.0631Stern, J., A new identification scheme based on syndrome decoding (1993) CRYPTO, pp. 13-21. , volume 773 of Lecture Notes in Computer Science, (Douglas R. Stinson, ed.), SpringerVéron, P., Improved identification schemes based on error-correcting codes (1996) Appl. Algebra Eng. Commun. Comput., 81, pp. 57-69Xagawa, K., Tanaka, K., Zero-knowledge protocols for NTRU: Application to identification and proof of plaintext knowledge (2009) ProvSec, pp. 198-213. , volume 5848 of Lecture Notes in Computer Science, (Josef Pieprzyk and Fangguo Zhang, eds.), Springe
- …
