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
3
votes
1answer
43 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
92 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
31 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
144 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
207 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
40 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
62 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
39 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
58 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
51 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
67 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
64 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 ...
1
vote
1answer
67 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
86 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
57 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
45 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
73 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
49 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
64 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
153 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
80 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
73 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
59 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 ...
1
vote
1answer
64 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 ...
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
136 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 ...
0
votes
1answer
65 views

Searching for a dining cryptographers problem variant

When I frist read about the famous dining cryptographers problem, in a book years ago I remember the author made a twist on it, demonstrating the generalization of the problem. Basically the dining ...
3
votes
0answers
438 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 ...
0
votes
0answers
122 views

Formal security-definition reference

Is there a reference where all common formal security-definitions are summarized (such as OW-CPA, IND-CPA, IND-CCA1, IND-CCA2, EUF-CMA and so on)? I need a PUBLISHED reference (paper, book) which ...
2
votes
2answers
202 views

Why should one model an entropy source in order to build a TRNG?

Some assert that a theoretical model of the unconditioned source must be created when building any TRNG. It's believed to be a fundamental requirement. So a few related questions arise:- What is a "...
2
votes
1answer
395 views

What are implementations of PRNGs based on ChaCha20? [closed]

I thought I'd find an implementation in NaCl, but /dev/urandom is what I find. Search engines samples revealed most implementations are broken. What libraries are ...
1
vote
1answer
123 views

Where can I find the standard definition for GPG ECDSA signature?

I am playing around with GPG which I'd like to use to sign an integer and use the resulting signature binary in another piece of code. So far I have created a simple PGP packet parser with which I ...
1
vote
1answer
162 views

Inverse of an element in a RSA group

Consider a RSA group $Z_N$ for $N=pq$, where $p,q$ are large prime numbers. Under strong RSA assumption, can an adversary efficiently compute the inverse of a random element $z$ from $Z_N$ without ...
-1
votes
1answer
101 views

Original papers for hashing functions

I would like to learn how hashing functions are discovered / created. In part of this process I think it would be helpful to see the original works or papers of any authors of cryptographic or non-...
3
votes
0answers
133 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 ...
2
votes
2answers
372 views

Is there a symmetric cipher that is explicitly designed to be slow?

I am trying to find a symmetric cipher that is explicitly designed to be slow. I realize that this is generally not desirable, but I'd like many cycles and lots of electronic action. I could modify ...
2
votes
2answers
80 views

Is there a way to sign a message without being allowed to see it?

I want to sign a message while not being able to see the message. Logically, there should be a way, I just don't know how this translates into cryptography. Here is an illustration for what I mean: ...
0
votes
1answer
78 views

Time-release Protocol Implementation

“How to Build Time-Lock Encryption” by Jager “Time-release Protocol from Bitcoin and Witness Encryption for SAT” by Liu, Garcia, and Ryan I looked through the references, googled, searched GitHub ...
1
vote
1answer
1k views

AES MixColumns Predefined Lookup 2D Tables and Rcon Predefined Lookup 2D Table

I need to have the a copy of predefined 2D table lookup for AES MixColumns when state is multiplied by 2 and 3, 9,11,13,14 and also the Rcon predefine table. I search it everywhere but I couldn't ...
1
vote
1answer
55 views

Counting the number of binary solutions of quadratic system

I have a quadratic system of equations related to a balanced RSA modulus $n=pq$ (i.e. $\log p\approx\log q$), and I want to give an upper bound on the number of solutions. Indeed, let $p_i,q_i$ be ...
8
votes
3answers
1k views

Where can I find a description of the SHA-0 hash algorithm?

Where can I find the description and or pseudocode for the SHA-0 hash algorithm? I am looking for something on these lines: HMAC RIPEMD. I have been implementing a few of those (HMAC, HOTP, TOTP and ...
2
votes
1answer
106 views

What is Standard Referencing of Cryptography Papers

I am writing a paper. One of my references is 1)Barreto, P. and Rijmen, V., “The Khazad Legacy-Level Block Cipher,” Submission to the NESSIE Project, vol. 97, 2004. My professor criticize ...
3
votes
2answers
68 views

How is formal analysis of the strength of a round achieved?

I've been trying to understand how the number of rounds are picked for ciphers. There seems to be a minimum number of rounds that is analyzed for "strength" and then some security margin is added. ...
0
votes
1answer
160 views

Reference for the Tortoise and Hare algorithm by Floyd?

Can someone please point me to a book or paper that describes the Tortoise and Hare algorithm by Floyd? I know there are ample websites out there, but for reference purposes, I need a book or paper ...
1
vote
1answer
94 views

Can NORX be used as a general purpose hash function?

In general terms, NORX works combining a cryptographic hash function and an stream cipher. At the end of an encryption operation you end with a ciphered message plus its authenticated hash. If you ...
1
vote
1answer
1k views

Any concrete examples of the use of NIST Special Publication 800-90B?

This question relates to NIST Special Publication 800-90B, Recommendation for the Entropy Sources used for Random Bit Generation. A copy is available here. Can anyone supply a pointer to any ...
15
votes
0answers
287 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 ...
1
vote
1answer
78 views

Can you point me to an MDS table reference for the Kalyna cipher?

I'm working with cipher Kalyna. Kalyna — like AES — has MDS tables in its MixColumns step. But Kalyna's documentation doesn't list these MDS tables. Could you give me a hint where to find proper ...
2
votes
1answer
51 views

Would it be possible to negotiate a key of 128 or 256 bits strength using Merkle puzzles?

One can be fascinated by the simplicity of the schemes created by Ralf Merkle; like the Merkle tree or his key negociation protocol over an insecure channel. Wikipedia has some material on "Merkle ...
4
votes
3answers
190 views

How to thwart a cleartext message's size?

Here is a question I don't find addressed in my cryptography books: let's say Alice want to send Bob a message of length N. what is the proper way for Alice to hide N? I am thinking Alice should do ...

1
2 3 4 5
8