Relevant bibliographies by topics / Hashek

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Hashek'

Author: Grafiati
Published: 4 June 2025
Last updated: 23 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Hashek.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Hashek"

1

Steinebach, Martin. "A Close Look at Robust Hash Flip Positions." Electronic Imaging 2021, no. 4 (2021): 345–1. http://dx.doi.org/10.2352/issn.2470-1173.2021.4.mwsf-345.

Full text
Abstract:
Images can be recognized by cryptographic or robust hashes during forensic investigation or content filtering. Cryptographic methods tend to be too fragile, robust methods may leak information about the hashed images. Combining robust and cryptographic methods can solve both problems, but requires a good prediction of hash bit positions most likely to break. Previous research shows the potential of this approach, but evaluation results still have rather high error rates, especially many false negatives. In this work we have a detailed look at the behavior of robust hashes under attacks and the potential of prediction derived from distance from median and learning from attacks.
APA, Harvard, Vancouver, ISO, and other styles
2

Tetreault, Chantal. "“What do you think about having beauty marks on your-Hashek !”: Innovative and Impolite Uses of an Arabic Politeness Formula among French Teenagers." Journal of Linguistic Anthropology 25, no. 3 (2015): 285–302. http://dx.doi.org/10.1111/jola.12098.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Quilala, Rogel Ladia, Ariel M. Sison, and Ruji P. Medina. "Modified SHA-1 Algorithm." Indonesian Journal of Electrical Engineering and Computer Science 11, no. 3 (2018): 1027. http://dx.doi.org/10.11591/ijeecs.v11.i3.pp1027-1034.

Full text
Abstract:
Hashes are used to check the integrity of data. This paper modified SHA-1 by incorporating mixing method in every round for better diffusion. The modification increased the hash output to 192-bits. Increasing the output increases the strength because breaking the hash takes longer. Based on the different message types, avalanche percentage of modified SHA-1 showed better diffusion at 51.64%, higher than the target 50%, while SHA-1 achieved 46.61%. The average execution time noted for modified SHA-1 is 0.33 seconds while SHA-1 is 0.08 seconds. Time increases as the number of messages hashed increases; the difference is negligible in fewer messages. <a name="_Hlk507405879"></a>On character hits, that is - no same character in the same position, modified SHA-1 achieved lower hit rate because of the mixing method added. The modifications’ effectiveness was also evaluated using a hash test program. After inputting 1000 hashes from random strings, the result shows no duplicate hash.
APA, Harvard, Vancouver, ISO, and other styles
4

Rogel, L. Quilala, M. Sison Ariel, and P. Medina Ruji. "Modified SHA-1 Algorithm." Indonesian Journal of Electrical Engineering and Computer Science 11, no. 3 (2018): 1027–34. https://doi.org/10.11591/ijeecs.v11.i3.pp1027-1034.

Full text
Abstract:
Hashes are used to check the integrity of data. This paper modified SHA-1 by incorporating mixing method in every round for better diffusion. The modification increased the hash output to 192-bits. Increasing the output increases the strength because breaking the hash takes longer. Based on the different message types, avalanche percentage of modified SHA-1 showed better diffusion at 51.64%, higher than the target 50%, while SHA-1 achieved 46.61%. The average execution time noted for modified SHA-1 is 0.33 seconds while SHA-1 is 0.08 seconds. Time increases as the number of messages hashed increases; the difference is negligible in fewer messages. On character hits, that is - no same character in the same position, modified SHA-1 achieved lower hit rate because of the mixing method added. The modifications’ effectiveness was also evaluated using a hash test program. After inputting 1000 hashes from random strings, the result shows no duplicate hash.
APA, Harvard, Vancouver, ISO, and other styles
5

MERMUTLU, MEHMET BEDRI, and MASOUMEH EKHTIARI CHAROYMAGHI. "Handwritten poems of the 16th century Iranian poet of the Ottoman court Hashem (Hashmi) Ajam." A Journal of Iranology Studies 1, no. 18 (2023): 1–14. http://dx.doi.org/10.5152/ajis.2023.220716.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hadjieleftheriou, Marios, Xiaohui Yu, Nick Koudas, and Divesh Srivastava. "Hashed samples." Proceedings of the VLDB Endowment 1, no. 1 (2008): 201–12. http://dx.doi.org/10.14778/1453856.1453883.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gutmann, P., D. Naccache, and C. C. Palmer. "When Hashes Collide." IEEE Security and Privacy Magazine 3, no. 3 (2005): 68–71. http://dx.doi.org/10.1109/msp.2005.84.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rosenthal, Gilbert S. "Two Sides of One Coin: Hillul Hashem and Kiddush Hashem." Journal of Ecumenical Studies 55, no. 3 (2020): 415–36. http://dx.doi.org/10.1353/ecu.2020.0035.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Marletta, Daniele, Alessandro Midolo, and Emiliano Tramontana. "A Blockchain-Based Strategy for Certifying Timestamps in a Distributed Healthcare Emergency Response Systems." Future Internet 17, no. 5 (2025): 210. https://doi.org/10.3390/fi17050210.

Full text
Abstract:
A high level of data integrity is a strong requirement in systems where the life of people depends on accurate and timely responses. In healthcare emergency response systems, a centralized authority that handles data related to occurring events is prone to challenges, such as, e.g., disputes over event timestamps and data authenticity. To address both the potential lack of trust among collaborating parties and the inability of an authority to clearly certify events by itself, this paper proposes a blockchain-based framework designed to provide proof of integrity and authenticity of data in healthcare emergency response systems. The proposed solution integrates blockchain technology to certify the accuracy of events throughout their incident lifecycle. Critical events are timestamped and hashed using SHA-256; then, such hashes are stored immutably on an EVM-compatible blockchain via smart contracts. The system combines blockchain technology with cloud storage to ensure scalability, security, and transparency. Blockchain technology provides the advantage of eliminating a trusted server, providing timestamping and reducing costs by forgoing such a service. The experimental results, using publicly available incident data, demonstrated the feasibility and effectiveness of this approach. The system provides a cost-effective, scalable solution for managing incident data while keeping a proof of their integrity. The proposed blockchain-based framework offers a reliable, transparent mechanism for certifying incident-related data. This fosters trust among healthcare emergency response system actors.
APA, Harvard, Vancouver, ISO, and other styles
10

Konovalov, V. A. "A METHOD FOR SYNTHESIZING TOPOS OF HASHES IN THE CATEGORICAL cN-SCHEME OF THE MARKOV ALGORITHM. Part 2." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 243 (September 2024): 40–51. https://doi.org/10.14489/vkit.2024.09.pp.040-051.

Full text
Abstract:
In the second part of the study, the synthesis of the cN-scheme of the Markov algorithm with the hash topos included in it is continued. The hash topos is included in this Markov algorithm scheme to determine whether a word belongs to its chain of occurrences by a fast algorithm without the need to iterate through the data in memory. The definition of such affiliation is necessary for the analysis of economic interactions in organizational systems in countering the laundering of proceeds from crime and the financing of terrorism. Interactions in organizational systems are considered both as occurrences of words in each other in the Markov alphabet, and as morphisms of objects in categories. The categorical cN-scheme of the Markov algorithm is also distinguished by the conclusion, which cannot be considered normal according to Markov. The topos of hashes, which consists of a composition of a five hash trees, is investigated without taking into account the structure of this five. The hash topos is used to detect and classify cycles, referred to in the study as λ-voids, and to quickly overcome the looping of algorithms when processing large amounts of data. The morphisms involved in the processing of words in the ordered and extended Markov alphabet A2M using the topos of hashes in the cN-scheme of the Markov algorithm are consistently refined and theoretically substantiated. In the course of the study, it was found that between the hashed data and the quad, consisting of a dictionary, source number, morphism number, morphism type number, it is possible to detect an isomorphic interaction, which allows, when receiving a word from the input data sample, to check whether it belongs to its chain of Markov occurrences, detecting cycles (λ-voids) in the input data samples. It is shown that the introduction of the categorical cN-scheme of the Markov algorithm into scientific circulation is the first step towards the synthesis of a variant of intuitionistic logic for the homology of the Markov algorithm. It is concluded that it is expedient to synthesize a Markov network algorithm from this scheme to search for new mathematical properties of the algorithm, with different compositions of data sources.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Hashek"

1

Almakrami, Hashem Abdullah A. "Online self-disclosure across cultures: A study of Facebook use in Saudi Arabia and Australia." Thesis, Queensland University of Technology, 2015. https://eprints.qut.edu.au/84494/4/Hashem%20Almakrami%20Thesis.pdf.

Full text
Abstract:
This research aimed to gain a sophisticated understanding of self-disclosure on Facebook across two distinctive cultures, Saudi Arabia and Australia. This study utilised an explanatory sequential mixed methods design, consisting of a quantitative phase followed by a qualitative phase. Findings from both quantitative and qualitative data provide a broad understanding of the types of information that people self-disclose on Facebook, identifies factors that have a significant influence (either positive or negative) on such disclosure, and explains how it is affected by one's national culture.
APA, Harvard, Vancouver, ISO, and other styles
2

Dhoopa, Harish Priyanka. "Towards Designing Energy-Efficient Secure Hashes." UNF Digital Commons, 2015. http://digitalcommons.unf.edu/etd/598.

Full text
Abstract:
In computer security, cryptographic algorithms and protocols are required to ensure security of data and applications. This research investigates techniques to reduce the energy consumed by cryptographic hash functions. The specific hash functions considered are Message Digest-2 (MD2), Message Digest-5 (MD5), Secure Hash Algorithm-1 (SHA-1) and Secure Hash Algorithm-2 (SHA-2). The discussion around energy conservation in handheld devices like laptops and mobile devices is gaining momentum. Research has been done at the hardware and operating system levels to reduce the energy consumed by these devices. However, research on conserving energy at the application level is a new approach. This research is motivated by the energy consumed by anti-virus applications which use computationally intensive hash functions to ensure security. To reduce energy consumption by existing hash algorithms, the generic energy complexity model, designed by Roy et al. [Roy13], has been applied and tested. This model works by logically mapping the input across the eight available memory banks in the DDR3 architecture and accessing the data in parallel. In order to reduce the energy consumed, the data access pattern of the hash functions has been studied and the energy complexity model has been applied to hash functions to redesign the existing algorithms. These experiments have shown a reduction in the total energy consumed by hash functions with different degrees of parallelism of the input message, as the energy model predicted, thereby supporting the applicability of the energy model on the different hash functions chosen for the study. The study also compared the energy consumption by the hash functions to identify the hash function suitable for use based on required security level. Finally, statistical analysis was performed to verify the difference in energy consumption between MD5 and SHA2.
APA, Harvard, Vancouver, ISO, and other styles
3

Rogozinsky, Shayna. "Luzzatto's Derech Hashem: understanding the way of God." Thesis, McGill University, 2011. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=97093.

Full text
Abstract:
The aim of this paper is to introduce the reader to Moshe Chaim Luzzatto's Derech Hashem and Luzzatto's thought process. It begins with an analysis of the introduction to the work and then examines three major themes: Fundamentals, Prophecy, and the importance of the Shema prayer. Where applicable, comparisons will be made to other Jewish thinkers. Themes will be explained within the Kabbalistic framework that influenced Luzzatto's work. By the end of the paper the reader should be able to grasp the key elements and reasons that inspired Luzzatto to write this book.<br>Le but de ce document est de présenter le lecteur processus de Moshe Chaim Luzzatto de Derech Hashem et de Luzzatto à pensée. Il commence par une analyse de l'introduction au travail et puis examine trois thèmes importants : Principes fondamentaux, prophétie, et l'importance de la prière de Shema. Là où applicables, des comparaisons seront faites à d'autres penseurs juifs. Des thèmes seront expliqués dans le cadre de Kabbalistic que le travail de Luzzatto influencé. Vers la fin du papier le lecteur devrait pouvoir saisir les éléments clé et les raisons qui a inspiré Luzzatto écrire ce livre.
APA, Harvard, Vancouver, ISO, and other styles
4

Almeida, Carlos Emanuel Guedes. "Análise comparativa de hastes longas vs hastes curtas na artroplastia da anca." Master's thesis, Universidade de Aveiro, 2018. http://hdl.handle.net/10773/23695.

Full text
Abstract:
Mestrado em Engenharia Mecânica<br>articulação da anca é das articulações mais importantes presentes no corpo humano, devido em especial às cargas envolvidas na mesma, que a tornam interesse de estudo. No entanto estão associadas a esta articulação diversas anomalias resultantes de patologias, levando à necessidade de uma intervenção cirúrgica. Esta intervenção tem por meio a substituição total da articulação por artefactos protésicos como componentes femoral e acetabular. Nos componentes femorais existe uma grande variedade de próteses, em termos de tamanhos e geometrias, o que altera o comportamento do fémur com a sua implantação. Com esta constatação, a presente dissertação tem como objetivo a realização de uma análise comparativa entre hastes curtas e hastes longas na artroplastia da anca. Esta avaliação tem por meio verificar qual dos implantes reproduz um comportamento mecânico mais similar com o obtido no osso intacto. Foram assim escolhidos três componentes para a realização deste estudo comparativo, dois com hastes curtas de geometrias distintas e uma haste longa. Numa primeira fase foram desenvolvidos os modelos geométricos de cada implante através de programas de modelação 3D. Para além dos modelos protésicos, também foi obtido um modelo geométrico do fémur intacto com o intuito de servir de meio comparativo na análise dos modelos implantados. Após a obtenção dos modelos geométricos, passou-se para a definição dos respetivos modelos numéricos através da utilização do Método dos Elementos Finitos. Com este pressuposto realizou-se o estudo de duas situações reais, uma situação de imediato pós-operatório e uma outra em que houve osseointegração na interface implante-osso, simulando assim um estado de médio-longo prazo de pós-operatório. Dos resultados obtidos foi possível verificar que as hastes curtas se aproximam mais do comportamento do osso intacto, no entanto observaram-se regiões com probabilidade de ocorrência de falha mecânica por fadiga devido a um acumular de deformações elevadas com maior incidência para o aspeto medial do fémur. No caso da haste longa, os resultados indicaram que no aspeto medial ocorre uma redução das deformações no osso cortical, pelo que daqui se concluiu que esta é uma zona onde existe forte stress-shielding, reduzindo a densidade óssea que leva a falência do componente. Resultados semelhantes foram observados através do estudo de casos clínicos associados às próteses curtas e longa, o que permitiu concluir uma boa correlação dos resultados obtidos.<br>The hip joint is one of the most important joints in the human body, due to the loads involved in it, which make it an interesting subject of study. However, several anomalies resulting from pathologies are associated with this joint, leading to the need for surgical intervention. This intervention consists in a total joint replacement by prosthesis, like femoral and acetabular components. There is a great variety in the femoral components of prostheses, in terms of size and geometry, which changes the femur behaviour with its implantation. With this finding, this dissertation aims to perform a comparative analysis between short stems and long stems in hip arthroplasty. This evaluation aims to verify which of the implants reproduces a mechanical behaviour more similar to the one obtained in the intact bone. Three components were chosen for this comparative study, two with short stems of different geometries and one long stem. Initially, the geometric models of each implant were developed through 3D modelling programs. In addition to the prosthetic models, a geometric model of the intact femur was also obtained to serve as a comparative in the analysis of the implanted models. After obtaining the geometric models, the definition of the respective numerical models was made using the Finite Element Method. With this assumption, the study of two real situations was carried out, one in a postoperative scenario, and another one in which there was osseointegration at the implant-bone interface, thus simulating a mid-long-term postoperative state. From the obtained results it was possible to verify that the short stems are closer to the behaviour of the intact bone, however, we observed regions with probability of occurrence of mechanical failure due to fatigue, due to an accumulation of high deformations, with greater incidence for the medial region of the femur. In the case of the long stem, the results indicated that in the medial region of the femur a reduction of the deformations in the cortical bone occurs, reason why it was concluded that this is a zone where there is a strong stress-shielding effect, reducing the bone density, which leads to the failure of the component. Similar results were observed through the study of clinical cases associated with short and long prostheses, which allowed to conclude a good correlation of the obtained results.
APA, Harvard, Vancouver, ISO, and other styles
5

Stultz, Jacob A. "Optimizing live virtual machine migrations using content-based page hashes." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/46499.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.<br>Includes bibliographical references (p. 55).<br>Virtualization systems such as VMware ESX Server use content-based page hashing to help identify duplicate memory pages within virtual machines. Such duplicate pages, once identified, can then be mapped copy-on-write to a single page in physical RAM, thus saving memory in a manner that is transparent to the virtual machine. The page hashes that are collected in this process can be further utilized. This thesis demonstrates how these page hashes can be used to reduce the time required to migrate running virtual machines from one physical machine to another. Normally, this is done by sending the virtual machine state and all memory contents from the source to destination machine. However, since some memory pages may already be present on the destination, it is possible to reduce the number of pages sent (and therefore total migration time and bandwidth used), by sending only a compact hash instead of the full contents for each page likely to be present on the destination machine. This thesis accomplishes this by creating a database of canonical or "standard" pages to determine which pages can be safely sent as only a hash. Tests of the system demonstrate up to 70% reduction in migration time in idealized workloads, 40% reduction in some realistic workloads, and minimal slowdown in some pathological cases.<br>by Jacob A. Stultz.<br>M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
6

Duflot, Roland. "Iulia Hasdeu : légendes et réalités." Université de Provence. Faculté des lettres et sciences humaines (1969-2011), 1999. http://www.theses.fr/1999AIX10086.

Full text
Abstract:
Iulia hasdeu (1869-1888), fille du savant roumain b. P. Hasdeu, est consideree a la fois comme un modele de reussite scolaire et un ecrivain remarquable. Sa precocite creatrice lui a valu la qualification de "genie", alors que, paradoxalement, ses ecrits narratifs, rediges pour la plupart en francais, sont inconnus du public et que ses poemes ont eu une diffusion tres restreinte. Sa position de dernier rejeton d'une famille d^intellectuels celebres la place dans un cadre socio-culturel deja constitue ou l'excellence intellectuelle parait aller de soi. Les resultats de l'analyse critique de documents relatifs a sa vie ont contredit cette representation traditionnelle. Ce travail met en evidence l'existence de donnees legendaires, expose leur emergence, leur propagation et leur persistance au cours du xxe siecle. B. P. Hasdeu, historien et philologue de renommee mondiale, fut l'instigateur de ce processus de mise en legende. Refusant la realite de la mort prematuree de sa fille, il batit sa notoriete posthume par la promotion de ses ecrits d'adolescente et par des agissements d'ordre irrationnel (spiritisme, croyance a l'atavisme) qui parvinrent a instaurer dans la culture roumaine une image de iulia hasdeu comme << martyre de la science >>. Grace a l'etude de documents primaires, nous avons cherche a replacer sa personnalite dans son contexte historique. Iulia hasdeu fut un enfant surdoue de type creatif. Elle accomplit a bucarest sa scolarite primaire avec une avance exceptionnelle qui etonna ses contemporains. Poursuivant a l'adolescence sa scolarite a paris, elle fut une ecoliere ordinaire puis une etudiante mediocre. Tres tot, elle s'est forge, sur la base d'une forte identification a son pere, un ideal de celebrite universelle qui l'incitait a prendre la plume dans l'espoir d'y acceder. Grace a ses facilites d'invention, elle a trouve dans l'ecriture un moyen de relativiser des problemes psychologiques nes de la separation de ses parents et de son education centree sur ses performances scolaires. Ses textes fictionnels, dont les plus matures ont ete ecrits entre 15 et 19 ans, restent proches de cet enracinement biographique. Au-dela d'une mise en evidence de la formation d'une legende, ce travail apporte un complement aux etudes hasdeennes en etudiant un aspect meconnu de b. P. Hasdeu, celui de sa qualite de pere.
APA, Harvard, Vancouver, ISO, and other styles
7

Zullo, Douglas R. "Jiri Kolar in Exile: Ubiety and Identity in Two Views of Prague." Columbus, Ohio : Ohio State University, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1132666987.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shorafa, Hashem [Verfasser]. "Strukturchemie von Osmiumverbindungen in den Oxidationsstufen (VII & VI) und Hexafluorobenzolradikalkation / Hashem Shorafa." Berlin : Freie Universität Berlin, 2009. http://d-nb.info/1023622823/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Alkhaldi, Hashem [Verfasser]. "Contact Investigations of Granular Mechanical Media in a Tumbling Sorting Machine / Hashem Alkhaldi." Aachen : Shaker, 2007. http://d-nb.info/116651109X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

LIMA, José Paulo da Silva. "Validação de dados através de hashes criptográficos: uma avaliação na perícia forense computacional brasileira." Universidade Federal de Pernambuco, 2015. https://repositorio.ufpe.br/handle/123456789/15966.

Full text
Abstract:
Submitted by Fabio Sobreira Campos da Costa (fabio.sobreira@ufpe.br) on 2016-03-15T14:10:33Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Mestrado - CIn-UFPE - José Paulo.pdf: 1469540 bytes, checksum: ce7369f282093630fb39f482f5e6b4f9 (MD5)<br>Made available in DSpace on 2016-03-15T14:10:33Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Mestrado - CIn-UFPE - José Paulo.pdf: 1469540 bytes, checksum: ce7369f282093630fb39f482f5e6b4f9 (MD5) Previous issue date: 2015-08-31<br>A criptografia tem três princípios básicos: garantir a confidencialidade das mensagens, que elas não sejam alteradas por intrusos e que a mensagem flua entre o remetente e destinatário sem que haja a interrupção desta comunicação. Visto resumidamente as metas de um esquema criptográfico, podemos observar o quão importante a criptografia é nos dias atuais. Funções hash são usadas comumente para garantir a integridade de dados, ou seja, garantir que os dados não foram mudados. Os hashes acabam sendo usados em diversas áreas, especialmente na perícia computacional onde o perito prova que não alterou os dados que ele coletou. Porém, seria necessário que houvesse um maior cuidado com a utilização de hashes, afinal existem muitos deles que são considerados inseguros e podem continuar a ser usados indevidamente. Visto isso, este trabalho tenta analisar o cenário atual dentro da perícia forense computacional e da legislação de alguns países, com o objetivo de apontar melhorias para que despertem uma preocupação quanto a confiança na utilização dos hashes criptográficos.<br>The cryptography has three basic principles: ensure the confidentiality of messages, don’t be changed by intruders and the message flow between the sender and the recipient without any interruption in communication. Considering the goals of a cryptographic scheme, we can realise how important encryption is today. Hash functions are commonly used to ensure data integrity, that is, ensure that the data haven’t changed. Hashes are used in various fields, especially in computer forensics where the specialist proves that he didn’t manipulate the data he collected. However, it would be necessary a greater concern with the use of hashes, after all there are many of them who are considered unsafe and can to continue to be used incorrectly. Considering it, this paper attempts to analyze the current situation within the computer forensic expertise and the legislation of some countries, in order to point out improvements to awaken a concern with the confidence in the use of cryptographic hashes.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Hashek"

1

Tasa, Meydad. Gadol Hashem. Aviad Gil, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Burgan, Michael. Dominik Hasek. Chelsea House Publishers, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rossiter, Sean. Dominik Hasek. Greystone Books, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bonan, Daṿid. Shut De hashev. Torah or, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Fridman, Sheraga Fayṿl. Living kiddush Hashem: Sanctifying Hashem in everything we do. Mesorah Publications, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Becker, Hyam Yona. The Temple of Hashem. Gefen, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Khāna, Hāśema. Hāśema Khāna =: Hashem Khan. Bāṃlādeśa Śilpakalā Ekāḍemī, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Khāna, Hāśema. Hāśema Khāna =: Hashem Khan. Bāṃlādeśa Śilpakalā Ekāḍemī, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

ill, Ariʼel Liʼat Binyamini, ed. Where are you, Hashem? Mesorah Publications, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nusairi, Sara El. Hashem El Madani: Studio practices. Arab Image Foundation, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Hashek"

1

Capello, Maria Angela, and Hosnia S. Hashim. "Hashem S. Hashim." In Learned in the Trenches. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62822-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Clements, Matt. "Hashes." In Ruby Quick Syntax Reference. Apress, 2014. http://dx.doi.org/10.1007/978-1-4302-6569-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lee, James, Simon Cozens, and Peter Wainwright. "Hashes." In Beginning Perl. Apress, 2004. http://dx.doi.org/10.1007/978-1-4302-0665-1_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Easttom, William. "Cryptographic Hashes." In Modern Cryptography. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-63115-4_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Easttom, Chuck. "Cryptographic Hashes." In Modern Cryptography. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-12304-7_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sinha, Sanjib. "Hashes and Passwords." In Beginning Ethical Hacking with Kali Linux. Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3891-2_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gooch, Jan W. "Hashab." In Encyclopedic Dictionary of Polymers. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-6247-8_5809.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gunsing, Aldo, and Bart Mennink. "Collapseability of Tree Hashes." In Post-Quantum Cryptography. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44223-1_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rothwell, William “Bo.” "Advanced Data Types: Hashes." In Advanced Perl Programming. Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5863-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mantione, Massimiliano, and Fred Chow. "Hashed SSA Form: HSSA." In SSA-based Compiler Design. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80515-9_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Hashek"

1

Kwon, Osang, Yongho Lee, Junhyeok Park, Sungbin Jang, Byungchul Tak, and Seokin Hong. "Distributed Page Table: Harnessing Physical Memory as an Unbounded Hashed Page Table." In 2024 57th IEEE/ACM International Symposium on Microarchitecture (MICRO). IEEE, 2024. https://doi.org/10.1109/micro61859.2024.00013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Schardong, Frederico, and Daniel Formolo. "A Non-Probabilistic Time-Storage Trade-off for Unsalted Hashes." In Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais. Sociedade Brasileira de Computação - SBC, 2016. http://dx.doi.org/10.5753/sbseg.2016.19308.

Full text
Abstract:
This work proposes a new cryptanalytic non-probabilistic trade-off for unsalted hashes. It presents the main cryptanalytic trade-offs, making a comparison with the proposed method. Although the number of hash operations to recover an element is high compared with the traditional methods, the new method has the advantage of guaranteed success on the recovery of hashes, minimal and sequential disk read operations, unlike the existing probabilistic trade-offs.
APA, Harvard, Vancouver, ISO, and other styles
3

Ribeiro, Jorge Miguel, Daniel Macêdo Batista, and José Coelho de Pina. "hashify: Uma Ferramenta para Visualização de Hashes com Animações." In Anais Estendidos do Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/sbseg_estendido.2020.19277.

Full text
Abstract:
Comparar hashes é uma operação importante em segurança digital, porém tediosa e propensa a erros quando os hashes estão na forma de strings hexadecimais. Esse artigo apresenta um novo software de visualização de hashes com animações. O software, nomeado hashify, utiliza 4 caracteres e 4 ícones SVG para gerar animações de 2 segundos que transmitem por volta de 48 bits de uma sequência derivada do hash original. Ele foi implementado como uma biblioteca JavaScript e foi embutido em um protótipo de extensão do Firefox, que utiliza a biblioteca para mostrar uma estampa do certificado HTTPS utilizado em uma página web. A probabilidade de colisão e os resultados de uma pesquisa feita com usuários atestam a eficácia do hashify.
APA, Harvard, Vancouver, ISO, and other styles
4

Sitnikova, L. K., M. O. Elantcev, and R. O. Sultanov. "A two-step method of searching for similar images in a large image database." In 2022 33th All-Russian Youth Exhibition of Innovations. Publishing House of Kalashnikov ISTU, 2022. http://dx.doi.org/10.22213/ie022143.

Full text
Abstract:
This article analyzes the methods of searching for similar images in a large database, examines in detail the search for images using perceptual hashes with Hamming distance calculation, using a convolutional neural network and using these methods together. The analysis of the speed and accuracy of the method of searching for similar images by comparing perceptual hashes, the analysis of the accuracy of image classification using a convolutional neural network, the analysis of speed and accuracy when they are used together, including with small changes in images (cropping, rotation, contrast change, sharpness change). According to the results of the study, it was revealed that the joint use of the perceptual hash comparison method and the classification method using a neural network is the most effective.
APA, Harvard, Vancouver, ISO, and other styles
5

Stolz, Peter, Sebastian Roth, and Ben Stock. "To hash or not to hash: A security assessment of CSP’s unsafe-hashes expression." In 2022 IEEE Security and Privacy Workshops (SPW). IEEE, 2022. http://dx.doi.org/10.1109/spw54247.2022.9833888.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cao, Zhangjie, Mingsheng Long, Jianmin Wang, and Philip S. Yu. "HashNet: Deep Learning to Hash by Continuation." In 2017 IEEE International Conference on Computer Vision (ICCV). IEEE, 2017. http://dx.doi.org/10.1109/iccv.2017.598.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sato, Jessica Yumi Nakano, Jorge Miguel Ribeiro, Roberto Samarone Araujo, José Coelho de Pina, and Daniel Macêdo Batista. "Utilização de Animações para Comparação de Hashes em Votação Eletrônica via Internet." In Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/sbseg_estendido.2022.224854.

Full text
Abstract:
Sistemas seguros de votação eletrônica via Internet requerem comparação de dados em varias etapas do processo de votação. Alguns desses dados sao hashes, representados geralmente por strings. A comparação dessas strings por seres humanos tende a ser tediosa, o que faz com que a mesma nem sempre seja realizada corretamente. Este artigo relata resultados preliminares de um sistema de software que avança o estado da arte em votação eletrônica via Internet por meio da comparação de hashes representados por animações. A base do sistema são o software livre hashify, responsável pelas animações, e o software livre Helios, responsavel pelas votações. Resultados mostram que é possível comparar os hashes do Helios usando as animações do hashify.
APA, Harvard, Vancouver, ISO, and other styles
8

John, Binoy, Aakash Kumar Singh, and C. Sabarinathan. "Voter Verification in an Election Using Merkle Tree." In International Research Conference on IOT, Cloud and Data Science. Trans Tech Publications Ltd, 2023. http://dx.doi.org/10.4028/p-9fnk16.

Full text
Abstract:
In this paper we propose a new way to verify eligible voters in a blockchain election. Usually verifying a voter in a list of eligible voters is done using linear search-based algorithms which runs with a worst-case time complexity of O(N) or O(kN). Our system shall use a Merkle tree to implement a search algorithm which runs with a worst-case time complexity of O(Log (N)). Under normal circumstances, when there are 1,000,000 eligible voters, the server would have to scan through 1,000,000 voter address hashes in order to verify a voter. In our system, only 20 hashes will be checked in order to verify a voter. The number of hashes required to calculate the number of hashes needed to process can be found out by getting the logarithm value of the number of hashes, to the base 2 since our Merkle tree has a branching factor of 2. A logarithmic algorithm will exponentially reduce the time and make the eligibility verification process more efficient. Since we are hashing the addresses of the voters before creating the tree, the privacy of the voters shall also be maintained. Instead of using a centralized database for handling the vote requests, we shall use a blockchain database in order to make this system decentralized. Making the system decentralized will make it almost impossible to tamper with the results of the election as once the election is deployed, even the owner of the election that is, the address that deploys the smart contract cannot tamper with the results or the functions in the deployed smart contract.
APA, Harvard, Vancouver, ISO, and other styles
9

Wyman, Chris, and Morgan McGuire. "Hashed alpha testing." In I3D '17: Symposium on Interactive 3D Graphics and Games. ACM, 2017. http://dx.doi.org/10.1145/3023368.3023370.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Steinebach, Martin, Sebastian Lutz, and Huajian Liu. "Privacy and Robust Hashes." In ARES '19: 14th International Conference on Availability, Reliability and Security. ACM, 2019. http://dx.doi.org/10.1145/3339252.3340105.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Hashek"

1

Eastlake, D. HMAC SHA (Hashed Message Authentication Code, Secure Hash Algorithm) TSIG Algorithm Identifiers. RFC Editor, 2006. http://dx.doi.org/10.17487/rfc4635.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Farrell, S., D. Kutscher, C. Dannewitz, B. Ohlman, A. Keranen, and P. Hallam-Baker. Naming Things with Hashes. RFC Editor, 2013. http://dx.doi.org/10.17487/rfc6920.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bryan, A., N. McNab, T. Tsujikawa, P. Poeml, and H. Nordstrom. Metalink/HTTP: Mirrors and Hashes. RFC Editor, 2011. http://dx.doi.org/10.17487/rfc6249.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hoffman, P., and B. Schneier. Attacks on Cryptographic Hashes in Internet Protocols. RFC Editor, 2005. http://dx.doi.org/10.17487/rfc4270.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Laurie, B., G. Sisson, R. Arends, and D. Blacka. DNS Security (DNSSEC) Hashed Authenticated Denial of Existence. RFC Editor, 2008. http://dx.doi.org/10.17487/rfc5155.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ovsienko, D. Babel Hashed Message Authentication Code (HMAC) Cryptographic Authentication. RFC Editor, 2014. http://dx.doi.org/10.17487/rfc7298.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Velvindron, L., K. Moriarty, and A. Ghedini. Deprecating MD5 and SHA-1 Signature Hashes in TLS 1.2 and DTLS 1.2. RFC Editor, 2021. http://dx.doi.org/10.17487/rfc9155.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Dang, Quynh H. Secure Hash Standard. National Institute of Standards and Technology, 2015. http://dx.doi.org/10.6028/nist.fips.180-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Brewer, Mike. Reforming welfare: less haste, more detail please. The IFS, 2010. http://dx.doi.org/10.1920/co.ifs.2024.0949.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Jones, Marcus, and Nick E. Christians. Evaluation of an Amino Acid Biostimulant to Hasten Turfgrass Recovery. Iowa State University, Digital Repository, 2012. http://dx.doi.org/10.31274/farmprogressreports-180814-414.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Hashek' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography