Skip to main content
LLM Security Database
Skip to research search
Last analyzed Sep 9, 2026

Language Model Security Database

985 research findings · 1119 evaluated models

Filtered research findings

32 entries

Matches every word across titles, descriptions, sources, affected systems, and models.

Universal Magic Word Jailbreak

Published Analyzed Source: arXiv

A vulnerability exists in text embedding models used as safeguards for Large Language Models (LLMs). Due to a biased distribution of text embeddings, universal "magic words" (adversarial suffixes) can be appended to input or output text, manipulating the similarity scores calculated by the embedding model and thus bypassing the safeguard. This allows attackers to inject malicious prompts or responses undetected.

Jailbreaking LLMs' Safeguard with Universal Magic Words for Text Embedding Models
Evaluated models: E5 Base v2, Jina Embeddings v2, Nomic Embed+2 more
  • E5 Base v2
  • Jina Embeddings v2
  • Nomic Embed
  • Qwen 2.5 0.5B
  • Sentence-T5 Base

Confounder Gadgets Reroute LLMs

Published Analyzed Source: arXiv

A vulnerability exists in Large Language Model (LLM) routing systems (control planes) that allows for the manipulation of inference flow via adversarial input sequences. LLM routers, which dynamically direct user queries to either "weak" (cheaper) or "strong" (expensive) models based on predicted query complexity, can be bypassed by appending specific, pre-optimized token sequences known as "confounder gadgets." These gadgets artificially inflate the router's complexity score for an input…

Rerouting llm routers
Evaluated models: Not reported

Research methodology

Entries summarize publicly available primary-source security research. Model names reflect only systems explicitly evaluated by the cited paper, and measurements are research-reported unless independent verification is stated.

Discovery and publication are separate: new papers enter a candidate queue, then require human review and explicit approval before publication. Updates follow that review process, not a guaranteed daily publishing schedule. “Last analyzed” is the newest analysis date among published entries; it does not mean that all recent research has been covered.