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.

Filter by
Sorted by
Tagged with
-2
votes
1answer
43 views

How to hack pass-protected private RSA key

I know nothing about cryptography. I must present a completed ASP project to my university that proves I have learned clingo. I have heard that the task of recovering the plaintext private RSA key ...
7
votes
1answer
1k views

Opinion from “military institution” about the academic work

A few years ago, I've heard about a harsh report from an American institution (I've forgotten which one, but it was something like the NSA) about IACR conferences. Which report could it be? I think ...
2
votes
0answers
60 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 ...
7
votes
0answers
112 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 ...
2
votes
0answers
26 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 ...
0
votes
0answers
34 views

Complete taxonomy of public-key cryptosystem primitives

This question is similar to “What primitives are needed to generically implement public-key cryptography?”, but with a more applied/contingent focus: That question asked about what's theoretically ...
1
vote
1answer
68 views

Some information about zero knowledge proofs

How do I start studying Zero-Knowledge proofs? What are some good books and entry-level research papers on that topic? What are some prerequisites of the same?
3
votes
0answers
86 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 ...
1
vote
1answer
74 views

looking for BKZ earliest algorithm and its application in cryptography

I am reading lattice based cryptography for my master thesis, I am looking for the earliest version of BKZ algorithm, and its applications in cryptography, to understand it very well, I already know ...
1
vote
0answers
80 views

References on lattice-based cryptography [duplicate]

I need earlier references (books, articles, etc) on lattice-based cryptography, and any advice will be helpful to me. I am reading Stinson & Paterson's Cryptography: theory and practice. Thanks in ...
4
votes
0answers
198 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 ...
3
votes
0answers
43 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 ...
1
vote
0answers
26 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 $...
0
votes
0answers
9 views

Directional vector privacy-preserving techniques

I'm new to cryptography, and I wonder if it's possible to temporarily track users by observing directional vectors in Mobile-Ad-Hoc-Networks, and if there are any methods, in case it is trackable, to ...
2
votes
2answers
42 views

What is $z_b$ in this introduction to Private Information Retrieval?

I was trying to read this introduction to private information retrieval. On page 12 of the document, a scheme for 1-DB private information retrieval is discussed. I was unable to understand one of the ...
2
votes
1answer
104 views

Constant Time algorithms for $\mathbb{Z}/m\mathbb{Z}$, $\mathbb{Z}/m\mathbb{Z}[x]$, and $\mathbb{Z}/m\mathbb{Z}[x] / (f(x))$?

I want to implement some (lattice based) protocols to better familiarize myself with a programming language (Rust). These tend to do arithmetic over rings like $\mathbb{Z}/m\mathbb{Z}$, or "...
2
votes
0answers
97 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....
6
votes
2answers
164 views

Why does NIST say that 2nd preimage resistance depends on the message length

In NIST FIPS 202 on the table, It is written as Function Output Size Collision PreImage 2nd Preimage SHA-1 160 < 80 160 160–L(M) SHA-224 224 112 224 min(224, 256–L(M)) SHA-512/224 224 112 224 ...
17
votes
2answers
2k views

Is Bruce Schneier Applied Cryptography, Second ed. up to date?

I like Applied Cryptography, and I am returning to cryptography after a while. So I am wondering if that book is up to date or can be complemented with other references. I am looking for a book, ...
0
votes
0answers
42 views

Generalization of Bezout Identity for Polynomials

Let $i \in \{1,\ldots, n\}$, $f_i(x)$ be a univariate polynomial, and $g(x) = \mathsf{GCD}(f_1(x), \ldots,f_n(x))$. According to Bezout identity, there exists $a_i(x)$ such that: $$\sum_{i \in [n]}a_i(...
3
votes
2answers
171 views

Do Korea and Japan have their own national hashing standard?

I know China has SM3 and SM4 commercial cryptographic hash and block cipher standards, and I know Japan has Camellia block cipher and Korea has SEED. Do Japan and Korea have an industry standard for ...
0
votes
1answer
83 views

Security analysis of Rijndael (AES)

I was studying the Rijndael Block Cipher for an assignment. I am looking for a (layman-ish) explanation as to why the cipher is secure. Googling did not seem to be give any good explanations. The ...
3
votes
1answer
76 views

References about a boolean function involving hamming weight

Some weeks ago, I read an article about an interesting boolean function with some applications to cryptography. Then, I forgot about the article and now I cannot find it. Hence here I am asking if ...
0
votes
1answer
98 views

Is there any code available online for CHA-1? [closed]

Is there any code available online for the chaos-based hash algorithm CHA-1? I am trying to apply the methodology of this paper to blockchain applications.
3
votes
0answers
45 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 ...
4
votes
0answers
179 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 ...
0
votes
1answer
244 views

Argument of Knowledge - Definition

I've recently understood the difference between Interactive Proofs and Arguments, but even if several standard variations of IP are well known and thoroughly described in textbooks (Goldreich for ...
1
vote
0answers
41 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 ...
0
votes
1answer
127 views

Attacks on LCG with “self-XOR” output function?

Consider an ordinary LCG modulo $2^n$ with an internal state of $n$ bits and an output of $n/2$ bits, with the twist that instead of simply truncating the state to produce an output, we take the upper ...
1
vote
0answers
60 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 ...
1
vote
1answer
62 views

Is there a simplified article, video, or blog about bulletproofs?

I'm trying to learn about bulletproofs for my master "Enhancing Privacy in E-voting Systems", but the original paper was too hard for me. I also tried to look at this, but it was also too difficult. ...
0
votes
0answers
108 views

KDF3 - implementation explanation

An old project that I did not code is using the KDF3 algorithm, but I struggle to find an explanation about the way this key derivation algorithm works. I know that this algorithm is part of the ISO-...
1
vote
1answer
75 views

Confused about terminology in the many flavors of security [closed]

I am learning about cryptography from diverse sources, and I have found terminology a bit confusing. In principle, I understand the difference between the symbolic model and the computational model. ...
1
vote
1answer
75 views

How should one handle the identity value and other “obviously” weak secret random values?

In RSA, ECDSA, ElGamal and quite a few other schemes, using a secret (random) value equal to 1 might not provide any form of security, while still being mathematically sound. For RSA, ECDSA or ...
2
votes
1answer
96 views

Where was the stand-alone model for simulation-based MPC proposed first?

The stand-alone model and the UC model for simulation-based proofs in multiparty computation differ in the guarantees that they provide: The stand-alone model provides security under sequential ...
2
votes
1answer
110 views

Variants of Bilinear Diffie-Hellman Assumption

Could someone point me to the paper/reference where the following variant of q-strong Bilinear Diffie-Hellman assumption was used? Given $s \in \mathbb{Z}_p^*$ and $g, g^{\frac{1}{s}}, g^{s}, g^{s^2},...
1
vote
0answers
61 views

Ressources for implementing cryptography [closed]

I am looking for resources on how to implement cryptographic algorithms. I am a cryptographic researcher, so I am not interested in reviewing the basics, and I don't need the talk about it not being ...
2
votes
1answer
56 views

Reference for the Security Analysis of Ring-LWE

Can someone please share a link of any research paper or web-page analyzing the security of Ring-LWE? Essentially, how should I choose my parameters to get security equivalent to 128-bit or 256-bit?
1
vote
1answer
94 views

IEEE P1619/XTS, inconsistent reference implementation and test vectors [closed]

I'm testing IEEE's P1619, which is XTS mode. IEEE documents from 2007 provided both test vectors and a reference implementation. Documents from 2008 only provided the reference implementation. Here is ...
0
votes
1answer
55 views

Reference books in security and privacy preservation [closed]

I am looking for books or reference guides to learn and teach "cryptography, security and privacy preservation techniques"? I need some advice to good resources that I can use.
0
votes
0answers
72 views

Do there exist cryptographic algorithms where the “core” function is 96-to-32-bit?

There exists a FOX family of block ciphers (Wikipedia article: IDEA NXT). This cipher uses a function called "f32" which operates on three 32-bit words and outputs one 32-bit word. This function ...
2
votes
1answer
301 views

Pollard's $(p - 1)$ factorization method runtime

Wondering if anyone knows a good reference for Pollard's $p-1$ algorithm's runtime? I was looking on the Wikipedia page and the runtime cited there is $\mathcal{O}(B\cdot \log B\cdot \log^2 n)$. ...
1
vote
0answers
96 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 (...
1
vote
0answers
83 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 ...
3
votes
0answers
69 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 ...
4
votes
2answers
251 views

Is there an English translation of Vigenère's “Traicté des Chiffres”?

I Googled Vigenère's "Traicté des Chiffres": no English translations, not even a reference to one. Perhaps someone's Google-wu is better than mine; I can't find it. I'm slogging my way ...
1
vote
1answer
65 views

Privacy and warrants to obtain information

How could a site issue a `warrant'*, a document which: 1) Others can verify was issued from that site 2) Contains a date stamp, a named site and instructions which can be presented to a third site by ...
5
votes
1answer
156 views

Cryptography on programming

In pursuit of understanding a randomly found topic I was interested in learning the connection between integer programming and cryptography and found Lenstra Jr.'s Integer Programming and Cryptography....
18
votes
3answers
3k views

Digital signature that is only verifiable by one specific person

I would like to digitally sign a message in such a way that the signature can only be verified by one specific person. Simply encrypting the signature will not work, because that person could then ...
4
votes
1answer
147 views

Cryptography resources for programmers

As a senior programmer entering blockchain projects, i'm looking for a comprehensive introduction to relevant cryptographic tools/primitives, preferably one that puts less emphasis on the math and ...

1
2 3 4 5
8