I want a cryptographically secure hash-like function (it need not output integers, it could be any data type) which takes directed graphs with a single marked point as input, so that if graphs A and B differ only in A's marked point being linked to B's marked point by an edge, it would be possible to recognize this fact easily from the outputs of the function on A and B - but it would not be possible to reverse the function and find out the actual shape of A and B - only that you can change A into B by moving the mark across that edge. Is this possible? How could such a thing be constructed?
2026-03-25 16:03:37.1774454617
Is there a hash-like function from pointed digraphs where if A and B differ only in the placement of the point, this is clear in the hash?
15 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail AtRelated Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in CRYPTOGRAPHY
- What exactly is the definition of Carmichael numbers?
- What if Eve knows the value of $S$ in digital signiture?
- Relative prime message in RSA encryption.
- Encryption with $|K| = |P| = |C| = 1$ is perfectly secure?
- Cryptocurrency Math
- DLP Relationship of primitive roots $\pmod{p}$ with $p$ and $g$
- Hints to prove $2^{(p−1)/2}$ is congruent to 1 (mod p) or p-1 (mod p)
- Period of a binary sequence
- generating function / stream cipher
- RSA, cryptography
Related Questions in DIRECTED-GRAPHS
- Graph Theory with Directed Graph and Dominance Order
- Prove that the subgraph is a complete directed graph
- Digraph with no even cycle
- How can one construct a directed expander graph with varying degree distributions (not d-regular)?
- Maximum number of edges in a DAG with special condition
- question about the min cut max flow theorm
- Remove cycles from digraph without losing information (aka howto 'dagify' a digraph)
- Planarity of a “cell graph”
- Strongly regular digraph
- A procedure for sampling paths in a directed acyclic graph
Related Questions in HASH-FUNCTION
- What is the graph of my chances to mine a bitcoin?
- Calculating probability of no hash collision
- Representing a String of n characters, as a unique integer
- Existence of a Perfect Cryptographic Hash Function
- $2$-universal family of hash functions and $\varepsilon$-good
- Hash without overflow
- Days required to collide at least one hash?
- Finding collision probability of hash function using modulo operation
- Given a boolen hash function (based on XOR), find the $n^{th}$ key for a specific hash.
- Given a square grid of side length N and m objects, design a bijection between each object and a unique set of coordinates
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?