Secure SMS messaging using Quasigroup encryption and Java SMS API Marko Hassinen, Smile Markovski Marko.Hassinen@cs.uku.fi, smile@ii.edu.mk University of Kuopio, Finland SS Cyril and Methodius University, Republic of Macedonia SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.1/18
Contents Motivation Definition of the encryption method Application structure Performance figures Conclusions and Future Work SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.2/18
Motivation SMS message can go to a wrong number SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.3/18
Motivation SMS message can go to a wrong number Traffic is sometimes not encrypted SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.3/18
Motivation SMS message can go to a wrong number Traffic is sometimes not encrypted The device with messages in it may get lost SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.3/18
Motivation SMS message can go to a wrong number Traffic is sometimes not encrypted The device with messages in it may get lost The operator can have malicious employees SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.3/18
Motivation SMS message can go to a wrong number Traffic is sometimes not encrypted The device with messages in it may get lost The operator can have malicious employees Authentication of receiver SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.3/18
� ✁ Quasigroup encryption A groupoid is a finite set that is closed with respect to an operator SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.4/18
� ✁ Quasigroup encryption A groupoid is a finite set that is closed with respect to an operator A quasigroup is a groupoid with unique left and right inverses. SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.4/18
✆ ✄ � ✆ ✡☛ ✁ ✠✁ ✞✟ ✁ Quasigroup encryption A groupoid is a finite set that is closed with respect to an operator A quasigroup is a groupoid with unique left and right inverses. A quasigroup can be characterised with a �✂✁ ☎✝✆ that is an matrix where each row and column is a permutation of elements of a set SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.4/18
✡ ✂ ☛ ☛ � ✠ ✂ ✄ ✄ ✝ ✝ ✝ ✑ ☛ ✂ ☞ ✄ ☞ ✆ ✝ ✝ ✝ ☞ ✞ ✁ ☞ ✄ ✁ ✝ ✌ ✠✁ � ✡ ✒ ✁ ✓ ✆ ✝ ✝ ✄ ✝ ✞✟ ✡☛ ✝ ✍ ✆ ✁ ✆ ✒ ☛ ☎ ✠ ✄ ✑ ✏ ✝ ☛ Quasigroup encryption A groupoid is a finite set that is closed with respect to an operator A quasigroup is a groupoid with unique left and right inverses. A quasigroup can be characterised with a �✂✁ ☎✝✆ that is an matrix where each row and column is a permutation of elements of a set The encryption primitive on sequence is ☛ ✁� ✂☎✄ ✂☎✆ ✂✟✞ defined as where ✂☎✆ ✂✟✞ ✄✎✍ ☞☎✏ ☞☎✏ SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.4/18
✒ ✏ ✄ ☛ ✌ ☎ ☞ ✄ ✍ ✂ ✏ ✑ ✄ ☛ ☞ ☎ ✡ ☞ ✏ ✑ ✄ ✠ ☎ ☛ ✒ ✍ ✝ ✝ ✝ ✆ ✓ ✂ ✞ ✂ ☞ � � ✁ ✂ ✑ ✄ ✂ ✑ � � ✠ ☞ ✄ ✆ ☛ ✝ ✝ ✝ ☞ ✞ ✡ ✝ ✝ ✂ ✄ ✂ ✆ ✝ Decryption Decryption is defined as ,where SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.5/18
☎ ✏ ✌ ☛ ☞ ✄ ✍ ✂ ✏ ✑ ✄ ☛ ☞ ✏ ☎ ☞ ✑ ✄ ✝ ✁ � ✡ ✒ ✓ ✆ ✝ ✄ ✝ ✍ ✒ ☛ ☎ ✠ ☛ ✂ ☛ ✑ ✄ ☞ ✠ � � ✌ ✂ ✆ ✄ ✑ ✂ ✁ � � ☞ ✝ ✡ ✂ ✞ ✂ ✝ ✝ ✝ ✆ ✄ ✝ ✂ ☛ ✡ ✞ ☞ ✝ ✌ Decryption Decryption is defined as ,where As an example encrypting a bitsequence 10011100 with a quasigroup of order 4 ( = 01): SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.5/18
✍ ✏ ✌ ☎ ☞ ✄ ☛ ✂ ✏ ✑ ✄ ☛ ☞ ✏ ☎ ☞ ✑ ✄ ✝ ✁ � ✡ ✒ ✓ ✆ ✝ ✄ ✝ ✍ ✒ ☛ ☎ ✠ ☛ ✂ ☛ ✑ ✄ ☞ ✠ � � ✌ ✂ ✆ ✄ ✑ ✂ ✁ � � ☞ ✝ ✡ ✂ ✞ ✂ ✝ ✝ ✝ ✆ ✄ ✝ ✂ ☛ ✡ ✞ ☞ ✝ ✌ Decryption Decryption is defined as ,where As an example encrypting a bitsequence 10011100 with a quasigroup of order 4 ( = 01): 11100100 00111001 10 01 11 00 10010011 01001110 01 00 10 10 11 SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.5/18
✍ ✏ ✌ ☎ ☞ ✄ ☛ ✂ ✏ ✑ ✄ ☛ ☞ ✏ ☎ ☞ ✑ ✄ ✝ ✁ � ✡ ✒ ✓ ✆ ✝ ✄ ✝ ✍ ✒ ☛ ☎ ✠ ☛ ✂ ☛ ✑ ✄ ☞ ✠ � � ✌ ✂ ✆ ✄ ✑ ✂ ✁ � � ☞ ✝ ✡ ✂ ✞ ✂ ✝ ✝ ✝ ✆ ✄ ✝ ✂ ☛ ✡ ✞ ☞ ✝ ✌ Decryption Decryption is defined as ,where As an example encrypting a bitsequence 10011100 with a quasigroup of order 4 ( = 01): 11100100 00111001 10 01 11 00 10010011 01001110 01 00 10 10 11 SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.5/18
✍ ✏ ✌ ☎ ☞ ✄ ☛ ✂ ✏ ✑ ✄ ☛ ☞ ✏ ☎ ☞ ✑ ✄ ✝ ✁ � ✡ ✒ ✓ ✆ ✝ ✄ ✝ ✍ ✒ ☛ ☎ ✠ ☛ ✂ ☛ ✑ ✄ ☞ ✠ � � ✌ ✂ ✆ ✄ ✑ ✂ ✁ � � ☞ ✝ ✡ ✂ ✞ ✂ ✝ ✝ ✝ ✆ ✄ ✝ ✂ ☛ ✡ ✞ ☞ ✝ ✌ Decryption Decryption is defined as ,where As an example encrypting a bitsequence 10011100 with a quasigroup of order 4 ( = 01): 11100100 00111001 10 01 11 00 10010011 01001110 01 00 10 10 11 SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.5/18
✍ ✏ ✌ ☎ ☞ ✄ ☛ ✂ ✏ ✑ ✄ ☛ ☞ ✏ ☎ ☞ ✑ ✄ ✝ ✁ � ✡ ✒ ✓ ✆ ✝ ✄ ✝ ✍ ✒ ☛ ☎ ✠ ☛ ✂ ☛ ✑ ✄ ☞ ✠ � � ✌ ✂ ✆ ✄ ✑ ✂ ✁ � � ☞ ✝ ✡ ✂ ✞ ✂ ✝ ✝ ✝ ✆ ✄ ✝ ✂ ☛ ✡ ✞ ☞ ✝ ✌ Decryption Decryption is defined as ,where As an example encrypting a bitsequence 10011100 with a quasigroup of order 4 ( = 01): 11100100 00111001 10 01 11 00 10010011 01001110 01 00 10 10 11 SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.5/18
☛ � � � Some words about security Encryption is a composition of primitives and which are characterised by a variable length passprhase. SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.6/18
✄ ☛ � � � � ✆ ✁ � ☎ Some words about security Encryption is a composition of primitives and which are characterised by a variable length passprhase. The amount of different latin squares of order is ✞ ✄✂ SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.6/18
✁ ☎ ☛ � ✁✂ � � ✒ � ✆ � � ✄ Some words about security Encryption is a composition of primitives and which are characterised by a variable length passprhase. The amount of different latin squares of order is ✞ ✄✂ There are at least 288 latin squares of order 4, but more than of order 16. SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.6/18
✁✂ ✁ ☛ � ✆ � � � ✄ ✒ � � ☎ Some words about security Encryption is a composition of primitives and which are characterised by a variable length passprhase. The amount of different latin squares of order is ✞ ✄✂ There are at least 288 latin squares of order 4, but more than of order 16. A Latin square of order 16 has 256 entries that can be stored in 128 bytes. SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.6/18
J2ME as an application environment J2ME (Java 2 Micro Edition) is a runtime environment designed for devices with limited resources OEM SPECIFIC MIDP APPLICATIONS NATIVE APPLICATIONS APPLICATIONS OEM SPECIFIC CLASSES MIDP CLDC NATIVE SOFTWARE DEVICE SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.7/18
J2ME as an application environment Basic language features and libraries are in the CLDC (Connected Limited Device Configuration). OEM SPECIFIC MIDP APPLICATIONS NATIVE APPLICATIONS APPLICATIONS OEM SPECIFIC CLASSES MIDP CLDC NATIVE SOFTWARE DEVICE SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.7/18
J2ME as an application environment Mobile Information Device Profile (MIDP) provides additional functionality for a specific type of device. OEM SPECIFIC MIDP APPLICATIONS NATIVE APPLICATIONS APPLICATIONS OEM SPECIFIC CLASSES MIDP CLDC NATIVE SOFTWARE DEVICE SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.7/18
Application requirements The requirements for the application were to 1. Encrypt an SMS message using quasigroup encryption and send it SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.8/18
Application requirements The requirements for the application were to 1. Encrypt an SMS message using quasigroup encryption and send it 2. Receive encrypted messages and decrypt them SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.8/18
Application requirements The requirements for the application were to 1. Encrypt an SMS message using quasigroup encryption and send it 2. Receive encrypted messages and decrypt them 3. Operate fast enough to provide acceptable service in an environment with very limited processing power like a mobile phone SPLST 2003 Kuopio, Finland 17-18.6.2003 – p.8/18
Recommend
More recommend
