
 
 
L= sum of fragmented datagrams length 
l= sum of internal datagram leng h t
N= number of external fragment 
NlL
NM
/)(
00
∑∑
−
 
 
Figure 4b, shows how the average overhead is in the 
range 50-60 bytes for small datagrams (less than 608 
bytes) and about 70 bytes for larger datagrams. 
Moreover, also in this case, there is an overhead 
variation for different values of internal datagram 
length and there are no significant differences 
between the GSM and the GPRS case.  
To understand the relationship between overhead 
and datagram length we can observe from a different 
point of view what happens in the up link case. 
Figure 4c shows that the length of encrypted 
datagrams belongs to a discrete set of values. In 
particular, as the internal packet length increases, the 
length of external datagram assumes discrete set of 
increasing values. The reason of this behavior is the 
padding introduced by the encryption algorithm, 
useful to obfuscate statistical cryptanalysis. 
How stated in 0, padding in an ESP packet is 
optional and the sender may add 0-255 bytes of 
padding. Padding is required when an encryption 
algorithm is employed that requires the plaintext to 
be a multiple of some number of bytes, or, 
irrespective of encryption algorithm requirements, to 
ensure that the resulting ciphertext terminates on a 
4-byte boundary. Padding may be used to conceal 
the actual length of the payload, in support of 
(partial) traffic flow confidentiality. In this case, the 
inclusion of such additional padding has adverse 
bandwidth implications. 
4.4 Time and costs 
We have already introduced some aspect about the 
time analysis and the difficult in performing a valid 
set of tests to compare the performances of GSM 
and GPRS links. In fact the bandwidth variation, the 
signal strength and the number of users 
simultaneously connected, made the transmission 
rate of GPRS variable between 0 and the maximum 
rate. Moreover, the performances of interactive 
traffic in the particular case of the link configuration 
phase of PPP increase the latency slowing the first 
phase of a GSM connection 0. With the performed 
analysis we have focused only on datagram length 
measurement to be sure that the results are 
independent from the factors discussed above. 
Moreover also in the presented case we observed 
that the GPRS was faster than GSM a part a delay in 
the “authentication device” phase, due to an IKE 
informational packet present in the GPRS case. The 
overhead introduced by encryption afflicts costs, 
with respect to bytes exchanged (GPRS) and 
connection time (GSM) of session flow. In fact, the 
above measurement shows that the overhead, 
varying in the 50-80 bytes range for each datagram, 
afflicts the traffic as follows: 
- up link case: datagrams, containing mainly queries 
data, are doubled (small packets not longer than 70 
bytes); 
- down link case: datagrams containing application 
layer responses fragments (3270 format), are 
increased of 7-12% (datagram longer than 600 
bytes). 
We argue an average increment of traffic and costs, 
in the GPRS case, approximately of 10%. 
Further studies can take into account GPRS 
bandwidth variation and the relationship with IPSEC 
performance in term of time and cost, with different 
session application (e.g., FTP, HTTP) and 
authentication and encryption protocols.  
5 CONCLUSIONS 
In this paper we have showed how the IPSec suite 
can be effectively applied to secure GSM/GPRS 
communications. The level of reliability in 
GSM/GPRS communications that this result can 
induce the deployment of large scale GPRS 
networks, as well as the adoption of public network 
GPRS-based, in critical governmental/private 
infrastructure. In particular, we have showed the 
effectiveness of the IPSec, proving that the overhead 
generated is tolerable under a wide set of 
parameters. The only limitation, posed by mobile 
operator capabilities, relies on GPRS connection 
reliability while roaming. 
As for further research directions, we are interested 
in techniques to reduce the burst overhead generated 
by the set up IPSec-secured GPRS communications 
and to further study IPSEC connection reliability 
while roaming in GPRS environment. Moreover, we 
are addressing the possibility to employ the IPSec 
suite to secure peer to peer, ad hoc networks. 
REFERENCES 
Barkan, Biham and Keller, "Instant Ciphertext-Only 
Cryptanalysis of GSM Encrypted Communication", 
Proceedings Crypto 2003"  
http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-
get.cgi/2003/CS/CS-2003-05.ps.gz, 2003. 
Biryukov A, Shamir A, Wagner D., “Real time 
cryptanalysis of A5/1 on a PC”, Fast Software 
Encryption. 7
th
 International Workshop, FSE 2000. 
ICETE 2004 - SECURITY AND RELIABILITY IN INFORMATION SYSTEMS AND NETWORKS
10