Whirlwind: a new cryptographic hash function

A new cryptographic hash function Whirlwind is presented. We give the full specification and explain the design rationale. We show how the hash function can be implemented efficiently in software and give first performance numbers. A detailed analysis of the security against state-of-the-art cryptanalysis methods is also provided. In comparison to the algorithms submitted to the SHA-3 competition, Whirlwind takes recent developments in cryptanalysis into account by design. Even though software performance is not outstanding, it compares favourably with the 512-bit versions of SHA-3 candidates such as LANE or the original CubeHash proposal and is about on par with ECHO and MD6.

Message Integrity in the World Wide Web: Use of Nested Hash Function and a Fast Stream Cipher

The focus of this work is to provide authentication and confidentiality of messages in a swift and cost effective manner to suit the fast growing Internet applications. A nested hash function with lower computational and storage demands is designed with a view to providing authentication as also to encrypt the message as well as the hash code using a fast stream cipher MAJE4 with a variable key size of 128-bit or 256-bit for achieving confidentiality. Both nested Hash function and MAJE4 stream cipher algorithm use primitive computational operators commonly found in microprocessors; this makes the method simple and fast to implement both in hardware and software. Since the memory requirement is less, it can be used for handheld devices for security purposes.

Jerim-320: A New 320-Bit Hash Function Compared To Hash Functions With Parallel Branches

This paper describes JERIM-320, a new 320-bit hash function used for ensuring message integrity and details a comparison with popular hash functions of similar design. JERIM-320 and FORK -256 operate on four parallel lines of message processing while RIPEMD-320 operates on two parallel lines. Popular hash functions like MD5 and SHA-1 use serial successive iteration for designing compression functions and hence are less secure. The parallel branches help JERIM-320 to achieve higher level of security using multiple iterations and processing on the message blocks. The focus of this work is to prove the ability of JERIM 320 in ensuring the integrity of messages to a higher degree to suit the fast growing internet applications

Biometric authentication of users through iris by using key binding and similarity preserving hash functions = Autenticación biométrica de usuarios a través del iris mediante la ocultación de claves y funciones resumen que preservan la similitud

El extraordinario auge de las nuevas tecnologías de la información, el desarrollo de la Internet de las Cosas, el comercio electrónico, las redes sociales, la telefonía móvil y la computación y almacenamiento en la nube, han proporcionado grandes beneficios en todos los ámbitos de la sociedad. Junto a éstos, se presentan nuevos retos para la protección y privacidad de la información y su contenido, como la suplantación de personalidad y la pérdida de la confidencialidad e integridad de los documentos o las comunicaciones electrónicas. Este hecho puede verse agravado por la falta de una frontera clara que delimite el mundo personal del mundo laboral en cuanto al acceso de la información. En todos estos campos de la actividad personal y laboral, la Criptografía ha jugado un papel fundamental aportando las herramientas necesarias para garantizar la confidencialidad, integridad y disponibilidad tanto de la privacidad de los datos personales como de la información. Por otro lado, la Biometría ha propuesto y ofrecido diferentes técnicas con el fin de garantizar la autentificación de individuos a través del uso de determinadas características personales como las huellas dáctilares, el iris, la geometría de la mano, la voz, la forma de caminar, etc. Cada una de estas dos ciencias, Criptografía y Biometría, aportan soluciones a campos específicos de la protección de datos y autentificación de usuarios, que se verían enormemente potenciados si determinadas características de ambas ciencias se unieran con vistas a objetivos comunes. Por ello es imperativo intensificar la investigación en estos ámbitos combinando los algoritmos y primitivas matemáticas de la Criptografía con la Biometría para dar respuesta a la demanda creciente de nuevas soluciones más técnicas, seguras y fáciles de usar que potencien de modo simultáneo la protección de datos y la identificacíón de usuarios. En esta combinación el concepto de biometría cancelable ha supuesto una piedra angular en el proceso de autentificación e identificación de usuarios al proporcionar propiedades de revocación y cancelación a los ragos biométricos. La contribución de esta tesis se basa en el principal aspecto de la Biometría, es decir, la autentificación segura y eficiente de usuarios a través de sus rasgos biométricos, utilizando tres aproximaciones distintas: 1. Diseño de un esquema criptobiométrico borroso que implemente los principios de la biometría cancelable para identificar usuarios lidiando con los problemas acaecidos de la variabilidad intra e inter-usuarios. 2. Diseño de una nueva función hash que preserva la similitud (SPHF por sus siglas en inglés). Actualmente estas funciones se usan en el campo del análisis forense digital con el objetivo de buscar similitudes en el contenido de archivos distintos pero similares de modo que se pueda precisar hasta qué punto estos archivos pudieran ser considerados iguales. La función definida en este trabajo de investigación, además de mejorar los resultados de las principales funciones desarrolladas hasta el momento, intenta extender su uso a la comparación entre patrones de iris. 3. Desarrollando un nuevo mecanismo de comparación de patrones de iris que considera tales patrones como si fueran señales para compararlos posteriormente utilizando la transformada de Walsh-Hadarmard. Los resultados obtenidos son excelentes teniendo en cuenta los requerimientos de seguridad y privacidad mencionados anteriormente. Cada uno de los tres esquemas diseñados han sido implementados para poder realizar experimentos y probar su eficacia operativa en escenarios que simulan situaciones reales: El esquema criptobiométrico borroso y la función SPHF han sido implementados en lenguaje Java mientras que el proceso basado en la transformada de Walsh-Hadamard en Matlab. En los experimentos se ha utilizado una base de datos de imágenes de iris (CASIA) para simular una población de usuarios del sistema. En el caso particular de la función de SPHF, además se han realizado experimentos para comprobar su utilidad en el campo de análisis forense comparando archivos e imágenes con contenido similar y distinto. En este sentido, para cada uno de los esquemas se han calculado los ratios de falso negativo y falso positivo. ABSTRACT The extraordinary increase of new information technologies, the development of Internet of Things, the electronic commerce, the social networks, mobile or smart telephony and cloud computing and storage, have provided great benefits in all areas of society. Besides this fact, there are new challenges for the protection and privacy of information and its content, such as the loss of confidentiality and integrity of electronic documents and communications. This is exarcebated by the lack of a clear boundary between the personal world and the business world as their differences are becoming narrower. In both worlds, i.e the personal and the business one, Cryptography has played a key role by providing the necessary tools to ensure the confidentiality, integrity and availability both of the privacy of the personal data and information. On the other hand, Biometrics has offered and proposed different techniques with the aim to assure the authentication of individuals through their biometric traits, such as fingerprints, iris, hand geometry, voice, gait, etc. Each of these sciences, Cryptography and Biometrics, provides tools to specific problems of the data protection and user authentication, which would be widely strengthen if determined characteristics of both sciences would be combined in order to achieve common objectives. Therefore, it is imperative to intensify the research in this area by combining the basics mathematical algorithms and primitives of Cryptography with Biometrics to meet the growing demand for more secure and usability techniques which would improve the data protection and the user authentication. In this combination, the use of cancelable biometrics makes a cornerstone in the user authentication and identification process since it provides revocable or cancelation properties to the biometric traits. The contributions in this thesis involve the main aspect of Biometrics, i.e. the secure and efficient authentication of users through their biometric templates, considered from three different approaches. The first one is designing a fuzzy crypto-biometric scheme using the cancelable biometric principles to take advantage of the fuzziness of the biometric templates at the same time that it deals with the intra- and inter-user variability among users without compromising the biometric templates extracted from the legitimate users. The second one is designing a new Similarity Preserving Hash Function (SPHF), currently widely used in the Digital Forensics field to find similarities among different files to calculate their similarity level. The function designed in this research work, besides the fact of improving the results of the two main functions of this field currently in place, it tries to expand its use to the iris template comparison. Finally, the last approach of this thesis is developing a new mechanism of handling the iris templates, considering them as signals, to use the Walsh-Hadamard transform (complemented with three other algorithms) to compare them. The results obtained are excellent taking into account the security and privacy requirements mentioned previously. Every one of the three schemes designed have been implemented to test their operational efficacy in situations that simulate real scenarios: The fuzzy crypto-biometric scheme and the SPHF have been implemented in Java language, while the process based on the Walsh-Hadamard transform in Matlab. The experiments have been performed using a database of iris templates (CASIA-IrisV2) to simulate a user population. The case of the new SPHF designed is special since previous to be applied i to the Biometrics field, it has been also tested to determine its applicability in the Digital Forensic field comparing similar and dissimilar files and images. The ratios of efficiency and effectiveness regarding user authentication, i.e. False Non Match and False Match Rate, for the schemes designed have been calculated with different parameters and cases to analyse their behaviour.

A family of perfect hashing methods

Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating order preserving minimal perfect hash functions. We show that almost all members of the family construct space and time optimal order preserving minimal perfect hash functions, and we identify the one with minimum constants. Members of the family generate a hash function in two steps. First a special kind of function into an r-graph is computed probabilistically. Then this function is refined deterministically to a minimal perfect hash function. We give strong theoretical evidence that the first step uses linear random time. The second step runs in linear deterministic time. The family not only has theoretical importance, but also offers the fastest known method for generating perfect hash functions.

On the computational security of a distributed key distribution scheme

In a distributed key distribution scheme, a set of servers helps a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some servers and some users has no information about the key of a noncorrupted group. In this work, we formalize the security analysis of one such scheme which was not considered in the original proposal. We prove the scheme is secure in the random oracle model, assuming that the Decisional Diffie-Hellman (DDH) problem is hard to solve. We also detail a possible modification of that scheme and the one in which allows us to prove the security of the schemes without assuming that a specific hash function behaves as a random oracle. As usual, this improvement in the security of the schemes is at the cost of an efficiency loss.

Algorisme de hashing basat en hiperplans separadors localment òptims

L'objectiu principal d'aquest projecte és dissenyar un algorisme de hashing que ens permeti, donat un conjunt d'hiperplans separadors, reduïr-ne el nombre, minimitzant la pèrdua d'eficiència en la classificació.

Um algoritmo de criptografia de chave pública semanticamente seguro baseado em curvas elípticas

Esta dissertação apresenta o desenvolvimento de um novo algoritmo de criptografia de chave pública. Este algoritmo apresenta duas características que o tornam único, e que foram tomadas como guia para a sua concepção. A primeira característica é que ele é semanticamente seguro. Isto significa que nenhum adversário limitado polinomialmente consegue obter qualquer informação parcial sobre o conteúdo que foi cifrado, nem mesmo decidir se duas cifrações distintas correspondem ou não a um mesmo conteúdo. A segunda característica é que ele depende, para qualquer tamanho de texto claro, de uma única premissa de segurança: que o logaritmo no grupo formado pelos pontos de uma curva elíptica de ordem prima seja computacionalmente intratável. Isto é obtido garantindo-se que todas as diferentes partes do algoritmo sejam redutíveis a este problema. É apresentada também uma forma simples de estendê-lo a fim de que ele apresente segurança contra atacantes ativos, em especial, contra ataques de texto cifrado adaptativos. Para tanto, e a fim de manter a premissa de que a segurança do algoritmo seja unicamente dependente do logaritmo elíptico, é apresentada uma nova função de resumo criptográfico (hash) cuja segurança é baseada no mesmo problema.

Fragile logo watermarking for public authentication

A new fragile logo watermarking scheme is proposed for public authentication and integrity verification of images. The security of the proposed block-wise scheme relies on a public encryption algorithm and a hash function. The encoding and decoding methods can provide public detection capabilities even in the absence of the image indices and the original logos. Furthermore, the detector automatically authenticates input images and extracts possible multiple logos and image indices, which can be used not only to localise tampered regions, but also to identify the original source of images used to generate counterfeit images. Results are reported to illustrate the effectiveness of the proposed method.

Cryptographic Primitives with Quasigroup Transformations

AMS Subj. Classification: Primary 20N05, Secondary 94A60

Relationship Between Orofacial Function, Dentofacial Morphology, And Bite Force In Young Subjects.

The aim was to evaluate the relationship between orofacial function, dentofacial morphology, and bite force in young subjects. Three hundred and sixteen subjects were divided according to dentition stage (early, intermediate, and late mixed and permanent dentition). Orofacial function was screened using the Nordic Orofacial Test-Screening (NOT-S). Orthodontic treatment need, bite force, lateral and frontal craniofacial dimensions and presence of sleep bruxism were also assessed. The results were submitted to descriptive statistics, normality and correlation tests, analysis of variance, and multiple linear regression to test the relationship between NOT-S scores and the studied independent variables. The variance of NOT-S scores between groups was not significant. The evaluation of the variables that significantly contributed to NOT-S scores variation showed that age and presence of bruxism related to higher NOT-S total scores, while the increase in overbite measurement and presence of closed lip posture related to lower scores. Bite force did not show a significant relationship with scores of orofacial dysfunction. No significant correlations between craniofacial dimensions and NOT-S scores were observed. Age and sleep bruxism were related to higher NOT-S scores, while the increase in overbite measurement and closed lip posture contributed to lower scores of orofacial dysfunction.

Impaired Compensatory Beta-cell Function And Growth In Response To High-fat Diet In Ldl Receptor Knockout Mice.

In this study, we investigated the effect of low density lipoprotein receptor (LDLr) deficiency on gap junctional connexin 36 (Cx36) islet content and on the functional and growth response of pancreatic beta-cells in C57BL/6 mice fed a high-fat (HF) diet. After 60 days on regular or HF diet, the metabolic state and morphometric islet parameters of wild-type (WT) and LDLr-/- mice were assessed. HF diet-fed WT animals became obese and hypercholesterolaemic as well as hyperglycaemic, hyperinsulinaemic, glucose intolerant and insulin resistant, characterizing them as prediabetic. Also they showed a significant decrease in beta-cell secretory response to glucose. Overall, LDLr-/- mice displayed greater susceptibility to HF diet as judged by their marked cholesterolaemia, intolerance to glucose and pronounced decrease in glucose-stimulated insulin secretion. HF diet induced similarly in WT and LDLr-/- mice, a significant decrease in Cx36 beta-cell content as revealed by immunoblotting. Prediabetic WT mice displayed marked increase in beta-cell mass mainly due to beta-cell hypertrophy/replication. Nevertheless, HF diet-fed LDLr-/- mice showed no significant changes in beta-cell mass, but lower islet-duct association (neogenesis) and higher beta-cell apoptosis index were seen as compared to controls. The higher metabolic susceptibility to HF diet of LDLr-/- mice may be explained by a deficiency in insulin secretory response to glucose associated with lack of compensatory beta-cell expansion.

Long-term Postoperative Atrophy Of Contralateral Hippocampus And Cognitive Function In Unilateral Refractory Mtle With Unilateral Hippocampal Sclerosis.

This study aimed to evaluate long-term atrophy in contralateral hippocampal volume after surgery for unilateral MTLE, as well as the cognitive outcome for patients submitted to either selective transsylvian amygdalohippocampectomy (SelAH) or anterior temporal lobe resection (ATL). We performed a longitudinal study of 47 patients with MRI signs of unilateral hippocampal sclerosis (23 patients with right-sided hippocampal sclerosis) who underwent surgical treatment for MTLE. They underwent preoperative/postoperative high-resolution MRI as well as neuropsychological assessment for memory and estimated IQ. To investigate possible changes in the contralateral hippocampus of patients, we included 28 controls who underwent two MRIs at long-term intervals. The volumetry using preoperative MRI showed significant hippocampal atrophy ipsilateral to the side of surgery when compared with controls (p<0.0001) but no differences in contralateral hippocampal volumes. The mean postoperative follow-up was 8.7 years (± 2.5 SD; median=8.0). Our patients were classified as Engel I (80%), Engel II (18.2%), and Engel III (1.8%). We observed a small but significant reduction in the contralateral hippocampus of patients but no volume changes in controls. Most of the patients presented small declines in both estimated IQ and memory, which were more pronounced in patients with left TLE and in those with persistent seizures. Different surgical approaches did not impose differences in seizure control or in cognitive outcome. We observed small declines in cognitive scores with most of these patients, which were worse in patients with left-sided resection and in those who continued to suffer from postoperative seizures. We also demonstrated that manual volumetry can reveal a reduction in volume in the contralateral hippocampus, although this change was mild and could not be detected by visual analysis. These new findings suggest that dynamic processes continue to act after the removal of the hippocampus, and further studies with larger groups may help in understanding the underlying mechanisms.

Doehlert Design-desirability Function Multi-criteria Optimal Separation Of 17 Phenolic Compounds From Extra-virgin Olive Oil By Capillary Zone Electrophoresis.

In Brazil, the consumption of extra-virgin olive oil (EVOO) is increasing annually, but there are no experimental studies concerning the phenolic compound contents of commercial EVOO. The aim of this work was to optimise the separation of 17 phenolic compounds already detected in EVOO. A Doehlert matrix experimental design was used, evaluating the effects of pH and electrolyte concentration. Resolution, runtime and migration time relative standard deviation values were evaluated. Derringer's desirability function was used to simultaneously optimise all 37 responses. The 17 peaks were separated in 19min using a fused-silica capillary (50μm internal diameter, 72cm of effective length) with an extended light path and 101.3mmolL(-1) of boric acid electrolyte (pH 9.15, 30kV). The method was validated and applied to 15 EVOO samples found in Brazilian supermarkets.

Effect Of Exercise Test On Pulmonary Function Of Obese Adolescents.

to investigate the pulmonary response to exercise of non-morbidly obese adolescents, considering the gender. a prospective cross-sectional study was conducted with 92 adolescents (47 obese and 45 eutrophic), divided in four groups according to obesity and gender. Anthropometric parameters, pulmonary function (spirometry and oxygen saturation [SatO2]), heart rate (HR), blood pressure (BP), respiratory rate (RR), and respiratory muscle strength were measured. Pulmonary function parameters were measured before, during, and after the exercise test. BP and HR were higher in obese individuals during the exercise test (p = 0.0001). SatO2 values decreased during exercise in obese adolescents (p = 0.0001). Obese males had higher levels of maximum inspiratory and expiratory pressures (p = 0.0002) when compared to obese and eutrophic females. Obese males showed lower values of maximum voluntary ventilation, forced vital capacity, and forced expiratory volume in the first second when compared to eutrophic males, before and after exercise (p = 0.0005). Obese females had greater inspiratory capacity compared to eutrophic females (p = 0.0001). Expiratory reserve volume was lower in obese subjects when compared to controls (p ≤ 0,05). obese adolescents presented changes in pulmonary function at rest and these changes remained present during exercise. The spirometric and cardiorespiratory values were different in the four study groups. The present data demonstrated that, in spite of differences in lung growth, the model of fat distribution alters pulmonary function differently in obese female and male adolescents.