[ABSTRAK Fungsi bilinear merupakan suatu fungsi yang berbentuk 𝑒: 𝑉 × 𝑉 → 𝐹, dengan 𝑉adalah ruang vektor atas lapangan 𝐹 yang bersifat linear. Pada implementasinya,fungsi bilinear dapat diterapkan pada skema kriptografi. Kriptografi didefinisikansebagai ilmu yang berkaitan dengan aspek keamanan informasi, sepertikerahasiaan, keutuhan data, otentikasi entitas dan otentikasi sumber data, denganmenggunakan teknik-teknik matematika. Salah satu skema kriptografi yangmenggunakan fungsi bilinear adalah skema yang berkaitan dengan otentikasisumber data, yaitu Tanda Tangan Agregat Tanpa Sertifikat (CertificatelessAggregate Signature). Pada penelitian ini akan dibahas skema Tanda TanganAgregat Tanpa Sertifikat (T2ATS) yang diajukan oleh Liu dkk pada tahun 2014serta sifat/karakteristik dari fungsi bilinear yang harus dipenuhi guna menjaminkeamanan dari skema kriptografi, khususnya skema T2ATS. Hasil dari penelitianini menunjukkan bahwa fungsi bilinear yang digunakan pada skema T2ATS harusmenggunakan domain dan kodomain yang memenuhi masalah logaritma diskrit(Discrete Logarithm Problem). Selain itu, penelitian ini juga akan menerapkansalah satu varian fungsi bilinear, yaitu fungsi weil pairing pada skema T2ATS. ABSTRACT Bilinear map is a linear function that in form e: V × V → F, where V is a vectorspace over field F. Bilinear map can be used in cryptographic scheme.Cryptography is the study of mathematical techniques related to aspects ofinformation security such as confidentiality, data integrity, entity authentication,and data origin authentication. An example of bilinear map implementation used incryptographic scheme is Certificateless Aggregate Signature (CLAS). CLAS is acryptographic scheme related to data origin authentication. This research willdescribe CLAS scheme proposed by Liu et.al (2014) and bilinear map propertieshold to ensure security of this scheme. The result of this paper show that domainand codomain of bilinear map used in CLAS scheme should meet DiscreteLogarithm Problem. This research also implement weil pairing as one of bilinearfunction commonly used in cryptography on CLAS scheme;Bilinear map is a linear function that in form e: V × V → F, where V is a vectorspace over field F. Bilinear map can be used in cryptographic scheme.Cryptography is the study of mathematical techniques related to aspects ofinformation security such as confidentiality, data integrity, entity authentication,and data origin authentication. An example of bilinear map implementation used incryptographic scheme is Certificateless Aggregate Signature (CLAS). CLAS is acryptographic scheme related to data origin authentication. This research willdescribe CLAS scheme proposed by Liu et.al (2014) and bilinear map propertieshold to ensure security of this scheme. The result of this paper show that domainand codomain of bilinear map used in CLAS scheme should meet DiscreteLogarithm Problem. This research also implement weil pairing as one of bilinearfunction commonly used in cryptography on CLAS scheme, Bilinear map is a linear function that in form e: V × V → F, where V is a vectorspace over field F. Bilinear map can be used in cryptographic scheme.Cryptography is the study of mathematical techniques related to aspects ofinformation security such as confidentiality, data integrity, entity authentication,and data origin authentication. An example of bilinear map implementation used incryptographic scheme is Certificateless Aggregate Signature (CLAS). CLAS is acryptographic scheme related to data origin authentication. This research willdescribe CLAS scheme proposed by Liu et.al (2014) and bilinear map propertieshold to ensure security of this scheme. The result of this paper show that domainand codomain of bilinear map used in CLAS scheme should meet DiscreteLogarithm Problem. This research also implement weil pairing as one of bilinearfunction commonly used in cryptography on CLAS scheme] |