Kolmogorov Complexity Bounds for LLM Steganography and a Perplexity-Based Detection Proxy
Kolmogorov Complexity Bounds for LLM Steganography and a Perplexity-Based Detection Proxy explores This paper theoretically bounds the complexity of LLM steganography and proposes a perplexity-based detection proxy.. Commercial viability score: 3/10 in LLM Security.
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 $11K - $15K 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
- Builds On ThisSeamless Deception: Larger Language Models Are Better Knowledge ConcealersViability: 2.0
- Prior WorkA Decision-Theoretic Formalisation of Steganography With Applications to LLM MonitoringViability: 3.0
- Prior WorkOn the Rate-Distortion-Complexity Tradeoff for Semantic CommunicationViability: 3.0
- Higher ViabilityHide and Seek in Embedding Space: Geometry-based Steganography and Detection in Large Language ModelsViability: 5.0
- Higher ViabilityOn the Possible Detectability of Image-in-Image Steganography