Skip to main content

Questions tagged [reference-request]

A reference request is a request to be provided with a source from documentation, official papers, and specs related to one or more specific algorithms or cryptographic procedures. Open ended literature recommendation requests are off topic! Also: Crypto.SE is not an optimal replacement for a search engine. The reference-request tag is not something that provides a base to replace research efforts.

83 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
19 votes
0 answers
468 views

Adding bit constants to the key schedule to reduce rounds?

Bit constants are often added to the key schedule to reduce slide attacks. I have reviewed David Wagner's work, where he showed that the increased rounds in a Feistel network do not help if you have ...
b degnan's user avatar
  • 4,880
14 votes
0 answers
226 views

Space complexity of quantum collision search?

Is there a known way to reduce the space complexity of quantum collision search (PDF) beyond what is offered by the built-in time-space tradeoff, while keeping the time complexity significantly below ...
user avatar
11 votes
0 answers
215 views

How exactly does ASKE (Alpha Secure Key Establishment) in Zigbee work?

I am working on Zigbee security. For key establishment, some approaches are given in Zigbee. Some of them are: ASKE (Alpha Secure Key Establishment), ASAC (Alpha Secure Access Control), and SKKE (...
Prasanth Kumar Arisetti's user avatar
7 votes
0 answers
310 views

Who invented salt, and why is it called salt?

I'm looking for an authoritative reference about the history of salts in the context of hash functions. Why is the personalization string in a hash function called a "salt"? Who should be ...
Mikero's user avatar
  • 13.6k
7 votes
0 answers
133 views

Amazon's anti-piracy: how many movies can $m$ conspirators leak?

Is there any existing academic literature about this application of traitor tracing? A video streaming service has a new anti-piracy technique to identify customers who capture and share their ...
JamesTheAwesomeDude's user avatar
7 votes
0 answers
385 views

Are there any test vectors for the CMS content type AuthEnvelopedData (for AES-GCM)?

I am looking for CMS AuthEnvelopedData test vectors for AES-GCM mode. I haven’t seen any ready-to-use test vectors for it. There are test vectors for AES-GCM mode but not for its CMS support. I even ...
Makif's user avatar
  • 820
5 votes
0 answers
354 views

Computationally binding commitment

A Computationally Binding commitment scheme is defined as a tuple of protocols $(\mathsf{Keygen}, \mathsf{Com}, \mathsf{Open})$, that along with correctness guarantees that for all PPT algorithms the ...
JayTuma's user avatar
  • 71
4 votes
0 answers
337 views

Cryptomania and NP $\cap$ co-NP

Cryptomania is usually presented as the Impagliazzo's world, which gives us public-key cryptography under the assumption that trapdoor OWFs exist. For purposes of constructing public-key cryptography ...
Ilk's user avatar
  • 233
4 votes
0 answers
888 views

Reference for additive secret sharing

Regarding the secret sharing schemes, I am wondering if there are any academic references for the Additive Secret Sharing and its variations. Is there any textbook or article which has specifically ...
Babak Ravandi's user avatar
4 votes
0 answers
70 views

Election communication protocol

I'm not a cryptography expert, but this seems like it falls into this area. Imagine I want to design an election system (senate race for example) where I send the exact same ballot of 100 candidates ...
Gregable's user avatar
  • 141
4 votes
0 answers
90 views

Are there any real-world E-voting systems in use with the Paillier cryptosystem?

There are a lot of theories of Paillier cryptosystem with references to e-voting. Are there any real-world E-voting systems in use with the Paillier cryptosystem?
Kusi's user avatar
  • 41
4 votes
1 answer
142 views

VIC cipher author known?

Does anybody know if the design of VIC cipher is attributed to anybody? I've tried Google and found nothing. There are quite a few sites describing the method in detail, a few implementing it ...
Jimi WIlls's user avatar
3 votes
0 answers
228 views

Is there a source(book, thesis, paper) that explains Lattice basis reduction algorithms (LLL, HKZ) and provides an in depth analysis of the same?

I want to give a slight background about me: I've Bachelors in Computer Engineering and I've been interested in Cryptography since my college days and have been following the field ever since. I'm ...
mostlycryptic's user avatar
3 votes
0 answers
147 views

What is the Indexed Code Book Mode?

While reading specsheets for NXP processors (example mention in this PDF) the other day I saw the mention of the Indexed Code Book mode (ICB) for their AES acceleration hardware - the only mode they ...
SEJPM's user avatar
  • 46.2k
3 votes
0 answers
300 views

What is the original paper of the length extension attack on hash based MAC functions

A message authentication code (MAC) based on using a hash function with the secret prefix $H(k||m)$ technique goes back to two independent sources according to Tsudik's article on 1992; S. Crocker, S....
kelalaka's user avatar
  • 49k
3 votes
0 answers
64 views

Applications of Shuffle Proofs

Shuffle proofs enable a prover to show that a vector of commitments or encryptions $(c_1, \dots, c_n)$ is permuted into a vector of commitments $(c'_1, \dots, c'_n)$ without revealing the permutation ...
Cryptonaut's user avatar
  • 1,076
3 votes
0 answers
93 views

Subexponential algorithms that apply only one of factoring and discrete logarithm?

Shor (quantum polynomial), Number Field Sieve (subexponential), Pollard rho (square root) all have both factoring and discrete logarithm over $\mathbb F_p^*$ variants. What are the subexponential ...
Turbo's user avatar
  • 930
3 votes
0 answers
153 views

Old French Cipher w/ Text Hidden In Drawing

I'm trying to find a cipher challenge I saw a few years back, it was an old drawing (I think 1800's or earlier) with clouds and stars on it and French text was hidden in the image. Does anyone happen ...
Sam Kennedy's user avatar
3 votes
0 answers
283 views

Shared-secret authentication with implicit session keys?

Consider a system with producers (P), consumers (C) and a server (S) with two TCP ports open where a consumer connects on one port and a producer on the other. The server is just a TCP relay which ...
DurandA's user avatar
  • 453
3 votes
0 answers
86 views

On a proposition in NTRU original paper: $\gamma_1 |f|_2 |g|_2 \leq |f \circledast g|_\infty \leq \gamma_2 |f|_2 |g|_2$

In the original paper of NTRU cryptosystem, we have the following proposition (that is said to be suggested by Don Coppersmith): For any $\epsilon > 0$, there are constants $\gamma_1,\gamma_2 &...
Leafar's user avatar
  • 325
3 votes
0 answers
101 views

Unknown authenticated encryption mode

I'm running through a protocol specification (LoRaWAN, pdf), and I'm puzzled by the crypto. The data is encrypted and authenticated in the following way: a unique 128-bit key is used; the plaintext ...
dots's user avatar
  • 31
3 votes
0 answers
89 views

Words having weight near to minimum distance

I am studying the NP-Problem of the codes Syndrome Decoding. The formulation is show below. Input: a binary matrix $H$ of dimension $r \times n$ and a bit string $S$ of length $r$. Property: there ...
juaninf's user avatar
  • 2,711
3 votes
0 answers
62 views

El-Gamal and Lines on Planes

I've been thinking about a geometric picture for El-Gamal. The idea is to understand the set $\{(my^{x},g^x) \mid x \in Z_p\}$ (the set of encryption of $m$ for fixed $g$ and $y$) by taking the $\...
wlad's user avatar
  • 1,239
3 votes
0 answers
135 views

Lowest number challenge scheme

Suppose Alice knows a secret number $a$, and Bob knows a secret number $b$. Is there a simple way for Alice and Bob to know who has the lowest number, without Alice & Bob exchanging their numbers ...
Florian Omnes's user avatar
3 votes
0 answers
159 views

Paper about this secure P2P idea?

Two or three years ago, I was reading something interesting, but then I lost the paper. The paper described building secure and fast P2P networks (not like tor or I2P). Unfortunately, I only remember ...
ex3ndr's user avatar
  • 39
2 votes
1 answer
144 views

Post-quantum EU-CMA security from OWF-only

In the paper: "Universal One-Way Hash Functions and their Cryptographic Applications". The following is proven: "If 1-1 one-way functions exist, then the one-way based signature scheme ...
Ilk's user avatar
  • 233
2 votes
0 answers
68 views

Designated verifier signature from Diffie–Hellman and a MAC

Here is an idea for a designated verifier signature scheme. Suppose Alice and Bob know each other’s public keys and Alice wants to send a message to Bob, such that only he will be convinced of its ...
kirelagin's user avatar
  • 206
2 votes
0 answers
150 views

Detailed running time analysis for Shamir secret sharing scheme

I am successfully working on Shamir's secret sharing scheme for few months. But the only issue I am facing is the calculation of theoretical time complexity. Since I am from algorithmic background, I ...
Fateh's user avatar
  • 107
2 votes
0 answers
42 views

Does anybody have test vectors for the LBlock block cipher?

LBlock is a lightweight block cipher with 64-80 bits block-key size, designed by a group of Chinese scholars. Does anybody have LBlock test vectors? I am looking for test vectors, which contain the ...
nari's user avatar
  • 21
2 votes
0 answers
210 views

*feasible* pre-image attacks against reduced SHA-1

(tldr: see last paragraph) Although SHA-1 is vulnerable to collision attacks, it is still resistant to pre-image attacks. SHA-1 was designed to be resistant until a brute-force attack of $2^{160}$ is ...
Albert Hendriks's user avatar
2 votes
0 answers
250 views

RC6-like key schedule with 16-bit S-boxes

I am trying to figure out an encryption algorithm whose key schedule function seems to be similar to RC6. However, it seems to be creating S-Boxes using 16-bit integers instead of 32-bit ones. I have ...
Prixar's user avatar
  • 21
2 votes
0 answers
74 views

What is the current encryption method used on GSM currently?

I am currently doing a mini project which sniffs GSM packets using gr-gsm and wireshark. I was wondering if anyone knows what is the name of the current encryption algorithm method used on GSM?
bc95's user avatar
  • 21
2 votes
0 answers
181 views

IND-CCA2 secure schemes without Plaintext Awareness?

I have been reading up on IND-CCA2 security and was wondering: Are there efficient IND-CCA2 secure schemes that do not require plaintext awareness? I'm guessing yes - could someone point me to these ...
Angela's user avatar
  • 353
2 votes
0 answers
216 views

Hardware Implementation of Pairing over BN curves

I am in the middle of FPGA based Hardware architecture design for the computation of Pairing (particularly R-ate Pairing) over BN curves. Where, the point addition, and point doubling should be ...
Khalid's user avatar
  • 307
2 votes
0 answers
67 views

Malicious KGC attack in the identity-based authenticated key exchange protocol

There are two users $A$ and $B$ who are in different domain. Let's assume that $A\in KGC_1$ and $B\in KGC_2$. If they want to establish secure session, then they must run an identity-based ...
T.B's user avatar
  • 81
2 votes
0 answers
386 views

Blowfish vs. Twofish regarding power consumption

If I wanted to use Blowfish or Twofish to provide security on a device where power consumption is crucial. Regarding power consumption, which one would win? Generally, which algorithms are known to ...
Pavo's user avatar
  • 21
2 votes
0 answers
263 views

RSA Key Blinding

I was looking the answer to the following question (Timing attack on modular exponentiation), discussing the Private Key Blinding as a countermeasure for timing attacks. Therefore I'm asking if ...
Filosopher's user avatar
2 votes
0 answers
752 views

Where can I find examples of ECC implemented in VHDL?

I am looking into implementing ECDSA signature and ECDH key agreement in a Xilinx FPGA. All the examples I have found of VHDL implementations skip over how to construct the low level ECC primitives (...
g. garcia's user avatar
1 vote
0 answers
40 views

One Way Functions with Non-Uniform Inputs

It is well-known that a One-Way Function is hard to invert on uniformly random inputs. As per Wikipedia, for [sic] all randomized algorithms $F$, all positive integers $c$ and all sufficiently large $...
Lt. Commander. Data's user avatar
1 vote
0 answers
69 views

Authors of "How to explain zero-knowledge Protocols to your children?"

Does anyone know what are the family relationships in the paper "How to Explain Zero-Knowledge Protocols to Your Children" The authors are: Jean-Jacques Quisquater, Myriam Quisquater, Muriel ...
Alex Them's user avatar
  • 322
1 vote
0 answers
84 views

References and Books for the basics

I started studying again recently, I forgot plenty of stuff. But there are 2 areas that I am really struggling. The procedures to prove and demonstrate theorems. The basic math necessary for ...
Alec Holland's user avatar
1 vote
0 answers
209 views

"Add" points that are not on the same elliptic curve?

Assume elliptic curve in Weierstrass form. $y^2 = x^3 + a x + b$ where $x,y,a,b \in F$ I noticed the point addition formula does not involve parameters $a,b$. Furthermore, one can always solve for $a,...
Kh40tiK's user avatar
  • 121
1 vote
0 answers
1k views

How to find the 6 main properties of cryptographic hash functions when implementing a hash function?

According to this there are at least 6 "properties" all cryptographically secure hash functions strive to attain: Deterministic: the same message always results in the same hash; Quick: it ...
Lance's user avatar
  • 171
1 vote
0 answers
180 views

Classic secret sharing schemes vs Homomorphic secret sharing schemes

What is the difference between the classic secret sharing schemes that are used in the protocols of Ben-or and Rabin, Ben-Or, M., Goldwasser, S., Wigderson (that is the Shamir's secret sharing scheme) ...
Hunger Learn's user avatar
1 vote
0 answers
100 views

Coursera Course or book(s) That covers the following subjects: OPENSSL, SSH, PKI, MD5, RSA, Certificates, keys, signatures

I started working as a developper in a cryptography company 3 months ago where the applications are for mostly windows applications. I found that I don't have enough knowledge concerning the topics ...
Hani Gotc's user avatar
  • 119
1 vote
0 answers
38 views

Threshold signature verified by an equivalent key

I am looking for references for the following problem: Consider we have a DSA with the keypair $(sk, pk)$ and a message $m$, such that its signature is $s = sig(m,sk)$ and the verification result is $...
user87152's user avatar
1 vote
0 answers
46 views

OAuth(2) and friends

I've worked on low-level security (side-channel attacks etc.) for years and have a PhD in crypto. Web security is something I've never needed to touch beyond knowing how the TLS handshake works with ...
dst's user avatar
  • 11
1 vote
0 answers
163 views

Rivest - Time Memory Tradeoff Using Distinguished Points

A while ago, Hellman introduced a time-memory tradeoff for chosen plaintext attack on block ciphers. There is an innovation due Rivest using a concept of 'distinguished points'. I am looking for the ...
user avatar
1 vote
0 answers
151 views

Dependence of a Pseudorandom Function's Security on its Input/Output Spaces

Let $n$ be a security parameter and $F:\{0,1\}^{\ell_{key}(n)} \times \{0,1\}^{\ell_{in}(n)} \rightarrow \{0,1\}^{\ell_{out}(n)}$ be a keyed function which forms a family of Pseudorandom Functions (...
Nima's user avatar
  • 11
1 vote
0 answers
89 views

What is the motivation of multipartite secret sharing?

In this thesis chapter 3.1 A multipartite secret sharing scheme is a scheme in which the set of participants is divided into several parts and all participants in the same part play an equivalent ...
Natwar's user avatar
  • 441