Pinned Repositories
AVLtrees
Implementation of AVL trees in C++
bitsErpApp
client-sever-password-based-authentication-in-python
Implementation of a simple client-server program which will facilitate a client to register itself to the server. It is implemented in python socket programming.A server should keep a table of user-hash(password) entry for each user
distributed-query-processing-in-wsn
elliptic-curve-diffie-hellman
Implemented in python , Elliptic-curve Diffie–Hellman (ECDH) is a key agreement protocol that allows two parties, each having an elliptic-curve public–private key pair, to establish a shared secret over an insecure channel. This shared secret may be directly used as a key, or to derive another key
extract-features-pcap-sqlLite
Extract network features from pcap files using python pyshark and storing them in SQL LITE DB
home-automation-contiki
Simulation of smart home automation system devices using contiki OS
rail-fence-ciphers
Implementation of classic rail fence cipher encryption and encryption,decryption of 2-level rail fence cipher
Ubertooth-Kismet-Wireshark
yaos-millionare-problem
Yao's Millionaires' problem is a secure multi-party computation problem which was introduced in 1982 by computer scientist and computational theorist Andrew Yao. The problem discusses two millionaires, Alice and Bob, who are interested in knowing which of them is richer without revealing their actual wealth
kanika2296's Repositories
kanika2296/client-sever-password-based-authentication-in-python
Implementation of a simple client-server program which will facilitate a client to register itself to the server. It is implemented in python socket programming.A server should keep a table of user-hash(password) entry for each user
kanika2296/home-automation-contiki
Simulation of smart home automation system devices using contiki OS
kanika2296/elliptic-curve-diffie-hellman
Implemented in python , Elliptic-curve Diffie–Hellman (ECDH) is a key agreement protocol that allows two parties, each having an elliptic-curve public–private key pair, to establish a shared secret over an insecure channel. This shared secret may be directly used as a key, or to derive another key
kanika2296/distributed-query-processing-in-wsn
kanika2296/Ubertooth-Kismet-Wireshark
kanika2296/yaos-millionare-problem
Yao's Millionaires' problem is a secure multi-party computation problem which was introduced in 1982 by computer scientist and computational theorist Andrew Yao. The problem discusses two millionaires, Alice and Bob, who are interested in knowing which of them is richer without revealing their actual wealth
kanika2296/extract-features-pcap-sqlLite
Extract network features from pcap files using python pyshark and storing them in SQL LITE DB
kanika2296/2048
A C++ simulation of the famous 2048 game
kanika2296/AVLtrees
Implementation of AVL trees in C++
kanika2296/bitsErpApp
kanika2296/rail-fence-ciphers
Implementation of classic rail fence cipher encryption and encryption,decryption of 2-level rail fence cipher
kanika2296/analog-clock-matlab
Analog clock in MATLAB APP Designer
kanika2296/c-book-code
c code to simulate a book
kanika2296/disk_scheduling
kanika2296/html-css-website
Simple website using BootStrap
kanika2296/innodb-cluster
Setting up innodb-cluster using Docker
kanika2296/leetcode-solutions
kanika2296/LocationAwareGCNs
Research Presentation
kanika2296/matlab-cody
kanika2296/matlab-cody-2020
kanika2296/Percolation
kanika2296/pollsApp_team10
kanika2296/RSA
This is a simple RSA implementation in pure python
kanika2296/Stack_Queue
C++ implementation of Stacks and Queues using templates.