For slides, a problem set and more on learning cryptography, visit www.crypto-textbook.com

Views: 68314
Introduction to Cryptography by Christof Paar

DES algorithm follows the Feistel Structure
Most of the Block cipher algorithms follows Feistel Structure
BLOCK SIZE - 64 bits Plain Text
No. of Rounds - 16 Rounds
Key Size - 64 bits
Sub Key Size - 48 bits
No. of Sub Keys - 16 Sub Keys
Cipher Text - 64 bits

Views: 157437
Sundeep Saradhi Kanthety

Many years ago I came across a clickable flash animation that explained how the Rijndael cipher works. And even though Rijndael is pure, complex math, the animated visualizations made the whole process so crystal clear that I had to bend down to the floor afterwards to pick up my dropped jaw.
Since then I know how powerful animated visualizations can be, even (or rather especially) for abstract and/or complex topics.
When I started my Go blog, I knew I had to use animations because they are worth a thousand words. I did the same in my Go videos that you can find over here in my channel, and also in my Go course.
This video is a recoding of the flash animation while I click through it. The flash animation is still available at formaestudio.com (link below), but no sane browser would agree to play any flash content anymore, so a video capture is the best we can get. I hope the pace of clicking through the steps is just right for you.
NOTE: The video has no audio part. This is not a bug, the Flash animation simply had no sounds.
The Rijndael Animation (and another Flash program called Rijndael Inspector): http://www.formaestudio.com/rijndaelinspector/
(c) Enrique Zabala. License terms: "Both these programs are free of use." (I guess that publishing a video of the animation is covered by these terms.)
My blog: https://appliedgo.net
My course: https://appliedgo.com/p/mastergo

Views: 28182
AppliedGo

The video explains the second step in developing DES-Key Schedule

Views: 452
Project Rhea

In this network security video tutorial we will study the working of RSA Algorithm.
RSA Algorithm theory -
1. Ron Rivest, Adi Shamir and Len Adlemen developed the method called as RSA algorithm.
2. Most popular and proven asymmetric key cryptography algorithm
3. Based on the mathematical fact that it is easy to find and multiply large prime numbers together, but it is extremely difficult to factor their product.
RSA Algorithm Steps -
1. Choose two large prime numbers P and Q.
2. Calculate N = P * Q
3. Select the public key (i.e. the encryption key) E such that it is not a factor of [(P – 1) * (Q – 1)].
4. Select the private key (i.e. the decryption key) D such that the following equation is true:
(D * E) mod (P – 1) * (Q – 1) = 1
5. For encryption calculate the cipher text CT from the plain text PT as follows: CT= PT^E mod N
6. Send CT as the cipher text to the receiver
7. For decryption calculate the plain text PT from the cipher text CT as follows: PT = CT^D mod N
Complete Network Security / Information Security Playlist - https://www.youtube.com/watch?v=IkfggBVUJxY&list=PLIY8eNdw5tW_7-QrsY_n9nC0Xfhs1tLEK
Download my FREE Network Security Android App - https://play.google.com/store/apps/details?id=com.intelisenze.networksecuritytutorials
Simple Snippets Official Website -
http://simplesnippets.tech/
Simple Snippets on Facebook -
https://www.facebook.com/simplesnippets/
Simple Snippets on Instagram -
https://www.instagram.com/simplesnippets/
Simple Snippets on Twitter -
https://twitter.com/simplesnippet
Simple Snippets Google Plus Page -
https://plus.google.com/+SimpleSnippets
Simple Snippets email ID -
[email protected]il.com
For More Technology News, Latest Updates and Blog articles visit our Official Website - http://simplesnippets.tech/
#RSA #RSAalgorithm #NetworkSecurity #AsymmetricCryptography

Views: 1270
Simple Snippets

Modern cryptography depends on the existence of several special kinds of mathematical functions. One important kind is a trapdoor function. Trapdoor functions are somewhat similar to hash functions in that they are easy to compute but hard to invert… except if you know a secret piece of information. So if someone does not have the secret or key, they cannot invert the function. If they do, they can open the trapdoor and invert the function. Trapdoor functions form the basis of modern cryptographic techniques that are widely-used online.
Credits: Talking: Geoffrey Challen (Assistant Professor, Computer Science and Engineering, University at Buffalo). Producing: Greg Bunyea (Undergraduate, Computer Science and Engineering, University at Buffalo).
Part of the https://www.internet-class.org online internet course. A blue Systems Research Group (https://blue.cse.buffalo.edu) production.

Views: 8634
internet-class

Full Video Details: http://www.securitytube.net/video/79

Views: 24631
TheSecurityTube

This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.

Views: 844
Udacity

MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Srinivas Devadas
In this lecture, Professor Devadas continues with cryptography, introducing encryption methods.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Views: 17160
MIT OpenCourseWare

Implementing RC4 in Matlab
Key Scheduling Algorithm (KSA)
Pseudo-random generation algorithm (PRGA)

Views: 444
Programming Community

Views: 15156
Internetwork Security

CUFP 2011: John Launchbury, Galois
Even though step-by-step refinement has long been seen as desirable, it is hard to find compelling industrial applications of the technique. In theory, transforming a high-level specification into a high-performance implementation is an ideal means of producing a correct design, but in practice it is hard to make it work, and even harder to make it worthwhile. This talk describes an exception. We relate a design experience in which theorem-based refinement played a crucial role in producing an industrial quality FPGA encryptor and decryptor for AES. Quite simply, we are unlikely to have succeeded without the technique.
We began with a specification for AES written in Cryptol, a high-level functional language designed specifically for describing the domain of bit-level computations as arise in Cryptography. Over a series of five design stages we were able to produce an industrial grade encrypt core. In each stage, we stated theorems which related the component behaviors in one stage with the corresponding behaviors in the refinement. The resulting cores, running at 350Mhz-440Mhz depending on the FPGA part, bore little relationship to the original, except that the step-by-step theorems ensured we had not gone astray.
The next significant challenge we faced was in performing decrypt. While there are many similarities between encrypt and decrypt in AES, there are some crucial differences with regard to high performance. First concerns the generation of key material. The AES key is used as a seed for a specific pseudo-random number generator which produces key material for use in each of the AES rounds. For encrypt, the key-generator runs in sync with the action of encryption, so may be scheduled alongside it. For decrypt, they run counter to one-another, facing a major challenge to be overcome. Second, the generated key material needs to have an additional transformation applied to it, which occurs deep in the middle of the high performing core.
Using theorems as stepping stones along the way, we redesigned the key expansion algorithm so that it would run in sync with the decryption, and we traced parallel steps to the derivation of encrypt, establishing a commuting ladder diagram along the way. At each barriers in development, we produced many theorems to isolate the bug, using theorems as a principled kind of printf. When the bug was eradicated, we elided many of the temporary theorems, leaving behind those that provided important insights into the behavior of the code.
This talk is a story of the journey with demonstrations of the tool at work. Its ultimate message is to highlight the value of including a theorem facility within purely functional domain-specific languages.

Views: 338
anilmvs

Take the full crash course of Cryptography and Security System for free at Last moment tuitions
Full course : https://lastmomenttuitions.com/course/cryptography-and-system-security/
Sample Notes :https://goo.gl/QpZPF5
For full hand made notes of Artificial Intelligence its only 100 rs
payment options is PAYTM :9762903078
once we get payment notification we will mail you the notes on your email id
contact us at :[email protected]
whatsapp :9762903078
apko koi bhi doubt ho toh app humko direct email ya phone kar sakte ho
Cryptography and security systems Series
introduction to CSS: https://goo.gl/tjrh1L
security goals and mechanism:https://goo.gl/uq35hP
symmetric cipher:https://goo.gl/KFxF9j
Substitution cipher and its types:https://goo.gl/MKmPzk
Transposition cipher:https://goo.gl/uHqD7i
diffie -hellman: https://goo.gl/YrskC5
RSA Algorithm:https://goo.gl/KwzCBF
Kerberos:https://goo.gl/MQPgzw
IDEA algorithm : https://goo.gl/PTCqFH
Dos and DDos attack: https://goo.gl/8T345G
SQL injection:https://goo.gl/bcVHnw
SHA-1 vs MD5 :https://goo.gl/QJBhJD
chalo toh public bus pass hojao aur share karo videos ko whatsapp group
apne last moment pe unn dosto ko jo apni tarah last moment pe padhte hai
Aur videos CSS ke aane waale hai so Channel ko subscribe jaroor karna
follow us on:
https://www.instagram.com/last_moment_tuitions
https://www.facebook.com/lastmomenttuition
https://www.facebook.com/sumerr3

Views: 71629
Last moment tuitions

implementing RC4 in Python
Key-scheduling algorithm (KSA)
Pseudo-random generation algorithm (PRGA)

Views: 970
Programming Community

Cryptography and Network Security by Prof. D. Mukhopadhyay, Department of Computer Science and Engineering, IIT Kharagpur. For more details on NPTEL visit http://nptel.iitm.ac.in

Views: 17767
nptelhrd

Cryptography and Network Security by Prof. D. Mukhopadhyay, Department of Computer Science and Engineering, IIT Kharagpur. For more details on NPTEL visit http://nptel.iitm.ac.in

Views: 28190
nptelhrd

Views: 3001
Raymond Chan

MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Srinivas Devadas
In this lecture, Professor Devadas introduces approximation algorithms in the context of NP-hard problems.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Views: 23881
MIT OpenCourseWare

MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Erik Demaine
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Views: 236738
MIT OpenCourseWare

This shows the operation of the RC4 algorithm (limited to 5 bits instead of the usual 8) after the key scheduling has happened.

Views: 16937
jgrahamc

MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Srinivas Devadas
In this lecture, Professor Devadas gives an overview of the course and introduces an algorithm for optimal interval scheduling.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Views: 188281
MIT OpenCourseWare

Views: 1712
Nisha Mittal

https://8gwifi.org/CipherFunctions.jsp
Encryption Decryption Online https://8gwifi.org/CipherFunctions.jsp
what is DES DATA ENCRYPTION STANDARD (DES)
The Data Encryption Standard (DES) specifies two FIPS approved
cryptographic algorithms as required by FIPS 140-1. When used in conjunction with American
National Standards Institute (ANSI) X9.52 standard, this publication provides a complete description
of the mathematical algorithms for encrypting (enciphering) and decrypting (deciphering) binary
coded information. Encrypting data converts it to an unintelligible form called cipher. Decrypting
cipher converts the data back to its original form called plaintext. The algorithms described in this
standard specifies both enciphering and deciphering operations which are based on a binary number
called a key
computer security cryptography
data encryption standard animation

Views: 72313
Zariga Tongy

Views: 5102
Internetwork Security

Cryptography and Network Security by Prof. D. Mukhopadhyay, Department of Computer Science and Engineering, IIT Kharagpur. For more details on NPTEL visit http://nptel.iitm.ac.in

Views: 18276
nptelhrd

Spring 2018 Cryptography & Cryptanalysis
Prof. Shafi Goldwasser

Views: 3054
Andrew Xia

Views: 15462
Internetwork Security

Dr. Rakesh Mohanty
Dept of Computer Science
Vssut ,Burla

Views: 408
VSSUT ONLINE VIDEO LECTURES

Views: 6212
Internetwork Security

Discrete Mathematics Homework.
Sources:
http://omerozcan.net/rsa/
https://tr.khanacademy.org/computing/computer-science/cryptography/modern-crypt/v/intro-to-rsa-encryption
Project code link: https://yadi.sk/d/BRLDPvyt3ZfqJG

Views: 1224
Burak Parlak

MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Ling Ren
In this recitation, problems related to cryptography are discussed.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Views: 3700
MIT OpenCourseWare

Threat Monitoring (Firewall) and Technique of Encryption in Operating System
Like Us on Facebook - https://www.facebook.com/Easy-Engineering-Classes-346838485669475/
Operating System Hindi Classes
Operating System Tutorial for Beginners in Hindi
Operating System Study Notes
Operating System Video Lectures

Views: 15300
Easy Engineering Classes

Embedded System Software Tutorial: Cryptography
Prof. Phil Koopman, Carnegie Mellon University
For slides, see: https://users.ece.cmu.edu/~koopman/lectures/

Views: 116
Phil Koopman

Views: 7605
Internetwork Security

The Yale Quantum Institute welcomes Fred Chong of University of Chicago for a colloquium “Closing the Gap Between Quantum Algorithms and Hardware through Software-Enabled Vertical Integration and Co-Design”. This talk brought together Yale quantum physicists, computer scientists, and electrical engineers.
Quantum computing is at an inflection point, where 72-qubit (quantum bit) machines are under test, 100-qubit machines are just around the corner, and even 1000-qubit machines are perhaps only a few years away. These machines have the potential to fundamentally change our concept of what is computable and demonstrate practical applications in areas such as quantum chemistry, optimization, and quantum simulation. Yet a significant resource gap remains between practical quantum algorithms and real machines. Programming, compilation and control will play a key role in increasing the efficiency of algorithms and machines to close this gap. In this video, Fred Chong will outline several grand research challenges in closing this gap, including programming language design, software and hardware verification, defining and perforating abstraction boundaries, cross-layer optimization, managing parallelism and communication, mapping and scheduling computations, reducing control complexity, machine-specific optimizations, learning error patterns, and many more. He will also describe the resources and infrastructure available for starting research in quantum computing and for tackling these challenges.
This colloquium is co-sponsored by Yale Computer Science and Electrical Engineering departments.

Views: 1084
YaleUniversity

ITP - C Programming Lecture 1 - Algorithm, Flowchart with Examples - Hindi tutorial
ALGORITHM - Introduction
Example – Algorithm to find Greatest Among three numbers
Approaches of Algorithm – Top Down Approach(Divide and Conquer Technique)
Efficiency of an Algorithm
Time and Space Complexity, Analysis of Algorithm
FLOWCHARTS - Introduction
Example – Algorithm and Flowchart to Check whether a Number is Even or Odd
Example: Algorithm to find Factorial of a Number
Example: Flowchart for Addition of Two numbers
Example: Flowchart to Find Average of 10 Numbers
#LMR
#ITP #C Programming tutorial for Beginners in Hindi

Views: 2951
Easy Engineering Classes

📚📚📚📚📚📚📚📚
GOOD NEWS FOR COMPUTER ENGINEERS
INTRODUCING
5 MINUTES ENGINEERING
🎓🎓🎓🎓🎓🎓🎓🎓
SUBJECT :-
Discrete Mathematics (DM)
Theory Of Computation (TOC)
Artificial Intelligence(AI)
Database Management System(DBMS)
Software Modeling and Designing(SMD)
Software Engineering and Project Planning(SEPM)
Data mining and Warehouse(DMW)
Data analytics(DA)
Mobile Communication(MC)
Computer networks(CN)
High performance Computing(HPC)
Operating system
System programming (SPOS)
Web technology(WT)
Internet of things(IOT)
Design and analysis of algorithm(DAA)
💡💡💡💡💡💡💡💡
EACH AND EVERY TOPIC OF EACH AND EVERY SUBJECT (MENTIONED ABOVE) IN COMPUTER ENGINEERING LIFE IS EXPLAINED IN JUST 5 MINUTES.
💡💡💡💡💡💡💡💡
THE EASIEST EXPLANATION EVER ON EVERY ENGINEERING SUBJECT IN JUST 5 MINUTES.
🙏🙏🙏🙏🙏🙏🙏🙏
YOU JUST NEED TO DO
3 MAGICAL THINGS
LIKE
SHARE
&
SUBSCRIBE
TO MY YOUTUBE CHANNEL
5 MINUTES ENGINEERING
📚📚📚📚📚📚📚📚

Views: 176
5 Minutes Engineering

Implemented a fancy gui. Slight tweak to cpu algorithm, it plays blind atm, no consideration for the next piece. The algorithm doesn't incorporate any piece hooking concept either.

Views: 177
aJack77

Hackerdashery #2
Inspired by the Complexity Zoo wiki: https://complexityzoo.uwaterloo.ca/Complexity_Zoo
For more advanced reading, I highly recommend Scott Aaronson's blog, Shtetl-Optimized: http://www.scottaaronson.com/blog/
-----
Retro-fabulous, cabinet-sized computers:
System/360: http://en.wikipedia.org/wiki/IBM_System/360
photo: "360-91-panel". Licensed under Public domain via Wikimedia Commons - http://commons.wikimedia.org/wiki/File:360-91-panel.jpg#mediaviewer/File:360-91-panel.jpg
PDP-8: http://en.wikipedia.org/wiki/PDP-8
photo: "PDP-8". Licensed under Public domain via Wikimedia Commons - http://commons.wikimedia.org/wiki/File:PDP-8.jpg#mediaviewer/File:PDP-8.jpg
-----
Protein folding illustration: "Protein folding schematic" by Tomixdf (talk) - Own work (Original text: “self-made”). Licensed under Public domain via Wikimedia Commons - http://commons.wikimedia.org/wiki/File:Protein_folding_schematic.png#mediaviewer/File:Protein_folding_schematic.png
P vs. NP opinion poll: http://www.cs.umd.edu/~gasarch/papers/poll2012.pdf

Views: 1763512
hackerdashery

User Authentication Introduction to Passwords Based Authentication, Derived from Passwords, MD of Passwords
Keywords:
User Authentication
Password Based Authentication
Network Security Notes
Computer Network Security Notes
Something derived from passwords
Problems with Clear Text Password Schemes
Message Digest(MD) of Passwords

Views: 16162
Easy Engineering Classes

Database Management System GATE Lectures (DBMS) for GATE 2019 Computer Science Preparation.
Enrol for FREE GATE CSE Lectures here ► https://gradeup.co/courses/gate-cse-video-lectures-free?utm_source=youtube&utm_medium=des&utm_campaign=DBMS_Intro
Watch all DBMS Lectures here: https://www.youtube.com/watch?v=oMid8R729n0&list=PLynLXReWAxdFMPz61t1L7S37G9TyScys2
This GATE Lecture includes:
- DBMS GATE Syllabus
- DBMS GATE Book
- Database Management System Weightage Analysis from 2014-2018
- Basics of Database Management System for GATE 2019
Practice Database Management System (DBMS) questions with FREE GATE CSE 2019 Mocks here ► https://gradeup.co/online-test-series/computer-science-engineering/gate-cs-2019-combo-test-series-zjivhowpx?utm_source=youtube&utm_medium=des&utm_campaign=DBMS_Intro
FREE Mocks are also available for other exams like:
- AAI ATC CSE ► https://gradeup.co/online-test-series/computer-science-engineering/aai-atc-junior-executive-2018-test-series-zjlnheyq8?utm_source=youtube&utm_medium=des&utm_campaign=DBMS_Intro
- DRDO CEPTAM CSE ► https://gradeup.co/online-test-series/computer-science-engineering/drdo-ceptam-sta-b-2018-tier-i-test-series-zjlniktoq?utm_source=youtube&utm_medium=des&utm_campaign=DBMS_Intro
Try Free Mock Now!
Get Free Study Material & Practice daily quizzes on Gradeup App ► https://gradeup.page.link/gate
Get all information about GATE Computer Science here: https://gradeup.co/computer-science-engineering/gate-cse?utm_source=youtube&utm_medium=des&utm_campaign=DBMS_Intro
GATE CSE 2019 syllabus (https://gradeup.co/gate-syllabus-for-cse-i-c68e9084-1b57-11e6-bec1-c3f7752aa5f5) is divided into following sections:
1. Engineering Mathematics: Discrete mathematics, Linear Algebra, Calculus, Probability
2. Digital Logic: Boolean Algebra, Combinational and Sequential Circuits, Minimization, Number Representations and computer arithmetic (fixed and floating point)
3. Computer Organisation and Architecture: Machine instructions and addressing modes. ALU, data path and control unit. Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode)
4. Programming and Data Structures: Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs
5. Algorithms: Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide and conquer. Graph search, minimum spanning trees, shortest paths
6. Theory of Computation: Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability
7. Compiler Design: Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation
8. Operating System: Processes, threads, inter process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems
9. Databases: ER model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control
10. Computer Networks: Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.
Refer GATE 2019 notification here: https://gradeup.co/gate?utm_source=youtube&utm_medium=des&utm_campaign=DBMS_Intro
#GATECSE #GATE #GATE2019 #GATEgradeup

Views: 5848
Gradeup- GATE, ESE, PSUs Exam Preparation

This is the 2nd part of a presentation in collaboration with the Department of Computer Science, at University College London (UCL). Andreas is a UCL alumni. Part of an academic lecture that Andreas M. Antonopoulos gave at the beginning of 2016 explaining the consensus algorithm, "Proof of Work", used by bitcoin and many other blockchains.
Watch the full presentation here https://youtu.be/fw3WkySh_Ho
Andreas is the author of two books: “Mastering Bitcoin,” published by O’Reilly Media and considered the best technical guide to bitcoin; “The Internet of Money,” a book about why bitcoin matters.
Get the books on Amazon http://amzn.to/2zpekI0
Follow Andreas on Twitter @aantonop https://twitter.com/aantonop
Subscribe to Andreas's YouTube channel https://www.youtube.com/user/aantonop
Check out Andreas's website https://antonopoulos.com/
Support Andreas by becoming a Patreon https://www.patreon.com/aantonop
This is part of a video that was first published under a creative commons licence https://creativecommons.org/ on 31 Jan 2016 the aantonop YouTube channel https://www.youtube.com/user/aantonop and can be found here https://youtu.be/fw3WkySh_Ho
About the Creative Commons Licence: One goal of Creative Commons is to increase the amount of openly licensed creativity in “the commons” — the body of work freely available for legal use, sharing, repurposing, and remixing.
Watch part 1 Bitcoin Consensus Algorithms https://youtu.be/pnyxdFow194
Follow Bitcoinboy on Twitter @BitCoinBoy https://twitter.com/BitCoinBoy
If you'd like to support this channel 1BtCboyxPL4WNutwq79oqsQ5Vc25SchoZp

Views: 2605
Bitcoinboy

APTITUDE
===================
how to find number of Triangles Part 2 : https://youtu.be/rul4FUqgdcA
how to find number of Triangles Part 1 : https://youtu.be/YWzKAaXNefI
how to find number of Triangles Part 3 : https://youtu.be/zEA_X13u52E
how to find number of squares : https://youtu.be/SXz6ixH1pLk
how to find number of Rectangles Part1 : https://youtu.be/Y19kOt9nvtk
how to find number of Rectangles part 2 : https://youtu.be/AjSafoT_wgQ
GATE
======================
Gate question on character array pointer #taiyyari : https://youtu.be/Jr-C8sDfrfE
How does int and char pointers work? : https://youtu.be/uB69YSFw2yI
Gate question pointer 2008 : https://youtu.be/UB___-Fq8vQ
Gate question on recursion : https://youtu.be/26IKSb_eu4M
C question on recursion.... solution gate : https://youtu.be/4yHrBivo6ig
Compiler introduction... Part1 : https://youtu.be/OQn7z27tS8k
#taiyyari compiler introduction part 2 : https://youtu.be/biwvbDSMfBQ
Compiler gate higher precedence : https://youtu.be/_qIDdafjXa8
Binary search worst case : https://youtu.be/JdGuQihtGFs
Call by reference explained.... : https://youtu.be/QwW8sPoc7So
How to use Static Keyword in C programming Gate 2000 : https://youtu.be/PJqX0AzTBJI
C programming tokens #taiyyari : https://youtu.be/qfkG6PDS2eE
LRTF CPU SchedulingAlgorithm #Taiyyari : https://youtu.be/MhE8SHBa7YE
SRTF CPU Scheduling Algorithm #taiyyari : https://youtu.be/fwId1CapoeA
SJF CPU Scheduling Algorithm #taiyyari : https://youtu.be/VIn68mFJmRo
Round Robin CPU Schedling Algorithm #Taiyyari : https://youtu.be/0IxVIKFu414
Binary To Gray Algorithm code conversion #taiyyari : https://youtu.be/la9z4KHI66U
Gray to Binary Code conversion - Number system : https://youtu.be/UozTFV-xtKI
Gate 2018 solution ER model.. : https://youtu.be/JAFVdnqrllI
Apigee for beginners... #taiyyari : https://youtu.be/M9RVuFyJ2Lk
Gate CSE 2018 Solved RISC Processor Question : https://youtu.be/4WyJThyXq4U
Gate CSE 2018 Solved Queestion on Xor and Xnor : https://youtu.be/BiMbkR8sMB8
Gate 2018 Solved Question on Process Instance : https://youtu.be/sK6-gQSWewo

Views: 13
Taiyyari Samahit

MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Erik Demaine
In this lecture, Professor Demaine reviews hashing in the context of randomized algorithms.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Views: 26843
MIT OpenCourseWare

MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Srinivas Devadas
In this lecture, Professor Devadas continues with the topic of network flow.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Views: 18025
MIT OpenCourseWare

Protecting Private Keys against Memory Disclosure Attacks Using Hardware Transactional Memory
Le Guan
Presented at the
2015 IEEE Symposium on Security & Privacy
May 18--20, 2015
San Jose, CA
http://www.ieee-security.org/TC/SP2015/
ABSTRACT
Cryptography plays an important role in computer and communication security. In practical implementations of cryptosystems, the cryptographic keys are usually loaded into the memory as plaintext, and then used in the cryptographic algorithms. Therefore, the private keys are subject to memory disclosure attacks that read unauthorized data from RAM. Such attacks could be performed through software methods (e.g., Open SSL Heart bleed) even when the integrity of the victim system's executable binaries is maintained. They could also be performed through physical methods (e.g., Cold-boot attacks on RAM chips) even when the system is free of software vulnerabilities. In this paper, we propose Mimosa that protects RSA private keys against the above software-based and physical memory attacks. When the Mimosa service is in idle, private keys are encrypted and reside in memory as cipher text. During the cryptographic computing, Mimosa uses hardware transactional memory (HTM) to ensure that (a) whenever a malicious process other than Mimosa attempts to read the plaintext private key, the transaction aborts and all sensitive data are automatically cleared with hardware mechanisms, due to the strong atomicity guarantee of HTM, and (b) all sensitive data, including private keys and intermediate states, appear as plaintext only within CPU-bound caches, and are never loaded to RAM chips. To the best of our knowledge, Mimosa is the first solution to use transactional memory to protect sensitive data against memory disclosure attacks. We have implemented Mimosa on a commodity machine with Intel Core i7 Haswell CPUs. Through extensive experiments, we show that Mimosa effectively protects cryptographic keys against various attacks that attempt to read sensitive data from memory, and it only introduces a small performance overhead.

Views: 358
IEEE Symposium on Security and Privacy