A Complexity Hierarchy of Shuffles in Card-Based Protocols
A Complexity Hierarchy of Shuffles in Card-Based Protocols explores This paper introduces a complexity hierarchy for shuffles in card-based cryptographic protocols to evaluate their practical implementation difficulty.. Commercial viability score: 2/10 in Cryptography.
BUILDER'S SANDBOX
Build This Paper
Use an AI coding agent to implement this research.
OpenAI CodexAI Agent
Lightweight coding agent in your terminal.
Claude CodeAI Agent
Agentic coding tool for terminal workflows.
AntiGravity IDEScaffolding
AI agent mindset installer and workflow scaffolder.
CursorIDE
AI-first code editor built on VS Code.
VS CodeIDE
Free, open-source editor by Microsoft.
Recommended Stack
Startup Essentials
Estimated $9K - $13K over 6-10 weeks.
See exactly what it costs to build this -- with 3 comparable funded startups.
7-day free trial. Cancel anytime.
Discover the researchers behind this paper and find similar experts.
7-day free trial. Cancel anytime.
Related Papers
- Prior WorkSystematization of Knowledge: The Design Space of Digital Payment Systems with Potential for CBDCViability: 2.0
- Higher ViabilityValet: A Standardized Testbed of Traditional Imperfect-Information Card GamesViability: 5.0
- Higher ViabilityDDH-based schemes for multi-party Function Secret SharingViability: 4.0
- Higher ViabilityEvaluating Model-Free Policy Optimization in Masked-Action Environments via an Exact Blackjack OracleViability: 4.0
- Higher ViabilityShardMemo: Masked MoE Routing for Sharded Agentic LLM Memory