diff --git a/lib/identify.c b/lib/identify.c
index b98877b..aa9c1d5 100644
--- a/lib/identify.c
+++ b/lib/identify.c
@@ -605,8 +605,15 @@ static void find_alignment_pattern(struct quirc *q, int index)
 	/* Spiral outwards from the estimate point until we find something
 	 * roughly the right size. Don't look too far from the estimate
 	 * point.
+	 *
+	 * A degenerate perspective transform (near-zero denominator) can make
+	 * size_estimate enormous, spinning this spiral for hundreds of millions
+	 * of iterations on a tiny image (denial of service on a crafted QR). The
+	 * alignment pattern must lie within the image, so also cap the search
+	 * radius at the image size.
 	 */
-	while (step_size * step_size < size_estimate * 100) {
+	const int max_step = (q->w > q->h ? q->w : q->h) + 1;
+	while (step_size * step_size < size_estimate * 100 && step_size <= max_step) {
 		static const int dx_map[] = {1, 0, -1, 0};
 		static const int dy_map[] = {0, -1, 0, 1};
 		int i;
diff --git a/lib/quirc.c b/lib/quirc.c
index 3cf75b9..4e22f8e 100644
--- a/lib/quirc.c
+++ b/lib/quirc.c
@@ -81,7 +81,8 @@ int quirc_resize(struct quirc *q, int w, int h)
 	 * old buffer when the new size is greater and (b) to write beyond the
 	 * new buffer when the new size is smaller, hence the min computation.
 	 */
-	(void)memcpy(image, q->image, min);
+	if (min > 0)
+		(void)memcpy(image, q->image, min);
 
 	/* alloc a new buffer for q->pixels if needed */
 	if (!QUIRC_PIXEL_ALIAS_IMAGE) {