Modeling contact formation between atomic-sized gold tips via molecular dynamics

The formation and rupture of atomic-sized contacts is modelled by means of molecular dynamics simulations. Such nano-contacts are realized in scanning tunnelling microscope and mechanically controlled break junction experiments. These instruments routinely measure the conductance across the nano-sized electrodes as they are brought into contact and separated, permitting conductance traces to be recorded that are plots of conductance versus the distance between the electrodes. One interesting feature of the conductance traces is that for some metals and geometric configurations a jump in the value of the conductance is observed right before contact between the electrodes, a phenomenon known as jump-to-contact. This paper considers, from a computational point of view, the dynamics of contact between two gold nano-electrodes. Repeated indentation of the two surfaces on each other is performed in two crystallographic orientations of face-centred cubic gold, namely (001) and (111). Ultimately, the intention is to identify the structures at the atomic level at the moment of first contact between the surfaces, since the value of the conductance is related to the minimum cross-section in the contact region. Conductance values obtained in this way are determined using first principles electronic transport calculations, with atomic configurations taken from the molecular dynamics simulations serving as input structures.Comment: 6 pages, 4 figures, conference submissio

On the Design of Cryptographic Primitives

The main objective of this work is twofold. On the one hand, it gives a brief overview of the area of two-party cryptographic protocols. On the other hand, it proposes new schemes and guidelines for improving the practice of robust protocol design. In order to achieve such a double goal, a tour through the descriptions of the two main cryptographic primitives is carried out. Within this survey, some of the most representative algorithms based on the Theory of Finite Fields are provided and new general schemes and specific algorithms based on Graph Theory are proposed