Questions tagged [terminology]

Questions about the meaning and proper use of specific technical terms or notation within cryptography.

Filter by
Sorted by
Tagged with
1
vote
1answer
28 views

Difference between Verification and Public Key for Signature Schemes

This is a semantics Question. Typically, in many asymmetric schemes, for this question specifically, digital signatures, we see that designers describe the key given to the verifier as Public Key. ...
5
votes
3answers
604 views

In laymans terms, what exactly is a “One time pad”?

Background I am an undergraduate novice learning about cryptography. Recently my professor introduced us to the concept of a "One time pad". According to my professor: A one time pad is a cipher ...
0
votes
0answers
33 views

Question about terminology of public key encryption in practice

I am asking myself the following question: Say Alice sets all things up so that she is the reciever in an RSA-system. What do you call this "network" now? I hope it is clear what I mean. I ...
0
votes
1answer
39 views

Termonology help: What is using AEAD without encrypting data called?

I'm using ChaCha20-Poly1305 in a "full AEAD" mode, where a payload of data is encrypted and a block of unencrypted "additional data" is secured as well. However, I'd like to also occasionally use the ...
1
vote
1answer
67 views

Is a bit string pseudorandom if it starts with predictable bits?

Assume we have $k = n + m$ bits string $S$ where the first $n$ bits are predictable, and the last $m$ bits are pseudorandom (the HMAC of the first $n$ bits + IV). Can we say $S$ is a pseudorandom ...
1
vote
2answers
92 views

Is obfuscation considered a cryptographic primitive?

The general definition of obfuscation is the process of obscuring a message (not necessarily source code). There is a "rigorous" method for obfuscation (indistinguishability obfuscation, ...
2
votes
1answer
75 views

What is Regular Digest/Hash Function

I was reading a paper, Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing where there was a reference to message digests being 'regular' Here, MD is a message digest. I've ...
5
votes
1answer
119 views

In cryptography, what is “fractionation”?

I understand how fractionation is used in the straddling keyboard, which is an important feature of the VIC Cipher, and in the Polybius Square of the ADFGVX cipher, but I am not sure how to describe ...
2
votes
3answers
122 views

Why is “key-rotation” called key-rotation?

The word "rotate" in respect to "key-rotation" has connotations of looping/repeating variable values like a rotor, but as far as I can tell there isn't a single definition available for "key-rotation" ...
2
votes
1answer
174 views

zk-SNARKs vs. Zk-STARKs vs. Bulletproofs: definitions

I have become quite familiar with Bulletproofs the last few months. Bulletproofs is the name given to a zero-knowledge proof system for arithmetic circuits, by Benedikt Bünz et al. It is a specific ...
1
vote
1answer
44 views

Definition of diffusion matrix

I've been studying this article and since I'm not studying cryptography in English and it is not my native language, I don't understand some of the terminology. More precisely: what are diffusion ...
2
votes
1answer
103 views

What is Reverse Trapdoor Function?

In wikipedia on Digital_signature: but rather, the message to be signed is first hashed to produce a short digest, that is then padded to larger width comparable to N, then signed with the ...
13
votes
7answers
6k views

Can I say “I have encrypted something” if I hash something?

As I understand it, a hashing algorithm is some kind of encryption, just a specific kind of it. So is it wrong to say "I encrypted this value." if I "only" hash it? I understand that it gives the ...
2
votes
0answers
58 views

What is labeled program

I've been studying homomorphic encryption. From their instantiations, i read Labeled Homomorphic Encryption (labHE) scheme 1 where it combines the notion of homomorphic encryption with labeled ...
0
votes
0answers
56 views

DLP instances for given number of congruences

Let $S$ be the set of $k$ congruences of the type $g_{i}^{x_i} \equiv h_i \pmod{n_i}, \quad \forall i,1\leq i \leq k$ What would be the best way to describe such set $S$ with a term in literature. ...
1
vote
2answers
38 views

What is the difference between “asymmetric key cryptosystem” “asymmetric cryptography” terminology?

What is the difference between "asymmetric cryptography" and "asymmetric key cryptosystem" terminology?
5
votes
2answers
173 views

The definition and origin of Schnorr groups?

Wanting to write something on Schnorr groups in a publication I realised how hard it is to find anything citable about them on the internet. Who can help me with the following questions? What (and ...
3
votes
2answers
66 views

What's the meaning of probabilities in differential privacy formula?

I don't understand what does it mean by "The probability is taken is over the coin tosses of K." Does it mean, the probability distribution is generated based on exactly same data but only the ...
4
votes
2answers
226 views

What is cryptographic sealing?

While revising my CAdES library I encountered some "sealing issue" in digital signatures. The Win SDK signtool.exe has a /seal ...
1
vote
1answer
75 views

Asymmetric Encryption - How is the Public Key Being Shared?

I've been reading up on the relationship between private keys and public keys (as well as hashing), and I watched a few videos, but I am still a bit confused. I don't have a programming background, ...
1
vote
1answer
82 views

Difference between hash functions and algorithms?

Wikipedia lists "Hash function algorithms" within the "Hash function" page. I'm wondering what are the differences and if I can use the terms "hash(ing?) algorithm" and "hash function" interchangeably....
0
votes
0answers
32 views

Term for non-ARX symmetric-key cryptographic primitive design strategy

What's the term for describing designing symmetric-key cryptography primitive out of bitwise operations and shifts and rotations? The closest thing I've found is this Keccek team's page calling it ...
2
votes
4answers
309 views

How to use “mod” related words in technical paper?

Modular reduction is a widely used arithmetic operation. I found many "mod" related words such as modulo modulus modular Can anyone explains the difference among these words? Please give examples ...
4
votes
2answers
159 views

Why ``adversary'' and ``challenger'' and what are typical roles of those?

I'm confused with words adversary and challenger, that are used in proof of security of some cryptosystems. For example, adversary and challenger appear in the formal definitions of IND-CPA, IND-CCA, ...
2
votes
3answers
81 views

“Work factor” and “iteration count” nomenclature in adaptive functions

In adaptive functions like PBKDF2 / bcrypt I often read people refer to "iteration count" and others refer to "work factor", and they seem to be used interchangeably (even though they're not - the ...
2
votes
2answers
60 views

What does it mean by 'cost' in CS?

I've seen the word 'cost' being used several times in describing algorithms e.g. algorithm A costs more to compute than algorithm B. What does 'cost' mean in this sense?
0
votes
2answers
372 views

Are ephemeral keys symmetric or asymmetric? [closed]

My question is: Are ephemeral keys symmetric or asymmetric? If symmetric, can ephemeral keys be created based on a (UserID || nonce)?
7
votes
0answers
127 views

What is the origin of the phrase “Don't roll your own crypto”?

The phrase is well-known and widely used, it is often attributed to Bruce Schneier and is indeed relevant to his Schneier's Law. However, I wasn't able to find this specific wording among Schneier's ...
3
votes
1answer
70 views

Are multi move proof protocols still “sigma protocols”?

Conventionally, sigma protocols are defined as being a three-move protocol (1. commit, 2. challenge, 3. response). Reading papers like "Bulletproofs" (Bunz, Bootle, Boneh et al., 2018), it feels like ...
1
vote
1answer
598 views

Mutual Index of Coincidence

I can't seem to find a simple explanation of Mutual Index of Coincidence. I am finding explanations of Mutual Index of Coincidence not Index of Coincidence. I don't understand what the formula below ...
2
votes
1answer
1k views

Difference between decryption and deciphering?

Is there a technical difference between decryption and deciphering?
2
votes
2answers
293 views

Does classifying an integer as a discrete log require it be part of a multiplicative group?

This question is not a question about the discrete log problem, the generalized discrete log problem, or an additive group. The confusion is whether any integer can be considered a discrete log or ...
11
votes
3answers
3k views

Why was the term “discrete” used in discrete logarithm?

Is there anything especially "discrete" about a discrete logarithm? This is not a question of what is a discrete logarithm or why the discrete logarithm problem is an "intractable problem" given ...
5
votes
2answers
271 views

What do NM-CPA, and NM-CCA mean?

When I've been researching authenticated encryption, the following terms keep showing up: NM-CPA NM-CCA ....without any definition as to what they mean. I've tried searching the web for their ...
0
votes
1answer
70 views

How should one refer to the smallest remainders generated by a modulus within DH or DLP?

It's my understanding that the integer base and exponents chosen to create the initial public keys in DH are from the remainders of a modulus. For example, if the value of the modulus is $N=11$, a ...
8
votes
2answers
911 views

What is meaning of the term “language”?

I don't have much formal background, and I could not find a suitable explanation for this after searching on Google/Wikipedia. What is the meaning of the term "language" as used in cryptographic ...
14
votes
2answers
466 views

Does GCM (or GHASH) only provide 64-bit security against forgeries?

In a recent comment a doubt was voiced about my answer, which claims GCM to requires $2^{128}$ for a successful forgery. The doubt was that the square root needs to be taken meaning the security would ...
0
votes
1answer
82 views

The meaning of formal and semi-formal in cryptography

The question is about "formal" analysis, proofs, etc... What is a correct definition of a formal proof, or a formal analysis? Is there a good way and a bad way to formally prove something. What is the ...
2
votes
3answers
150 views

Terminology: Is a block cipher in counter mode still considered a block cipher or is it classified as a stream cipher?

I'm confused about what terminology to use. I see people referring to such a cipher-MOO combination using both terms.
7
votes
1answer
952 views

What is a related key?

We talk of related keys and related key attacks, but what is a 'related key'? So in three related parts:- How can one key be related to another key? Is there a metric describing the degree of ...
1
vote
0answers
79 views

What is meant by the term “hostile environment”? [closed]

I come across many time a term called ”hostile environment” in cryptographic literature. What does “hostile” mean exactly? Is it unknown third parties which are responsible for handling and routing ...
5
votes
1answer
351 views

What is an accurate definition for a 'Monoalphabetic substitution cipher' and why does it provide a poor level of security

From my research online, I am confused about the difference between a 'monoalphabetic cipher' and 'monoalphabetic substitution cipher'. However, I have got my answer from the websites Kifanga and ...
8
votes
1answer
6k views

What is a Pedersen commitment?

I couldn't find any answer providing a high-level overview on what Pedersen commitments are or what they are used for.
5
votes
2answers
318 views

What does the term “nontrivial rotation” mean?

The paper “Gimli: a cross-platform permutation” contains the following information: Occasionally (after rounds 24, 20, 16, etc.) Gimli adds an asymmetric constant to entry 0 of the first row. ...
15
votes
2answers
2k views

What is the difference between TRNG and CSPRNG?

I understand the output of a TRNG is almost impossible to reproduce, such a flipping a coin 100 times to produce a 100-bit sequence. However, it is also my understanding that a CSPRNG produces an ...
6
votes
1answer
1k views

What does “seed” mean in cryptography?

I have come across "seed" many times, and at each time, it confuses me more and more. I think it has a well-known meaning in cryptography, so what is it? They can usually use the limited number of ...
1
vote
1answer
89 views

Why every access structure is a multipartite access structure?

The set of authorized subsets of participants is called an access structure. In a multipartite access structure, the set of participants is divided into several parts and all participants in the ...
-1
votes
1answer
54 views

Which of these deductions are true about the simulator and the adversary?

Which of these deductions make sense? The simulator is actually being run by the adversary. It makes sense that the adversary initializes the simulator (which is just a program) with the input that ...
1
vote
1answer
89 views

In “Lecture Notes on Cryptography” what does “PTM” mean?

I came across a handbook named "Lecture Notes on Cryptography" from Shafi Goldwasser and Mihir Bellare and I read their definition 3.1 about poly-time indistinguishability: Let $X_n,Y_n$ be ...
2
votes
1answer
76 views

The Collision Differential for MD4 - a question on notation (Wang, et al)

In the paper "Cryptanalysis of the Hash Functions MD4 and RIPEMD" the authors introduce the following notation (paragraph 4.1): $\Delta$$H_0$ = 0 $\xrightarrow{(M_,M')}$ $\Delta$$H$ = 0 What exactly ...