Log in

Relevant bibliographies by topics / Symmetric-key primitive

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Symmetric-key primitive'

Author: Grafiati

Published: 25 May 2024

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 'Symmetric-key primitive.'

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 "Symmetric-key primitive"

1

Jang, Kyungbae, Yujin Oh, Hyunji Kim, and Hwajeong Seo. "Quantum Implementation of AIM: Aiming for Low-Depth." Applied Sciences 14, no. 7 (2024): 2824. http://dx.doi.org/10.3390/app14072824.

Full text

Abstract:

Security vulnerabilities in the symmetric-key primitives of a cipher can undermine the overall security claims of the cipher. With the rapid advancement of quantum computing in recent years, there is an increasing effort to evaluate the security of symmetric-key cryptography against potential quantum attacks. This paper focuses on analyzing the quantum attack resistance of AIM, a symmetric-key primitive used in the AIMer digital signature scheme. We present the first quantum circuit implementation of AIM and estimate its complexity (such as qubit count, gate count, and circuit depth) with resp

APA, Harvard, Vancouver, ISO, and other styles

2

Shaukat Jamal, Sajjad, Dawood Shah, Abdulaziz Deajim, and Tariq Shah. "The Effect of the Primitive Irreducible Polynomial on the Quality of Cryptographic Properties of Block Ciphers." Security and Communication Networks 2020 (September 24, 2020): 1–14. http://dx.doi.org/10.1155/2020/8883884.

Full text

Abstract:

Substitution boxes are the only nonlinear component of the symmetric key cryptography and play a key role in the cryptosystem. In block ciphers, the S-boxes create confusion and add valuable strength. The majority of the substitution boxes algorithms focus on bijective Boolean functions and primitive irreducible polynomial that generates the Galois field. For binary field F2, there are exactly 16 primitive irreducible polynomials of degree 8 and it prompts us to construct 16 Galois field extensions of order 256. Conventionally, construction of affine power affine S-box is based on Galois field

APA, Harvard, Vancouver, ISO, and other styles

3

Challa, RatnaKumari, and VijayaKumari Gunta. "A Modified Symmetric Key Fully Homomorphic Encryption Scheme Based on Read-Muller Code." Baghdad Science Journal 18, no. 2(Suppl.) (2021): 0899. http://dx.doi.org/10.21123/bsj.2021.18.2(suppl.).0899.

Full text

Abstract:

Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security. We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintex

APA, Harvard, Vancouver, ISO, and other styles

4

Partala, Juha. "Algebraic generalization of Diffie–Hellman key exchange." Journal of Mathematical Cryptology 12, no. 1 (2018): 1–21. http://dx.doi.org/10.1515/jmc-2017-0015.

Full text

Abstract:

AbstractThe Diffie–Hellman key exchange scheme is one of the earliest and most widely used public-key primitives. Its underlying algebraic structure is a cyclic group and its security is based on the discrete logarithm problem (DLP). The DLP can be solved in polynomial time for any cyclic group in the quantum computation model. Therefore, new key exchange schemes have been sought to prepare for the time when quantum computing becomes a reality. Algebraically, these schemes need to provide some sort of commutativity to enable Alice and Bob to derive a common key on a public channel while keepin

APA, Harvard, Vancouver, ISO, and other styles

5

Álvarez, Rafael, Alicia Andrade, and Antonio Zamora. "Optimizing a Password Hashing Function with Hardware-Accelerated Symmetric Encryption." Symmetry 10, no. 12 (2018): 705. http://dx.doi.org/10.3390/sym10120705.

Full text

Abstract:

Password-based key derivation functions (PBKDFs) are commonly used to transform user passwords into keys for symmetric encryption, as well as for user authentication, password hashing, and preventing attacks based on custom hardware. We propose two optimized alternatives that enhance the performance of a previously published PBKDF. This design is based on (1) employing a symmetric cipher, the Advanced Encryption Standard (AES), as a pseudo-random generator and (2) taking advantage of the support for the hardware acceleration for AES that is available on many common platforms in order to mitiga

APA, Harvard, Vancouver, ISO, and other styles

6

Alzahrani, Bander A., Ahmed Barnawi, and Shehzad Ashraf Chaudhry. "A Resource-Friendly Authentication Protocol for UAV-Based Massive Crowd Management Systems." Security and Communication Networks 2021 (November 5, 2021): 1–12. http://dx.doi.org/10.1155/2021/3437373.

Full text

Abstract:

As a part of the smart city revolution, crowd management is an emerging trend and it can enhance the quality of life. Unmanned ariel vehicles (UAVs) can help in making the crowd management process more efficient and more accurate. UAVs can monitor and collect environmental-related surveillance data and share real-time information with each other and with the decision makers. However, the battery-operated UAVs communicate over the open public channel making the privacy and security of the UAVs a crucial element in mission-critical applications. The weaknesses of the existing scheme pave the way

APA, Harvard, Vancouver, ISO, and other styles

7

Bulbul, Salim Sabah, Zaid Ameen Abduljabbar, Duaa Fadhel Najem, Vincent Omollo Nyangaresi, Junchao Ma, and Abdulla J. Y. Aldarwish. "Fast Multi-User Searchable Encryption with Forward and Backward Private Access Control." Journal of Sensor and Actuator Networks 13, no. 1 (2024): 12. http://dx.doi.org/10.3390/jsan13010012.

Full text

Abstract:

Untrusted servers are servers or storage entities lacking complete trust from the data owner or users. This characterization implies that the server hosting encrypted data may not enjoy full trust from data owners or users, stemming from apprehensions related to potential security breaches, unauthorized access, or other security risks. The security of searchable encryption has been put into question by several recent attacks. Currently, users can search for encrypted documents on untrusted cloud servers using searchable symmetric encryption (SSE). This study delves deeply into two pivotal conc

APA, Harvard, Vancouver, ISO, and other styles

8

kumar, N. Shantha, and Dr Hareesh K. "A Primitive Proposal of an Algorithm for IP and Mac Based Data Aggregation and message authentication in Wireless Sensor Networks." International Journal of Soft Computing and Engineering 9, no. 4 (2019): 14–17. http://dx.doi.org/10.35940/ijsce.c3322.109119.

Full text

Abstract:

In wireless sensor networks(WSN) ,authentication of messages is the highly important function in preventing threats from un wanted , un authorized and corrupt messages from being sent. There are various message verification and authentication methods have been proposed as well as developed based on cryptography technology such as symmetric key cryptographic systems or public-key cryptographic systems. Also there are many different techniques available based on polynomial-based schemes, elliptic curve cryptography (ECC) and so on. All the above said methods have its own merits and demerits. In

APA, Harvard, Vancouver, ISO, and other styles

9

Ludyawati, Ludyawati, Muhammad Khudzaifah, and Erna Herawati. "Penggabungan Metode Vigènere Cipher dan ElGamal Pada Pengamanan Pesan Rahasia." Jurnal Riset Mahasiswa Matematika 2, no. 6 (2023): 247–56. http://dx.doi.org/10.18860/jrmm.v2i6.22041.

Full text

Abstract:

Vigènere Cipher is a symmetric cryptographic algorithm that uses the same type of key in the encryption and decryption process. The security of the Vigènere Cipher method lies in the modulo calculation used. ElGamal is an asymmetric cryptographic algorithm that uses two different types of keys in the encryption and decryption process. The security of the ElGamal algorithm lies in the complexity of calculating large prime numbers. The Vigènere Cipher and ElGamal have their advantages and disadvantages. The researchers are interested in combining the advantages of the two methods. In this study,

APA, Harvard, Vancouver, ISO, and other styles

10

Huang, Jing Lian, Zhuo Wang, and Mei Rong He. "Algebraic Immunity, Correlation Immunity and other Cryptographic Properties of Quadratic Rotation Symmetric Boolean Functions." Advanced Materials Research 989-994 (July 2014): 2593–98. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.2593.

Full text

Abstract:

Boolean functions with a variety of secure cipher properties are the key factors to design cryptosystem with the ability to resist multiple cipher attacks and good safety performance. In this paper, using the derivative of the Boolean functions and the e-derivative defined by ourselves as the main research tools, we study algebraic immunity, correlation immunity and other cryptographic properties of the quadratic rotation symmetric Boolean functions. We determine the quadratic rotation symmetric Boolean functions which are H Boolean functions, and the range of weight distribution of the quadra

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Symmetric-key primitive"

1

Coggia, Daniel. "Techniques de cryptanalyse dédiées au chiffrement à bas coût." Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS217.

Full text

Abstract:

Cette thèse contribue à l’effort de cryptanalyse de primitives symétriques comme les chiffrements par bloc ou les générateurs pseudo-aléatoires. Elle étudie en particulier une famille de distingueurs fondés sur la propagation de sous-espaces vectoriels différentiels dans les chiffrements par bloc de construction SPN. Cette thèse propose également des méthodes permettant aux cryptographes de modéliser un problème de cryptanalyse de primitive symétrique en problème MILP (Mixed-Integer Linear Programming), afin d’exploiter certains logiciels solutionneurs de problèmes MILP très performants. Enfin

APA, Harvard, Vancouver, ISO, and other styles

2

Kircanski, Aleksandar. "Cryptanalysis of symmetric key primitives." Thesis, 2009. http://spectrum.library.concordia.ca/976777/1/MR63043.pdf.

Full text

Abstract:

Block ciphers and stream ciphers are essential building blocks that are used to construct computing systems which have to satisfy several security objectives. Since the security of these systems depends on the security of its parts, the analysis of these symmetric key primitives has been a goal of critical importance. In this thesis we provide cryptanalytic results for some recently proposed block and stream ciphers. First, we consider two light-weight block ciphers, TREYFER and PIFEA-M. While TREYFER was designed to be very compact in order to fit into constrained environments such as smart

APA, Harvard, Vancouver, ISO, and other styles

3

Esmaeili, Salehani Yaser. "Side Channel Attacks on Symmetric Key Primitives." Thesis, 2011. http://spectrum.library.concordia.ca/7765/1/EsmaeiliSalehani_MASc_F2011.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Zaverucha, Gregory. "Hash Families and Cover-Free Families with Cryptographic Applications." Thesis, 2010. http://hdl.handle.net/10012/5532.

Full text

Abstract:

This thesis is focused on hash families and cover-free families and their application to problems in cryptography. We present new necessary conditions for generalized separating hash families, and provide new explicit constructions. We then consider three cryptographic applications of hash families and cover-free families. We provide a stronger de nition of anonymity in the context of shared symmetric key primitives and give a new scheme with improved anonymity properties. Second, we observe that nding the invalid signatures in a set of digital signatures that fails batch veri cation is a gro

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Symmetric-key primitive"

1

Zhang, Handong, Puwen Wei, Haiyang Xue, et al. "Resumable Zero-Knowledge for Circuits from Symmetric Key Primitives." In Information Security and Privacy. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-22301-3_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ramzan, Zulfikar, and Leonid Reyzin. "On the Round Security of Symmetric-Key Cryptographic Primitives." In Advances in Cryptology — CRYPTO 2000. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44598-6_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Nikolić, Ivica. "How to Use Metaheuristics for Design of Symmetric-Key Primitives." In Advances in Cryptology – ASIACRYPT 2017. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70700-6_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Buser, Maxime, Joseph K. Liu, Ron Steinfeld, and Amin Sakzad. "Post-quantum ID-Based Ring Signatures from Symmetric-Key Primitives." In Applied Cryptography and Network Security. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09234-3_44.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ghosal, Anit Kumar, Satrajit Ghosh, and Dipanwita Roychowdhury. "Practical Non-malleable Codes from Symmetric-Key Primitives in 2-Split-State Model." In Provable and Practical Security. Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-20917-8_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Grassi, Lorenzo, Irati Manterola Ayala, Martha Norberg Hovd, Morten Øygarden, Håvard Raddum, and Qingju Wang. "Cryptanalysis of Symmetric Primitives over Rings and a Key Recovery Attack on Rubato." In Advances in Cryptology – CRYPTO 2023. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38548-3_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Bangalore, Laasya, Rishabh Bhadauria, Carmit Hazay, and Muthuramakrishnan Venkitasubramaniam. "On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives." In Theory of Cryptography. Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-22318-1_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Derler, David, Sebastian Ramacher, and Daniel Slamanig. "Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives." In Post-Quantum Cryptography. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-79063-3_20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Noordhof, Paul. "Causal Non-Symmetry." In A Variety of Causes. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780199251469.003.0012.

Full text

Abstract:

Causation is a non-symmetric rather than asymmetric relation. Different bases of causal non-symmetry include an asymmetry of overdetermination, the independence condition, and agency. Causal non-symmetry can be rooted in one or more of these three while also recognizing a fourth non-symmetry appealing to a primitive non-symmetric chance-raising. Each counts as an appropriate basis for causal non-symmetry because it is a (partial) realization of non-symmetric chance-raising. Key moves involve a refinement of how to understand the way in which the asymmetry of overdetermination works, and how it interacts with the revised similarity weighting, the contribution of the independence condition to a proper understanding of the transition period, the role that appeals to primitive non-symmetric chance-raising should play in the treatment of problem cases, the circumstances in which an appeal to an interlevel non-symmetry of agency may be appropriate, and the priority ordering of these various realizations of causal non-symmetry.

APA, Harvard, Vancouver, ISO, and other styles

10

"Practical Constructions of Symmetric-Key Primitives." In Introduction to Modern Cryptography. Chapman and Hall/CRC, 2014. http://dx.doi.org/10.1201/b17668-11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Symmetric-key primitive"

1

Grassi, Lorenzo, Christian Rechberger, Dragos Rotaru, Peter Scholl, and Nigel P. Smart. "MPC-Friendly Symmetric Key Primitives." In CCS'16: 2016 ACM SIGSAC Conference on Computer and Communications Security. ACM, 2016. http://dx.doi.org/10.1145/2976749.2978332.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Anada, Hiroaki, Masayuki Fukumitsu, and Shingo Hasegawa. "Accountable Ring Signatures from Symmetric-Key Primitives*." In 2023 Eleventh International Symposium on Computing and Networking (CANDAR). IEEE, 2023. http://dx.doi.org/10.1109/candar60563.2023.00018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chase, Melissa, David Derler, Steven Goldfeder, et al. "Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives." In CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM, 2017. http://dx.doi.org/10.1145/3133956.3133997.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kara, Gizem, and Oguz Yayla. "Gröbner Basis Attack on STARK-Friendly Symmetric-Key Primitives: JARVIS, MiMC and GMiMC_erf." In 2022 15th International Conference on Information Security and Cryptography (ISCTURKEY). IEEE, 2022. http://dx.doi.org/10.1109/iscturkey56345.2022.9931846.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!