Slides from the presentation "Modern Cryptography" delivered at Deovxx UK 2013. See Parleys.com for the full video https://www.parleys.com/speaker/5148920c0364bc17fc5697a5
The presentation include:
-Diffie hellman key exchange algorithm
-Primitive roots
-Discrete logarithm and discrete logarithm problem
-Attacks on diffie hellman and their possible solution
-Key distribution center
The presentation include:
-Diffie hellman key exchange algorithm
-Primitive roots
-Discrete logarithm and discrete logarithm problem
-Attacks on diffie hellman and their possible solution
-Key distribution center
In cryptography, a block cipher is a deterministic algorithm operating on ... Systems as a means to effectively improve security by combining simple operations such as .... Finally, the cipher should be easily cryptanalyzable, such that it can be ...
The Diffie-Hellman algorithm was developed by Whitfield Diffie and Martin Hellman in 1976.
This algorithm was devices not to encrypt the data but to generate same private cryptographic key at both ends so that there is no need to transfer this key from one communication end to another.
Diffie – Hellman algorithm is an algorithm that allows two parties to get the shared secret key using the communication channel, which is not protected from the interception but is protected from modification.
Introduction to homomorphic encryption, encryption which allows computations on ciphertext. An overview of key aspects and the ideas that allow these schemes to work is given, as well as examples of how to apply it.
Christoph Matthies (@chrisma0), Hubert Hesse (@hubx), Robert Lehmann (@rlehmann)
Diffie–Hellman key exchange is a method of securely exchanging cryptographic keys over a public channel and was one of the first public-key protocols as originally conceptualized by Ralph Merkle and named after Whitfield Diffie and Martin Hellman.
Cryptography is the practice and study of techniques for conveying information security.
The goal of Cryptography is to allow the intended recipients of the message to receive the message securely.
The most famous algorithm used today is RSA algorithm
We will discuss the following: RSA Key generation , RSA Encryption , RSA Decryption , A Real World Example, RSA Security.
https://www.youtube.com/watch?v=x7QWJ13dgGs&list=PLKYmvyjH53q13_6aS4VwgXU0Nb_4sjwuf&index=7
Today in modern era of internet we share some sensitive data to information transmission. but need to ensure security. So we focus on Cryptography modern technique for secure transmission of information over network.
In this whole idea of v symmetric cipher model and also cryptography and cryptanalytics, also substitution techniques and transposition techniques and steganography.
A brief presentation on Position-Based, Device-Independent and Post Quantum Cryptographies. Detailing Position-Based QC, defining Device-Independent QC and discussing Post Device-Independent.
In cryptography, a block cipher is a deterministic algorithm operating on ... Systems as a means to effectively improve security by combining simple operations such as .... Finally, the cipher should be easily cryptanalyzable, such that it can be ...
The Diffie-Hellman algorithm was developed by Whitfield Diffie and Martin Hellman in 1976.
This algorithm was devices not to encrypt the data but to generate same private cryptographic key at both ends so that there is no need to transfer this key from one communication end to another.
Diffie – Hellman algorithm is an algorithm that allows two parties to get the shared secret key using the communication channel, which is not protected from the interception but is protected from modification.
Introduction to homomorphic encryption, encryption which allows computations on ciphertext. An overview of key aspects and the ideas that allow these schemes to work is given, as well as examples of how to apply it.
Christoph Matthies (@chrisma0), Hubert Hesse (@hubx), Robert Lehmann (@rlehmann)
Diffie–Hellman key exchange is a method of securely exchanging cryptographic keys over a public channel and was one of the first public-key protocols as originally conceptualized by Ralph Merkle and named after Whitfield Diffie and Martin Hellman.
Cryptography is the practice and study of techniques for conveying information security.
The goal of Cryptography is to allow the intended recipients of the message to receive the message securely.
The most famous algorithm used today is RSA algorithm
We will discuss the following: RSA Key generation , RSA Encryption , RSA Decryption , A Real World Example, RSA Security.
https://www.youtube.com/watch?v=x7QWJ13dgGs&list=PLKYmvyjH53q13_6aS4VwgXU0Nb_4sjwuf&index=7
Today in modern era of internet we share some sensitive data to information transmission. but need to ensure security. So we focus on Cryptography modern technique for secure transmission of information over network.
In this whole idea of v symmetric cipher model and also cryptography and cryptanalytics, also substitution techniques and transposition techniques and steganography.
A brief presentation on Position-Based, Device-Independent and Post Quantum Cryptographies. Detailing Position-Based QC, defining Device-Independent QC and discussing Post Device-Independent.
CrypTool is a free software illustrating the cryptographic concepts. It is the world\'s most widespread e-learning software in the area of cryptology. A great number of analysis tools and algorithms are efficiently implemented. The graphical interface and the abundant online documentation allow the user, even a newbie, to be introduced to cryptography mysteries.
Talk given at Devoxx UK 2014
Caveat - without the video these slides can be taken out of context, see Parleys for the full video.
RSA is the oldest kid in the public-key cryptography playground, and its position of toughest and fastest is under sharp competition from ECC (Elliptic Curve Cryptography). We look at the mathematical difference between the two cryptosystems, showing why ECC is faster and “harder” than RSA, but also very energy efficient hence its unique advantage in the mobile space. We show how to use ECC in your Java and Android applications. Before finally summarising the “state of the union” for RSA and ECC in the light of the Snowden leaks, and the likely near-future for public-key cryptography.
Basic Talk. 90 minute talk to an audience of Freshmen and Sophomores of IIT Bombay on 23/02/10 as a part of Science Week. Organised by Web and Coding Club. Place: GG 101 (Elec Department)
For a college course -- CNIT 141: Cryptography for Computer Networks, at City College San Francisco
Based on "Serious Cryptography: A Practical Introduction to Modern Encryption", by Jean-Philippe Aumasson, No Starch Press (November 6, 2017), ISBN-10: 1593278268 ISBN-13: 978-1593278267
Instructor: Sam Bowne
More info: https://samsclass.info/141/141_S19.shtml
For a college course -- CNIT 141: Cryptography for Computer Networks, at City College San Francisco
Based on "Serious Cryptography: A Practical Introduction to Modern Encryption", by Jean-Philippe Aumasson, No Starch Press (November 6, 2017), ISBN-10: 1593278268 ISBN-13: 978-1593278267
Instructor: Sam Bowne
More info: https://samsclass.info/141/141_S19.shtml
Quantum cryptography by Girisha Shankar, Sr. Manager, CiscoVishnu Pendyala
Quantum computing is said to break the Internet by making the underlying encryption ineffective. This session, hosted by ICON@Cisco tells you how Quantum cryptography, which has the potential to protect the Internet, works.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
2. About This Talk
• Not a treaty in mathematical theory
• Rapid fire - please save questions until the
end
• Looking under the hood
• Look at two popular algorithms
• Hot cryptographic research
4. “Secure Hashes”
• A hash function takes an arbitrary length input and
returns a fixed sized bit string
• Cryptographic hash function obey 3 properties:
• Given a hash h it should be hard to find a message m
s.t. h = hash(m)
• Given an input m1 it should be hard to find an m2 s.t.
m1 != m2 and hash(m1) = hash(m2)
• Should be hash collision resistant
• MD5, SHA-1, SHA-3, RIPEMD-xxx
12. Background
• The only kind of encryption until 1973
• The same cryptographic key for both
encryption of plaintext and decryption of
ciphertext
• This is a “shared secret”
18. All Hail Claude Shannon
• Godfather of:
• Information Theory
• Digital Computing & Digital Circuit
Design
• Cryptographic Confusion
• Cryptographic Diffusion
• "the enemy knows the system"
19. S-Boxes
• A function which maps an m bit input to an
n bit output
• Fixed lookup table vs dynamic based on key
• Example: 6x4 S-Box:
20. AES
• Based on the Rijndael cypher
• Block size: 128 bits
• Key size:
• 128 bit - 10 rounds
• 192 bit - 12 rounds
• 256 bit - 14 rounds
• Block represented as a 4×4 column-major
order matrix of bytes called the state
22. Key Expansion
• Each round of processing uses a round key
• Round keys are derived from the primary
key
• AES uses the Rijndael Key Schedule
• Round Keys are the same size as the state
23. Key XOR
• Bit-wise XOR the round key with the state
24. Substitute
• Replace each byte in the state using an S-box
• This process is reversible but non-linear
• The S-box is a derangement
26. Mix
• Apply an invertible linear transform to each
cell (4 bytes)
• This does not change the cell size
• Together with Transpose provides
cryptographic diffusion
28. Weaknesses
• Direct Attacks
• “Biclique Cryptanalysis of the Full AES”
Cracks AES-128 with computational complexity 2126.1
• Side channel attacks
• 2005 cache-timing attack (requires root access)
• 2009 some hardware implementations found to be
susceptible to differential fault analysis allowing key
recovery with complexity 232
• 2010 access-driven cache attack, “near realtime” key
recovery (requires root access)
30. Background
• 1973 - James H. Ellis, Clifford Cocks, and
Malcolm Williamson @GCHQ
• 1974/78 - Merkle’s Puzzles
• 1976 - Whitfield Diffie and Martin Hellman
• 1977/78 - Ron Rivest, Adi Shamir and
Leonard Adleman @MIT
31. RSA
• Based on the Integer Factorisation Problem
• Believed to be in NP and co-NP
• => not NP-complete
• Is a fundamental part of HTTPS/SSL
32. Key generation
• Choose two prime number p and q
• Compute n = pq
• Compute F(n) = F(p)F(q) = (p - 1)/(q - 1)
• Chose an integer e s.t.
• 1 < e < F(n)
• gcd(e, F(n)) = 1
• Compute d = 1 / e(mod F(n))
• Public Key = (e, n)
• Private Key = (e, d)
33. Encryption
• Given a message M
• Convert M to an integer m s.t. 0 < m < 1
• If necessary use a padding scheme
• Computer the cypher text c:
c = me (mod n)
34. Decryption
• Given a cyphertext c
• Compute m = cd (mod n)
• Remove padding if present
• Convert m in to M
35. Issues
• Picking the numbers is hard
• If p or q are too small or too close to each
other it greatly decreases the security
• If p-1 or q-1 only has small prime factors n
can be factored in polynomial time
• Side-channel attacks
• Timing
• Differential fault analysis (power)
39. Practical Tips
• KISS
• Choose the appropriate algorithm for the
situation
• Cost / benefit analysis
• Key size
• Hybrid encryption systems
• Good quality RNG seeds
43. Quantum Operations
• An operation on n qubits can be
represented by an nxn matrix
• Also represented by quantum circuits
• Always Reversible...
44. Measuring
• Given |q> = -0.2|0> + 0.8|1>
• Then the result of measuring q is:
• 0 with probability 0.2
• 1 with probability 0.8
|q> = -0.1|00> + 0.4|01> + 0.4|11> + 0.1|10>
|q> = -0.2|0> + 0.8|1>
• Irreversible
45. Entanglement
• Only a quantum effect
• An entangled quantum system allows a higher
correlation of states than classically possible
• Given a qubit system in equal superposition
Measuring the first qubit allows us to determine
the state of the second without measuring
46. Grover’s Algorithm
• Lov Grover 1996
• Given some function f and an value y find x
such that f(x) = y
• O(N1/2) time complexity
• O(log N) space complexity
52. Lattice-Based Cryptography
• A lattice L in Rn is a discrete subgroup of
Rn which spans the real vector space Rn
• Each lattice has a set of bases
• A basis is a set of vectors such that any
vector is the lattice is a linear combination
of the basis vectors
• Can be viewed as a regular tiling of a space
by a primitive cell
55. Closest Vector Problem
Given a lattice L in Rn and a vector v not in
L, find the closest vector in L to v
56. NP-Hard
• Non-deterministic polynomial time hard
• For all problems in NP, any NP-hard
problem is at least as hard as the hardest
problem in NP
• SVP & CVP are thought to be NP-hard
• If we find a polynomial time algorithm for
any NP-hard problem then P = NP!
57. Other Approaches
• Multivariate Cryptography
• Secure Hash Signatures
• Lamport signatures
• Merkle scheme
• McEliece and Niedenrreiter Algorithms
based on EEC
58. Summary
• Modern cryptography really started ~1937
• Symmetric cyhpers
• Asymmetric cyphers
• Non-classical cryptography
• Post-quantum cryptography