diff --git a/10_onion_routing.asciidoc b/10_onion_routing.asciidoc
index 8da643f..5fb682a 100644
--- a/10_onion_routing.asciidoc
+++ b/10_onion_routing.asciidoc
@@ -32,7 +32,8 @@ Let's say Alice wants to send a secret letter to Dina, indirectly via some inter
 There may be many paths that make it possible for Alice to reach Dina. We will explain the process of selecting the _optimum_ path in <<path_finding>>. For now, we'll assume that the path selected by Alice uses Bob and Chan as intermediaries to get to Dina.
 ====
 
-As a reminder, the path selected by Alice is shown in <<alice_dina_path>>, below. 
+[role="pagebreak-before"]
+As a reminder, the path selected by Alice is shown in <<alice_dina_path>>. 
 
 [[alice_dina_path]]
 .Path: Alice to Bob to Chan to Dina
@@ -224,6 +225,7 @@ Alice has now built the three hop payloads that will be wrapped in an onion. A s
 .Hop payloads for all the hops
 image::images/mtln_1013.png[Hop payloads for all the hops]
 
+[role="pagebreak-before less_space"]
 ==== Key Generation
 
 ((("keys","generating for onion routing", id="ix_10_onion_routing-asciidoc7", range="startofrange")))((("keys","onion routing and", id="ix_10_onion_routing-asciidoc8", range="startofrange")))((("onion routing","key generation", id="ix_10_onion_routing-asciidoc9", range="startofrange")))Alice must now generate several keys that will be used to encrypt the various layers in the onion.