Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „CRYPTOGRAPHI“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "CRYPTOGRAPHI" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "CRYPTOGRAPHI"
1
WANG, XINGYUAN, MING LIU und NINI GU. „TWO NEW CHAOTIC CRYPTOGRAPHIES BASED ON DIFFERENT ATTRACTOR-PARTITION ALGORITHMS“. International Journal of Modern Physics B 21, Nr. 27 (30.10.2007): 4739–50. http://dx.doi.org/10.1142/s0217979207038071.
Der volle Inhalt der QuelleAnnotation:
The paper analyses the limitation of Baptista cryptography in partitioning an attractor, and proposes two new attractor-partition methods: uniform-partition algorithm and dynamic-partition algorithm. They are different from the equal-interval-partition algorithm in Baptista cryptography, but dividing the attractor according to the attractor's natural invariant density and plaintext density, respectively. The comparative experiment indicates: the two new methods improve the unbalanced cryptograph distribution and cryptograph length in Baptista cryptography, they are also able to reduce the iteration time in chaotic systems effectively, which has improved decryption time and cryptographies' security.
2
Yan, Yuhan. „The Overview of Elliptic Curve Cryptography (ECC)“. Journal of Physics: Conference Series 2386, Nr. 1 (01.12.2022): 012019. http://dx.doi.org/10.1088/1742-6596/2386/1/012019.
Der volle Inhalt der QuelleAnnotation:
Abstract Elliptic Curve Cryptography (ECC) is one of the strongest and most efficient cryptographic techniques in modern cryptography. This paper gives the following introduction: The introduction of cryptography’s development; the introduction of the elliptic curve; the principle of ECC; the horizontal comparison between ECC and other types of cryptography; the modern breakthrough of ECC; the applications of ECC; by using a method of literature review. The study’s findings indicate that this factor is responsible for the rapid historical development of cryptography, from the classical password to the leap to modern cryptography. Elliptic Curve Cryptography (ECC), as one of the most important modern cryptographies, is stronger than most other cryptographies both in terms of security and strength, because it uses an elliptic curve to construct and, at the same time, uses mathematical operations to encrypt and generate keys. At the same time, elliptic curve cryptography can continue to improve the speed and intensity with the improvement of accelerators, scalar multiplication, and the speed of order operation. The applications of the elliptic curve in ECDSA and SM2 are very efficient, which further illustrates the importance of elliptic curve cryptography.
3
Goldreich, Oded. „Cryptography and cryptographic protocols“. Distributed Computing 16, Nr. 2-3 (01.09.2003): 177–99. http://dx.doi.org/10.1007/s00446-002-0077-1.
Der volle Inhalt der Quelle
4
BAFTIU, Naim. „Analysis and use of Cryptography techniques in programming language C#: Coding and Decoding“. PRIZREN SOCIAL SCIENCE JOURNAL 4, Nr. 3 (31.12.2020): 1–10. http://dx.doi.org/10.32936/pssj.v4i3.165.
Der volle Inhalt der QuelleAnnotation:
Cryptography is an old idea and science, but its approach exists and plays a large role in modernization today. Conventional cryptographic techniques form the basis of today's cryptographic algorithm. The different categories of algorithms have their respective features; internally, in performance and implementation. Cryptographic schemes and mechanisms have undergone continuous improvement. The application of cryptography has grown increasingly, ranging from limited use in state institutions to widespread use by private individuals and companies. The increased use of the Internet has significantly influenced the nature of applications and the way we communicate. Data security dictates the use of different cryptographic techniques. For this reason, we analyze in detail the various coding techniques by evaluating their performance and efficiency. Regarding the new paradigms in cryptography there are also new cryptographic schemes whose application requires detailed study and analysis. The classical cryptography algorithm is the oldest algorithm that was used long before the cryptographic system was discovered. Currently, the system has been widely applied to secure data, and using new methods in a way to improve existing methods. In this thesis the use of cryptographic methods using the C # programming language will be discussed.
5
., Abhishek Misal, und Tin Mar Kyi . „Virtual Cryptopgraphic Technique and Bit-plane Segmentation Stegnegography for Security in Bioinformatics and Biomedical Applications“. CSVTU International Journal of Biotechnology Bioinformatics and Biomedical 4, Nr. 2 (03.09.2019): 59–66. http://dx.doi.org/10.30732/ijbbb.20190402005.
Der volle Inhalt der QuelleAnnotation:
The security techniques are very important in all modern applications since most of the applications of science and engineering are using digital media and processing. There are sevral security techniques for protection of various types of data, such as biometrics, cryptograpy, watermarking etc. This paper discussses about cryptographic methods only and virtual cryptopgraphy has been implemented successfuly with considerable improvement in signal quality.The importance of the virtual cryptography is empahsized that can be used to protect and secure various types of data invloved in bioinformatics and biomedical applications. The bit-plane segmentation stagenography enhances the security and also helps in better ptrotection of data
6
Anilkumar, Chunduru, Bhavani Gorle und Kinthali Sowmya. „A Secure Method of Communication in Conventional Cryptography using Quantum Key Distribution“. Applied and Computational Engineering 8, Nr. 1 (01.08.2023): 68–73. http://dx.doi.org/10.54254/2755-2721/8/20230083.
Der volle Inhalt der QuelleAnnotation:
Security knowledge is one of the foremost challenges in the present day. When the topic is about Information security, the concept of cryptography comes into the picture. Every day, people and organizations use cryptography to maintain the confidentiality of their communications and data as well as to preserve their privacy. Today, one of the most successful methods used by businesses to protect their storage systems, whether at rest or in transit, is cryptography. Yet, cryptography is an effective technique to secure the data, the modern technology can break the cryptographic techniques. But some data encryption algorithms are several times stronger than today's conventional cryptography and can be constructed using quantum computing. They are "Quantum Cryptographic Algorithms ". Quantum cryptography uses the rules of quantum physics instead of classical encryption, which is based on mathematics, to protect and transmit data in a way that cannot be intercepted. Quantum key distribution is the greatest illustration of quantum cryptography and offers a safe solution to the key exchange issue. The proposed work deals with quantum cryptography and mainly focuses on how the quantum cryptographic algorithm is more secure than traditional cryptography.
7
Paul, Sebastian, und Melanie Niethammer. „On the importance of cryptographic agility for industrial automation“. at - Automatisierungstechnik 67, Nr. 5 (27.05.2019): 402–16. http://dx.doi.org/10.1515/auto-2019-0019.
Der volle Inhalt der QuelleAnnotation:
AbstractCryptographic primitives do not remain secure, they deteriorate over time. On the one hand increasing computing power leads to more powerful attacks on their underlying mathematical problems. On the other hand quantum computing threatens to break many widely used cryptographic primitives. The main goal ofcryptographic agilityis to enable an easy transition to alternative cryptographic schemes. Considering the long lifetime of products within industrial automation, we argue that vendors should strive for cryptographic agility in their products. In this work we motivate cryptographic agility by discussing the threat of quantum computers to modern cryptography. Additionally, we introduce the reader to the concept of post-quantum cryptography. Ultimately, we demonstrate that cryptographic agility requires three elements: 1) cryptographic application programming interfaces, 2) secure update mechanisms and 3) documentation of cryptographic primitives. By providing practical concepts we show how to meet these requirements in software-based systems.
8
Victor, Melvin, D. David Winster Praveenraj, Sasirekha R, Ahmed Alkhayyat und Abdullayeva Shakhzoda. „Cryptography: Advances in Secure Communication and Data Protection“. E3S Web of Conferences 399 (2023): 07010. http://dx.doi.org/10.1051/e3sconf/202339907010.
Der volle Inhalt der QuelleAnnotation:
In the innovative work secure communication and data protection are being main field, which are emerged by cryptography as a fundamental pillar. Strong cryptographic methods are now essential given the rising reliance on digital technologies and the threats posed by bad actors. This abstract examines the evolution of secure communication protocols and data protection techniques as it relates to the advancements in cryptography. The development of post-quantum cryptography is the most notable development in cryptography discussed in this study. As quantum computers become more powerful, they pose a serious threat to traditional cryptographic algorithms, such as RSA and ECC. Designing algorithms that are immune to attacks from quantum computers is the goal of post-quantum cryptography. Lattice-based, code-based, and multivariate-based cryptography are only a few of the methods that have been investigated in this context.
9
Rusetskaya, Irina A. „CRYPTOGRAPHY. FROM THE PAST TO THE FUTURE“. RSUH/RGGU Bulletin. Series Information Science. Information Security. Mathematics, Nr. 4 (2021): 47–57. http://dx.doi.org/10.28995/2686-679x-2021-4-47-57.
Der volle Inhalt der QuelleAnnotation:
The article is devoted to the analysis of modern trends in the development of cryptography, which are related to the issues of cryptography of the past and are reflected in the prospects for the development of cryptography in the future. New trends in the development of cryptography that are relevant in recent decades are highlighted, the main ones of which include: awareness of the mathematical nature of data encryption problems, the rapid increase in the volume of processed and encrypted information that is distributed among a large unlimited circle of users of the modern data transmission devices, practical and theoretical interest of user s in cryptography. It analyzes the continuity of the issues facing cryptography. Among such issues there are: an importance of the human factor in the use of any cryptographic system, the traditional participation of the state in the cryptography development, as well as the theoretical substantiation of ideas of the cryptographic data protection, generalizing the practical experience of using encryption. The author also analyzes the main tasks of cryptography, which include identification, authentication, maintaining the integrity, confidentiality and availability of information during its transfer and storage, emphasizing the need to solve them within the framework of the design and implementation of the complex security systems. Using the development of quantum cryptography as an example, the article emphasizes that the development of new approaches to the cryptographic data protection traditionally leads to the emergence of new vulnerability factors, which means that the traditional issue of cryptography is also to stay ahead of potential attackers.
10
Singh, Sukhveer. „Investigation of Cryptography for Secure Communication and Data Privacy Applications“. Mathematical Statistician and Engineering Applications 70, Nr. 1 (31.01.2021): 551–60. http://dx.doi.org/10.17762/msea.v70i1.2508.
Der volle Inhalt der QuelleAnnotation:
In many applications, secure communication and data privacy are crucially supported by cryptography. The study of cryptography is now essential for creating strong and dependable security systems due to the growing risks to sensitive information in the digital era. The fundamentals of cryptography, its guiding principles, and its useful applications in securing communication channels and preserving data privacy are explored in this research article.Beginning with symmetric and asymmetric encryption techniques, the inquiry first looks at the fundamental ideas of encryption and decryption. It explores the mathematical underpinnings of cryptography, including discrete logarithms, prime numbers, and modular arithmetic, which serve as the foundation for many cryptographic systems.The paper also examines the various cryptographic protocols and algorithms that are frequently used in secure communication systems. It examines well-known encryption algorithms like Elliptic Curve Cryptography (ECC), Rivest-Shamir-Adleman (RSA), and Advanced Encryption Standard (AES). To determine whether a given algorithm is appropriate for a given use case, its advantages, disadvantages, and distinguishing characteristics are examined.The inquiry also looks at other cryptographic methods including digital signatures, hashing, and key management in addition to encryption. In secure communication systems, these methods are essential for guaranteeing data integrity, authentication, and non-repudiation.
Dissertationen zum Thema "CRYPTOGRAPHI"
1
Poschmann, Axel York. „Lightweight cryptography cryptographic engineering for a pervasive world“. Berlin Bochum Dülmen London Paris Europ. Univ.-Verl, 2009. http://d-nb.info/996578153/04.
Der volle Inhalt der Quelle
2
Almeida, Braga Daniel de. „Cryptography in the wild : the security of cryptographic implementations“. Thesis, Rennes 1, 2022. http://www.theses.fr/2022REN1S067.
Der volle Inhalt der QuelleAnnotation:
Les attaques par canaux auxiliaire sont redoutables face aux implémentations cryptographiques. Malgré les attaques passées, et la prolifération d'outils de vérification, ces attaques affectent encore de nombreuses implémentations. Dans ce manuscrit, nous abordons deux aspects de cette problématique, centrés autour de l'attaque et de la défense. Nous avons dévoilé plusieurs attaques par canaux auxiliaires microarchitecturaux sur des implémentations de protocoles PAKE. En particulier, nous avons exposé des attaques sur Dragonfly, utilisé dans la nouvelle norme Wi-Fi WPA3, et SRP, déployé dans de nombreux logiciel tels que ProtonMail ou Apple HomeKit. Nous avons également exploré le manque d'utilisation par les développeurs d'outil permettant de détecter de telles attaques. Nous avons questionné des personnes impliqués dans différents projets cryptographiques afin d'identifier l'origine de ce manque. De leur réponses, nous avons émis des recommandations. Enfin, dans l'optique de mettre fin à la spirale d'attaques-correction sur les implémentations de Dragonfly, nous avons fournis une implémentation formellement vérifiée de la couche cryptographique du protocole, dont l'exécution est indépendante des secretsSide-channel attacks are daunting for cryptographic implementations. Despite past attacks, and the proliferation of verification tools, these attacks still affect many implementations. In this manuscript, we address two aspects of this problem, centered around attack and defense. We unveil several microarchitectural side-channel attacks on implementations of PAKE protocols. In particular, we exposed attacks on Dragonfly, used in the new Wi-Fi standard WPA3, and SRP, deployed in many software such as ProtonMail or Apple HomeKit. We also explored the lack of use by developers of tools to detect such attacks. We questioned developers from various cryptographic projects to identify the origin of this lack. From their answers, we issued recommendations. Finally, in order to stop the spiral of attack-patch on Dragonfly implementations, we provide a formally verified implementation of the cryptographic layer of the protocol, whose execution is secret-independent
3
Scerri, Guillaume. „Proof of security protocols revisited“. Thesis, Cachan, Ecole normale supérieure, 2015. http://www.theses.fr/2015DENS0002/document.
Der volle Inhalt der QuelleAnnotation:
Avec la généralisation d'Internet, l'usage des protocoles cryptographiques est devenu omniprésent. Étant donné leur complexité et leur l'aspect critique, une vérification formelle des protocoles cryptographiques est nécessaire.Deux principaux modèles existent pour prouver les protocoles. Le modèle symbolique définit les capacités de l'attaquant comme un ensemble fixe de règles, tandis que le modèle calculatoire interdit seulement a l'attaquant derésoudre certain problèmes difficiles. Le modèle symbolique est très abstrait et permet généralement d'automatiser les preuves, tandis que le modèle calculatoire fournit des garanties plus fortes.Le fossé entre les garanties offertes par ces deux modèles est dû au fait que le modèle symbolique décrit les capacités de l'adversaire alors que le modèle calculatoire décrit ses limitations. En 2012 Bana et Comon ont proposé unnouveau modèle symbolique dans lequel les limitations de l'attaquant sont axiomatisées. De plus, si la sémantique calculatoire des axiomes découle des hypothèses cryptographiques, la sécurité dans ce modèle symbolique fournit desgaranties calculatoires.L'automatisation des preuves dans ce nouveau modèle (et l'élaboration d'axiomes suffisamment généraux pour prouver un grand nombre de protocoles) est une question laissée ouverte par l'article de Bana et Comon. Dans cette thèse nous proposons une procédure de décision efficace pour une large classe d'axiomes. De plus nous avons implémenté cette procédure dans un outil (SCARY). Nos résultats expérimentaux montrent que nos axiomes modélisant la sécurité du chiffrement sont suffisamment généraux pour prouver une large classe de protocolesWith the rise of the Internet the use of cryptographic protocols became ubiquitous. Considering the criticality and complexity of these protocols, there is an important need of formal verification.In order to obtain formal proofs of cryptographic protocols, two main attacker models exist: the symbolic model and the computational model. The symbolic model defines the attacker capabilities as a fixed set of rules. On the other hand, the computational model describes only the attacker's limitations by stating that it may break some hard problems. While the former is quiteabstract and convenient for automating proofs the later offers much stronger guarantees.There is a gap between the guarantees offered by these two models due to the fact the symbolic model defines what the adversary may do while the computational model describes what it may not do. In 2012 Bana and Comon devised a new symbolic model in which the attacker's limitations are axiomatised. In addition provided that the (computational semantics) of the axioms follows from the cryptographic hypotheses, proving security in this symbolic model yields security in the computational model.The possibility of automating proofs in this model (and finding axioms general enough to prove a large class of protocols) was left open in the original paper. In this thesis we provide with an efficient decision procedure for a general class of axioms. In addition we propose a tool (SCARY) implementing this decision procedure. Experimental results of our tool shows that the axioms we designed for modelling security of encryption are general enough to prove a large class of protocols
4
Minaud, Brice. „Analyse de primitives cryptographiques récentes“. Thesis, Rennes 1, 2016. http://www.theses.fr/2016REN1S066/document.
Der volle Inhalt der QuelleAnnotation:
Dans cette thèse, nous nous intéressons à la sécurité de quelques primitives cryptographiques récentes, d’abord symétriques puis asymétriques, en passant par le modèle en boîte blanche, qui est à certains égards intermédiaire. Dans un premier temps, nous montrons l’existence de fonctions linéaires non triviales commutant avec la fonction de tour de certains chiffrements par bloc, dont découlent des attaques par auto-similarité et sous-espace invariant. Nous nous intéressons ensuite à la cryptanalyse de la structure ASASA, où deux couches non linéaires S sont imbriquées dans des couches affines A. Notre cryptanalyse structurelle permet de casser des instances de chiffrement symétrique, multivarié et en boîte blanche. En nous concentrant sur le modèle d’incompressibilité en boîte blanche, nous montrons ensuite comment réaliser un chiffrement par bloc et un générateur de clef efficaces dont la sécurité est prouvable. Finalement, du côté purement asymétrique, nous décrivons une attaque polynomiale contre une construction récente d’application multilinéaireIn this thesis, we study the security of some recent cryptographic primitives, both symmetric and asymmetric. Along the way we also consider white-box primitives, which may be regarded as a middle ground between symmetric and asymmetric cryptography. We begin by showing the existence of non-trivial linear maps commuting with the round function of some recent block cipher designs, which give rise to self-similarity and invariant subspace attacks. We then move on to the structural cryptanalysis of ASASA schemes, where nonlinear layers S alternate with affine layers A. Our structural cryptanalysis applies to symmetric, multivariate, as well as white-box instances. Focusing on the white-box model of incompressibility, we then build an efficient block cipher and key generator that offer provable security guarantees. Finally, on the purely asymmetric side, we describe a polynomial attack against a recent multilinear map proposal
5
Bultel, Xavier. „Mécanismes de délégation pour les primitives de cryptographie à clé publique“. Thesis, Université Clermont Auvergne (2017-2020), 2018. http://www.theses.fr/2018CLFAC100.
Der volle Inhalt der Quelle
6
Paindavoine, Marie. „Méthodes de calculs sur les données chiffrées“. Thesis, Lyon, 2017. http://www.theses.fr/2017LYSE1009/document.
Der volle Inhalt der QuelleAnnotation:
L'annonce de l'essor du chiffrement des données se heurte à celle de l'avènement du "big data". Il n'est maintenant plus suffisant d'envoyer et de recevoir des données, il faut pouvoir les analyser, les exploiter ou encore les partager à grande échelle. Or, les données à protéger sont de plus en plus nombreuses, notamment avec la prise de conscience de l'impact qu'ont les nouvelles technologies (smartphones, internet of things, cloud,...) sur la vie privée des utilisateurs. En rendant ces données inaccessibles, le chiffrement bloque a priori les fonctionnalités auxquelles les utilisateurs et les fournisseurs de service sont habitués. Pour rétablir ces fonctionnalités, il est nécessaire de savoir calculer des fonctions de données chiffrées, et cette thèse explore plusieurs pistes dans ce sens. Dans une première partie, nous nous intéressons au chiffrement totalement homomorphe qui permet de réaliser des calculs arbitraires sur les données chiffrées. Ce type de chiffrement est cependant particulièrement coûteux, notamment à cause de l'appel souvent nécessaire à une procédure très coûteuse : le réamorçage. Nous prouvons ici que minimiser le nombre de réamorçages est un problème NP-complet et donnons une méthode pratique pour approximer ce minimum. Dans une seconde partie, nous étudions des schémas dédiés à une fonctionnalité donnée. Le premier cas d'usage considéré est celui de la déduplication vérifiable de données chiffrées. Il s'agit pour un serveur de stockage externe d'être assuré qu'il ne conserve qu'un seul exemplaire de chaque fichier, même si ceux-ci sont chiffrés, ce qui lui permet d'optimiser l'usage de ses ressources mémoires. Ensuite, nous proposons un schéma de chiffrement cherchable permettant de détecter des intrusions dans un réseau de télécommunications chiffrés. En effet, le travail d'inspection du réseau par des moteurs d'analyse est actuellement entravé par la croissance du trafic chiffré. Les résultats obtenus permettent ainsi d'assurer la confidentialité des échanges tout en garantissant l'absence d'intrusions malveillantes dans le traficNowadays, encryption and services issued of ``big data" are at odds. Indeed, encryption is about protecting users privacy, while big data is about analyzing users data. Being increasingly concerned about security, users tend to encrypt their sensitive data that are subject to be accessed by other parties, including service providers. This hinders the execution of services requiring some kind of computation on users data, which makes users under obligation to choose between these services or their private life. We address this challenge in this thesis by following two directions.In the first part of this thesis, we study fully homomorphic encryption that makes possible to perform arbitrary computation on encrypted data. However, this kind of encryption is still inefficient, and this is due in part to the frequent execution of a costly procedure throughout evaluation, namely the bootstrapping. Thus, efficiency is inversely proportional to the number of bootstrappings needed to evaluate functions on encrypted data. In this thesis, we prove that finding such a minimum is NP-complete. In addition, we design a new method that efficiently finds a good approximation of it. In the second part, we design schemes that allow a precise functionality. The first one is verifiable deduplication on encrypted data, which allows a server to be sure that it keeps only one copy of each file uploaded, even if the files are encrypted, resulting in an optimization of the storage resources. The second one is intrusion detection over encrypted traffic. Current encryption techniques blinds intrusion detection services, putting the final user at risks. Our results permit to reconcile users' right to privacy and their need of keeping their network clear of all intrusion
7
Wen, Weiqiang. „Contributions to the hardness foundations of lattice-based cryptography“. Thesis, Lyon, 2018. http://www.theses.fr/2018LYSEN070/document.
Der volle Inhalt der QuelleAnnotation:
La cryptographie sur les réseaux est l’une des approches les plus compétitives pour protéger la confidentialité, dans les applications actuelles et l’ère post-quantique. Le problème central qui sert de fondement de complexité de la cryptographie sur réseaux est Learning with Errors (LWE). Il consiste à résoudre un système d’équations bruité, linéaire et surdéterminé. Ce problème est au moins aussi difficile que les problèmes standards portant sur les réseaux, tels que le décodage à distance bornée (BDD pour Bounded Distance Decoding) et le problème du vecteur le plus court unique (uSVP pour unique Shortest Vector Problem). Tous ces problèmes sont conjecturés difficiles à résoudre, même avec un ordinateur quantique de grande échelle. En particulier, le meilleur algorithme connu pour résoudre ces problèmes, BKZ, est très coûteux. Dans cette thèse, nous étudions les relations de difficulté entre BDD et uSVP, la difficulté quantique de LWE et les performances pratiques de l’algorithme BKZ. Tout d’abord, nous donnons une relation de difficulté plus étroite entre BDD et uSVP. Plus précisément, nous améliorons la réduction de BDD à uSVP d’un facteur √2, comparément à celle de Lyubashevsky et Micciancio. Ensuite, Nous apportons un nouvel élément à la conjecture que LWE est quantiquement difficile. Concrètement, nous considérons une version relâchée de la version quantique du problème du coset dièdral et montrons une équivalence computationnelle entre LWE et ce problème. Enfin, nous proposons un nouveau simulateur pour BKZ. Dans ce dernier travail, nous proposons le premier simulateur probabiliste pour BKZ, qui permet de prévoir le comportement pratique de BKZ très précisémentLattice-based cryptography is one of the most competitive candidates for protecting privacy, both in current applications and post quantum period. The central problem that serves as the hardness foundation of lattice-based cryptography is called the Learning with Errors (LWE). It asks to solve a noisy equation system, which is linear and over-determined modulo q. Normally, we call LWE problem as an average-case problem as all the coefficients in the equation system are randomly chosen modulo q. The LWE problem is conjectured to be hard even wtih a large scale quantum computer. It is at least as hard as standard problems defined in the lattices, such as Bounded Distance Decoding (BDD) and unique Shortest Vector Problem (uSVP). Finally, the best known algorithm for solving these problems is BKZ, which is very expensive. In this thesis, we study the quantum hardness of LWE, the hardness relations between the underlying problems BDD and uSVP, and the practical performance of the BKZ algorithm. First, we give a strong evidence of quantum hardness of LWE. Concretely, we consider a relaxed version of the quantum version of dihedral coset problem and show an computational equivalence between LWE and this problem. Second, we tighten the hardness relation between BDD and uSVP. More precisely, We improve the reduction from BDD to uSVP by a factor √2, compared to the one by Lyubashevsky and Micciancio. Third, we propose a more precise simulator for BKZ. In the last work, we propose the first probabilistic simulotor for BKZ, which can pridict the practical behavior of BKZ very precisely
8
Löken, Nils [Verfasser]. „Cryptography for the crowd : a study of cryptographic schemes with applications to crowd work / Nils Löken“. Paderborn : Universitätsbibliothek, 2019. http://d-nb.info/1203205074/34.
Der volle Inhalt der Quelle
9
Lambin, Baptiste. „Optimization of core components of block ciphers“. Thesis, Rennes 1, 2019. http://www.theses.fr/2019REN1S036/document.
Der volle Inhalt der QuelleAnnotation:
La sécurité des chiffrements par bloc évolue constamment au fur et à mesure que de nouvelles techniques de cryptanalyse sont découvertes. Lors de la conception de nouveaux chiffrements par bloc, il est donc nécessaire de considérer ces nouvelles techniques dans l'analyse de sécurité. Dans cette thèse, nous montrons comment construire certaines opérations internes des chiffrements par bloc pour améliorer la résistance à certaines attaques. Nous commençons par donner une méthode pour trouver les permutations paires-impaires optimales selon un certain critère pour les Réseaux de Feistel Généralisés. Grâce à une nouvelle caractérisation et à un algorithme efficace, nous sommes notamment capables de résoudre un problème ouvert depuis 10 ans. Nous donnons ensuite de nouvelles techniques de cryptanalyse pour améliorer la division property, qui nous permet également de donner un nouveau critère optimal pour la conception de boîtes-S. Nous continuons avec de nouvelles observations pour un cadencement de clé alternatif pour AES. Ceci nous permet de donner un nouveau cadencement de clé, à la fois plus efficace et augmentant la sécurité face à certaines attaques par rapport à l’original. Pour finir, nous présentons un algorithme général très effiace permettant d’attaquer la majorité des propositions pour la cryptographie en boîte blanche, ainsi qu’une attaque dédiée sur un schéma non attaqué jusque là, donnant lieu à une attaque qui n’a besoin que de quelques secondes pour retrouver la cléAlong with new cryptanalysis techniques, the security of block ciphers is always evolving. When designing new block ciphers, we thus need to consider these new techniques during the security analysis. In this thesis, we show how to build some core operations for block ciphers to improve the security against some attacks. We first start by describing a method to find optimal (according to some criterion) even-odd permutations for a Generalized Feistel Network. Using a new characterization and an efficient algorithm, we are able to solve a 10-years old problem. We then give new cryptanalysis techniques to improve the division property, along with a new proven optimal criterion for designing S-boxes. We continue with new observations for the design of an alternative key-schedule for AES. We thus give a new key-schedule, which is both more efficient and more secure against some attacks compared to the original one. Finally, we describe a very efficient generic algorithm to break most proposals in white-box cryptography, as well as a dedicated attack on a previously not analyzed scheme, leading to a key-recovery attack in a few seconds
10
Delaplace, Claire. „Algorithmes d'algèbre linéaire pour la cryptographie“. Thesis, Rennes 1, 2018. http://www.theses.fr/2018REN1S045/document.
Der volle Inhalt der QuelleAnnotation:
Dans cette thèse, nous discutons d’aspects algorithmiques de trois différents problèmes, en lien avec la cryptographie. La première partie est consacrée à l’algèbre linéaire creuse. Nous y présentons un nouvel algorithme de pivot de Gauss pour matrices creuses à coefficients exacts, ainsi qu’une nouvelle heuristique de sélection de pivots, qui rend l’entière procédure particulièrement efficace dans certains cas. La deuxième partie porte sur une variante du problème des anniversaires, avec trois listes. Ce problème, que nous appelons problème 3XOR, consiste intuitivement à trouver trois chaînes de caractères uniformément aléatoires de longueur fixée, telles que leur XOR soit la chaîne nulle. Nous discutons des considérations pratiques qui émanent de ce problème et proposons un nouvel algorithme plus rapide à la fois en théorie et en pratique que les précédents. La troisième partie est en lien avec le problème learning with errors (LWE). Ce problème est connu pour être l’un des principaux problèmes difficiles sur lesquels repose la cryptographie à base de réseaux euclidiens. Nous introduisons d’abord un générateur pseudo-aléatoire, basé sur la variante dé-randomisée learning with rounding de LWE, dont le temps d’évaluation est comparable avec celui d’AES. Dans un second temps, nous présentons une variante de LWE sur l’anneau des entiers. Nous montrerons que dans ce cas le problème est facile à résoudre et nous proposons une application intéressante en re-visitant une attaque par canaux auxiliaires contre le schéma de signature BLISSIn this thesis, we discuss algorithmic aspects of three different problems, related to cryptography. The first part is devoted to sparse linear algebra. We present a new Gaussian elimination algorithm for sparse matrices whose coefficients are exact, along with a new pivots selection heuristic, which make the whole procedure particularly efficient in some cases. The second part treats with a variant of the Birthday Problem with three lists. This problem, which we call 3XOR problem, intuitively consists in finding three uniformly random bit-strings of fixed length, such that their XOR is the zero string. We discuss practical considerations arising from this problem, and propose a new algorithm which is faster in theory as well as in practice than previous ones. The third part is related to the learning with errors (LWE) problem. This problem is known for being one of the main hard problems on which lattice-based cryptography relies. We first introduce a pseudorandom generator, based on the de-randomised learning with rounding variant of LWE, whose running time is competitive with AES. Second, we present a variant of LWE over the ring of integers. We show that in this case the problem is easier to solve, and we propose an interesting application, revisiting a side-channel attack against the BLISS signature scheme
Bücher zum Thema "CRYPTOGRAPHI"
1
Sokolov, Artem, und Oleg Zhdanov. Cryptographic constructions on the basis of functions of multivalued logic. ru: INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1045434.
Der volle Inhalt der QuelleAnnotation:
Symmetric encryption algorithms have been successfully used to protect information during transmission on an open channel. The classical approach to the synthesis of modern cryptographic algorithms and cryptographic primitives on which they are based, is the use of mathematical apparatus of Boolean functions. The authors demonstrate that the use to solve this problem of functions of multivalued logic (FML) allows to largely improve the durability of the cryptographic algorithms and to extend the used algebraic structures. On the other hand, the study of functions of multivalued logic in cryptography leads to a better understanding of the principles of cryptographic primitives and the emergence of new methods of describing cryptographic constructions.
In the monograph the results of theoretical and experimental studies of the properties of the FML, the presented algorithms for generating high-quality S-blocks for the symmetric encryption algorithms, as well as full-working samples of the cryptographic algorithms ready for practical implementation.
For students and teachers and all those interested in issues of information security.
2
Mi ma xue yuan li yu shi jian: Di er ban= Cryptography theory and practice. Beijing: Dian zi gong ye chu ban she, 2003.
Den vollen Inhalt der Quelle finden
3
Churchhouse, R. F. Codes and ciphers: Julius Caesar, the Enigma, and the internet. Cambridge: Cambridge University Press, 2002.
Den vollen Inhalt der Quelle finden
4
Codes and cryptography. Oxford [Oxfordshire]: Clarendon Press, 1988.
Den vollen Inhalt der Quelle finden
5
An introduction to cryptology. Boston: Kluwer Academic Publishers, 1988.
Den vollen Inhalt der Quelle finden
6
éd, Walker M., Hrsg. Cryptography and coding: 7th IMA conference, Cirencester, UK, December 20-22, 1999 : proceedings. Berlin: Springer, 1999.
Den vollen Inhalt der Quelle finden
7
Stinson, Douglas R., und Maura B. Paterson. Cryptography. Fourth edition. | Boca Raton : CRC Press, Taylor & Francis: Chapman and Hall/CRC, 2018. http://dx.doi.org/10.1201/9781315282497.
Der volle Inhalt der Quelle
8
Rubinstein-Salzedo, Simon. Cryptography. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94818-8.
Der volle Inhalt der Quelle
9
Levy, Steven. Crypto: How the code rebels beat the government-saving privacy in the digital age. New York: Viking, 2001.
Den vollen Inhalt der Quelle finden
10
C, Washington Lawrence, Hrsg. Introduction to cryptography: With coding theory. Upper Saddle River, NJ: Prentice Hall, 2002.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "CRYPTOGRAPHI"
1
Hofheinz, Dennis, und Eike Kiltz. „Scalable Cryptography“. In Lecture Notes in Computer Science, 169–78. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-21534-6_9.
Der volle Inhalt der QuelleAnnotation:
AbstractIn our modern digital society, cryptography is vital to protect the secrecy and integrity of transmitted and stored information. Settings like digital commerce, electronic banking, or simply private email communication already rely on encryption and signature schemes.However, today’s cryptographic schemes do not scale well, and thus are not suited for the increasingly large sets of data they are used on. For instance, the security guarantees currently known for RSA encryption—one of the most commonly used type of public-key encryption scheme—degrade linearly in the number of users and ciphertexts. Hence, larger settings (such as cloud computing, or simply the scenario of encrypting all existing email traffic) may enable new and more efficient attacks. To maintain a reasonable level of security in larger scenarios, RSA keylengths must be chosen significantly larger, and the scheme becomes very inefficient. Besides, a switch in RSA keylengths requires an update of the whole public key infrastructure, an impossibility in truly large scenarios. Even worse, when the scenario grows beyond an initially anticipated size, we may lose all security guarantees.This problematic is the motivation for our project “Scalable Cryptography”, which aims at offering a toolbox of cryptographic schemes that are suitable for huge sets of data. In this overview, we summarize the approach, and the main findings of our project. We give a number of settings in which it is possible to indeed provide scalable cryptographic building blocks. For instance, we survey our work on the construction of scalable public-key encryption schemes (a central cryptographic building block that helps secure communication), but also briefly mention other settings such as “reconfigurable cryptography”. We also provide first results on scalable quantum-resistant cryptography, i.e., scalable cryptographic schemes that remain secure even in the presence of a quantum computer.
2
Lin, Weyde. „Digital Signature“. In Trends in Data Protection and Encryption Technologies, 77–81. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33386-6_15.
Der volle Inhalt der QuelleAnnotation:
AbstractA digital signature uses cryptographic hashing functions and asymmetric cryptography to sign data. It also provides origin authentication, data integrity, and signer non-repudiation. The main idea is to generate a hash of the data using a cryptographic hashing function and then encrypt it by the signing party using its private key. As part of the verification process, the verifying party generates the hash of the data using the same cryptographic hashing function. With the increasing digitalization of business processes and other processes, the ability to apply and verify digital signatures will become increasingly important.
3
Zheng, Zhiyong, Kun Tian und Fengxia Liu. „A Generalization of NTRUencrypt“. In Financial Mathematics and Fintech, 175–88. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-7644-5_7.
Der volle Inhalt der QuelleAnnotation:
AbstractNTRU cryptosystem is a new public key cryptosystem based on lattice hard problem proposed in 1996 by three digit theorists Hoffstein, Piper and Silverman of Brown University in the United States. The essence of NTRU cryptographic design is the generalization of RSA on polynomials, so it is called the cryptosystem based on polynomial rings. Its main feature is that the key generation is very simple, and the encryption and decryption algorithm is much faster than the commonly used RSA and elliptic curve cryptography. In particular, NTRU can resist quantum computing attacks and is considered to be a potential public key cryptography that can replace RSA in the post-quantum cryptography era.
4
Moosavi, Sanaz Rahimi, und Arman Izadifar. „End-to-End Security Scheme for E-Health Systems Using DNA-Based ECC“. In Silicon Valley Cybersecurity Conference, 77–89. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96057-5_6.
Der volle Inhalt der QuelleAnnotation:
AbstractToday, the amount of data produced and stored in computing Internet of Things (IoT) devices is growing. Massive volumes of sensitive information are exchanged between these devices making it critical to ensure the security of these data. Cryptography is a widely used method for ensuring data security. Many lightweight cryptographic algorithms have been developed to address the limitations of resources on the IoT devices. Such devices have limited processing capabilities in terms of memory, processing power, storage, etc. The primary goal of exploiting cryptographic technique is to send data from the sender to the receiver in the most secure way to prevent eavesdropping of the content of the original data. In this paper, we propose an end-to-end security scheme for IoT system. The proposed scheme consists of (i) a secure and efficient mutual authentication scheme based on the Elliptic Curve Cryptography (ECC) and the Quark lightweight hash design, and (ii) a secure end-to-end communication based on Deoxyribonucleic Acid (DNA) and ECC. DNA Cryptography is the cryptographic technique to encrypt and decrypt the original data using DNA sequences based on its biological processes. It is a novel technique to hide data from unauthorized access with the help of DNA. The security analysis of the proposed scheme reveals that it is secure against the relevant threat models and provides a higher security level than the existing related work in the literature.
5
Buchmann, Johannes. „Sustainable Cryptography“. In International Symposium on Mathematics, Quantum Theory, and Cryptography, 3. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5191-8_1.
Der volle Inhalt der QuelleAnnotation:
Abstract Cryptography is a fundamental tool for cybersecurity and privacy which must be protected for long periods of time. However, the security of most cryptographic algorithms relies on complexity assumptions that may become invalid over time. In this talk I discuss how sustainable cybersecurity and privacy can be achieved in this situation.
6
Jo, Hyungrok, Shingo Sugiyama und Yoshinori Yamasaki. „Ramanujan Graphs for Post-Quantum Cryptography“. In International Symposium on Mathematics, Quantum Theory, and Cryptography, 231–50. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5191-8_17.
Der volle Inhalt der QuelleAnnotation:
Abstract We introduce a cryptographic hash function based on expander graphs, suggested by Charles et al. ’09, as one prominent candidate in post-quantum cryptography. We propose a generalized version of explicit constructions of Ramanujan graphs, which are seen as an optimal structure of expander graphs in a spectral sense, from the previous works of Lubotzky, Phillips, Sarnak ’88 and Chiu ’92. We also describe the relationship between the security of Cayley hash functions and word problems for group theory. We also give a brief comparison of LPS-type graphs and Pizer’s graphs to draw attention to the underlying hard problems in cryptography.
7
Cachin, Christian. „Multi-Party Threshold Cryptography“. In Trends in Data Protection and Encryption Technologies, 65–69. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33386-6_13.
Der volle Inhalt der QuelleAnnotation:
AbstractIn a threshold cryptosystem, the private key is typically distributed among parties that constitute the system using cryptographically secure secret sharing. Particular focus must be placed on generating the private key held jointly by the parties. Up to F of the parties might be faulty and leak their key shares, but F + 1 must cooperate in executing a cryptographic operation. Standards for threshold cryptography and the corresponding open-source implementations are expected to emerge because of the multi-year efforts driven by governmental or private-sector standardization agencies. For building secure distributed systems that can survive a partial corruption of their components, multi-party threshold cryptography plays an important role.
8
Cook, Debra L., John Ioannidis, Angelos D. Keromytis und Jake Luck. „CryptoGraphics: Secret Key Cryptography Using Graphics Cards“. In Lecture Notes in Computer Science, 334–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30574-3_23.
Der volle Inhalt der Quelle
9
Sommerhalder, Maria. „Hardware Security Module“. In Trends in Data Protection and Encryption Technologies, 83–87. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33386-6_16.
Der volle Inhalt der QuelleAnnotation:
AbstractHardware security modules are specialized devices that perform cryptographic operations. Their functions include key generation, key management, encryption, decryption, and hashing. The advent of cloud computing has increased the complexity of securing critical data. As a result, double-key encryption has become increasingly popular, which encrypts data using two keys. A copy is stored on an HSM, and a copy is stored in the cloud. Furthermore, as Hardware security modules can manage keys and enable users to manage keys, they provide significant security benefits to applications utilizing cryptography.
10
Hardy, Yorick, und Willi-Hans Steeb. „Cryptography“. In Classical and Quantum Computing, 215–28. Basel: Birkhäuser Basel, 2001. http://dx.doi.org/10.1007/978-3-0348-8366-5_11.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "CRYPTOGRAPHI"
1
Faz-Hernández, Armando, und Julio López. „High-Performance Elliptic Curve Cryptography: A SIMD Approach to Modern Curves“. In Concurso de Teses e Dissertações. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/ctd.2023.230156.
Der volle Inhalt der QuelleAnnotation:
Cryptography based on elliptic curves is endowed with efficient methods for public-key cryptography. Recent research has shown the superiority of the Montgomery and Edwards curves over the Weierstrass curves as they require fewer arithmetic operations. Using these modern curves has, however, introduced several challenges to the cryptographic algorithm’s design, opening up new opportunities for optimization. Our main objective is to propose algorithmic optimizations and implementation techniques for cryptographic algorithms based on elliptic curves. In order to speed up the execution of these algorithms, our approach relies on the use of extensions to the instruction set architecture. In addition to those specific for cryptography, we use extensions that follow the Single Instruction, Multiple Data (SIMD) parallel computing paradigm. In this model, the processor executes the same operation over a set of data in parallel. We investigated how to apply SIMD to the implementation of elliptic curve algorithms. As part of our contributions, we design parallel algorithms for prime field and elliptic curve arithmetic. We also design a new three-point ladder algorithm for the scalar multiplication P + kQ, and a faster formula for calculating 3P on Montgomery curves. These algorithms have found applicability in isogeny-based cryptography. Using SIMD extensions such as SSE, AVX, and AVX2, we develop optimized implementations of the following cryptographic algorithms: X25519, X448, SIDH, ECDH, ECDSA, EdDSA, and qDSA. Performance benchmarks show that these implementations are faster than existing implementations in the state of the art. Our study confirms that using extensions to the instruction set architecture is an effective tool for optimizing implementations of cryptographic algorithms based on elliptic curves. May this be an incentive not only for those seeking to speed up programs in general but also for computer manufacturers to include more advanced extensions that support the increasing demand for cryptography.
2
Лацин, Семен Михайлович, und Наталья Александровна Борсук. „ANALYSIS OF ELLIPTICAL CRYPTOGRAPHY ON THE EXAMPLE OF THE BITCOIN BLOCKCHAIN“. In Методики фундаментальных и прикладных научных исследований: сборник статей всероссийской научной конференции (Санкт-Петербург, Декабрь 2022). Crossref, 2023. http://dx.doi.org/10.37539/221223.2022.83.11.008.
Der volle Inhalt der QuelleAnnotation:
Криптография на основе эллиптических кривых была недавней областью исследований в криптографии. Она обеспечивает более высокий уровень безопасности с меньшим размером ключа по сравнению с другими методами шифрования. В статье рассмотрен принцип работы эллиптической криптографии. Elliptic curve cryptography has been a recent research area in the field of cryptography. It provides higher level of security with lesser key size compared to other cryptographic techniques. The article considers the principle of operation of elliptic curve cryptography.
3
Slutsky, Boris A., R. Rao, L. Tancevski, P. C. Sun und Y. Fainman. „Information Leakage Estimates in Quantum Cryptography“. In Optics in Computing. Washington, D.C.: Optica Publishing Group, 1997. http://dx.doi.org/10.1364/oc.1997.owc.2.
Der volle Inhalt der QuelleAnnotation:
Quantum cryptography permits two parties, who share no secret information initially, to communicate over an open channel and establish between themselves a shared secret sequence of bits [1]. Quantum cryptography is provably secure against an eavesdropping attack because any attempt by a third party to monitor a quantum cryptographic channel reveals itself through transmission errors between the legitimate users.
4
Duta, Cristinaloredana, und Laura Gheorghe. „ELEARNING FRAMEWORK FOR UNDERSTANDING CRYPTOGRAPHY AT ALL LEVELS“. In eLSE 2015. Carol I National Defence University Publishing House, 2015. http://dx.doi.org/10.12753/2066-026x-15-026.
Der volle Inhalt der QuelleAnnotation:
Nowadays security is needed in order to transmit confidential information over the network, which means that is required in everyday life of humanity. The best way to ensure data confidentiality is by using cryptography, which is considered an essential component in many modern applications. In this context, it is important for developers to understand how to efficiently and correctly implement security mechanisms and also how to apply them properly. In this paper, we present an eLearning platform for teachers, students, developers and other users interested in cryptography. The application allows users to experiment with cryptographic algorithms, and to learn how to implement, apply and evaluate cryptographic concepts. The eLearning framework encourages users to develop their own cryptographic algorithms and to verify them, by including a wide variety of cryptographic mechanisms for symmetric and asymmetric algorithms and many analysis tools. For instance, it allows users to analyze the randomness of the generated data, to determine the performance in terms of speed and throughput, and to evaluate the cryptographic properties of substitution and permutation functions. Moreover, the framework allows the user to test all the cryptographic algorithms that are included and to add new cryptographic algorithms for testing, without requiring the application to be modified. Additionally, it provides flexibility, which means that the existing or new algorithms can be fully parameterized by the users. Also the cryptographic eLearning platform allows users to track the execution of complex algorithms on real world examples in a step by step detailed view. It is an easy-to-use application, which offers a consistent and rich user experience.
5
Pacheco, Rodrigo, Douglas Braga, Iago Passos, Thiago Araújo, Vinícius Lagrota und Murilo Coutinho. „libharpia: a New Cryptographic Library for Brazilian Elections“. 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.2022.224098.
Der volle Inhalt der QuelleAnnotation:
The Research and Development Center for Communication Security (CEPESC) has a long partnership history with the Brazilian Superior Electoral Court to improve the security of the Brazilian election system. Among all the contributions from CEPESC, probably the most important is a cryptographic library used in some critical moments during the election. In an effort to improve transparency and auditability of the solution, we present the new cryptographic library developed at CEPESC, named libharpia. Its main design goal is to allow transparency and readability while substantially increasing security. One of the main advances is the use of post-quantum cryptography, implemented through secure hybrid protocols that mix current cryptographic standards (specifically elliptic curves) with new cryptographic primitives based on Lattices, believed to be secure against quantum computers.
6
Rodrigues, Gustavo Eloi de P., Alexandre M. Braga und Ricardo Dahab. „A machine learning approach to detect misuse of cryptographic APIs in source code“. In 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.2020.19223.
Der volle Inhalt der QuelleAnnotation:
Cryptography is an indispensable tool for achieving security requirements such as software security. However, most software developers do not have enough knowledge regarding the proper use of cryptography and its APIs. This leads to incorrect use and exploitable vulnerabilities in software applications. Here, we propose an approach based on machine learning techniques to detect different kinds of cryptographic misuse in known java source code representations, achieving an average 52 percentage points improvement with respect to previous works.
7
Braga, Alexandre, und Ricardo Dahab. „A Longitudinal and Retrospective Study on How Developers Misuse Cryptography in Online Communities“. In Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais. Sociedade Brasileira de Computação - SBC, 2017. http://dx.doi.org/10.5753/sbseg.2017.19488.
Der volle Inhalt der QuelleAnnotation:
Software developers participating in online communities benefit from quick solutions to technology specific issues and, eventually, get better in troubleshooting technology malfunctioning. In this work, we investigate whether developers who are part of online communities for cryptography programming are getting better in using cryptography with time. This is a crucial issue nowadays, when "real-world crypto" is becoming a topic of serious investigation, not only academically but in security management as a whole: cryptographic programming handled by non-specialists is an important and often invisible source of vulnerabilities [RWC ]. We performed a retrospective and longitudinal study, tracking developers' answers about cryptography programming in two online communities. We found that cryptography misuse is not only common in online communities, but also recurrent in developer's discussions, suggesting that developers can learn how to use crypto APIs without actually learning cryptography. In fact, we could not identify significant improvements in cryptography learning in many daily tasks such as avoiding obsolete cryptography. We conclude that the most active users of online communities for cryptography APIs are not learning the tricky details of applied cryptography, a quite worrisome state of affairs.
8
Adebisi Ojo, Segun, Aderonke Favour-Bethy Thompson, Mary O Iyare und Boniface Kayode Alese. „On Information Integrity Measurement with Secure Hash Algorithm (SHA)“. In InSITE 2015: Informing Science + IT Education Conferences: USA. Informing Science Institute, 2015. http://dx.doi.org/10.28945/2154.
Der volle Inhalt der QuelleAnnotation:
The “information age” as often referred to the modern society, has become heavily dependent on information systems. As this dependency increases, the threat to information security has also gained ground. Societies need to cater for the security of information, and this has led to the development of different information security techniques most notable of which is cryptography. Cryptographic Hash functions are used to achieve a number of security goals like authenticity, digital signatures, pseudo-random number generation, digital steganography, digital time stamping. The strength of a cryptographic hash function can be summarized into its vulnerability to attack and computational time. This work therefore, reviews existing standard cryptographic hash functions, their construction and their application areas. The secured hash function (SHA) was selected and implemented based on its comparative worth over others. The implemented cryptographic hash function is evaluated for performance using a cryptographic evaluation standard.
9
Xia, Ruiqi, Manman Li und Shaozhen Chen. „Cryptographic Algorithms Identification based on Deep Learning“. In 3rd International Conference on Artificial Intelligence and Machine Learning (CAIML 2022). Academy and Industry Research Collaboration Center (AIRCC), 2022. http://dx.doi.org/10.5121/csit.2022.121217.
Der volle Inhalt der QuelleAnnotation:
The identification of cryptographic algorithms is the premise of cryptanalysis which can help recover the keys effectively. This paper focuses on the construction of cryptographic identification classifiers based on residual neural network and feature engineering. We select 6 algorithms including block ciphers and public keys ciphers for experiments. The results show that the accuracy is generally over 90% for each algorithm. Our work has successfully combined deep learning with cryptanalysis, which is also very meaningful for the development of modern cryptography and pattern recognition.
10
A. Gunathilake, Nilupulee, Ahmed Al-Dubai, William J. Buchanan und Owen Lo. „Electromagnetic Analysis of an Ultra-Lightweight Cipher: PRESENT“. In 10th International Conference on Information Technology Convergence and Services (ITCSE 2021). AIRCC Publishing Corporation, 2021. http://dx.doi.org/10.5121/csit.2021.110915.
Der volle Inhalt der QuelleAnnotation:
Side-channel attacks are an unpredictable risk factor in cryptography. Therefore, continuous observations of physical leakages are essential to minimise vulnerabilities associated with cryptographic functions. Lightweight cryptography is a novel approach in progress towards internet-of-things (IoT) security. Thus, it would provide sufficient data and privacy protection in such a constrained ecosystem. IoT devices are resource-limited in terms of data rates (in kbps), power maintainability (battery) as well as hardware and software footprints (physical size, internal memory, RAM/ROM). Due to the difficulty in handling conventional cryptographic algorithms, lightweight ciphers consist of small key sizes, block sizes and few operational rounds. Unlike in the past, affordability to perform side-channel attacks using inexpensive electronic circuitries is becoming a reality. Hence, cryptanalysis of physical leakage in these emerging ciphers is crucial. Among existing studies, power analysis seems to have enough attention in research, whereas other aspects such as electromagnetic, timing, cache and optical attacks continue to be appropriately evaluated to play a role in forensic analysis. As a result, we started analysing electromagnetic emission leakage of an ultra-lightweight block cipher, PRESENT. According to the literature, PRESENT promises to be adequate for IoT devices, and there still seems not to exist any work regarding correlation electromagnetic analysis (CEMA) of it. Firstly, we conducted simple electromagnetic analysis in both time and frequency domains and then proceeded towards CEMA attack modelling. This paper provides a summary of the related literature (IoT, lightweight cryptography, side-channel attacks and EMA), our methodology, current outcomes and future plans for the optimised results.
Berichte der Organisationen zum Thema "CRYPTOGRAPHI"
1
de Abreu, Jonas, und Mariana Cunha e Melo. Extending Pix: An approach to offline Dynamic QR Code generation. Center for Technology and Public Interest, SL, April 2023. http://dx.doi.org/10.59262/9qu6ex.
Der volle Inhalt der QuelleAnnotation:
The Pix Dynamic QR Code URI can be extended to allow for offline QR Code generation. The proposed solution involves generating URIs that can be used as a vehicle to transmit information from the client to the server, allowing the payee to generate their own URIs. The document also goes into detail about URI properties, encoding, and cryptography. The proposed design balances tradeoffs between the amount of data that can be transmitted and cryptographic guarantees, and uses commonly available cryptographic primitives to reduce implementation costs.
2
Mouha, Nicky. Review of the Advanced Encryption Standard. National Institute of Standards and Technology, Juli 2021. http://dx.doi.org/10.6028/nist.ir.8319.
Der volle Inhalt der QuelleAnnotation:
The field of cryptography continues to advance at a very rapid pace, leading to new insights that may impact the security properties of cryptographic algorithms. The Crypto Publication Review Board ("the Board") has been established to identify publications to be reviewed. This report subjects the first standard to the review process: Federal Information Processing Standard (FIPS) 197, which defines the Advanced Encryption Standard (AES).
3
Blake-Wilson, S., D. Brown und P. Lambert. Use of Elliptic Curve Cryptography (ECC) Algorithms in Cryptographic Message Syntax (CMS). RFC Editor, April 2002. http://dx.doi.org/10.17487/rfc3278.
Der volle Inhalt der Quelle
4
Turner, S., und D. Brown. Use of Elliptic Curve Cryptography (ECC) Algorithms in Cryptographic Message Syntax (CMS). RFC Editor, Januar 2010. http://dx.doi.org/10.17487/rfc5753.
Der volle Inhalt der Quelle
5
Barker, William, William Polk und Murugiah Souppaya. Getting Ready for Post-Quantum Cryptography: Exploring Challenges Associated with Adopting and Using Post-Quantum Cryptographic Algorithms. National Institute of Standards and Technology, April 2021. http://dx.doi.org/10.6028/nist.cswp.04282021.
Der volle Inhalt der Quelle
6
Barker, William. Getting Ready for Post-Quantum Cryptography: Exploring Challenges Associated with Adopting and Using Post-Quantum Cryptographic Algorithms. Gaithersburg, MD: National Institute of Standards and Technology, 2021. http://dx.doi.org/10.6028/nist.cswp.15.
Der volle Inhalt der Quelle
7
Taiber, Joachim. Unsettled Topics Concerning the Impact of Quantum Technologies on Automotive Cybersecurity. SAE International, Dezember 2020. http://dx.doi.org/10.4271/epr2020026.
Der volle Inhalt der QuelleAnnotation:
Quantum computing is considered the “next big thing” when it comes to solving computational problems impossible to tackle using conventional computers. However, a major concern is that quantum computers could be used to crack current cryptographic schemes designed to withstand traditional cyberattacks. This threat also impacts future automated vehicles as they become embedded in a vehicle-to-everything (V2X) ecosystem. In this scenario, encrypted data is transmitted between a complex network of cloud-based data servers, vehicle-based data servers, and vehicle sensors and controllers. While the vehicle hardware ages, the software enabling V2X interactions will be updated multiple times. It is essential to make the V2X ecosystem quantum-safe through use of “post-quantum cryptography” as well other applicable quantum technologies. This SAE EDGE™ Research Report considers the following three areas to be unsettled questions in the V2X ecosystem: How soon will quantum computing pose a threat to connected and automated vehicle technologies? What steps and measures are needed to make a V2X ecosystem “quantum-safe?” What standardization is needed to ensure that quantum technologies do not pose an unacceptable risk from an automotive cybersecurity perspective?
8
Housley, R. Cryptographic Message Syntax. RFC Editor, Juni 1999. http://dx.doi.org/10.17487/rfc2630.
Der volle Inhalt der Quelle
9
Baker, F., B. Lindell und M. Talwar. RSVP Cryptographic Authentication. RFC Editor, Januar 2000. http://dx.doi.org/10.17487/rfc2747.
Der volle Inhalt der Quelle
10
Atkinson, R., und M. Fanto. RIPv2 Cryptographic Authentication. RFC Editor, Februar 2007. http://dx.doi.org/10.17487/rfc4822.
Der volle Inhalt der Quelle