Rizal Broer Bahaweres

3. Target akhir
– Buat aplikasi sederhana
-Konek database
-logic php
– wordpress
// Agenda today, 7 agus 2019 :
port default ssl : 443;
ssl : 447
1. instalassi xamppp
download :
google search : xampp download

Tugas pertama 1.
Install Xampp
buat/jalankan program hello word php
join google groups

tugas 2
buat program untuk menghitung luas dan keliling persegi panjang

luas = panjang x lebar
keliling = 2 x ( panjang + lebar)
code yg tadi dibuat kedalam form

w3 school php

tugas 3
buat program untuk mengecek apakah bilangan itu ganjil atau genap.
kita memasukan/mematok suatu bilangan
bila ganjil dituliskan ganjil
bila genap dituliskan genap

Materi :

Dyta:

https://drive.google.com/drive/folders/10lnqIQeSDtd3Xm4HUXGHisRPY5u1hAVb

Rizal Broer

https://drive.google.com/drive/folders/1RDGxk8z_7yOMk8hh-Fb9EtUsKool4RS-?usp=sharing

Reference:

Php Manual , https://www.php.net/manual/en/index.php

Questioner Peserta Logo dan Merek

Questioner

1. Nama
2. jenis usaha
3. Tempat, tgl berdirinya usaha ?
3. Apakah sudah ada logo ?
gambar ? (Y/T)
Tulisan/ Huruf/ Kata ? (Y/T)
4. Sudah memasukan/mendaftarkan form logo di DPE, Dep.KumHam ?
4a. Sudah berapa lama ?
4b. respon balik/ feed Back ?

5 Apakah pernah mempelajari Teknis, Desain Membuat logo dan merek ?
5a. Konsep Merek ? (Y/T)
5b. Konsep Logo ? (Y/T)
5c. Tools Desain
Adobe illustrator, dll.
6. Apakah pernah melakukan/memproses logo dan Merek, ?
6a. pernah ke web Dep.KumHam/Deperindag ?
6b. pernah mengisi dan mendaftarkan ?
6c. pernah punya logo, Merek ?

http://www.dgip.go.id/formulir-terkait-permohonan-merek

Protected: UAS Cryptography

UAS OS

Hari ini kita mulai UAS jam 8.00 dikelas biasa; Peserta UAS wajib hadir ontime

Dikerjakan dikertas, Lembar Ujian.
Boleh buka buku, internet dll, DILARANG MECONTEK TEMAN . Yang melangar akan diberi BONUS E

Soal type A. untuk NIM Ganjil
Soal Type B untuk NIM Genap

https://drive.google.com/drive/folders/1rjlQ-uY03C9f3QllK5VYFsKim7LGkAGp?usp=sharing

Tutorial Matematica Wolfram

Tutorial Wolfram Matematica

ECC part 1

Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC requires smaller keys compared to non-EC cryptography (based on plain Galois fields) to provide equivalent security.[1]

Elliptic curves are applicable for key agreement, digital signatures, pseudo-random generators and other tasks. Indirectly, they can be used for encryption by combining the key agreement with a symmetric encryption scheme. They are also used in several integer factorization algorithms based on elliptic curves that have applications in cryptography, such as Lenstra elliptic-curve factorization.

Theory

For current cryptographic purposes, an elliptic curve is a plane curve over a finite field (rather than the real numbers) which consists of the points satisfying the equation

{\displaystyle y^{2}=x^{3}+ax+b,\,}

along with a distinguished point at infinity, denoted ∞. (The coordinates here are to be chosen from a fixed finite field of characteristic not equal to 2 or 3, or the curve equation will be somewhat more complicated.)

This set together with the group operation of elliptic curves is an abelian group, with the point at infinity as an identity element. The structure of the group is inherited from the divisor group of the underlying algebraic variety.

{\displaystyle \mathrm {Div} ^{0}(E)\to \mathrm {Pic} ^{0}(E)\simeq E,\,}

Cryptographic schemes

Several discrete logarithm-based protocols have been adapted to elliptic curves, replacing the group

{\displaystyle (\mathbb {Z} _{p})^{\times }}

with an elliptic curve:

The Elliptic Curve Diffie–Hellman (ECDH) key agreement scheme is based on the Diffie–Hellman scheme,
The Elliptic Curve Integrated Encryption Scheme (ECIES), also known as Elliptic Curve Augmented Encryption Scheme or simply the Elliptic Curve Encryption Scheme,
The Elliptic Curve Digital Signature Algorithm (ECDSA) is based on the Digital Signature Algorithm,
The deformation scheme using Harrison’s p-adic Manhattan metric,
The Edwards-curve Digital Signature Algorithm (EdDSA) is based on Schnorr signature and uses twisted Edwards curves,
The ECMQV key agreement scheme is based on the MQV key agreement scheme,
The ECQV implicit certificate scheme.

At the RSA Conference 2005, the National Security Agency (NSA) announced Suite B which exclusively uses ECC for digital signature generation and key exchange. The suite is intended to protect both classified and unclassified national security systems and information.[8]

Recently, a large number of cryptographic primitives based on bilinear mappings on various elliptic curve groups, such as the Weil and Tate pairings, have been introduced. Schemes based on these primitives provide efficient identity-based encryption as well as pairing-based signatures, signcryption, key agreement, and proxy re-encryption.