Signing transactions para. 1 citations

Paper.tex

@@ -261,7 +261,6 @@ \subsection{The Transaction} \label{ch:transaction}
 \item[data] An unlimited size byte array specifying the input data of the message call, formally $T_\mathbf{d}$.
 \end{description}
 
-Appendix \ref{app:signing} specifies the function, $S$, which maps transactions to the sender, and happens through the ECDSA of the SECP-256k1 curve, using the hash of the transaction (excepting the latter three signature fields) as the datum to sign. For the present we simply assert that the sender of a given transaction $T$ can be represented with $S(T)$.
 
 \begin{equation}
 L_T(T) \equiv \begin{cases}
@@ -1394,7 +1393,7 @@ \section{Precompiled Contracts}\label{app:precompiled}
 
 \section{Signing Transactions}\label{app:signing}
 
-The method of signing transactions is similar to the `Electrum style signatures'; it utilises the SECP-256k1 curve as described by \cite{gura2004comparing}.
+The method of signing transactions is similar to the `Electrum style signatures' as defined by \cite{npmElectrum2017}, heading "Managing styles with Radium" in the bullet point list. This method utilises the SECP-256k1 curve as described by \cite{secp256k1BitcoinWiki2016} and \cite{secp256k1StackExchange2014}, and is implemented similarly to as described by \cite{gura2004comparing} on p. 9 of 15, para. 3.
 
 It is assumed that the sender has a valid private key $p_r$, which is a randomly selected positive integer (represented as a byte array of length 32 in big-endian form) in the range \hbox{$[1, \mathtt{\tiny secp256k1n} - 1]$}.