# embeddings_queue

created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 1eec82b2-6b15-414a-a667-e5961ef2c209
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 1, "full_page_content": "2 \n \nI. INTRODUCTION \nBasic Concepts \u2013 Security Architecture, Attacks, Services, Mechanisms, Model - Cryptography \nBasics - Symmetric Ciphers \u2013 Transposition, Substitution, Rotor Machines \u2013 Block Cipher \u2013 Data \nEncryption Standard \u2013 Confidentiality using Symmetric Encryption \n \n1.1 Introduction to Cyber Security \n\u2022 \nCyber Security is a process that's designed to protect networks and devices from external \nthreats. Businesses typically employ Cyber Security professionals to protect their confidential \ninformation, maintain employee productivity, and enhance customer confidence in products \nand services. Cyber security is the protection of Internet-connected systems, including \nhardware, software, and data from cyber-attacks.  \n\u2022 \nIt is made up of two words one is cyber and other is security. \n\u2022 \nCyber is related to the technology which contains systems, network and programs or data. \n\u2022 \nWhereas security related to the protection which includes systems security, network security \nand application and information security. \n1.2 Need of Cyber Security \n\u2022 \nCyber security becomes so important in our predominant digital world \n\u2022 \nCyber-attacks can be extremely expensive for businesses to endure.  \n\u2022 \nIn addition to financial damage suffered by the business, a data breach can also inflict untold \nreputational damage.   \n\u2022 \nCyber-attacks these days are becoming progressively destructive. Cybercriminals are using \nmore sophisticated ways to initiate cyber-attacks. \n\u2022 \nRegulations such as GDPR are forcing organizations into taking better care of the personal \ndata they hold. \n1.3 Security Goals", "chunk_id": "12061ef0-8310-43e0-ab05-3b0beec78d42", "chroma:document": "more sophisticated ways to initiate cyber-attacks. \n\u2022 \nRegulations such as GDPR are forcing organizations into taking better care of the personal \ndata they hold. \n1.3 Security Goals"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: f615c3d8-80a6-42d3-89de-d8e021b93275
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 2, "full_page_content": "3 \n \n \nFig. 1 Security Goals \n1.3.1 Confidentiality \n\u2022 \nConfidentiality is about preventing the disclosure of data to unauthorized parties. \n\u2022 \n It also means trying to keep the identity of authorized parties involved in sharing and holding \ndata private and anonymous. \n\u2022 \nOften confidentiality is compromised by cracking poorly encrypted data, Man-in-the-middle \n(MITM) attacks, disclosing sensitive data \n\u2022 \nStandard measures to establish confidentiality include: \n\u2022 \nData encryption  \n\u2022 \nTwo-factor authentication \n\u2022 \nBiometric verification  \n\u2022 \nSecurity tokens  \n1.3.2 Integrity \n\u2022 Integrity refers to protecting information from being modified by unauthorized parties. \nStandard measures to guarantee integrity include:  \n- \nCryptographic checksums  \n- \nUsing file permissions  \n- \nUninterrupted power supplies  \n- \nData backups  \n1.3.3 Availability \n\u2022 \nAvailability is making sure that authorized parties are able to access the information when \nneeded.  \no Standard measures to guarantee availability include:  \nSecurity Goals\nConfidentiality\nIntegrity\nAvailability", "chunk_id": "9e040786-5635-498e-b242-3a763c1b71cf", "chroma:document": "3 \n \n \nFig. 1 Security Goals \n1.3.1 Confidentiality \n\u2022 \nConfidentiality is about preventing the disclosure of data to unauthorized parties. \n\u2022 \n It also means trying to keep the identity of authorized parties involved in sharing and holding \ndata private and anonymous. \n\u2022 \nOften confidentiality is compromised by cracking poorly encrypted data, Man-in-the-middle"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 6fb7a673-283e-402f-8d7e-e41621884752
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 2, "full_page_content": "3 \n \n \nFig. 1 Security Goals \n1.3.1 Confidentiality \n\u2022 \nConfidentiality is about preventing the disclosure of data to unauthorized parties. \n\u2022 \n It also means trying to keep the identity of authorized parties involved in sharing and holding \ndata private and anonymous. \n\u2022 \nOften confidentiality is compromised by cracking poorly encrypted data, Man-in-the-middle \n(MITM) attacks, disclosing sensitive data \n\u2022 \nStandard measures to establish confidentiality include: \n\u2022 \nData encryption  \n\u2022 \nTwo-factor authentication \n\u2022 \nBiometric verification  \n\u2022 \nSecurity tokens  \n1.3.2 Integrity \n\u2022 Integrity refers to protecting information from being modified by unauthorized parties. \nStandard measures to guarantee integrity include:  \n- \nCryptographic checksums  \n- \nUsing file permissions  \n- \nUninterrupted power supplies  \n- \nData backups  \n1.3.3 Availability \n\u2022 \nAvailability is making sure that authorized parties are able to access the information when \nneeded.  \no Standard measures to guarantee availability include:  \nSecurity Goals\nConfidentiality\nIntegrity\nAvailability", "chunk_id": "41fa289f-d238-4dcb-a15e-67a71f391371", "chroma:document": "(MITM) attacks, disclosing sensitive data \n\u2022 \nStandard measures to establish confidentiality include: \n\u2022 \nData encryption  \n\u2022 \nTwo-factor authentication \n\u2022 \nBiometric verification  \n\u2022 \nSecurity tokens  \n1.3.2 Integrity \n\u2022 Integrity refers to protecting information from being modified by unauthorized parties. \nStandard measures to guarantee integrity include:  \n-"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 8d02ce3d-2e0e-4dc1-a207-a170a847712e
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 2, "full_page_content": "3 \n \n \nFig. 1 Security Goals \n1.3.1 Confidentiality \n\u2022 \nConfidentiality is about preventing the disclosure of data to unauthorized parties. \n\u2022 \n It also means trying to keep the identity of authorized parties involved in sharing and holding \ndata private and anonymous. \n\u2022 \nOften confidentiality is compromised by cracking poorly encrypted data, Man-in-the-middle \n(MITM) attacks, disclosing sensitive data \n\u2022 \nStandard measures to establish confidentiality include: \n\u2022 \nData encryption  \n\u2022 \nTwo-factor authentication \n\u2022 \nBiometric verification  \n\u2022 \nSecurity tokens  \n1.3.2 Integrity \n\u2022 Integrity refers to protecting information from being modified by unauthorized parties. \nStandard measures to guarantee integrity include:  \n- \nCryptographic checksums  \n- \nUsing file permissions  \n- \nUninterrupted power supplies  \n- \nData backups  \n1.3.3 Availability \n\u2022 \nAvailability is making sure that authorized parties are able to access the information when \nneeded.  \no Standard measures to guarantee availability include:  \nSecurity Goals\nConfidentiality\nIntegrity\nAvailability", "chunk_id": "749372cc-a223-4969-babf-ce372163eddb", "chroma:document": "- \nCryptographic checksums  \n- \nUsing file permissions  \n- \nUninterrupted power supplies  \n- \nData backups  \n1.3.3 Availability \n\u2022 \nAvailability is making sure that authorized parties are able to access the information when \nneeded.  \no Standard measures to guarantee availability include:  \nSecurity Goals\nConfidentiality\nIntegrity\nAvailability"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: ab921ea3-b814-43fd-b39f-d33cd13bb3a7
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 3, "full_page_content": "4 \n \no Backing up data to external drives \no Implementing firewalls \no Having backup power supplies  \no Data redundancy \nTable 1: CIA Comparison \n \n1.4 History of Cyber Security \n1940s: The time before crime \n\u2022 \nFor nearly two decades after the creation of the world\u2019s first digital computer in 1943, \ncarrying out cyberattacks was tricky.  \n\u2022 \nAccess to the giant electronic machines was limited to small numbers of people and they \nweren\u2019t networked. \n\u2022 \nOnly a few people knew how to work them so the threat was almost non-existent. \n1950s: The phone phreaks \n\u2022 \nFraudulent manipulation of telephone signaling in order to make free phone calls. \n1960s: All quiet on the Western Front \n1970s: Computer security is born \n\u2022 \nCybersecurity proper began in 1972 with a research project on ARPANET (The Advanced \nResearch Projects Agency Network), a precursor to the internet. \n\u2022 \nResearcher Bob Thomas created a computer program called Creeper that could move across \nARPANET\u2019s network, leaving a breadcrumb trail wherever it went.  \n\u2022 \nIt read: \u2018I\u2019m the creeper, catch me if you can\u2019. Ray Tomlinson \u2013 the inventor of email \u2013 wrote \nthe program Reaper, which chased and deleted Creeper.", "chunk_id": "e7721bb6-ebc5-497f-bfea-f738bfc47780", "chroma:document": "4 \n \no Backing up data to external drives \no Implementing firewalls \no Having backup power supplies  \no Data redundancy \nTable 1: CIA Comparison \n \n1.4 History of Cyber Security \n1940s: The time before crime \n\u2022 \nFor nearly two decades after the creation of the world\u2019s first digital computer in 1943, \ncarrying out cyberattacks was tricky.  \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 1310790f-b1ac-4f78-b790-6205fe7cb4b2
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 3, "full_page_content": "4 \n \no Backing up data to external drives \no Implementing firewalls \no Having backup power supplies  \no Data redundancy \nTable 1: CIA Comparison \n \n1.4 History of Cyber Security \n1940s: The time before crime \n\u2022 \nFor nearly two decades after the creation of the world\u2019s first digital computer in 1943, \ncarrying out cyberattacks was tricky.  \n\u2022 \nAccess to the giant electronic machines was limited to small numbers of people and they \nweren\u2019t networked. \n\u2022 \nOnly a few people knew how to work them so the threat was almost non-existent. \n1950s: The phone phreaks \n\u2022 \nFraudulent manipulation of telephone signaling in order to make free phone calls. \n1960s: All quiet on the Western Front \n1970s: Computer security is born \n\u2022 \nCybersecurity proper began in 1972 with a research project on ARPANET (The Advanced \nResearch Projects Agency Network), a precursor to the internet. \n\u2022 \nResearcher Bob Thomas created a computer program called Creeper that could move across \nARPANET\u2019s network, leaving a breadcrumb trail wherever it went.  \n\u2022 \nIt read: \u2018I\u2019m the creeper, catch me if you can\u2019. Ray Tomlinson \u2013 the inventor of email \u2013 wrote \nthe program Reaper, which chased and deleted Creeper.", "chunk_id": "ceb5fb12-415b-4ef4-be9d-530d6290d204", "chroma:document": "\u2022 \nAccess to the giant electronic machines was limited to small numbers of people and they \nweren\u2019t networked. \n\u2022 \nOnly a few people knew how to work them so the threat was almost non-existent. \n1950s: The phone phreaks \n\u2022 \nFraudulent manipulation of telephone signaling in order to make free phone calls. \n1960s: All quiet on the Western Front \n1970s: Computer security is born \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 4733a91b-7b2d-427c-9f72-ac53c27b5af8
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 3, "full_page_content": "4 \n \no Backing up data to external drives \no Implementing firewalls \no Having backup power supplies  \no Data redundancy \nTable 1: CIA Comparison \n \n1.4 History of Cyber Security \n1940s: The time before crime \n\u2022 \nFor nearly two decades after the creation of the world\u2019s first digital computer in 1943, \ncarrying out cyberattacks was tricky.  \n\u2022 \nAccess to the giant electronic machines was limited to small numbers of people and they \nweren\u2019t networked. \n\u2022 \nOnly a few people knew how to work them so the threat was almost non-existent. \n1950s: The phone phreaks \n\u2022 \nFraudulent manipulation of telephone signaling in order to make free phone calls. \n1960s: All quiet on the Western Front \n1970s: Computer security is born \n\u2022 \nCybersecurity proper began in 1972 with a research project on ARPANET (The Advanced \nResearch Projects Agency Network), a precursor to the internet. \n\u2022 \nResearcher Bob Thomas created a computer program called Creeper that could move across \nARPANET\u2019s network, leaving a breadcrumb trail wherever it went.  \n\u2022 \nIt read: \u2018I\u2019m the creeper, catch me if you can\u2019. Ray Tomlinson \u2013 the inventor of email \u2013 wrote \nthe program Reaper, which chased and deleted Creeper.", "chunk_id": "bb6d75c8-7ec5-426d-a40f-6399f68c0248", "chroma:document": "\u2022 \nCybersecurity proper began in 1972 with a research project on ARPANET (The Advanced \nResearch Projects Agency Network), a precursor to the internet. \n\u2022 \nResearcher Bob Thomas created a computer program called Creeper that could move across \nARPANET\u2019s network, leaving a breadcrumb trail wherever it went.  \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 37a341ea-5277-443c-9529-3595fca79c5c
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 3, "full_page_content": "4 \n \no Backing up data to external drives \no Implementing firewalls \no Having backup power supplies  \no Data redundancy \nTable 1: CIA Comparison \n \n1.4 History of Cyber Security \n1940s: The time before crime \n\u2022 \nFor nearly two decades after the creation of the world\u2019s first digital computer in 1943, \ncarrying out cyberattacks was tricky.  \n\u2022 \nAccess to the giant electronic machines was limited to small numbers of people and they \nweren\u2019t networked. \n\u2022 \nOnly a few people knew how to work them so the threat was almost non-existent. \n1950s: The phone phreaks \n\u2022 \nFraudulent manipulation of telephone signaling in order to make free phone calls. \n1960s: All quiet on the Western Front \n1970s: Computer security is born \n\u2022 \nCybersecurity proper began in 1972 with a research project on ARPANET (The Advanced \nResearch Projects Agency Network), a precursor to the internet. \n\u2022 \nResearcher Bob Thomas created a computer program called Creeper that could move across \nARPANET\u2019s network, leaving a breadcrumb trail wherever it went.  \n\u2022 \nIt read: \u2018I\u2019m the creeper, catch me if you can\u2019. Ray Tomlinson \u2013 the inventor of email \u2013 wrote \nthe program Reaper, which chased and deleted Creeper.", "chunk_id": "a5ec1f85-36b9-4ce9-80af-9eac54223760", "chroma:document": "\u2022 \nIt read: \u2018I\u2019m the creeper, catch me if you can\u2019. Ray Tomlinson \u2013 the inventor of email \u2013 wrote \nthe program Reaper, which chased and deleted Creeper."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 9d4df24f-0dcf-4f30-aa16-ebb7b5ef2294
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 4, "full_page_content": "5 \n \n\u2022 \n Reaper was not only the very first example of antivirus software, but it was also the first self-\nreplicating program, making it the first-ever computer worm. \n1980s: From ARPANET to internet \n\u2022 \nThe 1980s brought an increase in high-profile attacks, including those at National CSS, \nAT&T, and Los Alamos National Laboratory \n\u2022 \nDespite this, in 1986, German hacker Marcus Hess used an internet gateway in Berkeley, CA, \nto piggyback onto the ARPANET. He hacked 400 military computers, including mainframes \nat the Pentagon, intending to sell information to the KGB. \n1987: The birth of cybersecurity \n\u2022 \n1987 was the birth year of commercial antivirus, although there are competing claims for the \ninnovator of the first antivirus product. \n\u2022 \nAndreas Luning and Kai Figge released their first antivirus product for the Atari ST \u2013 which \nalso \nsaw \nthe \nrelease \nof \nUltimate \nVirus \nKiller \n(UVK) \nThree \nCzechoslovakians \ncreated \nthe \nfirst \nversion \nof NOD antivirus \nIn the U.S., John McAfee founded McAfee (then part of Intel Security), and released \nVirusScan. \n1990s: The world goes online \n\u2022 \nThe first polymorphic viruses were created (code that mutates while keeping the \noriginal algorithm intact to avoid detection) \n\u2022 \nBritish computer magazine PC Today released an edition with a free disc that \u2018accidentally\u2019 \ncontained the DiskKiller virus, infecting tens of thousands of computers \n\u2022 \nEICAR (European Institute for Computer Antivirus Research) was established towards the \nend of the 1990s, email was proliferating and while it promised to revolutionize \ncommunication, it also opened up a new entry point for viruses. \n2000s: Threats diversify and multiply \n2010s: The next generation \n\u2022 \n2012: Saudi hacker 0XOMAR publishes the details of more than 400,000 credit cards online \n\u2022 \n2013: Former CIA employee for the US Government Edward Snowden copied and leaked \nclassified information from the National Security Agency (NSA)", "chunk_id": "e055c649-e1fe-4502-b329-a42f930aba00", "chroma:document": "5 \n \n\u2022 \n Reaper was not only the very first example of antivirus software, but it was also the first self-\nreplicating program, making it the first-ever computer worm. \n1980s: From ARPANET to internet \n\u2022 \nThe 1980s brought an increase in high-profile attacks, including those at National CSS, \nAT&T, and Los Alamos National Laboratory \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: fb8bbc32-12e5-4982-96ae-520334303fbc
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 4, "full_page_content": "5 \n \n\u2022 \n Reaper was not only the very first example of antivirus software, but it was also the first self-\nreplicating program, making it the first-ever computer worm. \n1980s: From ARPANET to internet \n\u2022 \nThe 1980s brought an increase in high-profile attacks, including those at National CSS, \nAT&T, and Los Alamos National Laboratory \n\u2022 \nDespite this, in 1986, German hacker Marcus Hess used an internet gateway in Berkeley, CA, \nto piggyback onto the ARPANET. He hacked 400 military computers, including mainframes \nat the Pentagon, intending to sell information to the KGB. \n1987: The birth of cybersecurity \n\u2022 \n1987 was the birth year of commercial antivirus, although there are competing claims for the \ninnovator of the first antivirus product. \n\u2022 \nAndreas Luning and Kai Figge released their first antivirus product for the Atari ST \u2013 which \nalso \nsaw \nthe \nrelease \nof \nUltimate \nVirus \nKiller \n(UVK) \nThree \nCzechoslovakians \ncreated \nthe \nfirst \nversion \nof NOD antivirus \nIn the U.S., John McAfee founded McAfee (then part of Intel Security), and released \nVirusScan. \n1990s: The world goes online \n\u2022 \nThe first polymorphic viruses were created (code that mutates while keeping the \noriginal algorithm intact to avoid detection) \n\u2022 \nBritish computer magazine PC Today released an edition with a free disc that \u2018accidentally\u2019 \ncontained the DiskKiller virus, infecting tens of thousands of computers \n\u2022 \nEICAR (European Institute for Computer Antivirus Research) was established towards the \nend of the 1990s, email was proliferating and while it promised to revolutionize \ncommunication, it also opened up a new entry point for viruses. \n2000s: Threats diversify and multiply \n2010s: The next generation \n\u2022 \n2012: Saudi hacker 0XOMAR publishes the details of more than 400,000 credit cards online \n\u2022 \n2013: Former CIA employee for the US Government Edward Snowden copied and leaked \nclassified information from the National Security Agency (NSA)", "chunk_id": "958a2364-1998-48db-9ba9-589771809a98", "chroma:document": "\u2022 \nDespite this, in 1986, German hacker Marcus Hess used an internet gateway in Berkeley, CA, \nto piggyback onto the ARPANET. He hacked 400 military computers, including mainframes \nat the Pentagon, intending to sell information to the KGB. \n1987: The birth of cybersecurity \n\u2022 \n1987 was the birth year of commercial antivirus, although there are competing claims for the"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 7cdb587e-1346-499d-b5e3-469bda453be0
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 4, "full_page_content": "5 \n \n\u2022 \n Reaper was not only the very first example of antivirus software, but it was also the first self-\nreplicating program, making it the first-ever computer worm. \n1980s: From ARPANET to internet \n\u2022 \nThe 1980s brought an increase in high-profile attacks, including those at National CSS, \nAT&T, and Los Alamos National Laboratory \n\u2022 \nDespite this, in 1986, German hacker Marcus Hess used an internet gateway in Berkeley, CA, \nto piggyback onto the ARPANET. He hacked 400 military computers, including mainframes \nat the Pentagon, intending to sell information to the KGB. \n1987: The birth of cybersecurity \n\u2022 \n1987 was the birth year of commercial antivirus, although there are competing claims for the \ninnovator of the first antivirus product. \n\u2022 \nAndreas Luning and Kai Figge released their first antivirus product for the Atari ST \u2013 which \nalso \nsaw \nthe \nrelease \nof \nUltimate \nVirus \nKiller \n(UVK) \nThree \nCzechoslovakians \ncreated \nthe \nfirst \nversion \nof NOD antivirus \nIn the U.S., John McAfee founded McAfee (then part of Intel Security), and released \nVirusScan. \n1990s: The world goes online \n\u2022 \nThe first polymorphic viruses were created (code that mutates while keeping the \noriginal algorithm intact to avoid detection) \n\u2022 \nBritish computer magazine PC Today released an edition with a free disc that \u2018accidentally\u2019 \ncontained the DiskKiller virus, infecting tens of thousands of computers \n\u2022 \nEICAR (European Institute for Computer Antivirus Research) was established towards the \nend of the 1990s, email was proliferating and while it promised to revolutionize \ncommunication, it also opened up a new entry point for viruses. \n2000s: Threats diversify and multiply \n2010s: The next generation \n\u2022 \n2012: Saudi hacker 0XOMAR publishes the details of more than 400,000 credit cards online \n\u2022 \n2013: Former CIA employee for the US Government Edward Snowden copied and leaked \nclassified information from the National Security Agency (NSA)", "chunk_id": "528a7c9d-fc20-461f-b4c1-a72596978036", "chroma:document": "innovator of the first antivirus product. \n\u2022 \nAndreas Luning and Kai Figge released their first antivirus product for the Atari ST \u2013 which \nalso \nsaw \nthe \nrelease \nof \nUltimate \nVirus \nKiller \n(UVK) \nThree \nCzechoslovakians \ncreated \nthe \nfirst \nversion \nof NOD antivirus \nIn the U.S., John McAfee founded McAfee (then part of Intel Security), and released \nVirusScan."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 5c6d2e48-195f-44cb-bb09-f8fb89eae67e
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 4, "full_page_content": "5 \n \n\u2022 \n Reaper was not only the very first example of antivirus software, but it was also the first self-\nreplicating program, making it the first-ever computer worm. \n1980s: From ARPANET to internet \n\u2022 \nThe 1980s brought an increase in high-profile attacks, including those at National CSS, \nAT&T, and Los Alamos National Laboratory \n\u2022 \nDespite this, in 1986, German hacker Marcus Hess used an internet gateway in Berkeley, CA, \nto piggyback onto the ARPANET. He hacked 400 military computers, including mainframes \nat the Pentagon, intending to sell information to the KGB. \n1987: The birth of cybersecurity \n\u2022 \n1987 was the birth year of commercial antivirus, although there are competing claims for the \ninnovator of the first antivirus product. \n\u2022 \nAndreas Luning and Kai Figge released their first antivirus product for the Atari ST \u2013 which \nalso \nsaw \nthe \nrelease \nof \nUltimate \nVirus \nKiller \n(UVK) \nThree \nCzechoslovakians \ncreated \nthe \nfirst \nversion \nof NOD antivirus \nIn the U.S., John McAfee founded McAfee (then part of Intel Security), and released \nVirusScan. \n1990s: The world goes online \n\u2022 \nThe first polymorphic viruses were created (code that mutates while keeping the \noriginal algorithm intact to avoid detection) \n\u2022 \nBritish computer magazine PC Today released an edition with a free disc that \u2018accidentally\u2019 \ncontained the DiskKiller virus, infecting tens of thousands of computers \n\u2022 \nEICAR (European Institute for Computer Antivirus Research) was established towards the \nend of the 1990s, email was proliferating and while it promised to revolutionize \ncommunication, it also opened up a new entry point for viruses. \n2000s: Threats diversify and multiply \n2010s: The next generation \n\u2022 \n2012: Saudi hacker 0XOMAR publishes the details of more than 400,000 credit cards online \n\u2022 \n2013: Former CIA employee for the US Government Edward Snowden copied and leaked \nclassified information from the National Security Agency (NSA)", "chunk_id": "cfc43646-33e8-4e72-b9c4-7ceadb79dc26", "chroma:document": "VirusScan. \n1990s: The world goes online \n\u2022 \nThe first polymorphic viruses were created (code that mutates while keeping the \noriginal algorithm intact to avoid detection) \n\u2022 \nBritish computer magazine PC Today released an edition with a free disc that \u2018accidentally\u2019 \ncontained the DiskKiller virus, infecting tens of thousands of computers \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: d1645aac-1c0d-42f9-b368-0e3b14c19475
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 4, "full_page_content": "5 \n \n\u2022 \n Reaper was not only the very first example of antivirus software, but it was also the first self-\nreplicating program, making it the first-ever computer worm. \n1980s: From ARPANET to internet \n\u2022 \nThe 1980s brought an increase in high-profile attacks, including those at National CSS, \nAT&T, and Los Alamos National Laboratory \n\u2022 \nDespite this, in 1986, German hacker Marcus Hess used an internet gateway in Berkeley, CA, \nto piggyback onto the ARPANET. He hacked 400 military computers, including mainframes \nat the Pentagon, intending to sell information to the KGB. \n1987: The birth of cybersecurity \n\u2022 \n1987 was the birth year of commercial antivirus, although there are competing claims for the \ninnovator of the first antivirus product. \n\u2022 \nAndreas Luning and Kai Figge released their first antivirus product for the Atari ST \u2013 which \nalso \nsaw \nthe \nrelease \nof \nUltimate \nVirus \nKiller \n(UVK) \nThree \nCzechoslovakians \ncreated \nthe \nfirst \nversion \nof NOD antivirus \nIn the U.S., John McAfee founded McAfee (then part of Intel Security), and released \nVirusScan. \n1990s: The world goes online \n\u2022 \nThe first polymorphic viruses were created (code that mutates while keeping the \noriginal algorithm intact to avoid detection) \n\u2022 \nBritish computer magazine PC Today released an edition with a free disc that \u2018accidentally\u2019 \ncontained the DiskKiller virus, infecting tens of thousands of computers \n\u2022 \nEICAR (European Institute for Computer Antivirus Research) was established towards the \nend of the 1990s, email was proliferating and while it promised to revolutionize \ncommunication, it also opened up a new entry point for viruses. \n2000s: Threats diversify and multiply \n2010s: The next generation \n\u2022 \n2012: Saudi hacker 0XOMAR publishes the details of more than 400,000 credit cards online \n\u2022 \n2013: Former CIA employee for the US Government Edward Snowden copied and leaked \nclassified information from the National Security Agency (NSA)", "chunk_id": "f0ffc580-7aba-4ece-b8ef-d79b8a3580c3", "chroma:document": "\u2022 \nEICAR (European Institute for Computer Antivirus Research) was established towards the \nend of the 1990s, email was proliferating and while it promised to revolutionize \ncommunication, it also opened up a new entry point for viruses. \n2000s: Threats diversify and multiply \n2010s: The next generation \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 291fbbeb-fab0-4e6a-a7e6-7ed60176cc1f
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 4, "full_page_content": "5 \n \n\u2022 \n Reaper was not only the very first example of antivirus software, but it was also the first self-\nreplicating program, making it the first-ever computer worm. \n1980s: From ARPANET to internet \n\u2022 \nThe 1980s brought an increase in high-profile attacks, including those at National CSS, \nAT&T, and Los Alamos National Laboratory \n\u2022 \nDespite this, in 1986, German hacker Marcus Hess used an internet gateway in Berkeley, CA, \nto piggyback onto the ARPANET. He hacked 400 military computers, including mainframes \nat the Pentagon, intending to sell information to the KGB. \n1987: The birth of cybersecurity \n\u2022 \n1987 was the birth year of commercial antivirus, although there are competing claims for the \ninnovator of the first antivirus product. \n\u2022 \nAndreas Luning and Kai Figge released their first antivirus product for the Atari ST \u2013 which \nalso \nsaw \nthe \nrelease \nof \nUltimate \nVirus \nKiller \n(UVK) \nThree \nCzechoslovakians \ncreated \nthe \nfirst \nversion \nof NOD antivirus \nIn the U.S., John McAfee founded McAfee (then part of Intel Security), and released \nVirusScan. \n1990s: The world goes online \n\u2022 \nThe first polymorphic viruses were created (code that mutates while keeping the \noriginal algorithm intact to avoid detection) \n\u2022 \nBritish computer magazine PC Today released an edition with a free disc that \u2018accidentally\u2019 \ncontained the DiskKiller virus, infecting tens of thousands of computers \n\u2022 \nEICAR (European Institute for Computer Antivirus Research) was established towards the \nend of the 1990s, email was proliferating and while it promised to revolutionize \ncommunication, it also opened up a new entry point for viruses. \n2000s: Threats diversify and multiply \n2010s: The next generation \n\u2022 \n2012: Saudi hacker 0XOMAR publishes the details of more than 400,000 credit cards online \n\u2022 \n2013: Former CIA employee for the US Government Edward Snowden copied and leaked \nclassified information from the National Security Agency (NSA)", "chunk_id": "5076d1a4-6372-4648-b0c7-9122b0910053", "chroma:document": "\u2022 \n2012: Saudi hacker 0XOMAR publishes the details of more than 400,000 credit cards online \n\u2022 \n2013: Former CIA employee for the US Government Edward Snowden copied and leaked \nclassified information from the National Security Agency (NSA)"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 25b77008-7954-428d-804c-902ee57b5a75
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 5, "full_page_content": "6 \n \n\u2022 \n2013-2014: Malicious hackers broke into Yahoo, compromising the accounts and personal \ninformation of its 3 billion users. Yahoo was subsequently fined $35 million for failing to \ndisclose the news \n\u2022 \n2017: WannaCry ransomware infects 230,000 computers in one day \n\u2022 \n2019: Multiple DDoS attacks forced New Zealand's stock market to temporarily shut down \n\u2022 \nAccording to a security research firm, 81 global firms from 81 countries reported data \nbreaches in the first half of 2020 alone.  \n\u2022 \n80% of firms have seen an increase in cyber-attacks this year. Coronavirus is alone blamed \nfor a 238% rise in cyber-attacks on banks. Phishing attacks have seen a dramatic increase of \n600% since the end of February.  \n\u2022 \nDue to pandemic, ransomware attacks rose 148% in March and the average ransomware \npayment rose by 33% to $111,605 as compared to Q4 2019. \n1.5 Layers of Cyber Security \n \nFig. 2 Layers of Cyber Security \n1: Mission Critical Assets \u2013 This is the data you need to protect  \n2: Data Security \u2013 Data security controls protect the storage and transfer of data. \n3: Application Security \u2013 Applications security controls protect access to an application, an \napplication\u2019s access to your mission critical assets, and the internal security of the application.  \n4: Endpoint Security \u2013 Endpoint security controls protect the connection between devices and the \nnetwork.  \n5: Network Security \u2013 Network security controls protect an organization\u2019s network and prevent \nunauthorized access of the network.", "chunk_id": "47af229c-76e8-4380-a4ca-d226caf7869e", "chroma:document": "6 \n \n\u2022 \n2013-2014: Malicious hackers broke into Yahoo, compromising the accounts and personal \ninformation of its 3 billion users. Yahoo was subsequently fined $35 million for failing to \ndisclose the news \n\u2022 \n2017: WannaCry ransomware infects 230,000 computers in one day \n\u2022 \n2019: Multiple DDoS attacks forced New Zealand's stock market to temporarily shut down \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 122f53cc-0cbc-4763-920c-40cd9fccfb4a
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 5, "full_page_content": "6 \n \n\u2022 \n2013-2014: Malicious hackers broke into Yahoo, compromising the accounts and personal \ninformation of its 3 billion users. Yahoo was subsequently fined $35 million for failing to \ndisclose the news \n\u2022 \n2017: WannaCry ransomware infects 230,000 computers in one day \n\u2022 \n2019: Multiple DDoS attacks forced New Zealand's stock market to temporarily shut down \n\u2022 \nAccording to a security research firm, 81 global firms from 81 countries reported data \nbreaches in the first half of 2020 alone.  \n\u2022 \n80% of firms have seen an increase in cyber-attacks this year. Coronavirus is alone blamed \nfor a 238% rise in cyber-attacks on banks. Phishing attacks have seen a dramatic increase of \n600% since the end of February.  \n\u2022 \nDue to pandemic, ransomware attacks rose 148% in March and the average ransomware \npayment rose by 33% to $111,605 as compared to Q4 2019. \n1.5 Layers of Cyber Security \n \nFig. 2 Layers of Cyber Security \n1: Mission Critical Assets \u2013 This is the data you need to protect  \n2: Data Security \u2013 Data security controls protect the storage and transfer of data. \n3: Application Security \u2013 Applications security controls protect access to an application, an \napplication\u2019s access to your mission critical assets, and the internal security of the application.  \n4: Endpoint Security \u2013 Endpoint security controls protect the connection between devices and the \nnetwork.  \n5: Network Security \u2013 Network security controls protect an organization\u2019s network and prevent \nunauthorized access of the network.", "chunk_id": "981afec7-9a1e-41d9-89fe-ded4bfe329b8", "chroma:document": "\u2022 \nAccording to a security research firm, 81 global firms from 81 countries reported data \nbreaches in the first half of 2020 alone.  \n\u2022 \n80% of firms have seen an increase in cyber-attacks this year. Coronavirus is alone blamed \nfor a 238% rise in cyber-attacks on banks. Phishing attacks have seen a dramatic increase of \n600% since the end of February.  \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: c58a2053-50eb-40c2-b11d-612cdd41ae65
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 5, "full_page_content": "6 \n \n\u2022 \n2013-2014: Malicious hackers broke into Yahoo, compromising the accounts and personal \ninformation of its 3 billion users. Yahoo was subsequently fined $35 million for failing to \ndisclose the news \n\u2022 \n2017: WannaCry ransomware infects 230,000 computers in one day \n\u2022 \n2019: Multiple DDoS attacks forced New Zealand's stock market to temporarily shut down \n\u2022 \nAccording to a security research firm, 81 global firms from 81 countries reported data \nbreaches in the first half of 2020 alone.  \n\u2022 \n80% of firms have seen an increase in cyber-attacks this year. Coronavirus is alone blamed \nfor a 238% rise in cyber-attacks on banks. Phishing attacks have seen a dramatic increase of \n600% since the end of February.  \n\u2022 \nDue to pandemic, ransomware attacks rose 148% in March and the average ransomware \npayment rose by 33% to $111,605 as compared to Q4 2019. \n1.5 Layers of Cyber Security \n \nFig. 2 Layers of Cyber Security \n1: Mission Critical Assets \u2013 This is the data you need to protect  \n2: Data Security \u2013 Data security controls protect the storage and transfer of data. \n3: Application Security \u2013 Applications security controls protect access to an application, an \napplication\u2019s access to your mission critical assets, and the internal security of the application.  \n4: Endpoint Security \u2013 Endpoint security controls protect the connection between devices and the \nnetwork.  \n5: Network Security \u2013 Network security controls protect an organization\u2019s network and prevent \nunauthorized access of the network.", "chunk_id": "ef5d375a-d40e-4840-8ecc-08ca37823283", "chroma:document": "\u2022 \nDue to pandemic, ransomware attacks rose 148% in March and the average ransomware \npayment rose by 33% to $111,605 as compared to Q4 2019. \n1.5 Layers of Cyber Security \n \nFig. 2 Layers of Cyber Security \n1: Mission Critical Assets \u2013 This is the data you need to protect  \n2: Data Security \u2013 Data security controls protect the storage and transfer of data."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 6ce39942-5045-49a4-b563-de73eaa647c6
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 5, "full_page_content": "6 \n \n\u2022 \n2013-2014: Malicious hackers broke into Yahoo, compromising the accounts and personal \ninformation of its 3 billion users. Yahoo was subsequently fined $35 million for failing to \ndisclose the news \n\u2022 \n2017: WannaCry ransomware infects 230,000 computers in one day \n\u2022 \n2019: Multiple DDoS attacks forced New Zealand's stock market to temporarily shut down \n\u2022 \nAccording to a security research firm, 81 global firms from 81 countries reported data \nbreaches in the first half of 2020 alone.  \n\u2022 \n80% of firms have seen an increase in cyber-attacks this year. Coronavirus is alone blamed \nfor a 238% rise in cyber-attacks on banks. Phishing attacks have seen a dramatic increase of \n600% since the end of February.  \n\u2022 \nDue to pandemic, ransomware attacks rose 148% in March and the average ransomware \npayment rose by 33% to $111,605 as compared to Q4 2019. \n1.5 Layers of Cyber Security \n \nFig. 2 Layers of Cyber Security \n1: Mission Critical Assets \u2013 This is the data you need to protect  \n2: Data Security \u2013 Data security controls protect the storage and transfer of data. \n3: Application Security \u2013 Applications security controls protect access to an application, an \napplication\u2019s access to your mission critical assets, and the internal security of the application.  \n4: Endpoint Security \u2013 Endpoint security controls protect the connection between devices and the \nnetwork.  \n5: Network Security \u2013 Network security controls protect an organization\u2019s network and prevent \nunauthorized access of the network.", "chunk_id": "cde1fdbe-5ad4-42ea-a5e1-4b0a3b44457a", "chroma:document": "3: Application Security \u2013 Applications security controls protect access to an application, an \napplication\u2019s access to your mission critical assets, and the internal security of the application.  \n4: Endpoint Security \u2013 Endpoint security controls protect the connection between devices and the \nnetwork."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: ff9d2541-3c3a-4eab-93e9-ba90b4f45a4b
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 5, "full_page_content": "6 \n \n\u2022 \n2013-2014: Malicious hackers broke into Yahoo, compromising the accounts and personal \ninformation of its 3 billion users. Yahoo was subsequently fined $35 million for failing to \ndisclose the news \n\u2022 \n2017: WannaCry ransomware infects 230,000 computers in one day \n\u2022 \n2019: Multiple DDoS attacks forced New Zealand's stock market to temporarily shut down \n\u2022 \nAccording to a security research firm, 81 global firms from 81 countries reported data \nbreaches in the first half of 2020 alone.  \n\u2022 \n80% of firms have seen an increase in cyber-attacks this year. Coronavirus is alone blamed \nfor a 238% rise in cyber-attacks on banks. Phishing attacks have seen a dramatic increase of \n600% since the end of February.  \n\u2022 \nDue to pandemic, ransomware attacks rose 148% in March and the average ransomware \npayment rose by 33% to $111,605 as compared to Q4 2019. \n1.5 Layers of Cyber Security \n \nFig. 2 Layers of Cyber Security \n1: Mission Critical Assets \u2013 This is the data you need to protect  \n2: Data Security \u2013 Data security controls protect the storage and transfer of data. \n3: Application Security \u2013 Applications security controls protect access to an application, an \napplication\u2019s access to your mission critical assets, and the internal security of the application.  \n4: Endpoint Security \u2013 Endpoint security controls protect the connection between devices and the \nnetwork.  \n5: Network Security \u2013 Network security controls protect an organization\u2019s network and prevent \nunauthorized access of the network.", "chunk_id": "d9e7525d-9319-4150-9736-02953568dff8", "chroma:document": "network.  \n5: Network Security \u2013 Network security controls protect an organization\u2019s network and prevent \nunauthorized access of the network."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 94e78173-bb88-4530-86ed-c55f70ed6c05
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 6, "full_page_content": "7 \n \n6: Perimeter Security \u2013 Perimeter security controls include both the physical and digital security \nmethodologies that protect the business overall. \n 7: The Human Layer \u2013 Humans are the weakest link in any cyber security posture. Human security \ncontrols include phishing simulations and access management controls that protect mission critical \nassets from a wide variety of human threats, including cyber criminals, malicious insiders, and \nnegligent users \n \n1.6 Taxonomy of Attacks with respect to Security Goals \n \n \nFig.3 Taxonomy of Attacks \n1.6.1 Attacks Threatening Confidentiality \n(a) Snooping \n - It refers to unauthorized access to or interception of data. \n - The file transferred through the internet may contain confidential information. \n - Unauthorized entity may intercept the transmission.  \n - To prevent this, the data can be made unintelligible using encipherment techniques", "chunk_id": "3ea47625-6301-4ef2-81a7-5f2f60565b3c", "chroma:document": "7 \n \n6: Perimeter Security \u2013 Perimeter security controls include both the physical and digital security \nmethodologies that protect the business overall. \n 7: The Human Layer \u2013 Humans are the weakest link in any cyber security posture. Human security \ncontrols include phishing simulations and access management controls that protect mission critical"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 2f9df59a-fd04-49c8-8fad-9c3597bf32de
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 6, "full_page_content": "7 \n \n6: Perimeter Security \u2013 Perimeter security controls include both the physical and digital security \nmethodologies that protect the business overall. \n 7: The Human Layer \u2013 Humans are the weakest link in any cyber security posture. Human security \ncontrols include phishing simulations and access management controls that protect mission critical \nassets from a wide variety of human threats, including cyber criminals, malicious insiders, and \nnegligent users \n \n1.6 Taxonomy of Attacks with respect to Security Goals \n \n \nFig.3 Taxonomy of Attacks \n1.6.1 Attacks Threatening Confidentiality \n(a) Snooping \n - It refers to unauthorized access to or interception of data. \n - The file transferred through the internet may contain confidential information. \n - Unauthorized entity may intercept the transmission.  \n - To prevent this, the data can be made unintelligible using encipherment techniques", "chunk_id": "28a05325-f2d3-43fa-af19-11468e0c9e1b", "chroma:document": "assets from a wide variety of human threats, including cyber criminals, malicious insiders, and \nnegligent users \n \n1.6 Taxonomy of Attacks with respect to Security Goals \n \n \nFig.3 Taxonomy of Attacks \n1.6.1 Attacks Threatening Confidentiality \n(a) Snooping \n - It refers to unauthorized access to or interception of data."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: f0c6e744-9f47-483f-be65-6d4f7d7f331f
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 6, "full_page_content": "7 \n \n6: Perimeter Security \u2013 Perimeter security controls include both the physical and digital security \nmethodologies that protect the business overall. \n 7: The Human Layer \u2013 Humans are the weakest link in any cyber security posture. Human security \ncontrols include phishing simulations and access management controls that protect mission critical \nassets from a wide variety of human threats, including cyber criminals, malicious insiders, and \nnegligent users \n \n1.6 Taxonomy of Attacks with respect to Security Goals \n \n \nFig.3 Taxonomy of Attacks \n1.6.1 Attacks Threatening Confidentiality \n(a) Snooping \n - It refers to unauthorized access to or interception of data. \n - The file transferred through the internet may contain confidential information. \n - Unauthorized entity may intercept the transmission.  \n - To prevent this, the data can be made unintelligible using encipherment techniques", "chunk_id": "af5fb255-a975-4aef-b157-1ad13ace6a28", "chroma:document": "- The file transferred through the internet may contain confidential information. \n - Unauthorized entity may intercept the transmission.  \n - To prevent this, the data can be made unintelligible using encipherment techniques"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 5422a40e-f7a3-4582-9572-485389d904d5
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 7, "full_page_content": "8 \n \n \nFig.4 Snooping \n(b) Traffic Analysis \n\u2022 Although encipherment of data may make it non-intelligible for the interceptor, she can obtain \nsome other type information by monitoring online traffic.  \n\u2022 For example, she can find the electronic address (such as the e-mail address) of the sender or the \nreceiver. She can collect pairs of requests and responses to help her guess the nature of transaction. \n \nFig.5 Traffic Analysis \n1.6.2 Attacks Threatening Integrity \n\u2022 \nThe integrity of data can be threatened by several kinds of attacks: modification, \nmasquerading, replaying, and repudiation. \n(a) Modification", "chunk_id": "b2142055-8f73-45d2-b5ae-a1e30b8cff40", "chroma:document": "8 \n \n \nFig.4 Snooping \n(b) Traffic Analysis \n\u2022 Although encipherment of data may make it non-intelligible for the interceptor, she can obtain \nsome other type information by monitoring online traffic.  \n\u2022 For example, she can find the electronic address (such as the e-mail address) of the sender or the"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: b18524a2-4087-4037-b833-e7bc963357b8
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 7, "full_page_content": "8 \n \n \nFig.4 Snooping \n(b) Traffic Analysis \n\u2022 Although encipherment of data may make it non-intelligible for the interceptor, she can obtain \nsome other type information by monitoring online traffic.  \n\u2022 For example, she can find the electronic address (such as the e-mail address) of the sender or the \nreceiver. She can collect pairs of requests and responses to help her guess the nature of transaction. \n \nFig.5 Traffic Analysis \n1.6.2 Attacks Threatening Integrity \n\u2022 \nThe integrity of data can be threatened by several kinds of attacks: modification, \nmasquerading, replaying, and repudiation. \n(a) Modification", "chunk_id": "de2d5b22-377a-4eb7-9598-10fa0d9f0d8d", "chroma:document": "receiver. She can collect pairs of requests and responses to help her guess the nature of transaction. \n \nFig.5 Traffic Analysis \n1.6.2 Attacks Threatening Integrity \n\u2022 \nThe integrity of data can be threatened by several kinds of attacks: modification, \nmasquerading, replaying, and repudiation. \n(a) Modification"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 88e58f96-6f9a-4409-8b3e-7fe0e1fbd080
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 8, "full_page_content": "9 \n \n\u2751  After intercepting or accessing information, the attacker modifies the information to make \nit beneficial to herself.  \n\u2751  For example, a customer sends a message to a bank to do some transaction.  \n\u2751  The attacker intercepts the message and changes the type of transaction to benefit herself. \n \nFig. 6 Modification \n(b) Masquerading  \n\u27a2  Masquerading, or spoofing, happens when the attacker impersonates somebody else.  \n\u27a2  For example, an attacker might steal the bank card and PIN of a bank customer and pretend \nthat she is that customer.  \n\u27a2  Sometimes the attacker pretends instead to be the receiver entity.  \n\u27a2  For example, a user tries to contact a bank, but another site pretends that it is the bank and \nobtains some information from the user.  \n \nFig.7 Masquerading", "chunk_id": "1945a3b6-489f-49d2-a8e4-afdc0a9adb5e", "chroma:document": "9 \n \n\u2751  After intercepting or accessing information, the attacker modifies the information to make \nit beneficial to herself.  \n\u2751  For example, a customer sends a message to a bank to do some transaction.  \n\u2751  The attacker intercepts the message and changes the type of transaction to benefit herself. \n \nFig. 6 Modification \n(b) Masquerading"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: f7342f3a-ca2a-41d8-bef4-1699c4492c62
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 8, "full_page_content": "9 \n \n\u2751  After intercepting or accessing information, the attacker modifies the information to make \nit beneficial to herself.  \n\u2751  For example, a customer sends a message to a bank to do some transaction.  \n\u2751  The attacker intercepts the message and changes the type of transaction to benefit herself. \n \nFig. 6 Modification \n(b) Masquerading  \n\u27a2  Masquerading, or spoofing, happens when the attacker impersonates somebody else.  \n\u27a2  For example, an attacker might steal the bank card and PIN of a bank customer and pretend \nthat she is that customer.  \n\u27a2  Sometimes the attacker pretends instead to be the receiver entity.  \n\u27a2  For example, a user tries to contact a bank, but another site pretends that it is the bank and \nobtains some information from the user.  \n \nFig.7 Masquerading", "chunk_id": "af1c3abe-4814-4c05-a5ed-6c133848eb95", "chroma:document": "(b) Masquerading  \n\u27a2  Masquerading, or spoofing, happens when the attacker impersonates somebody else.  \n\u27a2  For example, an attacker might steal the bank card and PIN of a bank customer and pretend \nthat she is that customer.  \n\u27a2  Sometimes the attacker pretends instead to be the receiver entity."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: da847ce5-65c8-4d3e-8f09-21db1c5a7dd4
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 8, "full_page_content": "9 \n \n\u2751  After intercepting or accessing information, the attacker modifies the information to make \nit beneficial to herself.  \n\u2751  For example, a customer sends a message to a bank to do some transaction.  \n\u2751  The attacker intercepts the message and changes the type of transaction to benefit herself. \n \nFig. 6 Modification \n(b) Masquerading  \n\u27a2  Masquerading, or spoofing, happens when the attacker impersonates somebody else.  \n\u27a2  For example, an attacker might steal the bank card and PIN of a bank customer and pretend \nthat she is that customer.  \n\u27a2  Sometimes the attacker pretends instead to be the receiver entity.  \n\u27a2  For example, a user tries to contact a bank, but another site pretends that it is the bank and \nobtains some information from the user.  \n \nFig.7 Masquerading", "chunk_id": "f07dc99e-1997-4ebe-ac39-1dc4586f3455", "chroma:document": "\u27a2  For example, a user tries to contact a bank, but another site pretends that it is the bank and \nobtains some information from the user.  \n \nFig.7 Masquerading"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 0deb12f0-1c4a-408c-9a1c-c120c8ff235f
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 9, "full_page_content": "10 \n \n(c) Replaying  \n\u27a2  Replaying is another attack.  \n\u27a2  The attacker obtains a copy of a message sent by a user and later tries to replay it.  \n\u27a2  For example, a person sends a request to her bank to ask for payment to the attacker, who \nhas done a job for her.  \n\u27a2  The attacker intercepts the message and sends it again to receive another payment from the \nbank.  \n \nFig.8 Replay \n(d) Repudiation  \n\u27a2  This type of attack is different from others because it is performed by one of the two parties \nin the communication: the sender or the receiver.  \n\u27a2  The sender of the message might later deny that she has sent the message; the receiver of the \nmessage might later deny that he has received the message.  \n\u27a2  An example of denial by the sender would be a bank customer asking her bank to send some \nmoney to a third party but later denying that she has made such a request.  \n\u27a2  An example of denial by the receiver could occur when a person buys a product from a \nmanufacturer and pays for it electronically, but the manufacturer later denies having received \nthe payment and asks to be paid \n1.6.3 Attacks Threatening Availability \n \n(a) Denial of Service", "chunk_id": "1924d99a-03ac-447c-bf0b-3362959b42b8", "chroma:document": "10 \n \n(c) Replaying  \n\u27a2  Replaying is another attack.  \n\u27a2  The attacker obtains a copy of a message sent by a user and later tries to replay it.  \n\u27a2  For example, a person sends a request to her bank to ask for payment to the attacker, who \nhas done a job for her.  \n\u27a2  The attacker intercepts the message and sends it again to receive another payment from the \nbank."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 04d7efcc-91ee-4af3-bc0e-31f48dc64a96
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 9, "full_page_content": "10 \n \n(c) Replaying  \n\u27a2  Replaying is another attack.  \n\u27a2  The attacker obtains a copy of a message sent by a user and later tries to replay it.  \n\u27a2  For example, a person sends a request to her bank to ask for payment to the attacker, who \nhas done a job for her.  \n\u27a2  The attacker intercepts the message and sends it again to receive another payment from the \nbank.  \n \nFig.8 Replay \n(d) Repudiation  \n\u27a2  This type of attack is different from others because it is performed by one of the two parties \nin the communication: the sender or the receiver.  \n\u27a2  The sender of the message might later deny that she has sent the message; the receiver of the \nmessage might later deny that he has received the message.  \n\u27a2  An example of denial by the sender would be a bank customer asking her bank to send some \nmoney to a third party but later denying that she has made such a request.  \n\u27a2  An example of denial by the receiver could occur when a person buys a product from a \nmanufacturer and pays for it electronically, but the manufacturer later denies having received \nthe payment and asks to be paid \n1.6.3 Attacks Threatening Availability \n \n(a) Denial of Service", "chunk_id": "4af5f120-1e2f-4bc1-b11f-6c0be7fcb0cd", "chroma:document": "bank.  \n \nFig.8 Replay \n(d) Repudiation  \n\u27a2  This type of attack is different from others because it is performed by one of the two parties \nin the communication: the sender or the receiver.  \n\u27a2  The sender of the message might later deny that she has sent the message; the receiver of the \nmessage might later deny that he has received the message."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 0b56a0ab-b66f-4293-9f33-a45c98620429
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 9, "full_page_content": "10 \n \n(c) Replaying  \n\u27a2  Replaying is another attack.  \n\u27a2  The attacker obtains a copy of a message sent by a user and later tries to replay it.  \n\u27a2  For example, a person sends a request to her bank to ask for payment to the attacker, who \nhas done a job for her.  \n\u27a2  The attacker intercepts the message and sends it again to receive another payment from the \nbank.  \n \nFig.8 Replay \n(d) Repudiation  \n\u27a2  This type of attack is different from others because it is performed by one of the two parties \nin the communication: the sender or the receiver.  \n\u27a2  The sender of the message might later deny that she has sent the message; the receiver of the \nmessage might later deny that he has received the message.  \n\u27a2  An example of denial by the sender would be a bank customer asking her bank to send some \nmoney to a third party but later denying that she has made such a request.  \n\u27a2  An example of denial by the receiver could occur when a person buys a product from a \nmanufacturer and pays for it electronically, but the manufacturer later denies having received \nthe payment and asks to be paid \n1.6.3 Attacks Threatening Availability \n \n(a) Denial of Service", "chunk_id": "8d3f15de-0c1a-4f5e-a873-4e4b1a79730a", "chroma:document": "\u27a2  An example of denial by the sender would be a bank customer asking her bank to send some \nmoney to a third party but later denying that she has made such a request.  \n\u27a2  An example of denial by the receiver could occur when a person buys a product from a \nmanufacturer and pays for it electronically, but the manufacturer later denies having received"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 353691dd-ba57-42ad-a5eb-94ae73964b4d
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 9, "full_page_content": "10 \n \n(c) Replaying  \n\u27a2  Replaying is another attack.  \n\u27a2  The attacker obtains a copy of a message sent by a user and later tries to replay it.  \n\u27a2  For example, a person sends a request to her bank to ask for payment to the attacker, who \nhas done a job for her.  \n\u27a2  The attacker intercepts the message and sends it again to receive another payment from the \nbank.  \n \nFig.8 Replay \n(d) Repudiation  \n\u27a2  This type of attack is different from others because it is performed by one of the two parties \nin the communication: the sender or the receiver.  \n\u27a2  The sender of the message might later deny that she has sent the message; the receiver of the \nmessage might later deny that he has received the message.  \n\u27a2  An example of denial by the sender would be a bank customer asking her bank to send some \nmoney to a third party but later denying that she has made such a request.  \n\u27a2  An example of denial by the receiver could occur when a person buys a product from a \nmanufacturer and pays for it electronically, but the manufacturer later denies having received \nthe payment and asks to be paid \n1.6.3 Attacks Threatening Availability \n \n(a) Denial of Service", "chunk_id": "156a9838-d743-4526-b2f3-89dfe29c05ab", "chroma:document": "the payment and asks to be paid \n1.6.3 Attacks Threatening Availability \n \n(a) Denial of Service"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 7510e193-2f92-46c1-996b-43f0c7f1435e
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 10, "full_page_content": "11 \n \n\u2713  Denial of service (DoS) is a very common attack. It may slow down or totally interrupt the \nservice of a system.  \n\u2713  The attacker can use several strategies to achieve this. She might send so many bogus \nrequests to a server that the server crashes because of the heavy load.  \n\u2713  The attacker might intercept and delete a server\u2019s response to a client, making the client to \nbelieve that the server is not responding.  \n\u2713  The attacker may also intercept requests from the clients, causing the clients to send requests \nmany times and overload the system. \n \nFig. 9 Denial of Service \n1.7 Passive Vs Active Attacks \n(a) Passive Attacks \n\u25aa In a passive attack, the attacker\u2019s goal is just to obtain information. This means that the \nattack does not modify data or harm the system.  \n\u25aa  The system continues with its normal operation.  \n\u25aa  However, the attack may harm the sender or the receiver of the message.  \n\u25aa  Attacks that threaten confidentiality, snooping and traffic analysis are passive attacks.  \n\u25aa  The revealing of the information may harm the sender or receiver of the message, but the \nsystem is not affected.  \n\u25aa  For this reason, it is difficult to detect this type of attack until the sender or receiver finds \nout about the leaking of confidential information.", "chunk_id": "7e40bda3-9eb8-463e-97ce-e5f0b77cbf40", "chroma:document": "11 \n \n\u2713  Denial of service (DoS) is a very common attack. It may slow down or totally interrupt the \nservice of a system.  \n\u2713  The attacker can use several strategies to achieve this. She might send so many bogus \nrequests to a server that the server crashes because of the heavy load."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: ea70a3b6-5856-423a-a9e3-a8e4d4341d44
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 10, "full_page_content": "11 \n \n\u2713  Denial of service (DoS) is a very common attack. It may slow down or totally interrupt the \nservice of a system.  \n\u2713  The attacker can use several strategies to achieve this. She might send so many bogus \nrequests to a server that the server crashes because of the heavy load.  \n\u2713  The attacker might intercept and delete a server\u2019s response to a client, making the client to \nbelieve that the server is not responding.  \n\u2713  The attacker may also intercept requests from the clients, causing the clients to send requests \nmany times and overload the system. \n \nFig. 9 Denial of Service \n1.7 Passive Vs Active Attacks \n(a) Passive Attacks \n\u25aa In a passive attack, the attacker\u2019s goal is just to obtain information. This means that the \nattack does not modify data or harm the system.  \n\u25aa  The system continues with its normal operation.  \n\u25aa  However, the attack may harm the sender or the receiver of the message.  \n\u25aa  Attacks that threaten confidentiality, snooping and traffic analysis are passive attacks.  \n\u25aa  The revealing of the information may harm the sender or receiver of the message, but the \nsystem is not affected.  \n\u25aa  For this reason, it is difficult to detect this type of attack until the sender or receiver finds \nout about the leaking of confidential information.", "chunk_id": "c2518a76-af30-41cf-bb2c-d402a5f78784", "chroma:document": "\u2713  The attacker might intercept and delete a server\u2019s response to a client, making the client to \nbelieve that the server is not responding.  \n\u2713  The attacker may also intercept requests from the clients, causing the clients to send requests \nmany times and overload the system. \n \nFig. 9 Denial of Service \n1.7 Passive Vs Active Attacks \n(a) Passive Attacks"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: e25989af-a151-419b-b9d2-ebc9fd426474
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 10, "full_page_content": "11 \n \n\u2713  Denial of service (DoS) is a very common attack. It may slow down or totally interrupt the \nservice of a system.  \n\u2713  The attacker can use several strategies to achieve this. She might send so many bogus \nrequests to a server that the server crashes because of the heavy load.  \n\u2713  The attacker might intercept and delete a server\u2019s response to a client, making the client to \nbelieve that the server is not responding.  \n\u2713  The attacker may also intercept requests from the clients, causing the clients to send requests \nmany times and overload the system. \n \nFig. 9 Denial of Service \n1.7 Passive Vs Active Attacks \n(a) Passive Attacks \n\u25aa In a passive attack, the attacker\u2019s goal is just to obtain information. This means that the \nattack does not modify data or harm the system.  \n\u25aa  The system continues with its normal operation.  \n\u25aa  However, the attack may harm the sender or the receiver of the message.  \n\u25aa  Attacks that threaten confidentiality, snooping and traffic analysis are passive attacks.  \n\u25aa  The revealing of the information may harm the sender or receiver of the message, but the \nsystem is not affected.  \n\u25aa  For this reason, it is difficult to detect this type of attack until the sender or receiver finds \nout about the leaking of confidential information.", "chunk_id": "7f35c212-5f88-40ab-a28c-7deda616c129", "chroma:document": "\u25aa In a passive attack, the attacker\u2019s goal is just to obtain information. This means that the \nattack does not modify data or harm the system.  \n\u25aa  The system continues with its normal operation.  \n\u25aa  However, the attack may harm the sender or the receiver of the message.  \n\u25aa  Attacks that threaten confidentiality, snooping and traffic analysis are passive attacks."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 9db53cb5-09f4-491a-8ef4-d287f2056266
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 10, "full_page_content": "11 \n \n\u2713  Denial of service (DoS) is a very common attack. It may slow down or totally interrupt the \nservice of a system.  \n\u2713  The attacker can use several strategies to achieve this. She might send so many bogus \nrequests to a server that the server crashes because of the heavy load.  \n\u2713  The attacker might intercept and delete a server\u2019s response to a client, making the client to \nbelieve that the server is not responding.  \n\u2713  The attacker may also intercept requests from the clients, causing the clients to send requests \nmany times and overload the system. \n \nFig. 9 Denial of Service \n1.7 Passive Vs Active Attacks \n(a) Passive Attacks \n\u25aa In a passive attack, the attacker\u2019s goal is just to obtain information. This means that the \nattack does not modify data or harm the system.  \n\u25aa  The system continues with its normal operation.  \n\u25aa  However, the attack may harm the sender or the receiver of the message.  \n\u25aa  Attacks that threaten confidentiality, snooping and traffic analysis are passive attacks.  \n\u25aa  The revealing of the information may harm the sender or receiver of the message, but the \nsystem is not affected.  \n\u25aa  For this reason, it is difficult to detect this type of attack until the sender or receiver finds \nout about the leaking of confidential information.", "chunk_id": "1f8a5a0d-9f05-4740-9a9b-f30fc6fc1592", "chroma:document": "\u25aa  The revealing of the information may harm the sender or receiver of the message, but the \nsystem is not affected.  \n\u25aa  For this reason, it is difficult to detect this type of attack until the sender or receiver finds \nout about the leaking of confidential information."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 4bcb35a4-158a-41c0-bc4a-ff268dcd04a2
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 11, "full_page_content": "12 \n \n\u25aa  Passive attacks, however, can be prevented by encipherment of the data. \n(b) Active Attacks \n\u25aa An active attack may change the data or harm the system.  \n\u25aa  Attacks that threaten the integrity and availability are active attacks.  \n\u25aa  Active attacks are normally easier to detect than to prevent, because an attacker can launch \nthem in a variety of ways. \nTable 2. Passive Vs Active Attacks \n \n1.8 Security Services \n\u2756 Authentication \n\u2756  Access Control \n\u2756  Data Confidentiality \n\u2756  Data Integrity \n\u2756  Non-repudiation \n \nFig.10 Security Services \n(a) Authentication \n\u2022 \nAuthentication is the process of verifying whether someone (or something) is, in fact, who \n(or what) it is declared to be.", "chunk_id": "c11dffe4-c789-484f-b138-49e8bdaab4ac", "chroma:document": "12 \n \n\u25aa  Passive attacks, however, can be prevented by encipherment of the data. \n(b) Active Attacks \n\u25aa An active attack may change the data or harm the system.  \n\u25aa  Attacks that threaten the integrity and availability are active attacks.  \n\u25aa  Active attacks are normally easier to detect than to prevent, because an attacker can launch \nthem in a variety of ways."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 93dfe6d9-f43e-47e1-a5cf-acc6639c987d
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 11, "full_page_content": "12 \n \n\u25aa  Passive attacks, however, can be prevented by encipherment of the data. \n(b) Active Attacks \n\u25aa An active attack may change the data or harm the system.  \n\u25aa  Attacks that threaten the integrity and availability are active attacks.  \n\u25aa  Active attacks are normally easier to detect than to prevent, because an attacker can launch \nthem in a variety of ways. \nTable 2. Passive Vs Active Attacks \n \n1.8 Security Services \n\u2756 Authentication \n\u2756  Access Control \n\u2756  Data Confidentiality \n\u2756  Data Integrity \n\u2756  Non-repudiation \n \nFig.10 Security Services \n(a) Authentication \n\u2022 \nAuthentication is the process of verifying whether someone (or something) is, in fact, who \n(or what) it is declared to be.", "chunk_id": "fb4633b4-c795-4bb4-9281-d39bb3d8796d", "chroma:document": "Table 2. Passive Vs Active Attacks \n \n1.8 Security Services \n\u2756 Authentication \n\u2756  Access Control \n\u2756  Data Confidentiality \n\u2756  Data Integrity \n\u2756  Non-repudiation \n \nFig.10 Security Services \n(a) Authentication \n\u2022 \nAuthentication is the process of verifying whether someone (or something) is, in fact, who \n(or what) it is declared to be."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: df6aca61-e34f-4699-9349-a96bd1208cef
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 12, "full_page_content": "13 \n \n\u2022 \nAuthentication: Verifying the identity of a user, process, or device, often as a prerequisite to \nallowing access to resources in an information system. \n\u2022 \nThis process for establishing your identity to gain access to a system is typically two-steps: \nyou must first identify yourself (i.e. user ID, account number or email address), and then you \nhave to prove that you are who you say you are (authenticate yourself). \n(b) Access Control \n\u2022 The prevention of unauthorized use of a resource (i.e., this service controls who can have \naccess to a resource, under what conditions access can occur, and what those accessing the \nresource are allowed to do). \n(c) Confidentiality \no The protection of data from unauthorized disclosure. \no The other aspect of confidentiality is the protection of traffic flow from analysis. This \nrequires that an attacker not be able to observe the source and destination, frequency, length, \nor other characteristics of the traffic on a communications facility. \n(d) Integrity \n\u2022 \nAn integrity service deals with a stream of messages and assures that messages are received \nas sent with no duplication, insertion, modification, reordering, or replays. \n(e) Nonrepudiation \n\u2022 \nNonrepudiation prevents either sender or receiver from denying a transmitted message.  \n\u2022 \nThus, when a message is sent, the receiver can prove that the alleged sender in fact sent the \nmessage.  \n\u2022 \nSimilarly, when a message is received, the sender can prove that the alleged receiver in fact \nreceived the message. \n1.9 Security Mechanisms \n\u2022 Encipherment, hiding or covering data, can provide confidentiality. It can also be used to \ncomplement other mechanisms to provide other services. Today two techniques \ncryptography and steganography are used for enciphering. \n\u2022 Data integrity mechanism appends to the data a short check value that has been created by a \nspecific process from the data itself. The receiver receives the data and the check value. He \ncreates a new check value from the received data and compares the newly created check \nvalue with the one received. If the two check values are the same, the integrity of data has \nbeen preserved.", "chunk_id": "a228d05c-a2fd-40d8-960a-16f1cc5b6924", "chroma:document": "13 \n \n\u2022 \nAuthentication: Verifying the identity of a user, process, or device, often as a prerequisite to \nallowing access to resources in an information system. \n\u2022 \nThis process for establishing your identity to gain access to a system is typically two-steps: \nyou must first identify yourself (i.e. user ID, account number or email address), and then you"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 162f1f5f-24f5-4c7d-a54e-d8c8c911c04e
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 12, "full_page_content": "13 \n \n\u2022 \nAuthentication: Verifying the identity of a user, process, or device, often as a prerequisite to \nallowing access to resources in an information system. \n\u2022 \nThis process for establishing your identity to gain access to a system is typically two-steps: \nyou must first identify yourself (i.e. user ID, account number or email address), and then you \nhave to prove that you are who you say you are (authenticate yourself). \n(b) Access Control \n\u2022 The prevention of unauthorized use of a resource (i.e., this service controls who can have \naccess to a resource, under what conditions access can occur, and what those accessing the \nresource are allowed to do). \n(c) Confidentiality \no The protection of data from unauthorized disclosure. \no The other aspect of confidentiality is the protection of traffic flow from analysis. This \nrequires that an attacker not be able to observe the source and destination, frequency, length, \nor other characteristics of the traffic on a communications facility. \n(d) Integrity \n\u2022 \nAn integrity service deals with a stream of messages and assures that messages are received \nas sent with no duplication, insertion, modification, reordering, or replays. \n(e) Nonrepudiation \n\u2022 \nNonrepudiation prevents either sender or receiver from denying a transmitted message.  \n\u2022 \nThus, when a message is sent, the receiver can prove that the alleged sender in fact sent the \nmessage.  \n\u2022 \nSimilarly, when a message is received, the sender can prove that the alleged receiver in fact \nreceived the message. \n1.9 Security Mechanisms \n\u2022 Encipherment, hiding or covering data, can provide confidentiality. It can also be used to \ncomplement other mechanisms to provide other services. Today two techniques \ncryptography and steganography are used for enciphering. \n\u2022 Data integrity mechanism appends to the data a short check value that has been created by a \nspecific process from the data itself. The receiver receives the data and the check value. He \ncreates a new check value from the received data and compares the newly created check \nvalue with the one received. If the two check values are the same, the integrity of data has \nbeen preserved.", "chunk_id": "4e99d378-dfb4-4b8b-b633-97a5e0a84ddd", "chroma:document": "have to prove that you are who you say you are (authenticate yourself). \n(b) Access Control \n\u2022 The prevention of unauthorized use of a resource (i.e., this service controls who can have \naccess to a resource, under what conditions access can occur, and what those accessing the \nresource are allowed to do). \n(c) Confidentiality"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: e02039cb-89b8-4607-b514-90851d913cf9
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 12, "full_page_content": "13 \n \n\u2022 \nAuthentication: Verifying the identity of a user, process, or device, often as a prerequisite to \nallowing access to resources in an information system. \n\u2022 \nThis process for establishing your identity to gain access to a system is typically two-steps: \nyou must first identify yourself (i.e. user ID, account number or email address), and then you \nhave to prove that you are who you say you are (authenticate yourself). \n(b) Access Control \n\u2022 The prevention of unauthorized use of a resource (i.e., this service controls who can have \naccess to a resource, under what conditions access can occur, and what those accessing the \nresource are allowed to do). \n(c) Confidentiality \no The protection of data from unauthorized disclosure. \no The other aspect of confidentiality is the protection of traffic flow from analysis. This \nrequires that an attacker not be able to observe the source and destination, frequency, length, \nor other characteristics of the traffic on a communications facility. \n(d) Integrity \n\u2022 \nAn integrity service deals with a stream of messages and assures that messages are received \nas sent with no duplication, insertion, modification, reordering, or replays. \n(e) Nonrepudiation \n\u2022 \nNonrepudiation prevents either sender or receiver from denying a transmitted message.  \n\u2022 \nThus, when a message is sent, the receiver can prove that the alleged sender in fact sent the \nmessage.  \n\u2022 \nSimilarly, when a message is received, the sender can prove that the alleged receiver in fact \nreceived the message. \n1.9 Security Mechanisms \n\u2022 Encipherment, hiding or covering data, can provide confidentiality. It can also be used to \ncomplement other mechanisms to provide other services. Today two techniques \ncryptography and steganography are used for enciphering. \n\u2022 Data integrity mechanism appends to the data a short check value that has been created by a \nspecific process from the data itself. The receiver receives the data and the check value. He \ncreates a new check value from the received data and compares the newly created check \nvalue with the one received. If the two check values are the same, the integrity of data has \nbeen preserved.", "chunk_id": "0293d367-d7e4-4565-ae26-4311f60fc16e", "chroma:document": "o The protection of data from unauthorized disclosure. \no The other aspect of confidentiality is the protection of traffic flow from analysis. This \nrequires that an attacker not be able to observe the source and destination, frequency, length, \nor other characteristics of the traffic on a communications facility. \n(d) Integrity \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 134089bf-9b59-4476-913b-471c5e57bc00
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 12, "full_page_content": "13 \n \n\u2022 \nAuthentication: Verifying the identity of a user, process, or device, often as a prerequisite to \nallowing access to resources in an information system. \n\u2022 \nThis process for establishing your identity to gain access to a system is typically two-steps: \nyou must first identify yourself (i.e. user ID, account number or email address), and then you \nhave to prove that you are who you say you are (authenticate yourself). \n(b) Access Control \n\u2022 The prevention of unauthorized use of a resource (i.e., this service controls who can have \naccess to a resource, under what conditions access can occur, and what those accessing the \nresource are allowed to do). \n(c) Confidentiality \no The protection of data from unauthorized disclosure. \no The other aspect of confidentiality is the protection of traffic flow from analysis. This \nrequires that an attacker not be able to observe the source and destination, frequency, length, \nor other characteristics of the traffic on a communications facility. \n(d) Integrity \n\u2022 \nAn integrity service deals with a stream of messages and assures that messages are received \nas sent with no duplication, insertion, modification, reordering, or replays. \n(e) Nonrepudiation \n\u2022 \nNonrepudiation prevents either sender or receiver from denying a transmitted message.  \n\u2022 \nThus, when a message is sent, the receiver can prove that the alleged sender in fact sent the \nmessage.  \n\u2022 \nSimilarly, when a message is received, the sender can prove that the alleged receiver in fact \nreceived the message. \n1.9 Security Mechanisms \n\u2022 Encipherment, hiding or covering data, can provide confidentiality. It can also be used to \ncomplement other mechanisms to provide other services. Today two techniques \ncryptography and steganography are used for enciphering. \n\u2022 Data integrity mechanism appends to the data a short check value that has been created by a \nspecific process from the data itself. The receiver receives the data and the check value. He \ncreates a new check value from the received data and compares the newly created check \nvalue with the one received. If the two check values are the same, the integrity of data has \nbeen preserved.", "chunk_id": "384cbd2b-ee7f-499c-ae91-31a84f770f82", "chroma:document": "(d) Integrity \n\u2022 \nAn integrity service deals with a stream of messages and assures that messages are received \nas sent with no duplication, insertion, modification, reordering, or replays. \n(e) Nonrepudiation \n\u2022 \nNonrepudiation prevents either sender or receiver from denying a transmitted message.  \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: c22eae60-29ec-4493-9abe-5ee63485b6d5
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 12, "full_page_content": "13 \n \n\u2022 \nAuthentication: Verifying the identity of a user, process, or device, often as a prerequisite to \nallowing access to resources in an information system. \n\u2022 \nThis process for establishing your identity to gain access to a system is typically two-steps: \nyou must first identify yourself (i.e. user ID, account number or email address), and then you \nhave to prove that you are who you say you are (authenticate yourself). \n(b) Access Control \n\u2022 The prevention of unauthorized use of a resource (i.e., this service controls who can have \naccess to a resource, under what conditions access can occur, and what those accessing the \nresource are allowed to do). \n(c) Confidentiality \no The protection of data from unauthorized disclosure. \no The other aspect of confidentiality is the protection of traffic flow from analysis. This \nrequires that an attacker not be able to observe the source and destination, frequency, length, \nor other characteristics of the traffic on a communications facility. \n(d) Integrity \n\u2022 \nAn integrity service deals with a stream of messages and assures that messages are received \nas sent with no duplication, insertion, modification, reordering, or replays. \n(e) Nonrepudiation \n\u2022 \nNonrepudiation prevents either sender or receiver from denying a transmitted message.  \n\u2022 \nThus, when a message is sent, the receiver can prove that the alleged sender in fact sent the \nmessage.  \n\u2022 \nSimilarly, when a message is received, the sender can prove that the alleged receiver in fact \nreceived the message. \n1.9 Security Mechanisms \n\u2022 Encipherment, hiding or covering data, can provide confidentiality. It can also be used to \ncomplement other mechanisms to provide other services. Today two techniques \ncryptography and steganography are used for enciphering. \n\u2022 Data integrity mechanism appends to the data a short check value that has been created by a \nspecific process from the data itself. The receiver receives the data and the check value. He \ncreates a new check value from the received data and compares the newly created check \nvalue with the one received. If the two check values are the same, the integrity of data has \nbeen preserved.", "chunk_id": "7a096bbc-d188-4355-bf3e-ae8af21be395", "chroma:document": "\u2022 \nThus, when a message is sent, the receiver can prove that the alleged sender in fact sent the \nmessage.  \n\u2022 \nSimilarly, when a message is received, the sender can prove that the alleged receiver in fact \nreceived the message. \n1.9 Security Mechanisms \n\u2022 Encipherment, hiding or covering data, can provide confidentiality. It can also be used to"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 2cf5a363-0e7c-4628-b94c-13cbb53fe1c9
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 12, "full_page_content": "13 \n \n\u2022 \nAuthentication: Verifying the identity of a user, process, or device, often as a prerequisite to \nallowing access to resources in an information system. \n\u2022 \nThis process for establishing your identity to gain access to a system is typically two-steps: \nyou must first identify yourself (i.e. user ID, account number or email address), and then you \nhave to prove that you are who you say you are (authenticate yourself). \n(b) Access Control \n\u2022 The prevention of unauthorized use of a resource (i.e., this service controls who can have \naccess to a resource, under what conditions access can occur, and what those accessing the \nresource are allowed to do). \n(c) Confidentiality \no The protection of data from unauthorized disclosure. \no The other aspect of confidentiality is the protection of traffic flow from analysis. This \nrequires that an attacker not be able to observe the source and destination, frequency, length, \nor other characteristics of the traffic on a communications facility. \n(d) Integrity \n\u2022 \nAn integrity service deals with a stream of messages and assures that messages are received \nas sent with no duplication, insertion, modification, reordering, or replays. \n(e) Nonrepudiation \n\u2022 \nNonrepudiation prevents either sender or receiver from denying a transmitted message.  \n\u2022 \nThus, when a message is sent, the receiver can prove that the alleged sender in fact sent the \nmessage.  \n\u2022 \nSimilarly, when a message is received, the sender can prove that the alleged receiver in fact \nreceived the message. \n1.9 Security Mechanisms \n\u2022 Encipherment, hiding or covering data, can provide confidentiality. It can also be used to \ncomplement other mechanisms to provide other services. Today two techniques \ncryptography and steganography are used for enciphering. \n\u2022 Data integrity mechanism appends to the data a short check value that has been created by a \nspecific process from the data itself. The receiver receives the data and the check value. He \ncreates a new check value from the received data and compares the newly created check \nvalue with the one received. If the two check values are the same, the integrity of data has \nbeen preserved.", "chunk_id": "ffd4ca4d-f7a7-4869-a15d-de07f9859b5e", "chroma:document": "complement other mechanisms to provide other services. Today two techniques \ncryptography and steganography are used for enciphering. \n\u2022 Data integrity mechanism appends to the data a short check value that has been created by a \nspecific process from the data itself. The receiver receives the data and the check value. He"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 6c2145b9-ab06-4719-81de-d0b7831241cb
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 12, "full_page_content": "13 \n \n\u2022 \nAuthentication: Verifying the identity of a user, process, or device, often as a prerequisite to \nallowing access to resources in an information system. \n\u2022 \nThis process for establishing your identity to gain access to a system is typically two-steps: \nyou must first identify yourself (i.e. user ID, account number or email address), and then you \nhave to prove that you are who you say you are (authenticate yourself). \n(b) Access Control \n\u2022 The prevention of unauthorized use of a resource (i.e., this service controls who can have \naccess to a resource, under what conditions access can occur, and what those accessing the \nresource are allowed to do). \n(c) Confidentiality \no The protection of data from unauthorized disclosure. \no The other aspect of confidentiality is the protection of traffic flow from analysis. This \nrequires that an attacker not be able to observe the source and destination, frequency, length, \nor other characteristics of the traffic on a communications facility. \n(d) Integrity \n\u2022 \nAn integrity service deals with a stream of messages and assures that messages are received \nas sent with no duplication, insertion, modification, reordering, or replays. \n(e) Nonrepudiation \n\u2022 \nNonrepudiation prevents either sender or receiver from denying a transmitted message.  \n\u2022 \nThus, when a message is sent, the receiver can prove that the alleged sender in fact sent the \nmessage.  \n\u2022 \nSimilarly, when a message is received, the sender can prove that the alleged receiver in fact \nreceived the message. \n1.9 Security Mechanisms \n\u2022 Encipherment, hiding or covering data, can provide confidentiality. It can also be used to \ncomplement other mechanisms to provide other services. Today two techniques \ncryptography and steganography are used for enciphering. \n\u2022 Data integrity mechanism appends to the data a short check value that has been created by a \nspecific process from the data itself. The receiver receives the data and the check value. He \ncreates a new check value from the received data and compares the newly created check \nvalue with the one received. If the two check values are the same, the integrity of data has \nbeen preserved.", "chunk_id": "00f1fded-8a42-424e-8a4f-793946d270ad", "chroma:document": "creates a new check value from the received data and compares the newly created check \nvalue with the one received. If the two check values are the same, the integrity of data has \nbeen preserved."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: caf80aac-5d5d-4bf5-9055-66969aaf080a
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 13, "full_page_content": "14 \n \n\u2022 A digital signature is a means by which the sender can electronically sign the data and the \nreceiver can electronically verify the signature. The sender uses a process that involves \nshowing that she owns a private key related to the public key that she has announced publicly. \nThe receiver uses the sender\u2019s public key to prove that the message is indeed signed by the \nsender who claims to have sent the message. \n\u2022 Authentication Exchange In authentication exchange, two entities exchange some messages \nto prove their identity to each other. For example, one entity can prove that she knows a secret \nthat only she is supposed to know. \n\u2022 Traffic padding means inserting some bogus data into the data traffic to thwart the adversary\u2019s \nattempt to use the traffic analysis. \n\u2022 Routing control means selecting and continuously changing different available routes \nbetween the sender and the receiver to prevent the opponent from eavesdropping on a \nparticular route. \n\u2022 Notarization means selecting a third trusted party to control the communication between two \nentities. This can be done, for example, to prevent repudiation. The receiver can involve a \ntrusted party to store the sender request in order to prevent the sender from later denying that \nshe has made such a request. \n\u2022 Access control uses methods to prove that a user has access right to the data or resources \nowned by a system. Examples of proofs are passwords and PINs.  \n \nFig. 11 Security Mechanisms \n1.10 Model of Network Security", "chunk_id": "0ea794d0-d618-4e1f-a529-727b546da187", "chroma:document": "14 \n \n\u2022 A digital signature is a means by which the sender can electronically sign the data and the \nreceiver can electronically verify the signature. The sender uses a process that involves \nshowing that she owns a private key related to the public key that she has announced publicly. \nThe receiver uses the sender\u2019s public key to prove that the message is indeed signed by the"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: cd0650b5-6b42-4d8b-baec-872f16efef42
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 13, "full_page_content": "14 \n \n\u2022 A digital signature is a means by which the sender can electronically sign the data and the \nreceiver can electronically verify the signature. The sender uses a process that involves \nshowing that she owns a private key related to the public key that she has announced publicly. \nThe receiver uses the sender\u2019s public key to prove that the message is indeed signed by the \nsender who claims to have sent the message. \n\u2022 Authentication Exchange In authentication exchange, two entities exchange some messages \nto prove their identity to each other. For example, one entity can prove that she knows a secret \nthat only she is supposed to know. \n\u2022 Traffic padding means inserting some bogus data into the data traffic to thwart the adversary\u2019s \nattempt to use the traffic analysis. \n\u2022 Routing control means selecting and continuously changing different available routes \nbetween the sender and the receiver to prevent the opponent from eavesdropping on a \nparticular route. \n\u2022 Notarization means selecting a third trusted party to control the communication between two \nentities. This can be done, for example, to prevent repudiation. The receiver can involve a \ntrusted party to store the sender request in order to prevent the sender from later denying that \nshe has made such a request. \n\u2022 Access control uses methods to prove that a user has access right to the data or resources \nowned by a system. Examples of proofs are passwords and PINs.  \n \nFig. 11 Security Mechanisms \n1.10 Model of Network Security", "chunk_id": "77039953-3b84-4a53-bc8d-dac89dda8090", "chroma:document": "sender who claims to have sent the message. \n\u2022 Authentication Exchange In authentication exchange, two entities exchange some messages \nto prove their identity to each other. For example, one entity can prove that she knows a secret \nthat only she is supposed to know. \n\u2022 Traffic padding means inserting some bogus data into the data traffic to thwart the adversary\u2019s"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 432294e2-3393-47fe-9a9e-b77bb14bb632
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 13, "full_page_content": "14 \n \n\u2022 A digital signature is a means by which the sender can electronically sign the data and the \nreceiver can electronically verify the signature. The sender uses a process that involves \nshowing that she owns a private key related to the public key that she has announced publicly. \nThe receiver uses the sender\u2019s public key to prove that the message is indeed signed by the \nsender who claims to have sent the message. \n\u2022 Authentication Exchange In authentication exchange, two entities exchange some messages \nto prove their identity to each other. For example, one entity can prove that she knows a secret \nthat only she is supposed to know. \n\u2022 Traffic padding means inserting some bogus data into the data traffic to thwart the adversary\u2019s \nattempt to use the traffic analysis. \n\u2022 Routing control means selecting and continuously changing different available routes \nbetween the sender and the receiver to prevent the opponent from eavesdropping on a \nparticular route. \n\u2022 Notarization means selecting a third trusted party to control the communication between two \nentities. This can be done, for example, to prevent repudiation. The receiver can involve a \ntrusted party to store the sender request in order to prevent the sender from later denying that \nshe has made such a request. \n\u2022 Access control uses methods to prove that a user has access right to the data or resources \nowned by a system. Examples of proofs are passwords and PINs.  \n \nFig. 11 Security Mechanisms \n1.10 Model of Network Security", "chunk_id": "7bde5702-9a27-4493-82fd-23164d116cd1", "chroma:document": "attempt to use the traffic analysis. \n\u2022 Routing control means selecting and continuously changing different available routes \nbetween the sender and the receiver to prevent the opponent from eavesdropping on a \nparticular route. \n\u2022 Notarization means selecting a third trusted party to control the communication between two"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 63ab4134-c5cb-4230-b21c-f9e4d0d52141
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 13, "full_page_content": "14 \n \n\u2022 A digital signature is a means by which the sender can electronically sign the data and the \nreceiver can electronically verify the signature. The sender uses a process that involves \nshowing that she owns a private key related to the public key that she has announced publicly. \nThe receiver uses the sender\u2019s public key to prove that the message is indeed signed by the \nsender who claims to have sent the message. \n\u2022 Authentication Exchange In authentication exchange, two entities exchange some messages \nto prove their identity to each other. For example, one entity can prove that she knows a secret \nthat only she is supposed to know. \n\u2022 Traffic padding means inserting some bogus data into the data traffic to thwart the adversary\u2019s \nattempt to use the traffic analysis. \n\u2022 Routing control means selecting and continuously changing different available routes \nbetween the sender and the receiver to prevent the opponent from eavesdropping on a \nparticular route. \n\u2022 Notarization means selecting a third trusted party to control the communication between two \nentities. This can be done, for example, to prevent repudiation. The receiver can involve a \ntrusted party to store the sender request in order to prevent the sender from later denying that \nshe has made such a request. \n\u2022 Access control uses methods to prove that a user has access right to the data or resources \nowned by a system. Examples of proofs are passwords and PINs.  \n \nFig. 11 Security Mechanisms \n1.10 Model of Network Security", "chunk_id": "6a6dbc1f-d886-4dc2-8027-db7595304a49", "chroma:document": "entities. This can be done, for example, to prevent repudiation. The receiver can involve a \ntrusted party to store the sender request in order to prevent the sender from later denying that \nshe has made such a request. \n\u2022 Access control uses methods to prove that a user has access right to the data or resources \nowned by a system. Examples of proofs are passwords and PINs."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 769bde3e-0efc-41f5-a506-89b6309c2ded
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 13, "full_page_content": "14 \n \n\u2022 A digital signature is a means by which the sender can electronically sign the data and the \nreceiver can electronically verify the signature. The sender uses a process that involves \nshowing that she owns a private key related to the public key that she has announced publicly. \nThe receiver uses the sender\u2019s public key to prove that the message is indeed signed by the \nsender who claims to have sent the message. \n\u2022 Authentication Exchange In authentication exchange, two entities exchange some messages \nto prove their identity to each other. For example, one entity can prove that she knows a secret \nthat only she is supposed to know. \n\u2022 Traffic padding means inserting some bogus data into the data traffic to thwart the adversary\u2019s \nattempt to use the traffic analysis. \n\u2022 Routing control means selecting and continuously changing different available routes \nbetween the sender and the receiver to prevent the opponent from eavesdropping on a \nparticular route. \n\u2022 Notarization means selecting a third trusted party to control the communication between two \nentities. This can be done, for example, to prevent repudiation. The receiver can involve a \ntrusted party to store the sender request in order to prevent the sender from later denying that \nshe has made such a request. \n\u2022 Access control uses methods to prove that a user has access right to the data or resources \nowned by a system. Examples of proofs are passwords and PINs.  \n \nFig. 11 Security Mechanisms \n1.10 Model of Network Security", "chunk_id": "773ca2dd-be71-448c-b2ab-6d7d4174eaed", "chroma:document": "Fig. 11 Security Mechanisms \n1.10 Model of Network Security"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 570147d6-7252-4b08-ae3b-fb9d8f761f30
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 14, "full_page_content": "15 \n \n \nFig.12 Model of Network Security \nBasic Tasks \nThis general model shows that there are four basic tasks in designing a particular security service: \n1. Design an algorithm for performing the security-related transformation. The algorithm should \nbe such that an opponent cannot defeat its purpose. \n2. Generate the secret information to be used with the algorithm. \n3. Develop methods for the distribution and sharing of the secret information. \n4. Specify a protocol to be used by the two principals that makes use of the security algorithm \nand the secret information to achieve a particular security service. \nNetwork Access Security Model \n \nFig.13 Network Access Security Model", "chunk_id": "1459b0c8-8d05-4492-b5f0-2982e4ad1e6f", "chroma:document": "15 \n \n \nFig.12 Model of Network Security \nBasic Tasks \nThis general model shows that there are four basic tasks in designing a particular security service: \n1. Design an algorithm for performing the security-related transformation. The algorithm should \nbe such that an opponent cannot defeat its purpose. \n2. Generate the secret information to be used with the algorithm."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: d5bdab36-c624-4ef5-a607-78a56e61837d
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 14, "full_page_content": "15 \n \n \nFig.12 Model of Network Security \nBasic Tasks \nThis general model shows that there are four basic tasks in designing a particular security service: \n1. Design an algorithm for performing the security-related transformation. The algorithm should \nbe such that an opponent cannot defeat its purpose. \n2. Generate the secret information to be used with the algorithm. \n3. Develop methods for the distribution and sharing of the secret information. \n4. Specify a protocol to be used by the two principals that makes use of the security algorithm \nand the secret information to achieve a particular security service. \nNetwork Access Security Model \n \nFig.13 Network Access Security Model", "chunk_id": "36a80b5a-0d49-474e-84e7-692ed4a4553d", "chroma:document": "3. Develop methods for the distribution and sharing of the secret information. \n4. Specify a protocol to be used by the two principals that makes use of the security algorithm \nand the secret information to achieve a particular security service. \nNetwork Access Security Model \n \nFig.13 Network Access Security Model"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: a2252f57-73ec-4925-aeca-60a4e5a1d980
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 15, "full_page_content": "16 \n \n1.11 Symmetric Encryption \nA symmetric encryption scheme has five ingredients  \n\u2022 Plaintext: This is the original message or data that is fed into the algorithm as input. \n\u2022Encryption algorithm: The encryption algorithm performs various substitutions and \ntransformations on the plaintext. \n\u2022 Secret key: The secret key is also input to the algorithm. The exact substitutions and transformations \nperformed by the algorithm depend on the key. \n\u2022 Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and the \nsecret key. For a given message, two different keys will produce two different ciphertexts. \n\u2022 Decryption algorithm: This is essentially the encryption algorithm run in reverse. It takes the \nciphertext and the same secret key and produces the original plaintext. \n \nFig.14 Simplified Model of Symmetric Encryption \nEncryption, is the process of changing information in such a way as to make it unreadable by \nanyone except those possessing special knowledge (usually referred to as a \"key\") that allows \nthem to change the information back to its original, readable form.  \n(a) Basic Terms \n\u25aa Plaintext - original message \n\u25aa  Ciphertext - coded message \n\u25aa  Cipher - algorithm for transforming plaintext to cipher text \n\u25aa  Key - info used in cipher known only to sender/receiver info used in cipher known only to \nsender/receiver", "chunk_id": "061364e0-21b2-4fa8-be98-4d06ca8fe7a8", "chroma:document": "16 \n \n1.11 Symmetric Encryption \nA symmetric encryption scheme has five ingredients  \n\u2022 Plaintext: This is the original message or data that is fed into the algorithm as input. \n\u2022Encryption algorithm: The encryption algorithm performs various substitutions and \ntransformations on the plaintext."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 2d40ec0d-a1c2-4e3c-8084-c6fdb41cf4d9
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 15, "full_page_content": "16 \n \n1.11 Symmetric Encryption \nA symmetric encryption scheme has five ingredients  \n\u2022 Plaintext: This is the original message or data that is fed into the algorithm as input. \n\u2022Encryption algorithm: The encryption algorithm performs various substitutions and \ntransformations on the plaintext. \n\u2022 Secret key: The secret key is also input to the algorithm. The exact substitutions and transformations \nperformed by the algorithm depend on the key. \n\u2022 Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and the \nsecret key. For a given message, two different keys will produce two different ciphertexts. \n\u2022 Decryption algorithm: This is essentially the encryption algorithm run in reverse. It takes the \nciphertext and the same secret key and produces the original plaintext. \n \nFig.14 Simplified Model of Symmetric Encryption \nEncryption, is the process of changing information in such a way as to make it unreadable by \nanyone except those possessing special knowledge (usually referred to as a \"key\") that allows \nthem to change the information back to its original, readable form.  \n(a) Basic Terms \n\u25aa Plaintext - original message \n\u25aa  Ciphertext - coded message \n\u25aa  Cipher - algorithm for transforming plaintext to cipher text \n\u25aa  Key - info used in cipher known only to sender/receiver info used in cipher known only to \nsender/receiver", "chunk_id": "c9d8e05a-ee31-48ba-91e8-cd836013b4cc", "chroma:document": "\u2022 Secret key: The secret key is also input to the algorithm. The exact substitutions and transformations \nperformed by the algorithm depend on the key. \n\u2022 Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and the \nsecret key. For a given message, two different keys will produce two different ciphertexts."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 5a69b0f5-2448-47f1-bec4-4ae840d2d274
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 15, "full_page_content": "16 \n \n1.11 Symmetric Encryption \nA symmetric encryption scheme has five ingredients  \n\u2022 Plaintext: This is the original message or data that is fed into the algorithm as input. \n\u2022Encryption algorithm: The encryption algorithm performs various substitutions and \ntransformations on the plaintext. \n\u2022 Secret key: The secret key is also input to the algorithm. The exact substitutions and transformations \nperformed by the algorithm depend on the key. \n\u2022 Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and the \nsecret key. For a given message, two different keys will produce two different ciphertexts. \n\u2022 Decryption algorithm: This is essentially the encryption algorithm run in reverse. It takes the \nciphertext and the same secret key and produces the original plaintext. \n \nFig.14 Simplified Model of Symmetric Encryption \nEncryption, is the process of changing information in such a way as to make it unreadable by \nanyone except those possessing special knowledge (usually referred to as a \"key\") that allows \nthem to change the information back to its original, readable form.  \n(a) Basic Terms \n\u25aa Plaintext - original message \n\u25aa  Ciphertext - coded message \n\u25aa  Cipher - algorithm for transforming plaintext to cipher text \n\u25aa  Key - info used in cipher known only to sender/receiver info used in cipher known only to \nsender/receiver", "chunk_id": "67b8f2ff-3b3f-41cd-9f18-499dc5f10127", "chroma:document": "\u2022 Decryption algorithm: This is essentially the encryption algorithm run in reverse. It takes the \nciphertext and the same secret key and produces the original plaintext. \n \nFig.14 Simplified Model of Symmetric Encryption \nEncryption, is the process of changing information in such a way as to make it unreadable by"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 0339b7bf-2739-4079-a2af-80289edec114
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 15, "full_page_content": "16 \n \n1.11 Symmetric Encryption \nA symmetric encryption scheme has five ingredients  \n\u2022 Plaintext: This is the original message or data that is fed into the algorithm as input. \n\u2022Encryption algorithm: The encryption algorithm performs various substitutions and \ntransformations on the plaintext. \n\u2022 Secret key: The secret key is also input to the algorithm. The exact substitutions and transformations \nperformed by the algorithm depend on the key. \n\u2022 Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and the \nsecret key. For a given message, two different keys will produce two different ciphertexts. \n\u2022 Decryption algorithm: This is essentially the encryption algorithm run in reverse. It takes the \nciphertext and the same secret key and produces the original plaintext. \n \nFig.14 Simplified Model of Symmetric Encryption \nEncryption, is the process of changing information in such a way as to make it unreadable by \nanyone except those possessing special knowledge (usually referred to as a \"key\") that allows \nthem to change the information back to its original, readable form.  \n(a) Basic Terms \n\u25aa Plaintext - original message \n\u25aa  Ciphertext - coded message \n\u25aa  Cipher - algorithm for transforming plaintext to cipher text \n\u25aa  Key - info used in cipher known only to sender/receiver info used in cipher known only to \nsender/receiver", "chunk_id": "a4eb2bad-a134-476f-b70f-54e4bd00fa28", "chroma:document": "anyone except those possessing special knowledge (usually referred to as a \"key\") that allows \nthem to change the information back to its original, readable form.  \n(a) Basic Terms \n\u25aa Plaintext - original message \n\u25aa  Ciphertext - coded message \n\u25aa  Cipher - algorithm for transforming plaintext to cipher text"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 1463a5c5-3bce-47bd-9725-f2265c8f4b52
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 15, "full_page_content": "16 \n \n1.11 Symmetric Encryption \nA symmetric encryption scheme has five ingredients  \n\u2022 Plaintext: This is the original message or data that is fed into the algorithm as input. \n\u2022Encryption algorithm: The encryption algorithm performs various substitutions and \ntransformations on the plaintext. \n\u2022 Secret key: The secret key is also input to the algorithm. The exact substitutions and transformations \nperformed by the algorithm depend on the key. \n\u2022 Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and the \nsecret key. For a given message, two different keys will produce two different ciphertexts. \n\u2022 Decryption algorithm: This is essentially the encryption algorithm run in reverse. It takes the \nciphertext and the same secret key and produces the original plaintext. \n \nFig.14 Simplified Model of Symmetric Encryption \nEncryption, is the process of changing information in such a way as to make it unreadable by \nanyone except those possessing special knowledge (usually referred to as a \"key\") that allows \nthem to change the information back to its original, readable form.  \n(a) Basic Terms \n\u25aa Plaintext - original message \n\u25aa  Ciphertext - coded message \n\u25aa  Cipher - algorithm for transforming plaintext to cipher text \n\u25aa  Key - info used in cipher known only to sender/receiver info used in cipher known only to \nsender/receiver", "chunk_id": "ceef6e44-ec70-4fb2-a7a7-c519db0eeece", "chroma:document": "\u25aa  Key - info used in cipher known only to sender/receiver info used in cipher known only to \nsender/receiver"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 915ed134-a0d5-4000-ba0e-9fa6c211649e
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 16, "full_page_content": "17 \n \n\u25aa  Encipher (encrypt) Encipher (encrypt) - converting plaintext to ciphertext  \n\u25aa  Decipher (decrypt) - recovering ciphertext from plaintext  \n\u25aa  Cryptography  - study of encryption principles/methods study of encryption \nprinciples/methods  \n\u25aa  Cryptanalysis (code breaking) - study of principles/ methods of deciphering ciphertext \nwithout knowing key \n\u25aa  Cryptology - field of both cryptography and cryptanalysis \n(b) Cryptography \u2013 Classification \n1. By type of encryption operations used: \n\u27a2 Substitution  \n\u27a2 Transposition  \n\u27a2 Product \n2. By number of keys used By number of keys used: \n\u27a2 Single-key or private key  \n\u27a2 Two-key or public \n3. By the way in which plaintext is processed: \n\u27a2 Block  \n\u27a2 Stream \n1.12 Substitution \n\u2751 A substitution technique is one in which the letters of plaintext are replaced by other letters \nor by numbers or symbols.  \n\u2751  If the plaintext is viewed as a sequence of bits, then substitution involves replacing \nplaintext bit patterns with cipher text bit patterns. \n\u2751  Caesar Cipher.  \n\u2751  Playfair Cipher.  \n\u2751  One-Time Pad. \n\u2751 Hill Cipher \n\u2751 Monoalphabetic Ciphers", "chunk_id": "f1e5f15f-b376-414f-8a72-7c2dbb9254b6", "chroma:document": "17 \n \n\u25aa  Encipher (encrypt) Encipher (encrypt) - converting plaintext to ciphertext  \n\u25aa  Decipher (decrypt) - recovering ciphertext from plaintext  \n\u25aa  Cryptography  - study of encryption principles/methods study of encryption \nprinciples/methods  \n\u25aa  Cryptanalysis (code breaking) - study of principles/ methods of deciphering ciphertext \nwithout knowing key"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 5025b4d3-2f56-4c07-8060-d13cf6186df0
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 16, "full_page_content": "17 \n \n\u25aa  Encipher (encrypt) Encipher (encrypt) - converting plaintext to ciphertext  \n\u25aa  Decipher (decrypt) - recovering ciphertext from plaintext  \n\u25aa  Cryptography  - study of encryption principles/methods study of encryption \nprinciples/methods  \n\u25aa  Cryptanalysis (code breaking) - study of principles/ methods of deciphering ciphertext \nwithout knowing key \n\u25aa  Cryptology - field of both cryptography and cryptanalysis \n(b) Cryptography \u2013 Classification \n1. By type of encryption operations used: \n\u27a2 Substitution  \n\u27a2 Transposition  \n\u27a2 Product \n2. By number of keys used By number of keys used: \n\u27a2 Single-key or private key  \n\u27a2 Two-key or public \n3. By the way in which plaintext is processed: \n\u27a2 Block  \n\u27a2 Stream \n1.12 Substitution \n\u2751 A substitution technique is one in which the letters of plaintext are replaced by other letters \nor by numbers or symbols.  \n\u2751  If the plaintext is viewed as a sequence of bits, then substitution involves replacing \nplaintext bit patterns with cipher text bit patterns. \n\u2751  Caesar Cipher.  \n\u2751  Playfair Cipher.  \n\u2751  One-Time Pad. \n\u2751 Hill Cipher \n\u2751 Monoalphabetic Ciphers", "chunk_id": "565c8b90-76b0-44ec-9a03-7e33ffacbcae", "chroma:document": "\u25aa  Cryptology - field of both cryptography and cryptanalysis \n(b) Cryptography \u2013 Classification \n1. By type of encryption operations used: \n\u27a2 Substitution  \n\u27a2 Transposition  \n\u27a2 Product \n2. By number of keys used By number of keys used: \n\u27a2 Single-key or private key  \n\u27a2 Two-key or public \n3. By the way in which plaintext is processed: \n\u27a2 Block  \n\u27a2 Stream \n1.12 Substitution"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 7caa83fd-9fbf-4694-b83a-e9bb79e846ce
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 16, "full_page_content": "17 \n \n\u25aa  Encipher (encrypt) Encipher (encrypt) - converting plaintext to ciphertext  \n\u25aa  Decipher (decrypt) - recovering ciphertext from plaintext  \n\u25aa  Cryptography  - study of encryption principles/methods study of encryption \nprinciples/methods  \n\u25aa  Cryptanalysis (code breaking) - study of principles/ methods of deciphering ciphertext \nwithout knowing key \n\u25aa  Cryptology - field of both cryptography and cryptanalysis \n(b) Cryptography \u2013 Classification \n1. By type of encryption operations used: \n\u27a2 Substitution  \n\u27a2 Transposition  \n\u27a2 Product \n2. By number of keys used By number of keys used: \n\u27a2 Single-key or private key  \n\u27a2 Two-key or public \n3. By the way in which plaintext is processed: \n\u27a2 Block  \n\u27a2 Stream \n1.12 Substitution \n\u2751 A substitution technique is one in which the letters of plaintext are replaced by other letters \nor by numbers or symbols.  \n\u2751  If the plaintext is viewed as a sequence of bits, then substitution involves replacing \nplaintext bit patterns with cipher text bit patterns. \n\u2751  Caesar Cipher.  \n\u2751  Playfair Cipher.  \n\u2751  One-Time Pad. \n\u2751 Hill Cipher \n\u2751 Monoalphabetic Ciphers", "chunk_id": "6fcac61b-a7a2-4bd0-a882-35f6e61b37c1", "chroma:document": "1.12 Substitution \n\u2751 A substitution technique is one in which the letters of plaintext are replaced by other letters \nor by numbers or symbols.  \n\u2751  If the plaintext is viewed as a sequence of bits, then substitution involves replacing \nplaintext bit patterns with cipher text bit patterns. \n\u2751  Caesar Cipher.  \n\u2751  Playfair Cipher.  \n\u2751  One-Time Pad. \n\u2751 Hill Cipher"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 6f26cbd6-e779-451e-8f91-0fdfc3897174
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 16, "full_page_content": "17 \n \n\u25aa  Encipher (encrypt) Encipher (encrypt) - converting plaintext to ciphertext  \n\u25aa  Decipher (decrypt) - recovering ciphertext from plaintext  \n\u25aa  Cryptography  - study of encryption principles/methods study of encryption \nprinciples/methods  \n\u25aa  Cryptanalysis (code breaking) - study of principles/ methods of deciphering ciphertext \nwithout knowing key \n\u25aa  Cryptology - field of both cryptography and cryptanalysis \n(b) Cryptography \u2013 Classification \n1. By type of encryption operations used: \n\u27a2 Substitution  \n\u27a2 Transposition  \n\u27a2 Product \n2. By number of keys used By number of keys used: \n\u27a2 Single-key or private key  \n\u27a2 Two-key or public \n3. By the way in which plaintext is processed: \n\u27a2 Block  \n\u27a2 Stream \n1.12 Substitution \n\u2751 A substitution technique is one in which the letters of plaintext are replaced by other letters \nor by numbers or symbols.  \n\u2751  If the plaintext is viewed as a sequence of bits, then substitution involves replacing \nplaintext bit patterns with cipher text bit patterns. \n\u2751  Caesar Cipher.  \n\u2751  Playfair Cipher.  \n\u2751  One-Time Pad. \n\u2751 Hill Cipher \n\u2751 Monoalphabetic Ciphers", "chunk_id": "ab5b52b1-7dde-43ff-84ae-7b0f1597fd9c", "chroma:document": "\u2751 Hill Cipher \n\u2751 Monoalphabetic Ciphers"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: b86d4fee-a050-42e4-8426-856ffb72d9f9
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 17, "full_page_content": "18 \n \n\u2751 Polyalphabetic Ciphers \n1.12.1 Caesar Cipher: \nThe earliest known use of a substitution cipher and the simplest was by Julius Caesar. \n \n \nIf n=3 \n \nPlain Text: meet me after the toga party \nConsidering n=3 \nCipher Text: PHHW PH DIWHU WKH WRJD SDUWB \nWeakness: Total 26 keys \nBrute Force Cryptanalysis \n\u2022 \nIf it is known that a given ciphertext is a Caesar cipher, then a brute-force cryptanalysis is \neasily performed: simply try all the 25 possible keys. \n\u2022 \nThree important characteristics of this problem enabled us to use a bruteforce cryptanalysis: \n1. The encryption and decryption algorithms are known. \n2. There are only 25 keys to try. \n3. The language of the plaintext is known and easily recognizable.", "chunk_id": "ae21b330-fdac-4d58-ae29-4367ba79af3a", "chroma:document": "18 \n \n\u2751 Polyalphabetic Ciphers \n1.12.1 Caesar Cipher: \nThe earliest known use of a substitution cipher and the simplest was by Julius Caesar. \n \n \nIf n=3 \n \nPlain Text: meet me after the toga party \nConsidering n=3 \nCipher Text: PHHW PH DIWHU WKH WRJD SDUWB \nWeakness: Total 26 keys \nBrute Force Cryptanalysis \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 26e6cfcb-9be6-4d46-b991-28816cc8eaca
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 17, "full_page_content": "18 \n \n\u2751 Polyalphabetic Ciphers \n1.12.1 Caesar Cipher: \nThe earliest known use of a substitution cipher and the simplest was by Julius Caesar. \n \n \nIf n=3 \n \nPlain Text: meet me after the toga party \nConsidering n=3 \nCipher Text: PHHW PH DIWHU WKH WRJD SDUWB \nWeakness: Total 26 keys \nBrute Force Cryptanalysis \n\u2022 \nIf it is known that a given ciphertext is a Caesar cipher, then a brute-force cryptanalysis is \neasily performed: simply try all the 25 possible keys. \n\u2022 \nThree important characteristics of this problem enabled us to use a bruteforce cryptanalysis: \n1. The encryption and decryption algorithms are known. \n2. There are only 25 keys to try. \n3. The language of the plaintext is known and easily recognizable.", "chunk_id": "6fdc8511-2c7e-4b6a-8902-056e88a6ebac", "chroma:document": "\u2022 \nIf it is known that a given ciphertext is a Caesar cipher, then a brute-force cryptanalysis is \neasily performed: simply try all the 25 possible keys. \n\u2022 \nThree important characteristics of this problem enabled us to use a bruteforce cryptanalysis: \n1. The encryption and decryption algorithms are known. \n2. There are only 25 keys to try."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 53397a28-9f1a-4ff6-9e0a-5d7f732113a6
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 17, "full_page_content": "18 \n \n\u2751 Polyalphabetic Ciphers \n1.12.1 Caesar Cipher: \nThe earliest known use of a substitution cipher and the simplest was by Julius Caesar. \n \n \nIf n=3 \n \nPlain Text: meet me after the toga party \nConsidering n=3 \nCipher Text: PHHW PH DIWHU WKH WRJD SDUWB \nWeakness: Total 26 keys \nBrute Force Cryptanalysis \n\u2022 \nIf it is known that a given ciphertext is a Caesar cipher, then a brute-force cryptanalysis is \neasily performed: simply try all the 25 possible keys. \n\u2022 \nThree important characteristics of this problem enabled us to use a bruteforce cryptanalysis: \n1. The encryption and decryption algorithms are known. \n2. There are only 25 keys to try. \n3. The language of the plaintext is known and easily recognizable.", "chunk_id": "2d499e66-f001-40d7-8913-991effaf29cd", "chroma:document": "3. The language of the plaintext is known and easily recognizable."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: e6c0d3d3-e4e1-4ca1-9eb3-c5d4d9bdcd55
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 18, "full_page_content": "19 \n \n \nFig.15 Brute Force Cryptanalysis \n1.12.2 Playfair Cipher \n\u27a2 The best-known multiple letter encryption cipher is the Playfair, which treats digrams in the \nplaintext as single units and translates these units into cipher text digrams.  \n\u27a2 The Playfair algorithm is based on the use of 5x5 matrix of letters constructed using a \nkeyword. \n\u27a2 Let the keyword be \u201cmonarchy\u201f.  \n\u27a2 The matrix is constructed by filling in the letters of the keyword (minus duplicates) from left \nto right and from top to bottom, and then filling in the remainder of the matrix with the \nremaining letters in alphabetical order. \n\u27a2 The letter \u201ei\u201f and \u201ej\u201f count as one letter.  \nRules: \nPlaintext is encrypted two letters at a time according to the following rules: \n\u2751  Repeating plaintext letters that would fall in the same pair are separated with a filler letter \nsuch as \u201ex\u201f.", "chunk_id": "88c2f0db-24a4-45da-8f2f-6d42b450ec47", "chroma:document": "19 \n \n \nFig.15 Brute Force Cryptanalysis \n1.12.2 Playfair Cipher \n\u27a2 The best-known multiple letter encryption cipher is the Playfair, which treats digrams in the \nplaintext as single units and translates these units into cipher text digrams.  \n\u27a2 The Playfair algorithm is based on the use of 5x5 matrix of letters constructed using a \nkeyword. \n\u27a2 Let the keyword be \u201cmonarchy\u201f."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 3c1c4e8d-fbb6-4ea4-9f71-fbe7c0d0391d
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 18, "full_page_content": "19 \n \n \nFig.15 Brute Force Cryptanalysis \n1.12.2 Playfair Cipher \n\u27a2 The best-known multiple letter encryption cipher is the Playfair, which treats digrams in the \nplaintext as single units and translates these units into cipher text digrams.  \n\u27a2 The Playfair algorithm is based on the use of 5x5 matrix of letters constructed using a \nkeyword. \n\u27a2 Let the keyword be \u201cmonarchy\u201f.  \n\u27a2 The matrix is constructed by filling in the letters of the keyword (minus duplicates) from left \nto right and from top to bottom, and then filling in the remainder of the matrix with the \nremaining letters in alphabetical order. \n\u27a2 The letter \u201ei\u201f and \u201ej\u201f count as one letter.  \nRules: \nPlaintext is encrypted two letters at a time according to the following rules: \n\u2751  Repeating plaintext letters that would fall in the same pair are separated with a filler letter \nsuch as \u201ex\u201f.", "chunk_id": "25056f08-a540-4f33-a14e-dd3189c3d390", "chroma:document": "\u27a2 The matrix is constructed by filling in the letters of the keyword (minus duplicates) from left \nto right and from top to bottom, and then filling in the remainder of the matrix with the \nremaining letters in alphabetical order. \n\u27a2 The letter \u201ei\u201f and \u201ej\u201f count as one letter.  \nRules: \nPlaintext is encrypted two letters at a time according to the following rules:"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 595f8efa-2e64-4930-a3f4-7210621fa71e
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 18, "full_page_content": "19 \n \n \nFig.15 Brute Force Cryptanalysis \n1.12.2 Playfair Cipher \n\u27a2 The best-known multiple letter encryption cipher is the Playfair, which treats digrams in the \nplaintext as single units and translates these units into cipher text digrams.  \n\u27a2 The Playfair algorithm is based on the use of 5x5 matrix of letters constructed using a \nkeyword. \n\u27a2 Let the keyword be \u201cmonarchy\u201f.  \n\u27a2 The matrix is constructed by filling in the letters of the keyword (minus duplicates) from left \nto right and from top to bottom, and then filling in the remainder of the matrix with the \nremaining letters in alphabetical order. \n\u27a2 The letter \u201ei\u201f and \u201ej\u201f count as one letter.  \nRules: \nPlaintext is encrypted two letters at a time according to the following rules: \n\u2751  Repeating plaintext letters that would fall in the same pair are separated with a filler letter \nsuch as \u201ex\u201f.", "chunk_id": "487bf128-75d3-462b-8be7-a895173c8315", "chroma:document": "\u2751  Repeating plaintext letters that would fall in the same pair are separated with a filler letter \nsuch as \u201ex\u201f."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: dcb4f547-b13e-4324-a733-75818527d80a
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 19, "full_page_content": "20 \n \n\u2751  Plaintext letters that fall in the same row of the matrix are each replaced by the letter to the \nright, with the first element of the row following the last. \n\u2751  Plaintext letters that fall in the same column are replaced by the letter beneath, with the top \nelement of the column following the last. \n\u2751  Otherwise, each plaintext letter is replaced by the letter that lies in its own row and the column \noccupied by the other plaintext letter. \n(Ex): \nKeyword : MONARCHY \nM \nO \nN \nA \nR \nC \nH \nY \nB \nD \nE \nF \nG \nI/J \nK \nL \nP \nQ \nS \nT \nU \nV \nW \nX \nZ \n \nPlaintext = meet me at the school house \nSplitting two letters as a unit =>  \nme et me at th es ch ox ol ho us ex  \nCorresponding cipher text =>  \nCL KL CL RS PD IL HY AV MP HF XL IU \nSince there are 26 letters, 26x26 = 676 diagrams are possible, so identification of individual digram \nis more difficult. Frequency analysis is much more difficult.", "chunk_id": "b1d575c0-f44d-4f39-8eed-082e1e6e4c27", "chroma:document": "20 \n \n\u2751  Plaintext letters that fall in the same row of the matrix are each replaced by the letter to the \nright, with the first element of the row following the last. \n\u2751  Plaintext letters that fall in the same column are replaced by the letter beneath, with the top \nelement of the column following the last."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 1f1b2ba8-e3cb-4feb-889f-79d4fc09f9cf
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 19, "full_page_content": "20 \n \n\u2751  Plaintext letters that fall in the same row of the matrix are each replaced by the letter to the \nright, with the first element of the row following the last. \n\u2751  Plaintext letters that fall in the same column are replaced by the letter beneath, with the top \nelement of the column following the last. \n\u2751  Otherwise, each plaintext letter is replaced by the letter that lies in its own row and the column \noccupied by the other plaintext letter. \n(Ex): \nKeyword : MONARCHY \nM \nO \nN \nA \nR \nC \nH \nY \nB \nD \nE \nF \nG \nI/J \nK \nL \nP \nQ \nS \nT \nU \nV \nW \nX \nZ \n \nPlaintext = meet me at the school house \nSplitting two letters as a unit =>  \nme et me at th es ch ox ol ho us ex  \nCorresponding cipher text =>  \nCL KL CL RS PD IL HY AV MP HF XL IU \nSince there are 26 letters, 26x26 = 676 diagrams are possible, so identification of individual digram \nis more difficult. Frequency analysis is much more difficult.", "chunk_id": "dc91369f-7e81-4a4c-be44-1571c54a8ac6", "chroma:document": "\u2751  Otherwise, each plaintext letter is replaced by the letter that lies in its own row and the column \noccupied by the other plaintext letter. \n(Ex): \nKeyword : MONARCHY \nM \nO \nN \nA \nR \nC \nH \nY \nB \nD \nE \nF \nG \nI/J \nK \nL \nP \nQ \nS \nT \nU \nV \nW \nX \nZ \n \nPlaintext = meet me at the school house \nSplitting two letters as a unit =>  \nme et me at th es ch ox ol ho us ex"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 1d5047ae-d11b-4316-ac86-9b214c56da7a
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 19, "full_page_content": "20 \n \n\u2751  Plaintext letters that fall in the same row of the matrix are each replaced by the letter to the \nright, with the first element of the row following the last. \n\u2751  Plaintext letters that fall in the same column are replaced by the letter beneath, with the top \nelement of the column following the last. \n\u2751  Otherwise, each plaintext letter is replaced by the letter that lies in its own row and the column \noccupied by the other plaintext letter. \n(Ex): \nKeyword : MONARCHY \nM \nO \nN \nA \nR \nC \nH \nY \nB \nD \nE \nF \nG \nI/J \nK \nL \nP \nQ \nS \nT \nU \nV \nW \nX \nZ \n \nPlaintext = meet me at the school house \nSplitting two letters as a unit =>  \nme et me at th es ch ox ol ho us ex  \nCorresponding cipher text =>  \nCL KL CL RS PD IL HY AV MP HF XL IU \nSince there are 26 letters, 26x26 = 676 diagrams are possible, so identification of individual digram \nis more difficult. Frequency analysis is much more difficult.", "chunk_id": "5c101a50-681b-44fb-868c-e9d65a4f89a6", "chroma:document": "Corresponding cipher text =>  \nCL KL CL RS PD IL HY AV MP HF XL IU \nSince there are 26 letters, 26x26 = 676 diagrams are possible, so identification of individual digram \nis more difficult. Frequency analysis is much more difficult."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: b56c5639-e379-4f55-acb8-cdb735c2f100
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 20, "full_page_content": "21 \n \n1.12.3 Hill Cipher \n\u2022 \nThe Hill Cipher was invented by Lester S. Hill in 1929. \n\u2022 \nThe encryption algorithm takes \u2018m\u2019 successive plain text letters and substitutes for them \u2018m\u2019 \nciphertext letters. \nSteps: \n\u2022 \nSelect a message to encrypt \n\u2022 \n Select a key \n\u2022 \nIf we encrypt 2 letters at a time, then key size is 4. \n\u2022 \nAssign a numerical equivalent to each letter. \n\u2022 \nConvert the key to matrix \n\u2022 \nConvert the message to a \u2018n\u2019 component vector \n\u2022 \nEncryption - Ciphertext = K * P mod 26 \n\u2022 \nDecryption Plaintext = K-1 * C mod 26 \nExample : \n \nHill Cipher \nPlain Text  : welcome \nwe lc om ex \nGroup the plain text as digrams ( 2 letter combinations) \nKey : dbgf \nK = \u2308\ud835\udc51 \ud835\udc4f\n\ud835\udc54 \ud835\udc53\u2309 = \u23083 1\n6 5\u2309 \nRepresent the plaintext in matrix form \n\u2308\ud835\udc64\n\ud835\udc52\u2309\u2308\ud835\udc59\n\ud835\udc50\u2309\u2308\ud835\udc5c\n\ud835\udc5a\u2309\u2308\ud835\udc52\n\ud835\udc65\u2309", "chunk_id": "b6ee0c96-ba2a-4520-8225-3bbd14a54967", "chroma:document": "21 \n \n1.12.3 Hill Cipher \n\u2022 \nThe Hill Cipher was invented by Lester S. Hill in 1929. \n\u2022 \nThe encryption algorithm takes \u2018m\u2019 successive plain text letters and substitutes for them \u2018m\u2019 \nciphertext letters. \nSteps: \n\u2022 \nSelect a message to encrypt \n\u2022 \n Select a key \n\u2022 \nIf we encrypt 2 letters at a time, then key size is 4. \n\u2022 \nAssign a numerical equivalent to each letter. \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: fe7a96e7-ccac-439c-8352-68dd6d11f09f
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 20, "full_page_content": "21 \n \n1.12.3 Hill Cipher \n\u2022 \nThe Hill Cipher was invented by Lester S. Hill in 1929. \n\u2022 \nThe encryption algorithm takes \u2018m\u2019 successive plain text letters and substitutes for them \u2018m\u2019 \nciphertext letters. \nSteps: \n\u2022 \nSelect a message to encrypt \n\u2022 \n Select a key \n\u2022 \nIf we encrypt 2 letters at a time, then key size is 4. \n\u2022 \nAssign a numerical equivalent to each letter. \n\u2022 \nConvert the key to matrix \n\u2022 \nConvert the message to a \u2018n\u2019 component vector \n\u2022 \nEncryption - Ciphertext = K * P mod 26 \n\u2022 \nDecryption Plaintext = K-1 * C mod 26 \nExample : \n \nHill Cipher \nPlain Text  : welcome \nwe lc om ex \nGroup the plain text as digrams ( 2 letter combinations) \nKey : dbgf \nK = \u2308\ud835\udc51 \ud835\udc4f\n\ud835\udc54 \ud835\udc53\u2309 = \u23083 1\n6 5\u2309 \nRepresent the plaintext in matrix form \n\u2308\ud835\udc64\n\ud835\udc52\u2309\u2308\ud835\udc59\n\ud835\udc50\u2309\u2308\ud835\udc5c\n\ud835\udc5a\u2309\u2308\ud835\udc52\n\ud835\udc65\u2309", "chunk_id": "737e165d-d4b1-4d70-b5e6-afd8a33c8f3c", "chroma:document": "\u2022 \nConvert the key to matrix \n\u2022 \nConvert the message to a \u2018n\u2019 component vector \n\u2022 \nEncryption - Ciphertext = K * P mod 26 \n\u2022 \nDecryption Plaintext = K-1 * C mod 26 \nExample : \n \nHill Cipher \nPlain Text  : welcome \nwe lc om ex \nGroup the plain text as digrams ( 2 letter combinations) \nKey : dbgf \nK = \u2308\ud835\udc51 \ud835\udc4f\n\ud835\udc54 \ud835\udc53\u2309 = \u23083 1\n6 5\u2309 \nRepresent the plaintext in matrix form \n\u2308\ud835\udc64\n\ud835\udc52\u2309\u2308\ud835\udc59\n\ud835\udc50\u2309\u2308\ud835\udc5c\n\ud835\udc5a\u2309\u2308\ud835\udc52"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: c45b1ff7-c83c-41d4-baf3-9ff46e04f495
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 20, "full_page_content": "21 \n \n1.12.3 Hill Cipher \n\u2022 \nThe Hill Cipher was invented by Lester S. Hill in 1929. \n\u2022 \nThe encryption algorithm takes \u2018m\u2019 successive plain text letters and substitutes for them \u2018m\u2019 \nciphertext letters. \nSteps: \n\u2022 \nSelect a message to encrypt \n\u2022 \n Select a key \n\u2022 \nIf we encrypt 2 letters at a time, then key size is 4. \n\u2022 \nAssign a numerical equivalent to each letter. \n\u2022 \nConvert the key to matrix \n\u2022 \nConvert the message to a \u2018n\u2019 component vector \n\u2022 \nEncryption - Ciphertext = K * P mod 26 \n\u2022 \nDecryption Plaintext = K-1 * C mod 26 \nExample : \n \nHill Cipher \nPlain Text  : welcome \nwe lc om ex \nGroup the plain text as digrams ( 2 letter combinations) \nKey : dbgf \nK = \u2308\ud835\udc51 \ud835\udc4f\n\ud835\udc54 \ud835\udc53\u2309 = \u23083 1\n6 5\u2309 \nRepresent the plaintext in matrix form \n\u2308\ud835\udc64\n\ud835\udc52\u2309\u2308\ud835\udc59\n\ud835\udc50\u2309\u2308\ud835\udc5c\n\ud835\udc5a\u2309\u2308\ud835\udc52\n\ud835\udc65\u2309", "chunk_id": "7619bc8c-538f-465b-bdf7-86ad60a183d8", "chroma:document": "\u2308\ud835\udc64\n\ud835\udc52\u2309\u2308\ud835\udc59\n\ud835\udc50\u2309\u2308\ud835\udc5c\n\ud835\udc5a\u2309\u2308\ud835\udc52\n\ud835\udc65\u2309"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: af3caa76-aefb-413f-8c85-b66a106157fe
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 21, "full_page_content": "22 \n \n\u230822\n4 \u2309\u230811\n2 \u2309\u230814\n12\u2309\u23084\n23\u2309 \nEncryption \nC = K * P mod 26 \n1. For 22\n4  \nC = \u23083 1\n6 5\u2309 * \u230822\n4 \u2309  mod 26 \n   = \u23083 \u221722 + 1 \u22174\n6 \u221722 + 5 \u22174\u2309 mod 26 \n   =\u230870\n152\u2309 mod 26 \n = \u230818\n22\u2309 = \u2308\ud835\udc60\n\ud835\udc64\u2309 \n2. For 11\n2  \nC = \u23083 1\n6 5\u2309 * \u230811\n2 \u2309  mod 26 \n   = \u23083 \u221711 + 1 \u22172\n6 \u221711 + 5 \u22172\u2309 mod 26 \n   = \u230835\n76\u2309 mod 26 \n   = \u23089\n24\u2309 = \u2308\ud835\udc57\n\ud835\udc66\u2309 \n3. For 14\n12 \nC = \u23083 1\n6 5\u2309 * \u230814\n12\u2309  mod 26 \n  = \u23083 \u221714 + 1 \u221712\n6 \u221714 + 5 \u221712\u2309 mod 26 \n = \u230854\n144\u2309 mod 26 \n = \u23082\n14\u2309 = \u2308\ud835\udc50\n\ud835\udc5c\u2309 \n4. For 4\n23", "chunk_id": "5853c28d-aae4-4825-b4b4-c60570e33b46", "chroma:document": "22 \n \n\u230822\n4 \u2309\u230811\n2 \u2309\u230814\n12\u2309\u23084\n23\u2309 \nEncryption \nC = K * P mod 26 \n1. For 22\n4  \nC = \u23083 1\n6 5\u2309 * \u230822\n4 \u2309  mod 26 \n   = \u23083 \u221722 + 1 \u22174\n6 \u221722 + 5 \u22174\u2309 mod 26 \n   =\u230870\n152\u2309 mod 26 \n = \u230818\n22\u2309 = \u2308\ud835\udc60\n\ud835\udc64\u2309 \n2. For 11\n2  \nC = \u23083 1\n6 5\u2309 * \u230811\n2 \u2309  mod 26 \n   = \u23083 \u221711 + 1 \u22172\n6 \u221711 + 5 \u22172\u2309 mod 26 \n   = \u230835\n76\u2309 mod 26 \n   = \u23089\n24\u2309 = \u2308\ud835\udc57\n\ud835\udc66\u2309 \n3. For 14\n12 \nC = \u23083 1\n6 5\u2309 * \u230814\n12\u2309  mod 26"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 2259f661-4f23-4ef8-bb82-6c2971d9a33d
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 21, "full_page_content": "22 \n \n\u230822\n4 \u2309\u230811\n2 \u2309\u230814\n12\u2309\u23084\n23\u2309 \nEncryption \nC = K * P mod 26 \n1. For 22\n4  \nC = \u23083 1\n6 5\u2309 * \u230822\n4 \u2309  mod 26 \n   = \u23083 \u221722 + 1 \u22174\n6 \u221722 + 5 \u22174\u2309 mod 26 \n   =\u230870\n152\u2309 mod 26 \n = \u230818\n22\u2309 = \u2308\ud835\udc60\n\ud835\udc64\u2309 \n2. For 11\n2  \nC = \u23083 1\n6 5\u2309 * \u230811\n2 \u2309  mod 26 \n   = \u23083 \u221711 + 1 \u22172\n6 \u221711 + 5 \u22172\u2309 mod 26 \n   = \u230835\n76\u2309 mod 26 \n   = \u23089\n24\u2309 = \u2308\ud835\udc57\n\ud835\udc66\u2309 \n3. For 14\n12 \nC = \u23083 1\n6 5\u2309 * \u230814\n12\u2309  mod 26 \n  = \u23083 \u221714 + 1 \u221712\n6 \u221714 + 5 \u221712\u2309 mod 26 \n = \u230854\n144\u2309 mod 26 \n = \u23082\n14\u2309 = \u2308\ud835\udc50\n\ud835\udc5c\u2309 \n4. For 4\n23", "chunk_id": "4ed85c9d-f991-446e-a09e-c349b41cc723", "chroma:document": "12\u2309  mod 26 \n  = \u23083 \u221714 + 1 \u221712\n6 \u221714 + 5 \u221712\u2309 mod 26 \n = \u230854\n144\u2309 mod 26 \n = \u23082\n14\u2309 = \u2308\ud835\udc50\n\ud835\udc5c\u2309 \n4. For 4\n23"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 41b4242e-ebda-48e0-8f8a-83037edc447a
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 22, "full_page_content": "23 \n \nC = \u23083 1\n6 5\u2309 * \u23084\n23\u2309  mod 26 \n         = \u23083 \u22174 + 1 \u221723\n6 \u22174 + 5 \u221723\u2309 mod 26 \n         = \u230835\n139\u2309 mod 26 \n         = \u23089\n9\u2309 = \u2308\ud835\udc57\n\ud835\udc57\u2309 \n \n Cipher Text : swjycojj \n \nDecryption \nPlain Text = K-1 * C mod 26 \nTo compute K-1 \nK-1 = \n\ud835\udfcf\n|\ud835\udc72|  \ud835\udc82\ud835\udc85\ud835\udc8b(\ud835\udc72) \n \n \n|K|  = \u23083 1\n6 5\u2309 = 3*5 \u2013 6*1 = 15-6 = 9 \n \nDetermine the multiplicative inverse \n9 * mod 26 = 1 \nFind the multiplicative inverse of 9 w.r.t mod 26, such that the outcome \nis 1. \n9 * 1  mod 26 = 9 \n9 * 2 mod 26 = 18 \n9 * 3 mod 26 = 1", "chunk_id": "bf9785e8-f68f-477c-9dc0-9dc79ee668e6", "chroma:document": "23 \n \nC = \u23083 1\n6 5\u2309 * \u23084\n23\u2309  mod 26 \n         = \u23083 \u22174 + 1 \u221723\n6 \u22174 + 5 \u221723\u2309 mod 26 \n         = \u230835\n139\u2309 mod 26 \n         = \u23089\n9\u2309 = \u2308\ud835\udc57\n\ud835\udc57\u2309 \n \n Cipher Text : swjycojj \n \nDecryption \nPlain Text = K-1 * C mod 26 \nTo compute K-1 \nK-1 = \n\ud835\udfcf\n|\ud835\udc72|  \ud835\udc82\ud835\udc85\ud835\udc8b(\ud835\udc72) \n \n \n|K|  = \u23083 1\n6 5\u2309 = 3*5 \u2013 6*1 = 15-6 = 9 \n \nDetermine the multiplicative inverse \n9 * mod 26 = 1"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 8e0f3991-5df9-48ae-b23a-2f6389e7cc34
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 22, "full_page_content": "23 \n \nC = \u23083 1\n6 5\u2309 * \u23084\n23\u2309  mod 26 \n         = \u23083 \u22174 + 1 \u221723\n6 \u22174 + 5 \u221723\u2309 mod 26 \n         = \u230835\n139\u2309 mod 26 \n         = \u23089\n9\u2309 = \u2308\ud835\udc57\n\ud835\udc57\u2309 \n \n Cipher Text : swjycojj \n \nDecryption \nPlain Text = K-1 * C mod 26 \nTo compute K-1 \nK-1 = \n\ud835\udfcf\n|\ud835\udc72|  \ud835\udc82\ud835\udc85\ud835\udc8b(\ud835\udc72) \n \n \n|K|  = \u23083 1\n6 5\u2309 = 3*5 \u2013 6*1 = 15-6 = 9 \n \nDetermine the multiplicative inverse \n9 * mod 26 = 1 \nFind the multiplicative inverse of 9 w.r.t mod 26, such that the outcome \nis 1. \n9 * 1  mod 26 = 9 \n9 * 2 mod 26 = 18 \n9 * 3 mod 26 = 1", "chunk_id": "05186023-c09d-49ca-96f4-f19570c3912f", "chroma:document": "9 * mod 26 = 1 \nFind the multiplicative inverse of 9 w.r.t mod 26, such that the outcome \nis 1. \n9 * 1  mod 26 = 9 \n9 * 2 mod 26 = 18 \n9 * 3 mod 26 = 1"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: bc80acad-5103-48ef-822c-266cd35d3166
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 23, "full_page_content": "24 \n \nAns : 3 \n\ud835\udfcf\n|\ud835\udc72| = 3 \n\ud835\udc3e= \u23083 1\n6 5\u2309 \nadj (K) = \u23085   \u22121\n\u22126     3\u2309 \n \nK-1 = \n\ud835\udfcf\n|\ud835\udc72|  \ud835\udc82\ud835\udc85\ud835\udc8b(\ud835\udc72) \n     = 3 * \u23085   \u22121\n\u22126     3\u2309 \n      =  \u230815   \u22123\n\u221218     9\u2309 \nIn order to eliminate the negative sign, add 26 to the negative numbers \nK-1    = \u230815   23\n8     9 \u2309 \n \nCipher Text : swjycojj \nRepresent the given ciphertext as pairs in matrix form \n\u2308\ud835\udc60\n\ud835\udc64\u2309\u2308\ud835\udc57\n\ud835\udc66\u2309\u2308\ud835\udc50\n\ud835\udc5c\u2309\u2308\ud835\udc57\n\ud835\udc57\u2309 \n1. For \u2308\ud835\udc60\n\ud835\udc64\u2309= \u230818\n22\u2309 \nPlain Text = K-1 * C mod 26 \n \n \n = \u230815   23\n8     9 \u2309 * \u230818\n22\u2309 mod 26 \n                        = \u230815 \u221718 + 23 \u221722\n8 \u221718 + 9 \u221722 \u2309 mod 26 \n                       = \u2308776\n342\u2309 mod 26", "chunk_id": "97c5e744-e070-4916-b23a-4ea2b66aa604", "chroma:document": "24 \n \nAns : 3 \n\ud835\udfcf\n|\ud835\udc72| = 3 \n\ud835\udc3e= \u23083 1\n6 5\u2309 \nadj (K) = \u23085   \u22121\n\u22126     3\u2309 \n \nK-1 = \n\ud835\udfcf\n|\ud835\udc72|  \ud835\udc82\ud835\udc85\ud835\udc8b(\ud835\udc72) \n     = 3 * \u23085   \u22121\n\u22126     3\u2309 \n      =  \u230815   \u22123\n\u221218     9\u2309 \nIn order to eliminate the negative sign, add 26 to the negative numbers \nK-1    = \u230815   23\n8     9 \u2309 \n \nCipher Text : swjycojj \nRepresent the given ciphertext as pairs in matrix form \n\u2308\ud835\udc60\n\ud835\udc64\u2309\u2308\ud835\udc57\n\ud835\udc66\u2309\u2308\ud835\udc50\n\ud835\udc5c\u2309\u2308\ud835\udc57\n\ud835\udc57\u2309 \n1. For \u2308\ud835\udc60\n\ud835\udc64\u2309= \u230818\n22\u2309"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 2f21cd29-d7f9-4f0d-97f2-5e9f5bed7dc7
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 23, "full_page_content": "24 \n \nAns : 3 \n\ud835\udfcf\n|\ud835\udc72| = 3 \n\ud835\udc3e= \u23083 1\n6 5\u2309 \nadj (K) = \u23085   \u22121\n\u22126     3\u2309 \n \nK-1 = \n\ud835\udfcf\n|\ud835\udc72|  \ud835\udc82\ud835\udc85\ud835\udc8b(\ud835\udc72) \n     = 3 * \u23085   \u22121\n\u22126     3\u2309 \n      =  \u230815   \u22123\n\u221218     9\u2309 \nIn order to eliminate the negative sign, add 26 to the negative numbers \nK-1    = \u230815   23\n8     9 \u2309 \n \nCipher Text : swjycojj \nRepresent the given ciphertext as pairs in matrix form \n\u2308\ud835\udc60\n\ud835\udc64\u2309\u2308\ud835\udc57\n\ud835\udc66\u2309\u2308\ud835\udc50\n\ud835\udc5c\u2309\u2308\ud835\udc57\n\ud835\udc57\u2309 \n1. For \u2308\ud835\udc60\n\ud835\udc64\u2309= \u230818\n22\u2309 \nPlain Text = K-1 * C mod 26 \n \n \n = \u230815   23\n8     9 \u2309 * \u230818\n22\u2309 mod 26 \n                        = \u230815 \u221718 + 23 \u221722\n8 \u221718 + 9 \u221722 \u2309 mod 26 \n                       = \u2308776\n342\u2309 mod 26", "chunk_id": "99e1ec54-f5f9-4116-b37a-a442f3ae6a8b", "chroma:document": "\ud835\udc64\u2309= \u230818\n22\u2309 \nPlain Text = K-1 * C mod 26 \n \n \n = \u230815   23\n8     9 \u2309 * \u230818\n22\u2309 mod 26 \n                        = \u230815 \u221718 + 23 \u221722\n8 \u221718 + 9 \u221722 \u2309 mod 26 \n                       = \u2308776\n342\u2309 mod 26"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: baa4a344-d019-4018-b92a-28f71aa0fc37
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 24, "full_page_content": "25 \n \n                       = \u230822\n4 \u2309 = \u2308\ud835\udc64\n\ud835\udc52\u2309 \n2. For \u2308\ud835\udc57\n\ud835\udc66\u2309= \u23089\n24\u2309 \nPlain Text = K-1 * C mod 26 \n= \u230815   23\n8     9 \u2309 * \u23089\n24\u2309 mod 26 \n \n \n= \u2308687\n288\u2309 mod 26 \n \n \n= \u230811\n2 \u2309 = \u2308\ud835\udc59\n\ud835\udc50\u2309 \n \n \n3. For \u2308\ud835\udc50\n\ud835\udc5c\u2309 = \u23082\n14\u2309 \nPlain Text = K-1 * C mod 26 \n                   = \u230815   23\n8     9 \u2309 * \u23082\n14\u2309 mod 26 \n  \n      = \u2308352\n142\u2309 mod 26 \n                   = \u230814\n12\u2309 = \u2308\ud835\udc5c\n\ud835\udc5a\u2309 \n4. For \u2308\ud835\udc57\n\ud835\udc57\u2309 = \u23089\n9\u2309 \n \nPlain Text = K-1 * C mod 26 \n  \n=  \u230815   23\n8     9 \u2309 * \u23089\n9\u2309 mod 26 \n  \n= \u23084\n23\u2309 = \u2308\ud835\udc52\n\ud835\udc65\u2309 \nPlaintext : welcome", "chunk_id": "0c4cdc36-e601-4252-b2ac-dd3d7f52988e", "chroma:document": "25 \n \n                       = \u230822\n4 \u2309 = \u2308\ud835\udc64\n\ud835\udc52\u2309 \n2. For \u2308\ud835\udc57\n\ud835\udc66\u2309= \u23089\n24\u2309 \nPlain Text = K-1 * C mod 26 \n= \u230815   23\n8     9 \u2309 * \u23089\n24\u2309 mod 26 \n \n \n= \u2308687\n288\u2309 mod 26 \n \n \n= \u230811\n2 \u2309 = \u2308\ud835\udc59\n\ud835\udc50\u2309 \n \n \n3. For \u2308\ud835\udc50\n\ud835\udc5c\u2309 = \u23082\n14\u2309 \nPlain Text = K-1 * C mod 26 \n                   = \u230815   23\n8     9 \u2309 * \u23082\n14\u2309 mod 26 \n  \n      = \u2308352\n142\u2309 mod 26 \n                   = \u230814\n12\u2309 = \u2308\ud835\udc5c\n\ud835\udc5a\u2309 \n4. For \u2308\ud835\udc57\n\ud835\udc57\u2309 = \u23089"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 9033e26f-f7ef-494b-8b18-20dc782bbc55
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 24, "full_page_content": "25 \n \n                       = \u230822\n4 \u2309 = \u2308\ud835\udc64\n\ud835\udc52\u2309 \n2. For \u2308\ud835\udc57\n\ud835\udc66\u2309= \u23089\n24\u2309 \nPlain Text = K-1 * C mod 26 \n= \u230815   23\n8     9 \u2309 * \u23089\n24\u2309 mod 26 \n \n \n= \u2308687\n288\u2309 mod 26 \n \n \n= \u230811\n2 \u2309 = \u2308\ud835\udc59\n\ud835\udc50\u2309 \n \n \n3. For \u2308\ud835\udc50\n\ud835\udc5c\u2309 = \u23082\n14\u2309 \nPlain Text = K-1 * C mod 26 \n                   = \u230815   23\n8     9 \u2309 * \u23082\n14\u2309 mod 26 \n  \n      = \u2308352\n142\u2309 mod 26 \n                   = \u230814\n12\u2309 = \u2308\ud835\udc5c\n\ud835\udc5a\u2309 \n4. For \u2308\ud835\udc57\n\ud835\udc57\u2309 = \u23089\n9\u2309 \n \nPlain Text = K-1 * C mod 26 \n  \n=  \u230815   23\n8     9 \u2309 * \u23089\n9\u2309 mod 26 \n  \n= \u23084\n23\u2309 = \u2308\ud835\udc52\n\ud835\udc65\u2309 \nPlaintext : welcome", "chunk_id": "940ef897-eefc-49ac-9b7a-b6f30179b700", "chroma:document": "4. For \u2308\ud835\udc57\n\ud835\udc57\u2309 = \u23089\n9\u2309 \n \nPlain Text = K-1 * C mod 26 \n  \n=  \u230815   23\n8     9 \u2309 * \u23089\n9\u2309 mod 26 \n  \n= \u23084\n23\u2309 = \u2308\ud835\udc52\n\ud835\udc65\u2309 \nPlaintext : welcome"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: af911b5a-4e5d-4f7f-a4e2-8b9c807ece5d
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 25, "full_page_content": "26 \n \n3 letter combinations \nConsider the plaintext =\u201dAct\u201d \nSelect a 3 X 3 matrix as the key. \nK= \n6\n24\n1\n13\n16\n10\n20\n17\n15\n \nRepresent the plain text in numerical form \nP = \n0\n2\n19\n \nEncryption \nC = K * P mod 26 \n    =\n6\n24\n1\n13\n16\n10\n20\n17\n15\n    * \u2308\n0\n2\n19\n\u2309    mod 26 \n \n=  \u2308\n6 \u22170 + 24 \u22172 + 1 \u221719\n13 \u22170 + 16 \u22172 + 10 \u221719\n20 \u22170 + 17 \u22172 + 15 \u221719\n\u2309 mod 26 \n \n= \u2308\n67\n222\n319\n\u2309    mod 26 \n \n= \u2308\n15\n14\n7\n\u2309 = \u2308\n\ud835\udc43\n\ud835\udc42\n\ud835\udc3b\n\u2309 \n \n \nDecryption \nPlain Text = K-1 * C mod 26 \nTo compute K-1", "chunk_id": "b8ff262d-ffe9-4fe1-809b-4778f7c82612", "chroma:document": "26 \n \n3 letter combinations \nConsider the plaintext =\u201dAct\u201d \nSelect a 3 X 3 matrix as the key. \nK= \n6\n24\n1\n13\n16\n10\n20\n17\n15\n \nRepresent the plain text in numerical form \nP = \n0\n2\n19\n \nEncryption \nC = K * P mod 26 \n    =\n6\n24\n1\n13\n16\n10\n20\n17\n15\n    * \u2308\n0\n2\n19\n\u2309    mod 26 \n \n=  \u2308\n6 \u22170 + 24 \u22172 + 1 \u221719\n13 \u22170 + 16 \u22172 + 10 \u221719\n20 \u22170 + 17 \u22172 + 15 \u221719\n\u2309 mod 26 \n \n= \u2308\n67\n222\n319"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 5d075b21-9132-4636-855a-5c2415186cd1
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 25, "full_page_content": "26 \n \n3 letter combinations \nConsider the plaintext =\u201dAct\u201d \nSelect a 3 X 3 matrix as the key. \nK= \n6\n24\n1\n13\n16\n10\n20\n17\n15\n \nRepresent the plain text in numerical form \nP = \n0\n2\n19\n \nEncryption \nC = K * P mod 26 \n    =\n6\n24\n1\n13\n16\n10\n20\n17\n15\n    * \u2308\n0\n2\n19\n\u2309    mod 26 \n \n=  \u2308\n6 \u22170 + 24 \u22172 + 1 \u221719\n13 \u22170 + 16 \u22172 + 10 \u221719\n20 \u22170 + 17 \u22172 + 15 \u221719\n\u2309 mod 26 \n \n= \u2308\n67\n222\n319\n\u2309    mod 26 \n \n= \u2308\n15\n14\n7\n\u2309 = \u2308\n\ud835\udc43\n\ud835\udc42\n\ud835\udc3b\n\u2309 \n \n \nDecryption \nPlain Text = K-1 * C mod 26 \nTo compute K-1", "chunk_id": "3f40eb67-f2ab-4fed-aac3-8097312b8290", "chroma:document": "= \u2308\n67\n222\n319\n\u2309    mod 26 \n \n= \u2308\n15\n14\n7\n\u2309 = \u2308\n\ud835\udc43\n\ud835\udc42\n\ud835\udc3b\n\u2309 \n \n \nDecryption \nPlain Text = K-1 * C mod 26 \nTo compute K-1"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: e21de59f-80d3-4500-979a-415ca08349c3
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 26, "full_page_content": "27 \n \nK-1 = \n\ud835\udfcf\n|\ud835\udc72|  \ud835\udc82\ud835\udc85\ud835\udc8b(\ud835\udc72) \n|\ud835\udc3e| = \u2308\n6\n24\n1\n13\n16\n10\n20\n17\n15\n\u2309 \n    \n      = 6 (16*15 \u2013 17*10) \u2013 24(13*15 \u2013 20*10) + 1(13*17 \u2013 20*16) \n      = 6 (240-170) \u2013 24(195-200) +1(221-320) \n      = 6(70) -24(-5) +1(-99) \n      = 420 + 120 \u2013 99 \n      = 441 \n\ud835\udc82\ud835\udc85\ud835\udc8b(\ud835\udc72) \n \nK = \u2308\n6\n24\n1\n13\n16\n10\n20\n17\n15\n\u2309 \n \n KT = \u2308\n6\n13\n20\n24\n16\n17\n1\n10\n15\n\u2309 \n     \n       = \u2308\n16 \u221715 \u221210 \u221717\n\u2212(24 \u221715 \u22121 \u221717)\n24 \u221710 \u22121 \u221716\n\u2212(13 \u221715 \u221210 \u221720)\n6 \u221715 \u22121 \u221720\n\u2212(6 \u221710 \u22121 \u221713)\n13 \u221717 \u221216 \u221720\n\u2212(6 \u221717 \u221224 \u221720)\n(6 \u221716 \u221224 \u221713)\n\u2309 \n \nadj(K)   =  \u2308\n70\n\u2212343\n224\n5\n70\n\u221247\n\u221299\n378\n\u2212216\n\u2309", "chunk_id": "1d02abb3-769a-483c-8008-698181f4986e", "chroma:document": "27 \n \nK-1 = \n\ud835\udfcf\n|\ud835\udc72|  \ud835\udc82\ud835\udc85\ud835\udc8b(\ud835\udc72) \n|\ud835\udc3e| = \u2308\n6\n24\n1\n13\n16\n10\n20\n17\n15\n\u2309 \n    \n      = 6 (16*15 \u2013 17*10) \u2013 24(13*15 \u2013 20*10) + 1(13*17 \u2013 20*16) \n      = 6 (240-170) \u2013 24(195-200) +1(221-320) \n      = 6(70) -24(-5) +1(-99) \n      = 420 + 120 \u2013 99 \n      = 441 \n\ud835\udc82\ud835\udc85\ud835\udc8b(\ud835\udc72) \n \nK = \u2308\n6\n24\n1\n13\n16\n10\n20\n17\n15\n\u2309 \n \n KT = \u2308\n6\n13\n20\n24\n16\n17\n1\n10\n15\n\u2309 \n     \n       = \u2308\n16 \u221715 \u221210 \u221717\n\u2212(24 \u221715 \u22121 \u221717)"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 0bc65746-44ea-4766-b43c-218ea8f20555
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 26, "full_page_content": "27 \n \nK-1 = \n\ud835\udfcf\n|\ud835\udc72|  \ud835\udc82\ud835\udc85\ud835\udc8b(\ud835\udc72) \n|\ud835\udc3e| = \u2308\n6\n24\n1\n13\n16\n10\n20\n17\n15\n\u2309 \n    \n      = 6 (16*15 \u2013 17*10) \u2013 24(13*15 \u2013 20*10) + 1(13*17 \u2013 20*16) \n      = 6 (240-170) \u2013 24(195-200) +1(221-320) \n      = 6(70) -24(-5) +1(-99) \n      = 420 + 120 \u2013 99 \n      = 441 \n\ud835\udc82\ud835\udc85\ud835\udc8b(\ud835\udc72) \n \nK = \u2308\n6\n24\n1\n13\n16\n10\n20\n17\n15\n\u2309 \n \n KT = \u2308\n6\n13\n20\n24\n16\n17\n1\n10\n15\n\u2309 \n     \n       = \u2308\n16 \u221715 \u221210 \u221717\n\u2212(24 \u221715 \u22121 \u221717)\n24 \u221710 \u22121 \u221716\n\u2212(13 \u221715 \u221210 \u221720)\n6 \u221715 \u22121 \u221720\n\u2212(6 \u221710 \u22121 \u221713)\n13 \u221717 \u221216 \u221720\n\u2212(6 \u221717 \u221224 \u221720)\n(6 \u221716 \u221224 \u221713)\n\u2309 \n \nadj(K)   =  \u2308\n70\n\u2212343\n224\n5\n70\n\u221247\n\u221299\n378\n\u2212216\n\u2309", "chunk_id": "56a2cc3e-2fdb-4421-8e82-f0c7254725c5", "chroma:document": "\u2212(24 \u221715 \u22121 \u221717)\n24 \u221710 \u22121 \u221716\n\u2212(13 \u221715 \u221210 \u221720)\n6 \u221715 \u22121 \u221720\n\u2212(6 \u221710 \u22121 \u221713)\n13 \u221717 \u221216 \u221720\n\u2212(6 \u221717 \u221224 \u221720)\n(6 \u221716 \u221224 \u221713)\n\u2309 \n \nadj(K)   =  \u2308\n70\n\u2212343\n224\n5\n70\n\u221247\n\u221299\n378\n\u2212216\n\u2309"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 09febd73-c8f0-4be0-8897-b6f0a8e9b894
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 27, "full_page_content": "28 \n \n \nPlain Text = K-1 * C mod 26 \n \n \nK-1     =\n1\n441  \u2308\n70\n\u2212343\n224\n5\n70\n\u221247\n\u221299\n378\n\u2212216\n\u2309 \n \nP = \n1\n441  \u2308\n70\n\u2212343\n224\n5\n70\n\u221247\n\u221299\n378\n\u2212216\n\u2309\u2217\u2308\n15\n14\n7\n\u2309 mod 26 \n \n    =  \n1\n441  \u2308\n\u22122184\n726\n2295\n\u2309 mod 26 \n \n \nMultiplicative inverse for \n1\n441 \n \n441 *1 mod 26 = 25 \n\u2026 \n441 *25 mod 26 =1 \nAns : 25 \n \n= 25  \u2308\n\u22122184\n726\n2295\n\u2309 mod 26", "chunk_id": "fd1b8b41-fb49-4004-b757-e7f69e182cfc", "chroma:document": "28 \n \n \nPlain Text = K-1 * C mod 26 \n \n \nK-1     =\n1\n441  \u2308\n70\n\u2212343\n224\n5\n70\n\u221247\n\u221299\n378\n\u2212216\n\u2309 \n \nP = \n1\n441  \u2308\n70\n\u2212343\n224\n5\n70\n\u221247\n\u221299\n378\n\u2212216\n\u2309\u2217\u2308\n15\n14\n7\n\u2309 mod 26 \n \n    =  \n1\n441  \u2308\n\u22122184\n726\n2295\n\u2309 mod 26 \n \n \nMultiplicative inverse for \n1\n441 \n \n441 *1 mod 26 = 25 \n\u2026 \n441 *25 mod 26 =1 \nAns : 25 \n \n= 25  \u2308\n\u22122184\n726\n2295\n\u2309 mod 26"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 8dffe266-69e8-4559-9f27-caaec19335ea
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 28, "full_page_content": "29 \n \n= \u2308\n\u221254600\n18150\n57375\n\u2309 mod 26 \n\u2308\n0\n2\n19\n\u2309  = \u2308\n\ud835\udc34\n\ud835\udc36\n\ud835\udc47\n\u2309 \n \n1.12.4 One-Time Pad \n\u25aa It is an unbreakable cryptosystem. It represents the message as a sequence of 0s and 1s.  \n\u25aa This can be accomplished by writing all numbers in binary, for example, or by using ASCII. \nThe key is a random sequence of 0\u201fs and 1\u201fs of same length as the message. \n\u25aa Once a key is used, it is discarded and never used again. The system can be expressed as \nfollows: \n\u25aa Thus the cipher text is generated by performing the bitwise XOR of the plaintext and the \nkey. Decryption uses the same key.  \n\u25aa Because of the properties of XOR, decryption simply involves the same bitwise operation \n \n \nAdvantage: \n Encryption method is completely unbreakable for a ciphertext only attack. \n Disadvantages \n It requires a very long key which is expensive to produce and expensive to transmit. \n Once a key is used, it is dangerous to reuse it for a second message; any knowledge on the first \nmessage would give knowledge of the second. \n1.12.5 Monoalphabetic Ciphers \n\u2022 \nWith only 25 possible keys, the Caesar cipher is far from secure.", "chunk_id": "16657539-fbdc-4c01-95e6-e8b9859ae80c", "chroma:document": "29 \n \n= \u2308\n\u221254600\n18150\n57375\n\u2309 mod 26 \n\u2308\n0\n2\n19\n\u2309  = \u2308\n\ud835\udc34\n\ud835\udc36\n\ud835\udc47\n\u2309 \n \n1.12.4 One-Time Pad \n\u25aa It is an unbreakable cryptosystem. It represents the message as a sequence of 0s and 1s.  \n\u25aa This can be accomplished by writing all numbers in binary, for example, or by using ASCII. \nThe key is a random sequence of 0\u201fs and 1\u201fs of same length as the message."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: dac17d59-93f1-45bf-bbc3-b784f6375c18
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 28, "full_page_content": "29 \n \n= \u2308\n\u221254600\n18150\n57375\n\u2309 mod 26 \n\u2308\n0\n2\n19\n\u2309  = \u2308\n\ud835\udc34\n\ud835\udc36\n\ud835\udc47\n\u2309 \n \n1.12.4 One-Time Pad \n\u25aa It is an unbreakable cryptosystem. It represents the message as a sequence of 0s and 1s.  \n\u25aa This can be accomplished by writing all numbers in binary, for example, or by using ASCII. \nThe key is a random sequence of 0\u201fs and 1\u201fs of same length as the message. \n\u25aa Once a key is used, it is discarded and never used again. The system can be expressed as \nfollows: \n\u25aa Thus the cipher text is generated by performing the bitwise XOR of the plaintext and the \nkey. Decryption uses the same key.  \n\u25aa Because of the properties of XOR, decryption simply involves the same bitwise operation \n \n \nAdvantage: \n Encryption method is completely unbreakable for a ciphertext only attack. \n Disadvantages \n It requires a very long key which is expensive to produce and expensive to transmit. \n Once a key is used, it is dangerous to reuse it for a second message; any knowledge on the first \nmessage would give knowledge of the second. \n1.12.5 Monoalphabetic Ciphers \n\u2022 \nWith only 25 possible keys, the Caesar cipher is far from secure.", "chunk_id": "c8a6fe9f-f4d4-42ea-84f1-03a1b9ad96ae", "chroma:document": "\u25aa Once a key is used, it is discarded and never used again. The system can be expressed as \nfollows: \n\u25aa Thus the cipher text is generated by performing the bitwise XOR of the plaintext and the \nkey. Decryption uses the same key.  \n\u25aa Because of the properties of XOR, decryption simply involves the same bitwise operation \n \n \nAdvantage:"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: b1d1e082-56f3-42ff-95d7-ed0b73854715
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 28, "full_page_content": "29 \n \n= \u2308\n\u221254600\n18150\n57375\n\u2309 mod 26 \n\u2308\n0\n2\n19\n\u2309  = \u2308\n\ud835\udc34\n\ud835\udc36\n\ud835\udc47\n\u2309 \n \n1.12.4 One-Time Pad \n\u25aa It is an unbreakable cryptosystem. It represents the message as a sequence of 0s and 1s.  \n\u25aa This can be accomplished by writing all numbers in binary, for example, or by using ASCII. \nThe key is a random sequence of 0\u201fs and 1\u201fs of same length as the message. \n\u25aa Once a key is used, it is discarded and never used again. The system can be expressed as \nfollows: \n\u25aa Thus the cipher text is generated by performing the bitwise XOR of the plaintext and the \nkey. Decryption uses the same key.  \n\u25aa Because of the properties of XOR, decryption simply involves the same bitwise operation \n \n \nAdvantage: \n Encryption method is completely unbreakable for a ciphertext only attack. \n Disadvantages \n It requires a very long key which is expensive to produce and expensive to transmit. \n Once a key is used, it is dangerous to reuse it for a second message; any knowledge on the first \nmessage would give knowledge of the second. \n1.12.5 Monoalphabetic Ciphers \n\u2022 \nWith only 25 possible keys, the Caesar cipher is far from secure.", "chunk_id": "a502deeb-1543-4e52-8e9f-a5be34d3dfda", "chroma:document": "Advantage: \n Encryption method is completely unbreakable for a ciphertext only attack. \n Disadvantages \n It requires a very long key which is expensive to produce and expensive to transmit. \n Once a key is used, it is dangerous to reuse it for a second message; any knowledge on the first \nmessage would give knowledge of the second. \n1.12.5 Monoalphabetic Ciphers \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 1b715605-6a25-47d0-8f9a-c4e1f462b5d9
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 28, "full_page_content": "29 \n \n= \u2308\n\u221254600\n18150\n57375\n\u2309 mod 26 \n\u2308\n0\n2\n19\n\u2309  = \u2308\n\ud835\udc34\n\ud835\udc36\n\ud835\udc47\n\u2309 \n \n1.12.4 One-Time Pad \n\u25aa It is an unbreakable cryptosystem. It represents the message as a sequence of 0s and 1s.  \n\u25aa This can be accomplished by writing all numbers in binary, for example, or by using ASCII. \nThe key is a random sequence of 0\u201fs and 1\u201fs of same length as the message. \n\u25aa Once a key is used, it is discarded and never used again. The system can be expressed as \nfollows: \n\u25aa Thus the cipher text is generated by performing the bitwise XOR of the plaintext and the \nkey. Decryption uses the same key.  \n\u25aa Because of the properties of XOR, decryption simply involves the same bitwise operation \n \n \nAdvantage: \n Encryption method is completely unbreakable for a ciphertext only attack. \n Disadvantages \n It requires a very long key which is expensive to produce and expensive to transmit. \n Once a key is used, it is dangerous to reuse it for a second message; any knowledge on the first \nmessage would give knowledge of the second. \n1.12.5 Monoalphabetic Ciphers \n\u2022 \nWith only 25 possible keys, the Caesar cipher is far from secure.", "chunk_id": "ee41befe-9dd1-42b3-ad40-0eb5a7165135", "chroma:document": "\u2022 \nWith only 25 possible keys, the Caesar cipher is far from secure."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: bd975250-8a56-4cd1-8693-af8c35505d6d
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 29, "full_page_content": "30 \n \n\u2022 \nA dramatic increase in the key space can be achieved by allowing an arbitrary substitution. \n\u2022 \nA permutation of a finite set of elements is an ordered sequence of all the elements of, with \neach element appearing exactly once. For example, if, there are six permutations of : \n \n\u2022 \nIn general, there are ! permutations of a set of elements, because the first element can be \nchosen in one of n ways \n\u2022 \nIf, instead, the \u201ccipher\u201d line can be any permutation of the 26 alphabetic characters, then there \nare 26! or greater than   \n  possible keys. \n\u2022 \nThis is 10 orders of magnitude greater than the key space for DES and would seem to \neliminate brute-force techniques for cryptanalysis.  \n\u2022 \nSuch an approach is referred to as a monoalphabetic substitution cipher, because a single \ncipher alphabet (mapping from plain alphabet to cipher alphabet) is used per message. \n1.12.6 Polyalphabetic Ciphers \n\u2022 Vigenere Cipher is a method of encrypting alphabetic text. It uses a simple form \nof polyalphabetic substitution.  \n\u2022 A polyalphabetic cipher is any cipher based on substitution, using multiple substitution \nalphabets.  \n\u2022 The encryption of the original text is done using the Vigen\u00e8re square or Vigen\u00e8re table. \n\u2022 The table consists of the alphabets written out 26 times in different rows, each alphabet shifted \ncyclically to the left compared to the previous alphabet, corresponding to the 26 \npossible Caesar Ciphers. \n\u2022 At different points in the encryption process, the cipher uses a different alphabet from one of \nthe rows. \n\u2022 The alphabet used at each point depends on a repeating keyword. \n1.13 Transposition (Permutation) Ciphers \n\u27a2 Rearrange the letter order without altering the actual letters. \nRail Fence Cipher: \nMeet me after the toga party", "chunk_id": "aec03a73-42b2-4bed-be71-5416a8f4b5a2", "chroma:document": "30 \n \n\u2022 \nA dramatic increase in the key space can be achieved by allowing an arbitrary substitution. \n\u2022 \nA permutation of a finite set of elements is an ordered sequence of all the elements of, with \neach element appearing exactly once. For example, if, there are six permutations of : \n \n\u2022 \nIn general, there are ! permutations of a set of elements, because the first element can be"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: cfb9042f-be46-4274-bb1b-d61629deefd2
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 29, "full_page_content": "30 \n \n\u2022 \nA dramatic increase in the key space can be achieved by allowing an arbitrary substitution. \n\u2022 \nA permutation of a finite set of elements is an ordered sequence of all the elements of, with \neach element appearing exactly once. For example, if, there are six permutations of : \n \n\u2022 \nIn general, there are ! permutations of a set of elements, because the first element can be \nchosen in one of n ways \n\u2022 \nIf, instead, the \u201ccipher\u201d line can be any permutation of the 26 alphabetic characters, then there \nare 26! or greater than   \n  possible keys. \n\u2022 \nThis is 10 orders of magnitude greater than the key space for DES and would seem to \neliminate brute-force techniques for cryptanalysis.  \n\u2022 \nSuch an approach is referred to as a monoalphabetic substitution cipher, because a single \ncipher alphabet (mapping from plain alphabet to cipher alphabet) is used per message. \n1.12.6 Polyalphabetic Ciphers \n\u2022 Vigenere Cipher is a method of encrypting alphabetic text. It uses a simple form \nof polyalphabetic substitution.  \n\u2022 A polyalphabetic cipher is any cipher based on substitution, using multiple substitution \nalphabets.  \n\u2022 The encryption of the original text is done using the Vigen\u00e8re square or Vigen\u00e8re table. \n\u2022 The table consists of the alphabets written out 26 times in different rows, each alphabet shifted \ncyclically to the left compared to the previous alphabet, corresponding to the 26 \npossible Caesar Ciphers. \n\u2022 At different points in the encryption process, the cipher uses a different alphabet from one of \nthe rows. \n\u2022 The alphabet used at each point depends on a repeating keyword. \n1.13 Transposition (Permutation) Ciphers \n\u27a2 Rearrange the letter order without altering the actual letters. \nRail Fence Cipher: \nMeet me after the toga party", "chunk_id": "07440937-79df-4ff9-8065-8f45bf9388c6", "chroma:document": "chosen in one of n ways \n\u2022 \nIf, instead, the \u201ccipher\u201d line can be any permutation of the 26 alphabetic characters, then there \nare 26! or greater than   \n  possible keys. \n\u2022 \nThis is 10 orders of magnitude greater than the key space for DES and would seem to \neliminate brute-force techniques for cryptanalysis.  \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 6f2f921a-2a59-494a-a456-69a00b51ab18
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 29, "full_page_content": "30 \n \n\u2022 \nA dramatic increase in the key space can be achieved by allowing an arbitrary substitution. \n\u2022 \nA permutation of a finite set of elements is an ordered sequence of all the elements of, with \neach element appearing exactly once. For example, if, there are six permutations of : \n \n\u2022 \nIn general, there are ! permutations of a set of elements, because the first element can be \nchosen in one of n ways \n\u2022 \nIf, instead, the \u201ccipher\u201d line can be any permutation of the 26 alphabetic characters, then there \nare 26! or greater than   \n  possible keys. \n\u2022 \nThis is 10 orders of magnitude greater than the key space for DES and would seem to \neliminate brute-force techniques for cryptanalysis.  \n\u2022 \nSuch an approach is referred to as a monoalphabetic substitution cipher, because a single \ncipher alphabet (mapping from plain alphabet to cipher alphabet) is used per message. \n1.12.6 Polyalphabetic Ciphers \n\u2022 Vigenere Cipher is a method of encrypting alphabetic text. It uses a simple form \nof polyalphabetic substitution.  \n\u2022 A polyalphabetic cipher is any cipher based on substitution, using multiple substitution \nalphabets.  \n\u2022 The encryption of the original text is done using the Vigen\u00e8re square or Vigen\u00e8re table. \n\u2022 The table consists of the alphabets written out 26 times in different rows, each alphabet shifted \ncyclically to the left compared to the previous alphabet, corresponding to the 26 \npossible Caesar Ciphers. \n\u2022 At different points in the encryption process, the cipher uses a different alphabet from one of \nthe rows. \n\u2022 The alphabet used at each point depends on a repeating keyword. \n1.13 Transposition (Permutation) Ciphers \n\u27a2 Rearrange the letter order without altering the actual letters. \nRail Fence Cipher: \nMeet me after the toga party", "chunk_id": "af5d5409-97e8-42a7-a380-852fccce8cd5", "chroma:document": "\u2022 \nSuch an approach is referred to as a monoalphabetic substitution cipher, because a single \ncipher alphabet (mapping from plain alphabet to cipher alphabet) is used per message. \n1.12.6 Polyalphabetic Ciphers \n\u2022 Vigenere Cipher is a method of encrypting alphabetic text. It uses a simple form \nof polyalphabetic substitution."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 50849454-ca34-4f59-b092-c04699e28bfc
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 29, "full_page_content": "30 \n \n\u2022 \nA dramatic increase in the key space can be achieved by allowing an arbitrary substitution. \n\u2022 \nA permutation of a finite set of elements is an ordered sequence of all the elements of, with \neach element appearing exactly once. For example, if, there are six permutations of : \n \n\u2022 \nIn general, there are ! permutations of a set of elements, because the first element can be \nchosen in one of n ways \n\u2022 \nIf, instead, the \u201ccipher\u201d line can be any permutation of the 26 alphabetic characters, then there \nare 26! or greater than   \n  possible keys. \n\u2022 \nThis is 10 orders of magnitude greater than the key space for DES and would seem to \neliminate brute-force techniques for cryptanalysis.  \n\u2022 \nSuch an approach is referred to as a monoalphabetic substitution cipher, because a single \ncipher alphabet (mapping from plain alphabet to cipher alphabet) is used per message. \n1.12.6 Polyalphabetic Ciphers \n\u2022 Vigenere Cipher is a method of encrypting alphabetic text. It uses a simple form \nof polyalphabetic substitution.  \n\u2022 A polyalphabetic cipher is any cipher based on substitution, using multiple substitution \nalphabets.  \n\u2022 The encryption of the original text is done using the Vigen\u00e8re square or Vigen\u00e8re table. \n\u2022 The table consists of the alphabets written out 26 times in different rows, each alphabet shifted \ncyclically to the left compared to the previous alphabet, corresponding to the 26 \npossible Caesar Ciphers. \n\u2022 At different points in the encryption process, the cipher uses a different alphabet from one of \nthe rows. \n\u2022 The alphabet used at each point depends on a repeating keyword. \n1.13 Transposition (Permutation) Ciphers \n\u27a2 Rearrange the letter order without altering the actual letters. \nRail Fence Cipher: \nMeet me after the toga party", "chunk_id": "991c5dbc-6800-4c47-8c27-ccd6c753b6d9", "chroma:document": "\u2022 A polyalphabetic cipher is any cipher based on substitution, using multiple substitution \nalphabets.  \n\u2022 The encryption of the original text is done using the Vigen\u00e8re square or Vigen\u00e8re table. \n\u2022 The table consists of the alphabets written out 26 times in different rows, each alphabet shifted \ncyclically to the left compared to the previous alphabet, corresponding to the 26"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 6f03b923-638b-4b24-905d-7284d286c938
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 29, "full_page_content": "30 \n \n\u2022 \nA dramatic increase in the key space can be achieved by allowing an arbitrary substitution. \n\u2022 \nA permutation of a finite set of elements is an ordered sequence of all the elements of, with \neach element appearing exactly once. For example, if, there are six permutations of : \n \n\u2022 \nIn general, there are ! permutations of a set of elements, because the first element can be \nchosen in one of n ways \n\u2022 \nIf, instead, the \u201ccipher\u201d line can be any permutation of the 26 alphabetic characters, then there \nare 26! or greater than   \n  possible keys. \n\u2022 \nThis is 10 orders of magnitude greater than the key space for DES and would seem to \neliminate brute-force techniques for cryptanalysis.  \n\u2022 \nSuch an approach is referred to as a monoalphabetic substitution cipher, because a single \ncipher alphabet (mapping from plain alphabet to cipher alphabet) is used per message. \n1.12.6 Polyalphabetic Ciphers \n\u2022 Vigenere Cipher is a method of encrypting alphabetic text. It uses a simple form \nof polyalphabetic substitution.  \n\u2022 A polyalphabetic cipher is any cipher based on substitution, using multiple substitution \nalphabets.  \n\u2022 The encryption of the original text is done using the Vigen\u00e8re square or Vigen\u00e8re table. \n\u2022 The table consists of the alphabets written out 26 times in different rows, each alphabet shifted \ncyclically to the left compared to the previous alphabet, corresponding to the 26 \npossible Caesar Ciphers. \n\u2022 At different points in the encryption process, the cipher uses a different alphabet from one of \nthe rows. \n\u2022 The alphabet used at each point depends on a repeating keyword. \n1.13 Transposition (Permutation) Ciphers \n\u27a2 Rearrange the letter order without altering the actual letters. \nRail Fence Cipher: \nMeet me after the toga party", "chunk_id": "c9573442-2544-437a-9c3d-caed84936800", "chroma:document": "possible Caesar Ciphers. \n\u2022 At different points in the encryption process, the cipher uses a different alphabet from one of \nthe rows. \n\u2022 The alphabet used at each point depends on a repeating keyword. \n1.13 Transposition (Permutation) Ciphers \n\u27a2 Rearrange the letter order without altering the actual letters. \nRail Fence Cipher: \nMeet me after the toga party"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 7c5b2643-36ab-4b43-986b-2df0fb61931a
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 30, "full_page_content": "31 \n \n\u27a2 Write message out diagonally as, \n \nCiphertext:  \nMEMATRHTGPRYETEFETEOAAT \nRow Transposition Ciphers: \nWrite letters in rows, reorder the columns according to the key before reading off .  \n\u2022 \nKey: 4312567 \n \nProduct Ciphers \n\u2751 Use several ciphers in succession to make harder, but: \n\u27a2 Two substitutions make a more complex substitution \n\u27a2 Two transpositions make more complex transposition \n\u27a2  But a substitution followed by a transposition makes a new much harder cipher \n\u2751 This is a bridge from classical to modern ciphers", "chunk_id": "7559f0e6-b46b-453e-afca-a6a8bc02e64f", "chroma:document": "31 \n \n\u27a2 Write message out diagonally as, \n \nCiphertext:  \nMEMATRHTGPRYETEFETEOAAT \nRow Transposition Ciphers: \nWrite letters in rows, reorder the columns according to the key before reading off .  \n\u2022 \nKey: 4312567 \n \nProduct Ciphers \n\u2751 Use several ciphers in succession to make harder, but: \n\u27a2 Two substitutions make a more complex substitution"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 808bc9da-47af-4941-b901-a74acea98599
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 30, "full_page_content": "31 \n \n\u27a2 Write message out diagonally as, \n \nCiphertext:  \nMEMATRHTGPRYETEFETEOAAT \nRow Transposition Ciphers: \nWrite letters in rows, reorder the columns according to the key before reading off .  \n\u2022 \nKey: 4312567 \n \nProduct Ciphers \n\u2751 Use several ciphers in succession to make harder, but: \n\u27a2 Two substitutions make a more complex substitution \n\u27a2 Two transpositions make more complex transposition \n\u27a2  But a substitution followed by a transposition makes a new much harder cipher \n\u2751 This is a bridge from classical to modern ciphers", "chunk_id": "f933e2ca-5ebd-48ef-b7d2-78bd953a7b0f", "chroma:document": "\u27a2 Two transpositions make more complex transposition \n\u27a2  But a substitution followed by a transposition makes a new much harder cipher \n\u2751 This is a bridge from classical to modern ciphers"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 6258012e-f430-4c32-9e41-30cd543319ba
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 31, "full_page_content": "32 \n \n \n1.14 Block Cipher Vs Stream Cipher \n\u2022 \nA stream cipher is one that encrypts a digital data stream one bit or one byte at a time. \nExamples of classical stream ciphers are the autokeyed Vigen\u00e8re cipher and the Vernam \ncipher. \n\u2022 \nA block cipher is one in which a block of plaintext is treated as a whole and used to \nproduce a ciphertext block of equal length. Typically, a block size of 64 or 128 bits is used. \nBlock Cipher \n\u2022 \nA block cipher is an encryption/decryption scheme in which a block of plaintext is treated \nas a whole and used to produce a ciphertext block of equal length. \n\u2022 \nMany block ciphers have a Feistel structure.  \n\u2022 \nSuch a structure consists of a number of identical rounds of processing.  \n\u2022 \nIn each round, a substitution is performed on one half of the data being processed, followed \nby a permutation that interchanges the two halves.  \n\u2022 \nThe original key is expanded so that a different key is used for each round.", "chunk_id": "f56512df-546a-4bc6-bd51-b6bdb96f2146", "chroma:document": "32 \n \n \n1.14 Block Cipher Vs Stream Cipher \n\u2022 \nA stream cipher is one that encrypts a digital data stream one bit or one byte at a time. \nExamples of classical stream ciphers are the autokeyed Vigen\u00e8re cipher and the Vernam \ncipher. \n\u2022 \nA block cipher is one in which a block of plaintext is treated as a whole and used to"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 87f58c06-8dd7-4efb-9a73-570c717a0b9a
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 31, "full_page_content": "32 \n \n \n1.14 Block Cipher Vs Stream Cipher \n\u2022 \nA stream cipher is one that encrypts a digital data stream one bit or one byte at a time. \nExamples of classical stream ciphers are the autokeyed Vigen\u00e8re cipher and the Vernam \ncipher. \n\u2022 \nA block cipher is one in which a block of plaintext is treated as a whole and used to \nproduce a ciphertext block of equal length. Typically, a block size of 64 or 128 bits is used. \nBlock Cipher \n\u2022 \nA block cipher is an encryption/decryption scheme in which a block of plaintext is treated \nas a whole and used to produce a ciphertext block of equal length. \n\u2022 \nMany block ciphers have a Feistel structure.  \n\u2022 \nSuch a structure consists of a number of identical rounds of processing.  \n\u2022 \nIn each round, a substitution is performed on one half of the data being processed, followed \nby a permutation that interchanges the two halves.  \n\u2022 \nThe original key is expanded so that a different key is used for each round.", "chunk_id": "7bcdff19-d89a-4d21-a3d3-1a776dcf3145", "chroma:document": "produce a ciphertext block of equal length. Typically, a block size of 64 or 128 bits is used. \nBlock Cipher \n\u2022 \nA block cipher is an encryption/decryption scheme in which a block of plaintext is treated \nas a whole and used to produce a ciphertext block of equal length. \n\u2022 \nMany block ciphers have a Feistel structure.  \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 6133d31d-7d63-41c7-b4e8-37b477317745
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 31, "full_page_content": "32 \n \n \n1.14 Block Cipher Vs Stream Cipher \n\u2022 \nA stream cipher is one that encrypts a digital data stream one bit or one byte at a time. \nExamples of classical stream ciphers are the autokeyed Vigen\u00e8re cipher and the Vernam \ncipher. \n\u2022 \nA block cipher is one in which a block of plaintext is treated as a whole and used to \nproduce a ciphertext block of equal length. Typically, a block size of 64 or 128 bits is used. \nBlock Cipher \n\u2022 \nA block cipher is an encryption/decryption scheme in which a block of plaintext is treated \nas a whole and used to produce a ciphertext block of equal length. \n\u2022 \nMany block ciphers have a Feistel structure.  \n\u2022 \nSuch a structure consists of a number of identical rounds of processing.  \n\u2022 \nIn each round, a substitution is performed on one half of the data being processed, followed \nby a permutation that interchanges the two halves.  \n\u2022 \nThe original key is expanded so that a different key is used for each round.", "chunk_id": "37305d54-ea88-435a-986a-fe0bab57e68a", "chroma:document": "\u2022 \nSuch a structure consists of a number of identical rounds of processing.  \n\u2022 \nIn each round, a substitution is performed on one half of the data being processed, followed \nby a permutation that interchanges the two halves.  \n\u2022 \nThe original key is expanded so that a different key is used for each round."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 663816a4-fa94-47dd-906c-29294f3eaf53
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 32, "full_page_content": "33 \n \n \nFig. 16 Stream Cipher \n \nFig. 17 Block Cipher \n1.15 Feistel Cipher Structure \n\u2022 \nA block cipher operates on a plaintext block of n bits to produce a ciphertext block of n bits. \nThere are 2n possible different plaintext blocks and, for the encryption to be reversible (i.e., \nfor decryption to be possible), each must produce a unique ciphertext block. Such a \ntransformation is called reversible, or nonsingular. \n\u2022 \nThe following examples illustrate nonsingular and singular transformations for n=2. \n \nFig. 18 Reversible vs Irreversible Mapping", "chunk_id": "e535ce14-ce16-484a-a96c-f71bb5ef090e", "chroma:document": "33 \n \n \nFig. 16 Stream Cipher \n \nFig. 17 Block Cipher \n1.15 Feistel Cipher Structure \n\u2022 \nA block cipher operates on a plaintext block of n bits to produce a ciphertext block of n bits. \nThere are 2n possible different plaintext blocks and, for the encryption to be reversible (i.e., \nfor decryption to be possible), each must produce a unique ciphertext block. Such a"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: eedcd749-ff68-413b-ba3b-1f7feb3e70ff
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 32, "full_page_content": "33 \n \n \nFig. 16 Stream Cipher \n \nFig. 17 Block Cipher \n1.15 Feistel Cipher Structure \n\u2022 \nA block cipher operates on a plaintext block of n bits to produce a ciphertext block of n bits. \nThere are 2n possible different plaintext blocks and, for the encryption to be reversible (i.e., \nfor decryption to be possible), each must produce a unique ciphertext block. Such a \ntransformation is called reversible, or nonsingular. \n\u2022 \nThe following examples illustrate nonsingular and singular transformations for n=2. \n \nFig. 18 Reversible vs Irreversible Mapping", "chunk_id": "d53724b9-7288-4545-a3a0-2cfde03fa99f", "chroma:document": "transformation is called reversible, or nonsingular. \n\u2022 \nThe following examples illustrate nonsingular and singular transformations for n=2. \n \nFig. 18 Reversible vs Irreversible Mapping"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 2a9a8ebb-06ee-433d-989e-210119a415a4
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 33, "full_page_content": "34 \n \n\u2022 \nFeistel proposed the use of a cipher that alternates substitutions and permutations, where \nthese terms are defined as follows: \n\u2022 \nSubstitution: Each plaintext element or group of elements is uniquely replaced by a \ncorresponding ciphertext element or group of elements. \n\u2022 \nPermutation: A sequence of plaintext elements is replaced by a permutation of that \nsequence. That is, no elements are added or deleted or replaced in the sequence, \nrather the order in which the elements appear in the sequence is changed \n\u2022 \nIn fact, Feistel\u2019s is a practical application of a proposal by Claude Shannon to develop a \nproduct cipher that alternates confusion and diffusion functions \n\u2022 \nThe terms diffusion and confusion were introduced by Claude Shannon to capture the two \nbasic building blocks for any cryptographic system. \n\u2022 \nIn diffusion, the statistical structure of the plaintext is dissipated into long-range statistics of \nthe ciphertext. This is achieved by having each plaintext digit affect the value of many \nciphertext digits; generally, this is equivalent to having each ciphertext digit be affected by \nmany plaintext digits. \n\u2022 \nconfusion seeks to make the relationship between the statistics of the ciphertext and the \nvalue of the encryption key as complex as possible, again to thwart attempts to discover the \nkey. \n\u2022 \nThe inputs to the encryption algorithm are a plaintext block of length 2W bits and a key. \n\u2022 \nThe plaintext block is divided into two halves, L0 and R0  \n\u2022 \nThe two halves of the data pass through rounds of processing and then combine to produce \nthe ciphertext block \n\u2022 \nEach round has as inputs Li-1 and Ri-1 derived from the previous round, as well as a subkey \nKi derived from the overall K. \n\u2022 \n16 rounds are used, although any number of rounds could be implemented. \n\u2022 \nA substitution is performed on the left half of the data. This is done by applying a round \nfunction F to the right half of the data and then taking the exclusive-OR of the output of that \nfunction and the left half of the data.", "chunk_id": "6c39c34c-1a9e-4bf4-9d76-8ee3179d05fe", "chroma:document": "34 \n \n\u2022 \nFeistel proposed the use of a cipher that alternates substitutions and permutations, where \nthese terms are defined as follows: \n\u2022 \nSubstitution: Each plaintext element or group of elements is uniquely replaced by a \ncorresponding ciphertext element or group of elements. \n\u2022 \nPermutation: A sequence of plaintext elements is replaced by a permutation of that"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: fa11921e-e77b-43ad-8705-60e6d5cd0d52
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 33, "full_page_content": "34 \n \n\u2022 \nFeistel proposed the use of a cipher that alternates substitutions and permutations, where \nthese terms are defined as follows: \n\u2022 \nSubstitution: Each plaintext element or group of elements is uniquely replaced by a \ncorresponding ciphertext element or group of elements. \n\u2022 \nPermutation: A sequence of plaintext elements is replaced by a permutation of that \nsequence. That is, no elements are added or deleted or replaced in the sequence, \nrather the order in which the elements appear in the sequence is changed \n\u2022 \nIn fact, Feistel\u2019s is a practical application of a proposal by Claude Shannon to develop a \nproduct cipher that alternates confusion and diffusion functions \n\u2022 \nThe terms diffusion and confusion were introduced by Claude Shannon to capture the two \nbasic building blocks for any cryptographic system. \n\u2022 \nIn diffusion, the statistical structure of the plaintext is dissipated into long-range statistics of \nthe ciphertext. This is achieved by having each plaintext digit affect the value of many \nciphertext digits; generally, this is equivalent to having each ciphertext digit be affected by \nmany plaintext digits. \n\u2022 \nconfusion seeks to make the relationship between the statistics of the ciphertext and the \nvalue of the encryption key as complex as possible, again to thwart attempts to discover the \nkey. \n\u2022 \nThe inputs to the encryption algorithm are a plaintext block of length 2W bits and a key. \n\u2022 \nThe plaintext block is divided into two halves, L0 and R0  \n\u2022 \nThe two halves of the data pass through rounds of processing and then combine to produce \nthe ciphertext block \n\u2022 \nEach round has as inputs Li-1 and Ri-1 derived from the previous round, as well as a subkey \nKi derived from the overall K. \n\u2022 \n16 rounds are used, although any number of rounds could be implemented. \n\u2022 \nA substitution is performed on the left half of the data. This is done by applying a round \nfunction F to the right half of the data and then taking the exclusive-OR of the output of that \nfunction and the left half of the data.", "chunk_id": "17a32b92-d824-42ca-a747-20088bbc2c96", "chroma:document": "sequence. That is, no elements are added or deleted or replaced in the sequence, \nrather the order in which the elements appear in the sequence is changed \n\u2022 \nIn fact, Feistel\u2019s is a practical application of a proposal by Claude Shannon to develop a \nproduct cipher that alternates confusion and diffusion functions \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: bcc5a83e-e2f6-422e-bf16-eae2dc8f15bb
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 33, "full_page_content": "34 \n \n\u2022 \nFeistel proposed the use of a cipher that alternates substitutions and permutations, where \nthese terms are defined as follows: \n\u2022 \nSubstitution: Each plaintext element or group of elements is uniquely replaced by a \ncorresponding ciphertext element or group of elements. \n\u2022 \nPermutation: A sequence of plaintext elements is replaced by a permutation of that \nsequence. That is, no elements are added or deleted or replaced in the sequence, \nrather the order in which the elements appear in the sequence is changed \n\u2022 \nIn fact, Feistel\u2019s is a practical application of a proposal by Claude Shannon to develop a \nproduct cipher that alternates confusion and diffusion functions \n\u2022 \nThe terms diffusion and confusion were introduced by Claude Shannon to capture the two \nbasic building blocks for any cryptographic system. \n\u2022 \nIn diffusion, the statistical structure of the plaintext is dissipated into long-range statistics of \nthe ciphertext. This is achieved by having each plaintext digit affect the value of many \nciphertext digits; generally, this is equivalent to having each ciphertext digit be affected by \nmany plaintext digits. \n\u2022 \nconfusion seeks to make the relationship between the statistics of the ciphertext and the \nvalue of the encryption key as complex as possible, again to thwart attempts to discover the \nkey. \n\u2022 \nThe inputs to the encryption algorithm are a plaintext block of length 2W bits and a key. \n\u2022 \nThe plaintext block is divided into two halves, L0 and R0  \n\u2022 \nThe two halves of the data pass through rounds of processing and then combine to produce \nthe ciphertext block \n\u2022 \nEach round has as inputs Li-1 and Ri-1 derived from the previous round, as well as a subkey \nKi derived from the overall K. \n\u2022 \n16 rounds are used, although any number of rounds could be implemented. \n\u2022 \nA substitution is performed on the left half of the data. This is done by applying a round \nfunction F to the right half of the data and then taking the exclusive-OR of the output of that \nfunction and the left half of the data.", "chunk_id": "500e40bf-cf1f-42de-8ba8-3e8aee8cda85", "chroma:document": "\u2022 \nThe terms diffusion and confusion were introduced by Claude Shannon to capture the two \nbasic building blocks for any cryptographic system. \n\u2022 \nIn diffusion, the statistical structure of the plaintext is dissipated into long-range statistics of \nthe ciphertext. This is achieved by having each plaintext digit affect the value of many"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 0139f65e-bc9a-4939-9116-dac43d34e406
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 33, "full_page_content": "34 \n \n\u2022 \nFeistel proposed the use of a cipher that alternates substitutions and permutations, where \nthese terms are defined as follows: \n\u2022 \nSubstitution: Each plaintext element or group of elements is uniquely replaced by a \ncorresponding ciphertext element or group of elements. \n\u2022 \nPermutation: A sequence of plaintext elements is replaced by a permutation of that \nsequence. That is, no elements are added or deleted or replaced in the sequence, \nrather the order in which the elements appear in the sequence is changed \n\u2022 \nIn fact, Feistel\u2019s is a practical application of a proposal by Claude Shannon to develop a \nproduct cipher that alternates confusion and diffusion functions \n\u2022 \nThe terms diffusion and confusion were introduced by Claude Shannon to capture the two \nbasic building blocks for any cryptographic system. \n\u2022 \nIn diffusion, the statistical structure of the plaintext is dissipated into long-range statistics of \nthe ciphertext. This is achieved by having each plaintext digit affect the value of many \nciphertext digits; generally, this is equivalent to having each ciphertext digit be affected by \nmany plaintext digits. \n\u2022 \nconfusion seeks to make the relationship between the statistics of the ciphertext and the \nvalue of the encryption key as complex as possible, again to thwart attempts to discover the \nkey. \n\u2022 \nThe inputs to the encryption algorithm are a plaintext block of length 2W bits and a key. \n\u2022 \nThe plaintext block is divided into two halves, L0 and R0  \n\u2022 \nThe two halves of the data pass through rounds of processing and then combine to produce \nthe ciphertext block \n\u2022 \nEach round has as inputs Li-1 and Ri-1 derived from the previous round, as well as a subkey \nKi derived from the overall K. \n\u2022 \n16 rounds are used, although any number of rounds could be implemented. \n\u2022 \nA substitution is performed on the left half of the data. This is done by applying a round \nfunction F to the right half of the data and then taking the exclusive-OR of the output of that \nfunction and the left half of the data.", "chunk_id": "7f7e3d1b-e67c-4ae3-b9c7-0b678ddb92e7", "chroma:document": "ciphertext digits; generally, this is equivalent to having each ciphertext digit be affected by \nmany plaintext digits. \n\u2022 \nconfusion seeks to make the relationship between the statistics of the ciphertext and the \nvalue of the encryption key as complex as possible, again to thwart attempts to discover the \nkey. \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 47f6bb7d-c0da-4b65-9973-ed060a1e8605
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 33, "full_page_content": "34 \n \n\u2022 \nFeistel proposed the use of a cipher that alternates substitutions and permutations, where \nthese terms are defined as follows: \n\u2022 \nSubstitution: Each plaintext element or group of elements is uniquely replaced by a \ncorresponding ciphertext element or group of elements. \n\u2022 \nPermutation: A sequence of plaintext elements is replaced by a permutation of that \nsequence. That is, no elements are added or deleted or replaced in the sequence, \nrather the order in which the elements appear in the sequence is changed \n\u2022 \nIn fact, Feistel\u2019s is a practical application of a proposal by Claude Shannon to develop a \nproduct cipher that alternates confusion and diffusion functions \n\u2022 \nThe terms diffusion and confusion were introduced by Claude Shannon to capture the two \nbasic building blocks for any cryptographic system. \n\u2022 \nIn diffusion, the statistical structure of the plaintext is dissipated into long-range statistics of \nthe ciphertext. This is achieved by having each plaintext digit affect the value of many \nciphertext digits; generally, this is equivalent to having each ciphertext digit be affected by \nmany plaintext digits. \n\u2022 \nconfusion seeks to make the relationship between the statistics of the ciphertext and the \nvalue of the encryption key as complex as possible, again to thwart attempts to discover the \nkey. \n\u2022 \nThe inputs to the encryption algorithm are a plaintext block of length 2W bits and a key. \n\u2022 \nThe plaintext block is divided into two halves, L0 and R0  \n\u2022 \nThe two halves of the data pass through rounds of processing and then combine to produce \nthe ciphertext block \n\u2022 \nEach round has as inputs Li-1 and Ri-1 derived from the previous round, as well as a subkey \nKi derived from the overall K. \n\u2022 \n16 rounds are used, although any number of rounds could be implemented. \n\u2022 \nA substitution is performed on the left half of the data. This is done by applying a round \nfunction F to the right half of the data and then taking the exclusive-OR of the output of that \nfunction and the left half of the data.", "chunk_id": "9a4a25da-d16b-4997-a720-fbdbb630fb74", "chroma:document": "key. \n\u2022 \nThe inputs to the encryption algorithm are a plaintext block of length 2W bits and a key. \n\u2022 \nThe plaintext block is divided into two halves, L0 and R0  \n\u2022 \nThe two halves of the data pass through rounds of processing and then combine to produce \nthe ciphertext block \n\u2022 \nEach round has as inputs Li-1 and Ri-1 derived from the previous round, as well as a subkey"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: f3a73443-1330-4913-963a-5229b5da3f3b
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 33, "full_page_content": "34 \n \n\u2022 \nFeistel proposed the use of a cipher that alternates substitutions and permutations, where \nthese terms are defined as follows: \n\u2022 \nSubstitution: Each plaintext element or group of elements is uniquely replaced by a \ncorresponding ciphertext element or group of elements. \n\u2022 \nPermutation: A sequence of plaintext elements is replaced by a permutation of that \nsequence. That is, no elements are added or deleted or replaced in the sequence, \nrather the order in which the elements appear in the sequence is changed \n\u2022 \nIn fact, Feistel\u2019s is a practical application of a proposal by Claude Shannon to develop a \nproduct cipher that alternates confusion and diffusion functions \n\u2022 \nThe terms diffusion and confusion were introduced by Claude Shannon to capture the two \nbasic building blocks for any cryptographic system. \n\u2022 \nIn diffusion, the statistical structure of the plaintext is dissipated into long-range statistics of \nthe ciphertext. This is achieved by having each plaintext digit affect the value of many \nciphertext digits; generally, this is equivalent to having each ciphertext digit be affected by \nmany plaintext digits. \n\u2022 \nconfusion seeks to make the relationship between the statistics of the ciphertext and the \nvalue of the encryption key as complex as possible, again to thwart attempts to discover the \nkey. \n\u2022 \nThe inputs to the encryption algorithm are a plaintext block of length 2W bits and a key. \n\u2022 \nThe plaintext block is divided into two halves, L0 and R0  \n\u2022 \nThe two halves of the data pass through rounds of processing and then combine to produce \nthe ciphertext block \n\u2022 \nEach round has as inputs Li-1 and Ri-1 derived from the previous round, as well as a subkey \nKi derived from the overall K. \n\u2022 \n16 rounds are used, although any number of rounds could be implemented. \n\u2022 \nA substitution is performed on the left half of the data. This is done by applying a round \nfunction F to the right half of the data and then taking the exclusive-OR of the output of that \nfunction and the left half of the data.", "chunk_id": "5117ffb8-474d-496c-840a-a74651479a51", "chroma:document": "Ki derived from the overall K. \n\u2022 \n16 rounds are used, although any number of rounds could be implemented. \n\u2022 \nA substitution is performed on the left half of the data. This is done by applying a round \nfunction F to the right half of the data and then taking the exclusive-OR of the output of that \nfunction and the left half of the data."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: dd5c7e06-d548-4700-b8a3-c10c98bd11af
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 34, "full_page_content": "35 \n \n\u2022 \nPermutation is performed that consists of the interchange of the two halves of the data \n\u2022 \nThis structure is a particular form of the substitution-permutation network (SPN) proposed \nby Shannon \n \nFig.18 Fiestel Cipher Structure \nDesign Features \n\u2022 \nThe exact realization of a Feistel network depends on the choice of the following parameters \nand design features: \n\u2022 \nBlock size: Larger block sizes mean greater security (all other things being equal) but reduced \nencryption/decryption speed for a given algorithm \n\u2022 \nKey size: Larger key size means greater security but may decrease encryption/ decryption \nspeed.", "chunk_id": "1fc9107b-17d4-4e54-9e84-5cc2d9b999fb", "chroma:document": "35 \n \n\u2022 \nPermutation is performed that consists of the interchange of the two halves of the data \n\u2022 \nThis structure is a particular form of the substitution-permutation network (SPN) proposed \nby Shannon \n \nFig.18 Fiestel Cipher Structure \nDesign Features \n\u2022 \nThe exact realization of a Feistel network depends on the choice of the following parameters \nand design features: \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 4276316e-b5f8-4f26-b75e-bca4577aad50
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 34, "full_page_content": "35 \n \n\u2022 \nPermutation is performed that consists of the interchange of the two halves of the data \n\u2022 \nThis structure is a particular form of the substitution-permutation network (SPN) proposed \nby Shannon \n \nFig.18 Fiestel Cipher Structure \nDesign Features \n\u2022 \nThe exact realization of a Feistel network depends on the choice of the following parameters \nand design features: \n\u2022 \nBlock size: Larger block sizes mean greater security (all other things being equal) but reduced \nencryption/decryption speed for a given algorithm \n\u2022 \nKey size: Larger key size means greater security but may decrease encryption/ decryption \nspeed.", "chunk_id": "9c1adb7e-d09b-47ef-bd9d-f440f68b3b7e", "chroma:document": "\u2022 \nBlock size: Larger block sizes mean greater security (all other things being equal) but reduced \nencryption/decryption speed for a given algorithm \n\u2022 \nKey size: Larger key size means greater security but may decrease encryption/ decryption \nspeed."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 3494d0b3-f5ae-45c6-a4f7-1f0f3f9b9df1
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 35, "full_page_content": "36 \n \n\u2022 \nNumber of rounds: The essence of the Feistel cipher is that a single round offers inadequate \nsecurity but that multiple rounds offer increasing security. A typical size is 16 rounds. \n\u2022 \nSubkey generation algorithm: Greater complexity in this algorithm should lead to greater \ndifficulty of cryptanalysis. \n\u2022 \nRound function F: Again, greater complexity generally means greater resistance to \ncryptanalysis. \nFeistel Decryption Algorithm \n\u2022 \nThe process of decryption with a Feistel cipher is essentially the same as the encryption \nprocess.  \n\u2022 \nThe rule is as follows:  \n\u2022 \nUse the ciphertext as input to the algorithm, but use the subkeys Ki  in reverse order. \n1.16 Data Encryption Standard (DES) \n\u2022 \nThe Data Encryption Standard (DES) has been the most widely used symmetric encryption \nalgorithm until recently. It exhibits the classic Feistel structure.  \n\u2022 \nDES uses a 64-bit block and a 56-bit key. \n\u2022 \nTwo important methods of cryptanalysis are differential cryptanalysis and linear \ncryptanalysis.  \n\u2022 \nDES has been shown to be highly resistant to these two types of attack. \nDES Encryption \n\u2022 \nAs with any encryption scheme, there are two inputs to the encryption function: the plaintext \nto be encrypted and the key. In this case, the plaintext must be 64 bits in length and the key is \n56 bits in length. \n\u2022 \nWith the exception of the initial and final permutations, DES has the exact structure of a \nFeistel cipher,", "chunk_id": "860c7aab-eaf2-4ebd-8f6d-fae9e6e39d4e", "chroma:document": "36 \n \n\u2022 \nNumber of rounds: The essence of the Feistel cipher is that a single round offers inadequate \nsecurity but that multiple rounds offer increasing security. A typical size is 16 rounds. \n\u2022 \nSubkey generation algorithm: Greater complexity in this algorithm should lead to greater \ndifficulty of cryptanalysis. \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: e9febcb8-67c4-49c0-a2e1-396784881815
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 35, "full_page_content": "36 \n \n\u2022 \nNumber of rounds: The essence of the Feistel cipher is that a single round offers inadequate \nsecurity but that multiple rounds offer increasing security. A typical size is 16 rounds. \n\u2022 \nSubkey generation algorithm: Greater complexity in this algorithm should lead to greater \ndifficulty of cryptanalysis. \n\u2022 \nRound function F: Again, greater complexity generally means greater resistance to \ncryptanalysis. \nFeistel Decryption Algorithm \n\u2022 \nThe process of decryption with a Feistel cipher is essentially the same as the encryption \nprocess.  \n\u2022 \nThe rule is as follows:  \n\u2022 \nUse the ciphertext as input to the algorithm, but use the subkeys Ki  in reverse order. \n1.16 Data Encryption Standard (DES) \n\u2022 \nThe Data Encryption Standard (DES) has been the most widely used symmetric encryption \nalgorithm until recently. It exhibits the classic Feistel structure.  \n\u2022 \nDES uses a 64-bit block and a 56-bit key. \n\u2022 \nTwo important methods of cryptanalysis are differential cryptanalysis and linear \ncryptanalysis.  \n\u2022 \nDES has been shown to be highly resistant to these two types of attack. \nDES Encryption \n\u2022 \nAs with any encryption scheme, there are two inputs to the encryption function: the plaintext \nto be encrypted and the key. In this case, the plaintext must be 64 bits in length and the key is \n56 bits in length. \n\u2022 \nWith the exception of the initial and final permutations, DES has the exact structure of a \nFeistel cipher,", "chunk_id": "26876ff3-d6c7-4353-8427-6c7f082cb662", "chroma:document": "\u2022 \nRound function F: Again, greater complexity generally means greater resistance to \ncryptanalysis. \nFeistel Decryption Algorithm \n\u2022 \nThe process of decryption with a Feistel cipher is essentially the same as the encryption \nprocess.  \n\u2022 \nThe rule is as follows:  \n\u2022 \nUse the ciphertext as input to the algorithm, but use the subkeys Ki  in reverse order."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 698078d8-ddbb-46f6-876f-8f1755d02c3e
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 35, "full_page_content": "36 \n \n\u2022 \nNumber of rounds: The essence of the Feistel cipher is that a single round offers inadequate \nsecurity but that multiple rounds offer increasing security. A typical size is 16 rounds. \n\u2022 \nSubkey generation algorithm: Greater complexity in this algorithm should lead to greater \ndifficulty of cryptanalysis. \n\u2022 \nRound function F: Again, greater complexity generally means greater resistance to \ncryptanalysis. \nFeistel Decryption Algorithm \n\u2022 \nThe process of decryption with a Feistel cipher is essentially the same as the encryption \nprocess.  \n\u2022 \nThe rule is as follows:  \n\u2022 \nUse the ciphertext as input to the algorithm, but use the subkeys Ki  in reverse order. \n1.16 Data Encryption Standard (DES) \n\u2022 \nThe Data Encryption Standard (DES) has been the most widely used symmetric encryption \nalgorithm until recently. It exhibits the classic Feistel structure.  \n\u2022 \nDES uses a 64-bit block and a 56-bit key. \n\u2022 \nTwo important methods of cryptanalysis are differential cryptanalysis and linear \ncryptanalysis.  \n\u2022 \nDES has been shown to be highly resistant to these two types of attack. \nDES Encryption \n\u2022 \nAs with any encryption scheme, there are two inputs to the encryption function: the plaintext \nto be encrypted and the key. In this case, the plaintext must be 64 bits in length and the key is \n56 bits in length. \n\u2022 \nWith the exception of the initial and final permutations, DES has the exact structure of a \nFeistel cipher,", "chunk_id": "a978b82d-e6cf-4ce1-a01a-06ca1fb7f775", "chroma:document": "1.16 Data Encryption Standard (DES) \n\u2022 \nThe Data Encryption Standard (DES) has been the most widely used symmetric encryption \nalgorithm until recently. It exhibits the classic Feistel structure.  \n\u2022 \nDES uses a 64-bit block and a 56-bit key. \n\u2022 \nTwo important methods of cryptanalysis are differential cryptanalysis and linear \ncryptanalysis.  \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: c7cced9a-1cf6-4ac3-adfc-89258379138f
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 35, "full_page_content": "36 \n \n\u2022 \nNumber of rounds: The essence of the Feistel cipher is that a single round offers inadequate \nsecurity but that multiple rounds offer increasing security. A typical size is 16 rounds. \n\u2022 \nSubkey generation algorithm: Greater complexity in this algorithm should lead to greater \ndifficulty of cryptanalysis. \n\u2022 \nRound function F: Again, greater complexity generally means greater resistance to \ncryptanalysis. \nFeistel Decryption Algorithm \n\u2022 \nThe process of decryption with a Feistel cipher is essentially the same as the encryption \nprocess.  \n\u2022 \nThe rule is as follows:  \n\u2022 \nUse the ciphertext as input to the algorithm, but use the subkeys Ki  in reverse order. \n1.16 Data Encryption Standard (DES) \n\u2022 \nThe Data Encryption Standard (DES) has been the most widely used symmetric encryption \nalgorithm until recently. It exhibits the classic Feistel structure.  \n\u2022 \nDES uses a 64-bit block and a 56-bit key. \n\u2022 \nTwo important methods of cryptanalysis are differential cryptanalysis and linear \ncryptanalysis.  \n\u2022 \nDES has been shown to be highly resistant to these two types of attack. \nDES Encryption \n\u2022 \nAs with any encryption scheme, there are two inputs to the encryption function: the plaintext \nto be encrypted and the key. In this case, the plaintext must be 64 bits in length and the key is \n56 bits in length. \n\u2022 \nWith the exception of the initial and final permutations, DES has the exact structure of a \nFeistel cipher,", "chunk_id": "fe2dd200-38a9-446d-9e7d-7abc64a49729", "chroma:document": "cryptanalysis.  \n\u2022 \nDES has been shown to be highly resistant to these two types of attack. \nDES Encryption \n\u2022 \nAs with any encryption scheme, there are two inputs to the encryption function: the plaintext \nto be encrypted and the key. In this case, the plaintext must be 64 bits in length and the key is \n56 bits in length. \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: ccc2521c-250b-43d4-ac01-c5909835b6dd
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 35, "full_page_content": "36 \n \n\u2022 \nNumber of rounds: The essence of the Feistel cipher is that a single round offers inadequate \nsecurity but that multiple rounds offer increasing security. A typical size is 16 rounds. \n\u2022 \nSubkey generation algorithm: Greater complexity in this algorithm should lead to greater \ndifficulty of cryptanalysis. \n\u2022 \nRound function F: Again, greater complexity generally means greater resistance to \ncryptanalysis. \nFeistel Decryption Algorithm \n\u2022 \nThe process of decryption with a Feistel cipher is essentially the same as the encryption \nprocess.  \n\u2022 \nThe rule is as follows:  \n\u2022 \nUse the ciphertext as input to the algorithm, but use the subkeys Ki  in reverse order. \n1.16 Data Encryption Standard (DES) \n\u2022 \nThe Data Encryption Standard (DES) has been the most widely used symmetric encryption \nalgorithm until recently. It exhibits the classic Feistel structure.  \n\u2022 \nDES uses a 64-bit block and a 56-bit key. \n\u2022 \nTwo important methods of cryptanalysis are differential cryptanalysis and linear \ncryptanalysis.  \n\u2022 \nDES has been shown to be highly resistant to these two types of attack. \nDES Encryption \n\u2022 \nAs with any encryption scheme, there are two inputs to the encryption function: the plaintext \nto be encrypted and the key. In this case, the plaintext must be 64 bits in length and the key is \n56 bits in length. \n\u2022 \nWith the exception of the initial and final permutations, DES has the exact structure of a \nFeistel cipher,", "chunk_id": "8d6ebf9a-835a-4389-87fe-cfa41d87a84b", "chroma:document": "\u2022 \nWith the exception of the initial and final permutations, DES has the exact structure of a \nFeistel cipher,"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 6d09fcc7-89fe-4285-b942-ad228223a6aa
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 36, "full_page_content": "37 \n \n \nFig. 19 Data Encryption Standard \nSingle Round of DES Algorithm \n \nFig. 20 Single Round of DES Algorithm", "chunk_id": "0598ef09-3e2b-48a9-885b-241af64eb9b5", "chroma:document": "37 \n \n \nFig. 19 Data Encryption Standard \nSingle Round of DES Algorithm \n \nFig. 20 Single Round of DES Algorithm"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 0af36b6e-4aaf-4eb7-8b32-be13f40bc4c5
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 37, "full_page_content": "38", "chunk_id": "8edf4b2c-cfef-4922-b04b-aeeb1b227e46", "chroma:document": "38"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 6e43fb6c-361d-44d0-b1b4-132eb085c684
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 38, "full_page_content": "39 \n \n \n \n \n \nFig. 21 Calculation of F(R,K)", "chunk_id": "e5b9e94f-33f3-428d-9d3f-e910fbdac024", "chroma:document": "39 \n \n \n \n \n \nFig. 21 Calculation of F(R,K)"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 5d84c298-1c80-402e-a3fb-914458680466
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 39, "full_page_content": "40 \n \n \nFig. 22 Definition of S-Boxes", "chunk_id": "9ee6aea8-1820-4d9d-a3e9-a6d03211145f", "chroma:document": "40 \n \n \nFig. 22 Definition of S-Boxes"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: fb077630-0253-48db-a68c-6e87daa869af
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 40, "full_page_content": "41 \n \n \n \nFig. 23 DES Example \nThe Avalanche Effect", "chunk_id": "2f74fc1c-8534-45c2-89d3-8aa54daf34a1", "chroma:document": "41 \n \n \n \nFig. 23 DES Example \nThe Avalanche Effect"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: f1c4cb57-d684-4787-b746-de4dfac2e780
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 41, "full_page_content": "42 \n \n\u2022 \nA desirable property of any encryption algorithm is that a small change in either the plaintext \nor the key should produce a significant change in the ciphertext.  \n\u2022 \nIn particular, a change in one bit of the plaintext or one bit of the key should produce a change \nin many bits of the ciphertext.  \n\u2022 \nThis is referred to as the avalanche effect.  \n\u2022 \nIf the change were small, this might provide a way to reduce the size of the plaintext or key \nspace to be searched. \n \nFig. 24 Avalanche Effect in DES (Change in Plaintext) \n \nFig. 25 Avalanche Effect in DES (Change in Key)", "chunk_id": "aa9624f4-2291-41a3-8237-6b767916920c", "chroma:document": "42 \n \n\u2022 \nA desirable property of any encryption algorithm is that a small change in either the plaintext \nor the key should produce a significant change in the ciphertext.  \n\u2022 \nIn particular, a change in one bit of the plaintext or one bit of the key should produce a change \nin many bits of the ciphertext.  \n\u2022 \nThis is referred to as the avalanche effect.  \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: d1ab439c-dff8-434d-8f29-e222304056bb
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 41, "full_page_content": "42 \n \n\u2022 \nA desirable property of any encryption algorithm is that a small change in either the plaintext \nor the key should produce a significant change in the ciphertext.  \n\u2022 \nIn particular, a change in one bit of the plaintext or one bit of the key should produce a change \nin many bits of the ciphertext.  \n\u2022 \nThis is referred to as the avalanche effect.  \n\u2022 \nIf the change were small, this might provide a way to reduce the size of the plaintext or key \nspace to be searched. \n \nFig. 24 Avalanche Effect in DES (Change in Plaintext) \n \nFig. 25 Avalanche Effect in DES (Change in Key)", "chunk_id": "643fabb1-8d7e-4fd3-aa27-77a34c324074", "chroma:document": "\u2022 \nIf the change were small, this might provide a way to reduce the size of the plaintext or key \nspace to be searched. \n \nFig. 24 Avalanche Effect in DES (Change in Plaintext) \n \nFig. 25 Avalanche Effect in DES (Change in Key)"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 5d730f8a-4d29-476c-a73c-58c056e92222
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 42, "full_page_content": "43 \n \nStrength of DES \n\u2022 \nThe Use of 56-Bit Keys \n\u2022 \nWith a key length of 56 bits, there are 256 possible keys, which is approximately 7.2 \nX 1016 keys \n\u2022 \nThus, on the face of it, a brute-force attack appears impractical \n\u2022 \nAssuming that, on average, half the key space has to be searched, a single machine \nperforming one DES encryption per microsecond would take more than a thousand \nyears to break the cipher. \n\u2022 \nThe Nature of the DES Algorithm \n\u2022 \nAnother concern is the possibility that cryptanalysis is possible by exploiting the \ncharacteristics of the DES algorithm. The focus of concern has been on the eight \nsubstitution tables, or S-boxes, that are used in each iteration. Because the design \ncriteria for these boxes, and indeed for the entire algorithm, were not made public, \nthere is a suspicion that the boxes were constructed in such a way that cryptanalysis \n\u2022 For most of its life, the prime concern with DES has been its vulnerability to brute-\nforce attack because of its relatively short (56 bits) key length. However, there has \nalso been interest in finding cryptanalytic attacks on DES. With the increasing \npopularity of block ciphers with longer key lengths, including triple DES, brute- force \nattacks have become increasingly impractical. \nConfidentiality using Symmetric Encryption \n\u2022 \nPlacement of Encryption Function \n\u2022 \nWhat to encrypt and where to place the encrypted function \n\u2022 \nEncryption placement \u2013 end to end encryption and link encryption \n\u2022 \nThere are number of locations where attacks can occur. \n\u2022 \nAnd, it is not under the physical control of the end user.", "chunk_id": "5a07952c-da6e-451a-8e1a-fc95e8780a42", "chroma:document": "43 \n \nStrength of DES \n\u2022 \nThe Use of 56-Bit Keys \n\u2022 \nWith a key length of 56 bits, there are 256 possible keys, which is approximately 7.2 \nX 1016 keys \n\u2022 \nThus, on the face of it, a brute-force attack appears impractical \n\u2022 \nAssuming that, on average, half the key space has to be searched, a single machine"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: eb94c2fc-585b-44df-8a5c-852741ca2d4f
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 42, "full_page_content": "43 \n \nStrength of DES \n\u2022 \nThe Use of 56-Bit Keys \n\u2022 \nWith a key length of 56 bits, there are 256 possible keys, which is approximately 7.2 \nX 1016 keys \n\u2022 \nThus, on the face of it, a brute-force attack appears impractical \n\u2022 \nAssuming that, on average, half the key space has to be searched, a single machine \nperforming one DES encryption per microsecond would take more than a thousand \nyears to break the cipher. \n\u2022 \nThe Nature of the DES Algorithm \n\u2022 \nAnother concern is the possibility that cryptanalysis is possible by exploiting the \ncharacteristics of the DES algorithm. The focus of concern has been on the eight \nsubstitution tables, or S-boxes, that are used in each iteration. Because the design \ncriteria for these boxes, and indeed for the entire algorithm, were not made public, \nthere is a suspicion that the boxes were constructed in such a way that cryptanalysis \n\u2022 For most of its life, the prime concern with DES has been its vulnerability to brute-\nforce attack because of its relatively short (56 bits) key length. However, there has \nalso been interest in finding cryptanalytic attacks on DES. With the increasing \npopularity of block ciphers with longer key lengths, including triple DES, brute- force \nattacks have become increasingly impractical. \nConfidentiality using Symmetric Encryption \n\u2022 \nPlacement of Encryption Function \n\u2022 \nWhat to encrypt and where to place the encrypted function \n\u2022 \nEncryption placement \u2013 end to end encryption and link encryption \n\u2022 \nThere are number of locations where attacks can occur. \n\u2022 \nAnd, it is not under the physical control of the end user.", "chunk_id": "0303c5d7-71f9-43bb-83a5-876db9ddb25f", "chroma:document": "performing one DES encryption per microsecond would take more than a thousand \nyears to break the cipher. \n\u2022 \nThe Nature of the DES Algorithm \n\u2022 \nAnother concern is the possibility that cryptanalysis is possible by exploiting the \ncharacteristics of the DES algorithm. The focus of concern has been on the eight"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 5ab5e741-b28b-4116-9574-5ce52f0ce255
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 42, "full_page_content": "43 \n \nStrength of DES \n\u2022 \nThe Use of 56-Bit Keys \n\u2022 \nWith a key length of 56 bits, there are 256 possible keys, which is approximately 7.2 \nX 1016 keys \n\u2022 \nThus, on the face of it, a brute-force attack appears impractical \n\u2022 \nAssuming that, on average, half the key space has to be searched, a single machine \nperforming one DES encryption per microsecond would take more than a thousand \nyears to break the cipher. \n\u2022 \nThe Nature of the DES Algorithm \n\u2022 \nAnother concern is the possibility that cryptanalysis is possible by exploiting the \ncharacteristics of the DES algorithm. The focus of concern has been on the eight \nsubstitution tables, or S-boxes, that are used in each iteration. Because the design \ncriteria for these boxes, and indeed for the entire algorithm, were not made public, \nthere is a suspicion that the boxes were constructed in such a way that cryptanalysis \n\u2022 For most of its life, the prime concern with DES has been its vulnerability to brute-\nforce attack because of its relatively short (56 bits) key length. However, there has \nalso been interest in finding cryptanalytic attacks on DES. With the increasing \npopularity of block ciphers with longer key lengths, including triple DES, brute- force \nattacks have become increasingly impractical. \nConfidentiality using Symmetric Encryption \n\u2022 \nPlacement of Encryption Function \n\u2022 \nWhat to encrypt and where to place the encrypted function \n\u2022 \nEncryption placement \u2013 end to end encryption and link encryption \n\u2022 \nThere are number of locations where attacks can occur. \n\u2022 \nAnd, it is not under the physical control of the end user.", "chunk_id": "5fb3b0a0-cb6e-4878-83d5-dd9b104e0e48", "chroma:document": "substitution tables, or S-boxes, that are used in each iteration. Because the design \ncriteria for these boxes, and indeed for the entire algorithm, were not made public, \nthere is a suspicion that the boxes were constructed in such a way that cryptanalysis \n\u2022 For most of its life, the prime concern with DES has been its vulnerability to brute-"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 49241056-4a2b-4b75-a254-65115be4cf8b
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 42, "full_page_content": "43 \n \nStrength of DES \n\u2022 \nThe Use of 56-Bit Keys \n\u2022 \nWith a key length of 56 bits, there are 256 possible keys, which is approximately 7.2 \nX 1016 keys \n\u2022 \nThus, on the face of it, a brute-force attack appears impractical \n\u2022 \nAssuming that, on average, half the key space has to be searched, a single machine \nperforming one DES encryption per microsecond would take more than a thousand \nyears to break the cipher. \n\u2022 \nThe Nature of the DES Algorithm \n\u2022 \nAnother concern is the possibility that cryptanalysis is possible by exploiting the \ncharacteristics of the DES algorithm. The focus of concern has been on the eight \nsubstitution tables, or S-boxes, that are used in each iteration. Because the design \ncriteria for these boxes, and indeed for the entire algorithm, were not made public, \nthere is a suspicion that the boxes were constructed in such a way that cryptanalysis \n\u2022 For most of its life, the prime concern with DES has been its vulnerability to brute-\nforce attack because of its relatively short (56 bits) key length. However, there has \nalso been interest in finding cryptanalytic attacks on DES. With the increasing \npopularity of block ciphers with longer key lengths, including triple DES, brute- force \nattacks have become increasingly impractical. \nConfidentiality using Symmetric Encryption \n\u2022 \nPlacement of Encryption Function \n\u2022 \nWhat to encrypt and where to place the encrypted function \n\u2022 \nEncryption placement \u2013 end to end encryption and link encryption \n\u2022 \nThere are number of locations where attacks can occur. \n\u2022 \nAnd, it is not under the physical control of the end user.", "chunk_id": "9e48accb-8310-44e9-8e47-91e56f10ad1b", "chroma:document": "force attack because of its relatively short (56 bits) key length. However, there has \nalso been interest in finding cryptanalytic attacks on DES. With the increasing \npopularity of block ciphers with longer key lengths, including triple DES, brute- force \nattacks have become increasingly impractical. \nConfidentiality using Symmetric Encryption \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 324a6abc-93b5-4cb6-ab59-8493922ba310
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 42, "full_page_content": "43 \n \nStrength of DES \n\u2022 \nThe Use of 56-Bit Keys \n\u2022 \nWith a key length of 56 bits, there are 256 possible keys, which is approximately 7.2 \nX 1016 keys \n\u2022 \nThus, on the face of it, a brute-force attack appears impractical \n\u2022 \nAssuming that, on average, half the key space has to be searched, a single machine \nperforming one DES encryption per microsecond would take more than a thousand \nyears to break the cipher. \n\u2022 \nThe Nature of the DES Algorithm \n\u2022 \nAnother concern is the possibility that cryptanalysis is possible by exploiting the \ncharacteristics of the DES algorithm. The focus of concern has been on the eight \nsubstitution tables, or S-boxes, that are used in each iteration. Because the design \ncriteria for these boxes, and indeed for the entire algorithm, were not made public, \nthere is a suspicion that the boxes were constructed in such a way that cryptanalysis \n\u2022 For most of its life, the prime concern with DES has been its vulnerability to brute-\nforce attack because of its relatively short (56 bits) key length. However, there has \nalso been interest in finding cryptanalytic attacks on DES. With the increasing \npopularity of block ciphers with longer key lengths, including triple DES, brute- force \nattacks have become increasingly impractical. \nConfidentiality using Symmetric Encryption \n\u2022 \nPlacement of Encryption Function \n\u2022 \nWhat to encrypt and where to place the encrypted function \n\u2022 \nEncryption placement \u2013 end to end encryption and link encryption \n\u2022 \nThere are number of locations where attacks can occur. \n\u2022 \nAnd, it is not under the physical control of the end user.", "chunk_id": "18eefb21-0f74-4509-a660-97ebba50a5d9", "chroma:document": "\u2022 \nPlacement of Encryption Function \n\u2022 \nWhat to encrypt and where to place the encrypted function \n\u2022 \nEncryption placement \u2013 end to end encryption and link encryption \n\u2022 \nThere are number of locations where attacks can occur. \n\u2022 \nAnd, it is not under the physical control of the end user."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 0de458df-6b82-47f5-a27a-fd8416db2d70
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 43, "full_page_content": "44 \n \n \nFig. 26 Packet Switching Network \nTable 3 :  Difference Between Link Encryption and End-to-End Encryption \n \nTraffic Confidentiality \n\u2022 \nThe following types of information can be derived from a traffic analysis attack. \n\u2022 \nIdentities of partners \n\u2022 \nHow frequently the partners are communicating \n\u2022 \nMessage pattern, message length, quantity of messages that suggest important \ninformation being exchanged. \n\u2022 \nThe events that correlate with special conversations between particular partners.", "chunk_id": "330dfcb3-ddac-4a16-9525-116ba4ba74d7", "chroma:document": "44 \n \n \nFig. 26 Packet Switching Network \nTable 3 :  Difference Between Link Encryption and End-to-End Encryption \n \nTraffic Confidentiality \n\u2022 \nThe following types of information can be derived from a traffic analysis attack. \n\u2022 \nIdentities of partners \n\u2022 \nHow frequently the partners are communicating \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 7b07127d-f1cd-40dd-9bbd-453c00c44318
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 43, "full_page_content": "44 \n \n \nFig. 26 Packet Switching Network \nTable 3 :  Difference Between Link Encryption and End-to-End Encryption \n \nTraffic Confidentiality \n\u2022 \nThe following types of information can be derived from a traffic analysis attack. \n\u2022 \nIdentities of partners \n\u2022 \nHow frequently the partners are communicating \n\u2022 \nMessage pattern, message length, quantity of messages that suggest important \ninformation being exchanged. \n\u2022 \nThe events that correlate with special conversations between particular partners.", "chunk_id": "06c7b2f4-50ea-4395-8481-a26fc648434e", "chroma:document": "\u2022 \nMessage pattern, message length, quantity of messages that suggest important \ninformation being exchanged. \n\u2022 \nThe events that correlate with special conversations between particular partners."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 4b935636-5fee-45fc-8fcd-54769d0c083f
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 44, "full_page_content": "45 \n \nCovert Channel \n\u2022 \nA covert channel is any communication channel that can be exploited by a process to transfer \ninformation in a manner that violates the systems security policy.  \n\u2022 \nIn short, covert channels transfer information using non-standard methods against the system \ndesign. \n\u2022 \nThe main purpose of covert channels is to protect privacy or to increase security of critical \ncommunication. \nSymmetric Key Distribution \n\u2022 \nFor symmetric encryption to work, the two parties to an exchange must share the same key, \nand that key must be protected from access by others.  \n\u2022 \nFurthermore, frequent key changes are usually desirable to limit the amount of data \ncompromised if an attacker learns the key.  \n\u2022 \nTherefore, the strength of any cryptographic system rests with the key distribution technique, \na term that refers to the means of delivering a key to two parties who wish to exchange data \nwithout allowing others to see the key. \nFor two parties A and B, key distribution can be achieved in a number of ways, as follows: \n1. A can select a key and physically deliver it to B. \n2. A third party can select the key and physically deliver it to A and B. \n3. If A and B have previously and recently used a key, one party can transmit the new key to the \nother, encrypted using the old key. \n4. If A and B each has an encrypted connection to a third party C, C can deliver a key on the \nencrypted links to A and B. \n\u2022 Options 1 and 2 call for manual delivery of a key.  \n\u2022 For link encryption, this is a reasonable requirement, because each link encryption device is going \nto be exchanging data only with its partner on the other end of the link.  \n\u2022 However, for end-to-end encryption over a network, manual delivery is not good. In a distributed \nsystem, any given host or terminal may need to engage in exchanges with many other hosts and \nterminals over time. \n\u2022 Thus, each device needs a number of keys supplied dynamically. The problem is especially \ndifficult in a wide-area distributed system.", "chunk_id": "425a2a11-11c0-4e41-8eb2-f1cbe0f78968", "chroma:document": "45 \n \nCovert Channel \n\u2022 \nA covert channel is any communication channel that can be exploited by a process to transfer \ninformation in a manner that violates the systems security policy.  \n\u2022 \nIn short, covert channels transfer information using non-standard methods against the system \ndesign. \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 7721bcab-a2d2-4df0-af42-c6d03f1a36e0
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 44, "full_page_content": "45 \n \nCovert Channel \n\u2022 \nA covert channel is any communication channel that can be exploited by a process to transfer \ninformation in a manner that violates the systems security policy.  \n\u2022 \nIn short, covert channels transfer information using non-standard methods against the system \ndesign. \n\u2022 \nThe main purpose of covert channels is to protect privacy or to increase security of critical \ncommunication. \nSymmetric Key Distribution \n\u2022 \nFor symmetric encryption to work, the two parties to an exchange must share the same key, \nand that key must be protected from access by others.  \n\u2022 \nFurthermore, frequent key changes are usually desirable to limit the amount of data \ncompromised if an attacker learns the key.  \n\u2022 \nTherefore, the strength of any cryptographic system rests with the key distribution technique, \na term that refers to the means of delivering a key to two parties who wish to exchange data \nwithout allowing others to see the key. \nFor two parties A and B, key distribution can be achieved in a number of ways, as follows: \n1. A can select a key and physically deliver it to B. \n2. A third party can select the key and physically deliver it to A and B. \n3. If A and B have previously and recently used a key, one party can transmit the new key to the \nother, encrypted using the old key. \n4. If A and B each has an encrypted connection to a third party C, C can deliver a key on the \nencrypted links to A and B. \n\u2022 Options 1 and 2 call for manual delivery of a key.  \n\u2022 For link encryption, this is a reasonable requirement, because each link encryption device is going \nto be exchanging data only with its partner on the other end of the link.  \n\u2022 However, for end-to-end encryption over a network, manual delivery is not good. In a distributed \nsystem, any given host or terminal may need to engage in exchanges with many other hosts and \nterminals over time. \n\u2022 Thus, each device needs a number of keys supplied dynamically. The problem is especially \ndifficult in a wide-area distributed system.", "chunk_id": "0dd2962e-3aca-43ea-860a-5d5072d445ad", "chroma:document": "design. \n\u2022 \nThe main purpose of covert channels is to protect privacy or to increase security of critical \ncommunication. \nSymmetric Key Distribution \n\u2022 \nFor symmetric encryption to work, the two parties to an exchange must share the same key, \nand that key must be protected from access by others.  \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 259bbc36-096d-4b3e-8b2b-6705dd41c77d
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 44, "full_page_content": "45 \n \nCovert Channel \n\u2022 \nA covert channel is any communication channel that can be exploited by a process to transfer \ninformation in a manner that violates the systems security policy.  \n\u2022 \nIn short, covert channels transfer information using non-standard methods against the system \ndesign. \n\u2022 \nThe main purpose of covert channels is to protect privacy or to increase security of critical \ncommunication. \nSymmetric Key Distribution \n\u2022 \nFor symmetric encryption to work, the two parties to an exchange must share the same key, \nand that key must be protected from access by others.  \n\u2022 \nFurthermore, frequent key changes are usually desirable to limit the amount of data \ncompromised if an attacker learns the key.  \n\u2022 \nTherefore, the strength of any cryptographic system rests with the key distribution technique, \na term that refers to the means of delivering a key to two parties who wish to exchange data \nwithout allowing others to see the key. \nFor two parties A and B, key distribution can be achieved in a number of ways, as follows: \n1. A can select a key and physically deliver it to B. \n2. A third party can select the key and physically deliver it to A and B. \n3. If A and B have previously and recently used a key, one party can transmit the new key to the \nother, encrypted using the old key. \n4. If A and B each has an encrypted connection to a third party C, C can deliver a key on the \nencrypted links to A and B. \n\u2022 Options 1 and 2 call for manual delivery of a key.  \n\u2022 For link encryption, this is a reasonable requirement, because each link encryption device is going \nto be exchanging data only with its partner on the other end of the link.  \n\u2022 However, for end-to-end encryption over a network, manual delivery is not good. In a distributed \nsystem, any given host or terminal may need to engage in exchanges with many other hosts and \nterminals over time. \n\u2022 Thus, each device needs a number of keys supplied dynamically. The problem is especially \ndifficult in a wide-area distributed system.", "chunk_id": "9d385af7-c6a3-447c-ade3-d5b67dd025b1", "chroma:document": "\u2022 \nFurthermore, frequent key changes are usually desirable to limit the amount of data \ncompromised if an attacker learns the key.  \n\u2022 \nTherefore, the strength of any cryptographic system rests with the key distribution technique, \na term that refers to the means of delivering a key to two parties who wish to exchange data \nwithout allowing others to see the key."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: e901524f-619b-4ec7-94da-02a39a10a0e0
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 44, "full_page_content": "45 \n \nCovert Channel \n\u2022 \nA covert channel is any communication channel that can be exploited by a process to transfer \ninformation in a manner that violates the systems security policy.  \n\u2022 \nIn short, covert channels transfer information using non-standard methods against the system \ndesign. \n\u2022 \nThe main purpose of covert channels is to protect privacy or to increase security of critical \ncommunication. \nSymmetric Key Distribution \n\u2022 \nFor symmetric encryption to work, the two parties to an exchange must share the same key, \nand that key must be protected from access by others.  \n\u2022 \nFurthermore, frequent key changes are usually desirable to limit the amount of data \ncompromised if an attacker learns the key.  \n\u2022 \nTherefore, the strength of any cryptographic system rests with the key distribution technique, \na term that refers to the means of delivering a key to two parties who wish to exchange data \nwithout allowing others to see the key. \nFor two parties A and B, key distribution can be achieved in a number of ways, as follows: \n1. A can select a key and physically deliver it to B. \n2. A third party can select the key and physically deliver it to A and B. \n3. If A and B have previously and recently used a key, one party can transmit the new key to the \nother, encrypted using the old key. \n4. If A and B each has an encrypted connection to a third party C, C can deliver a key on the \nencrypted links to A and B. \n\u2022 Options 1 and 2 call for manual delivery of a key.  \n\u2022 For link encryption, this is a reasonable requirement, because each link encryption device is going \nto be exchanging data only with its partner on the other end of the link.  \n\u2022 However, for end-to-end encryption over a network, manual delivery is not good. In a distributed \nsystem, any given host or terminal may need to engage in exchanges with many other hosts and \nterminals over time. \n\u2022 Thus, each device needs a number of keys supplied dynamically. The problem is especially \ndifficult in a wide-area distributed system.", "chunk_id": "c844e79f-f499-4dfc-8a86-b6c93a7d0e1c", "chroma:document": "For two parties A and B, key distribution can be achieved in a number of ways, as follows: \n1. A can select a key and physically deliver it to B. \n2. A third party can select the key and physically deliver it to A and B. \n3. If A and B have previously and recently used a key, one party can transmit the new key to the \nother, encrypted using the old key."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 5a6857a6-3b85-4847-a61e-e490b544ce7d
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 44, "full_page_content": "45 \n \nCovert Channel \n\u2022 \nA covert channel is any communication channel that can be exploited by a process to transfer \ninformation in a manner that violates the systems security policy.  \n\u2022 \nIn short, covert channels transfer information using non-standard methods against the system \ndesign. \n\u2022 \nThe main purpose of covert channels is to protect privacy or to increase security of critical \ncommunication. \nSymmetric Key Distribution \n\u2022 \nFor symmetric encryption to work, the two parties to an exchange must share the same key, \nand that key must be protected from access by others.  \n\u2022 \nFurthermore, frequent key changes are usually desirable to limit the amount of data \ncompromised if an attacker learns the key.  \n\u2022 \nTherefore, the strength of any cryptographic system rests with the key distribution technique, \na term that refers to the means of delivering a key to two parties who wish to exchange data \nwithout allowing others to see the key. \nFor two parties A and B, key distribution can be achieved in a number of ways, as follows: \n1. A can select a key and physically deliver it to B. \n2. A third party can select the key and physically deliver it to A and B. \n3. If A and B have previously and recently used a key, one party can transmit the new key to the \nother, encrypted using the old key. \n4. If A and B each has an encrypted connection to a third party C, C can deliver a key on the \nencrypted links to A and B. \n\u2022 Options 1 and 2 call for manual delivery of a key.  \n\u2022 For link encryption, this is a reasonable requirement, because each link encryption device is going \nto be exchanging data only with its partner on the other end of the link.  \n\u2022 However, for end-to-end encryption over a network, manual delivery is not good. In a distributed \nsystem, any given host or terminal may need to engage in exchanges with many other hosts and \nterminals over time. \n\u2022 Thus, each device needs a number of keys supplied dynamically. The problem is especially \ndifficult in a wide-area distributed system.", "chunk_id": "76edab2a-fd38-452c-8c0e-252da2b89d40", "chroma:document": "4. If A and B each has an encrypted connection to a third party C, C can deliver a key on the \nencrypted links to A and B. \n\u2022 Options 1 and 2 call for manual delivery of a key.  \n\u2022 For link encryption, this is a reasonable requirement, because each link encryption device is going \nto be exchanging data only with its partner on the other end of the link."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 919f7f2b-4c40-401a-bdda-c84681dd7084
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 44, "full_page_content": "45 \n \nCovert Channel \n\u2022 \nA covert channel is any communication channel that can be exploited by a process to transfer \ninformation in a manner that violates the systems security policy.  \n\u2022 \nIn short, covert channels transfer information using non-standard methods against the system \ndesign. \n\u2022 \nThe main purpose of covert channels is to protect privacy or to increase security of critical \ncommunication. \nSymmetric Key Distribution \n\u2022 \nFor symmetric encryption to work, the two parties to an exchange must share the same key, \nand that key must be protected from access by others.  \n\u2022 \nFurthermore, frequent key changes are usually desirable to limit the amount of data \ncompromised if an attacker learns the key.  \n\u2022 \nTherefore, the strength of any cryptographic system rests with the key distribution technique, \na term that refers to the means of delivering a key to two parties who wish to exchange data \nwithout allowing others to see the key. \nFor two parties A and B, key distribution can be achieved in a number of ways, as follows: \n1. A can select a key and physically deliver it to B. \n2. A third party can select the key and physically deliver it to A and B. \n3. If A and B have previously and recently used a key, one party can transmit the new key to the \nother, encrypted using the old key. \n4. If A and B each has an encrypted connection to a third party C, C can deliver a key on the \nencrypted links to A and B. \n\u2022 Options 1 and 2 call for manual delivery of a key.  \n\u2022 For link encryption, this is a reasonable requirement, because each link encryption device is going \nto be exchanging data only with its partner on the other end of the link.  \n\u2022 However, for end-to-end encryption over a network, manual delivery is not good. In a distributed \nsystem, any given host or terminal may need to engage in exchanges with many other hosts and \nterminals over time. \n\u2022 Thus, each device needs a number of keys supplied dynamically. The problem is especially \ndifficult in a wide-area distributed system.", "chunk_id": "0471981d-c836-4dd5-a2f8-3e1a885ed395", "chroma:document": "\u2022 However, for end-to-end encryption over a network, manual delivery is not good. In a distributed \nsystem, any given host or terminal may need to engage in exchanges with many other hosts and \nterminals over time. \n\u2022 Thus, each device needs a number of keys supplied dynamically. The problem is especially \ndifficult in a wide-area distributed system."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 9b8d525b-d515-4e39-b6ab-e6a2bb4cdf29
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 45, "full_page_content": "46 \n \n\u2022 \nThe scale of the problem depends on the number of communicating pairs that must be \nsupported. If end-to-end encryption is done at a network or IP level, then a key is needed for \neach pair of hosts on the network that wish to communicate. \n\u2022 \nThus, if there are N hosts, the number of required keys is [N(N-1)]/2. \n\u2022 \nIf encryption is done at the application level, then a key is needed for every pair of users or \nprocesses that require communication. \n\u2022 \nThe use of a key distribution center is based on the use of a hierarchy of keys. At a minimum, \ntwo levels of keys are used.  \n\u2022 \nCommunication between end systems is encrypted using a temporary key, often referred to \nas a session key. \n\u2022 \nEach session key is obtained from the key distribution center over the same networking \nfacilities used for end-user communication. Accordingly, session keys are transmitted in \nencrypted form, using a master key that is shared by the key distribution center and an end \nsystem or user. \n \nFig. 27 The Use of Key Hierarchy \nA Key Distribution Scenario \n\u2022 \nThe key distribution concept can be deployed in a number of ways. \n\u2022 \nThe scenario assumes that each user shares a unique master key with the key distribution \ncenter (KDC).", "chunk_id": "4980f70a-2865-4384-a0a1-a730d657b160", "chroma:document": "46 \n \n\u2022 \nThe scale of the problem depends on the number of communicating pairs that must be \nsupported. If end-to-end encryption is done at a network or IP level, then a key is needed for \neach pair of hosts on the network that wish to communicate. \n\u2022 \nThus, if there are N hosts, the number of required keys is [N(N-1)]/2. \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 150e4c14-13f5-4554-b208-db06eef1ee5d
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 45, "full_page_content": "46 \n \n\u2022 \nThe scale of the problem depends on the number of communicating pairs that must be \nsupported. If end-to-end encryption is done at a network or IP level, then a key is needed for \neach pair of hosts on the network that wish to communicate. \n\u2022 \nThus, if there are N hosts, the number of required keys is [N(N-1)]/2. \n\u2022 \nIf encryption is done at the application level, then a key is needed for every pair of users or \nprocesses that require communication. \n\u2022 \nThe use of a key distribution center is based on the use of a hierarchy of keys. At a minimum, \ntwo levels of keys are used.  \n\u2022 \nCommunication between end systems is encrypted using a temporary key, often referred to \nas a session key. \n\u2022 \nEach session key is obtained from the key distribution center over the same networking \nfacilities used for end-user communication. Accordingly, session keys are transmitted in \nencrypted form, using a master key that is shared by the key distribution center and an end \nsystem or user. \n \nFig. 27 The Use of Key Hierarchy \nA Key Distribution Scenario \n\u2022 \nThe key distribution concept can be deployed in a number of ways. \n\u2022 \nThe scenario assumes that each user shares a unique master key with the key distribution \ncenter (KDC).", "chunk_id": "a1f74669-ccc9-4f38-ab13-c9fc1f8482ac", "chroma:document": "\u2022 \nIf encryption is done at the application level, then a key is needed for every pair of users or \nprocesses that require communication. \n\u2022 \nThe use of a key distribution center is based on the use of a hierarchy of keys. At a minimum, \ntwo levels of keys are used.  \n\u2022 \nCommunication between end systems is encrypted using a temporary key, often referred to \nas a session key. \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 908636c5-9bbd-45a5-9474-408e7ad84bf9
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 45, "full_page_content": "46 \n \n\u2022 \nThe scale of the problem depends on the number of communicating pairs that must be \nsupported. If end-to-end encryption is done at a network or IP level, then a key is needed for \neach pair of hosts on the network that wish to communicate. \n\u2022 \nThus, if there are N hosts, the number of required keys is [N(N-1)]/2. \n\u2022 \nIf encryption is done at the application level, then a key is needed for every pair of users or \nprocesses that require communication. \n\u2022 \nThe use of a key distribution center is based on the use of a hierarchy of keys. At a minimum, \ntwo levels of keys are used.  \n\u2022 \nCommunication between end systems is encrypted using a temporary key, often referred to \nas a session key. \n\u2022 \nEach session key is obtained from the key distribution center over the same networking \nfacilities used for end-user communication. Accordingly, session keys are transmitted in \nencrypted form, using a master key that is shared by the key distribution center and an end \nsystem or user. \n \nFig. 27 The Use of Key Hierarchy \nA Key Distribution Scenario \n\u2022 \nThe key distribution concept can be deployed in a number of ways. \n\u2022 \nThe scenario assumes that each user shares a unique master key with the key distribution \ncenter (KDC).", "chunk_id": "9a9e2296-1f7a-4a87-b936-a8e654222fcd", "chroma:document": "\u2022 \nEach session key is obtained from the key distribution center over the same networking \nfacilities used for end-user communication. Accordingly, session keys are transmitted in \nencrypted form, using a master key that is shared by the key distribution center and an end \nsystem or user. \n \nFig. 27 The Use of Key Hierarchy \nA Key Distribution Scenario \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 7a1f3389-bdde-4ca6-beb4-de5fa44862da
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 45, "full_page_content": "46 \n \n\u2022 \nThe scale of the problem depends on the number of communicating pairs that must be \nsupported. If end-to-end encryption is done at a network or IP level, then a key is needed for \neach pair of hosts on the network that wish to communicate. \n\u2022 \nThus, if there are N hosts, the number of required keys is [N(N-1)]/2. \n\u2022 \nIf encryption is done at the application level, then a key is needed for every pair of users or \nprocesses that require communication. \n\u2022 \nThe use of a key distribution center is based on the use of a hierarchy of keys. At a minimum, \ntwo levels of keys are used.  \n\u2022 \nCommunication between end systems is encrypted using a temporary key, often referred to \nas a session key. \n\u2022 \nEach session key is obtained from the key distribution center over the same networking \nfacilities used for end-user communication. Accordingly, session keys are transmitted in \nencrypted form, using a master key that is shared by the key distribution center and an end \nsystem or user. \n \nFig. 27 The Use of Key Hierarchy \nA Key Distribution Scenario \n\u2022 \nThe key distribution concept can be deployed in a number of ways. \n\u2022 \nThe scenario assumes that each user shares a unique master key with the key distribution \ncenter (KDC).", "chunk_id": "8f106805-508c-41b7-b585-781faa077e25", "chroma:document": "\u2022 \nThe key distribution concept can be deployed in a number of ways. \n\u2022 \nThe scenario assumes that each user shares a unique master key with the key distribution \ncenter (KDC)."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 59ab5d67-09e6-4280-8ded-9d3963933dbc
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 46, "full_page_content": "47 \n \n \nFig.28 Symmetric Key Distribution Scenario \n\u2022 \nLet us assume that user A wishes to establish a logical connection with B and requires a one-\ntime session key to protect the data transmitted over the connection. \n\u2022 \nA has a master key, Ka  known only to itself and the KDC. similarly, B shares the master key \nKb with the KDC. \nThe following steps occur,", "chunk_id": "4966b00e-5704-40e0-a40b-90bfaaa4e3c5", "chroma:document": "47 \n \n \nFig.28 Symmetric Key Distribution Scenario \n\u2022 \nLet us assume that user A wishes to establish a logical connection with B and requires a one-\ntime session key to protect the data transmitted over the connection. \n\u2022 \nA has a master key, Ka  known only to itself and the KDC. similarly, B shares the master key \nKb with the KDC. \nThe following steps occur,"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 7bb479a2-8b16-4930-90d8-b95cb356ade7
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 47, "full_page_content": "48 \n \n \n \nHierarchical Key Control \n\u2022 \nIt is not necessary to limit the key distribution function to a single KDC. Indeed, for very \nlarge networks, it may not be practical to do so. \n\u2022 \nAs an alternative, a hierarchy of KDCs can be established. For example, there can be local \nKDCs, each responsible for a small domain of the overall internetwork, such as a single LAN \nor a single building. \n\u2022 \nFor communication among entities within the same local domain, the local KDC is \nresponsible for key distribution. If two entities in different domains desire a shared key, then \nthe corresponding local KDCs can communicate through a global KDC. In this case, any one \nof the three KDCs involved can actually select the key. \nSession Key Lifetime \n\u2022 \nThe more frequently session keys are exchanged, the more secure they are, because the \nopponent has less ciphertext to work with for any given session key.  \n\u2022 \nOn the other hand, the distribution of session keys delays the start of any exchange and places \na burden on network capacity. \n\u2022 \nA security manager must try to balance these competing considerations in determining the \nlifetime of a particular session key.", "chunk_id": "9c547498-ec3e-4286-beeb-c85f6b5e0138", "chroma:document": "48 \n \n \n \nHierarchical Key Control \n\u2022 \nIt is not necessary to limit the key distribution function to a single KDC. Indeed, for very \nlarge networks, it may not be practical to do so. \n\u2022 \nAs an alternative, a hierarchy of KDCs can be established. For example, there can be local \nKDCs, each responsible for a small domain of the overall internetwork, such as a single LAN"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 5ac48ac3-6b6a-4317-9c12-5aec1d0fd221
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 47, "full_page_content": "48 \n \n \n \nHierarchical Key Control \n\u2022 \nIt is not necessary to limit the key distribution function to a single KDC. Indeed, for very \nlarge networks, it may not be practical to do so. \n\u2022 \nAs an alternative, a hierarchy of KDCs can be established. For example, there can be local \nKDCs, each responsible for a small domain of the overall internetwork, such as a single LAN \nor a single building. \n\u2022 \nFor communication among entities within the same local domain, the local KDC is \nresponsible for key distribution. If two entities in different domains desire a shared key, then \nthe corresponding local KDCs can communicate through a global KDC. In this case, any one \nof the three KDCs involved can actually select the key. \nSession Key Lifetime \n\u2022 \nThe more frequently session keys are exchanged, the more secure they are, because the \nopponent has less ciphertext to work with for any given session key.  \n\u2022 \nOn the other hand, the distribution of session keys delays the start of any exchange and places \na burden on network capacity. \n\u2022 \nA security manager must try to balance these competing considerations in determining the \nlifetime of a particular session key.", "chunk_id": "ef2cf7cd-7c7b-482c-82f9-b122ce343629", "chroma:document": "or a single building. \n\u2022 \nFor communication among entities within the same local domain, the local KDC is \nresponsible for key distribution. If two entities in different domains desire a shared key, then \nthe corresponding local KDCs can communicate through a global KDC. In this case, any one \nof the three KDCs involved can actually select the key. \nSession Key Lifetime \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: df1b7da0-ba05-482e-9091-e07c8c040476
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 47, "full_page_content": "48 \n \n \n \nHierarchical Key Control \n\u2022 \nIt is not necessary to limit the key distribution function to a single KDC. Indeed, for very \nlarge networks, it may not be practical to do so. \n\u2022 \nAs an alternative, a hierarchy of KDCs can be established. For example, there can be local \nKDCs, each responsible for a small domain of the overall internetwork, such as a single LAN \nor a single building. \n\u2022 \nFor communication among entities within the same local domain, the local KDC is \nresponsible for key distribution. If two entities in different domains desire a shared key, then \nthe corresponding local KDCs can communicate through a global KDC. In this case, any one \nof the three KDCs involved can actually select the key. \nSession Key Lifetime \n\u2022 \nThe more frequently session keys are exchanged, the more secure they are, because the \nopponent has less ciphertext to work with for any given session key.  \n\u2022 \nOn the other hand, the distribution of session keys delays the start of any exchange and places \na burden on network capacity. \n\u2022 \nA security manager must try to balance these competing considerations in determining the \nlifetime of a particular session key.", "chunk_id": "13d9dd39-3484-49be-9321-cfc1c66c2c00", "chroma:document": "\u2022 \nThe more frequently session keys are exchanged, the more secure they are, because the \nopponent has less ciphertext to work with for any given session key.  \n\u2022 \nOn the other hand, the distribution of session keys delays the start of any exchange and places \na burden on network capacity. \n\u2022"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: e18260fc-20ec-4756-87f6-db6406224c4a
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 47, "full_page_content": "48 \n \n \n \nHierarchical Key Control \n\u2022 \nIt is not necessary to limit the key distribution function to a single KDC. Indeed, for very \nlarge networks, it may not be practical to do so. \n\u2022 \nAs an alternative, a hierarchy of KDCs can be established. For example, there can be local \nKDCs, each responsible for a small domain of the overall internetwork, such as a single LAN \nor a single building. \n\u2022 \nFor communication among entities within the same local domain, the local KDC is \nresponsible for key distribution. If two entities in different domains desire a shared key, then \nthe corresponding local KDCs can communicate through a global KDC. In this case, any one \nof the three KDCs involved can actually select the key. \nSession Key Lifetime \n\u2022 \nThe more frequently session keys are exchanged, the more secure they are, because the \nopponent has less ciphertext to work with for any given session key.  \n\u2022 \nOn the other hand, the distribution of session keys delays the start of any exchange and places \na burden on network capacity. \n\u2022 \nA security manager must try to balance these competing considerations in determining the \nlifetime of a particular session key.", "chunk_id": "b2adc954-576f-4ae8-b73f-6622865721cd", "chroma:document": "\u2022 \nA security manager must try to balance these competing considerations in determining the \nlifetime of a particular session key."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: bb3d490e-03f3-4393-bf23-790a451d4123
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 48, "full_page_content": "49 \n \nDecentralized Key Control \n\u2022 \nThe use of a key distribution center imposes the requirement that the KDC be trusted and \nbe protected from subversion.  \n\u2022 \nThis requirement can be avoided if key distribution is fully decentralized.  \n\u2022 \nAlthough full decentralization is not practical for larger networks using symmetric \nencryption only, it may be useful within a local context. \n \n \nFig. 29 Decentralized Key Control \n \nReferences: \n\u2022 William Stallings, \u201c Cryptography and Network Security\u201d, 4th Edition, Pearson, 2009. \n\u2022 Behrouz A. Forouzan, \u201c Cryptography and Network Security\u201d, Tata McGraw-Hill, 2008.", "chunk_id": "72456a6e-2f32-4d18-ab75-07c5680af136", "chroma:document": "49 \n \nDecentralized Key Control \n\u2022 \nThe use of a key distribution center imposes the requirement that the KDC be trusted and \nbe protected from subversion.  \n\u2022 \nThis requirement can be avoided if key distribution is fully decentralized.  \n\u2022 \nAlthough full decentralization is not practical for larger networks using symmetric"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 629d3903-bf0c-438e-a026-eb07194919ad
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 48, "full_page_content": "49 \n \nDecentralized Key Control \n\u2022 \nThe use of a key distribution center imposes the requirement that the KDC be trusted and \nbe protected from subversion.  \n\u2022 \nThis requirement can be avoided if key distribution is fully decentralized.  \n\u2022 \nAlthough full decentralization is not practical for larger networks using symmetric \nencryption only, it may be useful within a local context. \n \n \nFig. 29 Decentralized Key Control \n \nReferences: \n\u2022 William Stallings, \u201c Cryptography and Network Security\u201d, 4th Edition, Pearson, 2009. \n\u2022 Behrouz A. Forouzan, \u201c Cryptography and Network Security\u201d, Tata McGraw-Hill, 2008.", "chunk_id": "2113a1d5-3251-425b-a296-9de7d03636b4", "chroma:document": "encryption only, it may be useful within a local context. \n \n \nFig. 29 Decentralized Key Control \n \nReferences: \n\u2022 William Stallings, \u201c Cryptography and Network Security\u201d, 4th Edition, Pearson, 2009. \n\u2022 Behrouz A. Forouzan, \u201c Cryptography and Network Security\u201d, Tata McGraw-Hill, 2008."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: ce512533-9321-4b2f-8a5f-93ed09545122
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 49, "full_page_content": "50 \n \n \n \nSCHOOL OF COMPUTING \nDEPARTMENT OF INFORMATION TECHNOLOGY \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \nUNIT \u2013 II Public Key Cryptography  SITA1602", "chunk_id": "d6b21544-7096-4706-80a2-f6b8414419af", "chroma:document": "50 \n \n \n \nSCHOOL OF COMPUTING \nDEPARTMENT OF INFORMATION TECHNOLOGY \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \nUNIT \u2013 II Public Key Cryptography  SITA1602"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 33408c07-1eaf-4a78-8650-7558392347ca
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 50, "full_page_content": "51 \n \n \n \n \nII. Public Key Cryptography \nPrinciples \u2013 RSA algorithm \u2013 Key Management \u2013 Diffie Hellman Key Exchange \n\u2013Message Authentication Requirements, Functions, Message Authentication \u2013 \nHash Functions \u2013 Digital Signatures \u2013 Authentication Protocols \n2.1 Introduction \nWhen the two parties communicate to each other to transfer the intelligible or sensible message, \nreferred to as plaintext, is converted into apparently random nonsense for security purpose \nreferred to as ciphertext.  \nEncryption: \nThe process of changing the plaintext into the ciphertext is referred to as encryption.  \nThe encryption process consists of an algorithm and a key. The key is a value independent of the \nplaintext.  \nThe security of conventional encryption depends on the major two factors:  \n1. The Encryption algorithm \n2. Secrecy of the key \nOnce the ciphertext is produced, it may be transmitted. The Encryption algorithm will produce a \ndifferent output depending on the specific key being used at the time. Changing the key changes the \noutput of the algorithm. Once the ciphertext is produced, it may be transmitted. Upon reception, the \nciphertext can be transformed back to the original plaintext by using a decryption algorithm and the \nsame key that was used for encryption.  \nDecryption:  \nThe process of changing the ciphertext to the plaintext that process is known as decryption.  \nPublic Key Encryption :  Asymmetric is a form of Cryptosystem in which encryption and decryption \nare performed using different keys-Public key (known to everyone) and Private key (Secret key). \nThis is known as Public Key Encryption. \n2.2 Principles of Public-Key Cryptosystems \nThe concept of public-key cryptography evolved from an attempt to attack two of the most difficult \nproblems associated with symmetric encryption. The first problem is that of key distribution, and the \nsecond one related to digital signature. key distribution under symmetric encryption requires either \n(1) that two communicants already share a key, which somehow has been distributed to them; or (2)", "chunk_id": "b5b0b8f4-22e5-4a63-81ea-c6320b937de6", "chroma:document": "51 \n \n \n \n \nII. Public Key Cryptography \nPrinciples \u2013 RSA algorithm \u2013 Key Management \u2013 Diffie Hellman Key Exchange \n\u2013Message Authentication Requirements, Functions, Message Authentication \u2013 \nHash Functions \u2013 Digital Signatures \u2013 Authentication Protocols \n2.1 Introduction \nWhen the two parties communicate to each other to transfer the intelligible or sensible message,"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 987571be-a809-45ff-8875-febad6a2cbed
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 50, "full_page_content": "51 \n \n \n \n \nII. Public Key Cryptography \nPrinciples \u2013 RSA algorithm \u2013 Key Management \u2013 Diffie Hellman Key Exchange \n\u2013Message Authentication Requirements, Functions, Message Authentication \u2013 \nHash Functions \u2013 Digital Signatures \u2013 Authentication Protocols \n2.1 Introduction \nWhen the two parties communicate to each other to transfer the intelligible or sensible message, \nreferred to as plaintext, is converted into apparently random nonsense for security purpose \nreferred to as ciphertext.  \nEncryption: \nThe process of changing the plaintext into the ciphertext is referred to as encryption.  \nThe encryption process consists of an algorithm and a key. The key is a value independent of the \nplaintext.  \nThe security of conventional encryption depends on the major two factors:  \n1. The Encryption algorithm \n2. Secrecy of the key \nOnce the ciphertext is produced, it may be transmitted. The Encryption algorithm will produce a \ndifferent output depending on the specific key being used at the time. Changing the key changes the \noutput of the algorithm. Once the ciphertext is produced, it may be transmitted. Upon reception, the \nciphertext can be transformed back to the original plaintext by using a decryption algorithm and the \nsame key that was used for encryption.  \nDecryption:  \nThe process of changing the ciphertext to the plaintext that process is known as decryption.  \nPublic Key Encryption :  Asymmetric is a form of Cryptosystem in which encryption and decryption \nare performed using different keys-Public key (known to everyone) and Private key (Secret key). \nThis is known as Public Key Encryption. \n2.2 Principles of Public-Key Cryptosystems \nThe concept of public-key cryptography evolved from an attempt to attack two of the most difficult \nproblems associated with symmetric encryption. The first problem is that of key distribution, and the \nsecond one related to digital signature. key distribution under symmetric encryption requires either \n(1) that two communicants already share a key, which somehow has been distributed to them; or (2)", "chunk_id": "29f71c1d-b560-461a-9afe-94777cda35bf", "chroma:document": "referred to as plaintext, is converted into apparently random nonsense for security purpose \nreferred to as ciphertext.  \nEncryption: \nThe process of changing the plaintext into the ciphertext is referred to as encryption.  \nThe encryption process consists of an algorithm and a key. The key is a value independent of the \nplaintext."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 71c8dd27-768f-4cda-b28b-73a8b4775c1c
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 50, "full_page_content": "51 \n \n \n \n \nII. Public Key Cryptography \nPrinciples \u2013 RSA algorithm \u2013 Key Management \u2013 Diffie Hellman Key Exchange \n\u2013Message Authentication Requirements, Functions, Message Authentication \u2013 \nHash Functions \u2013 Digital Signatures \u2013 Authentication Protocols \n2.1 Introduction \nWhen the two parties communicate to each other to transfer the intelligible or sensible message, \nreferred to as plaintext, is converted into apparently random nonsense for security purpose \nreferred to as ciphertext.  \nEncryption: \nThe process of changing the plaintext into the ciphertext is referred to as encryption.  \nThe encryption process consists of an algorithm and a key. The key is a value independent of the \nplaintext.  \nThe security of conventional encryption depends on the major two factors:  \n1. The Encryption algorithm \n2. Secrecy of the key \nOnce the ciphertext is produced, it may be transmitted. The Encryption algorithm will produce a \ndifferent output depending on the specific key being used at the time. Changing the key changes the \noutput of the algorithm. Once the ciphertext is produced, it may be transmitted. Upon reception, the \nciphertext can be transformed back to the original plaintext by using a decryption algorithm and the \nsame key that was used for encryption.  \nDecryption:  \nThe process of changing the ciphertext to the plaintext that process is known as decryption.  \nPublic Key Encryption :  Asymmetric is a form of Cryptosystem in which encryption and decryption \nare performed using different keys-Public key (known to everyone) and Private key (Secret key). \nThis is known as Public Key Encryption. \n2.2 Principles of Public-Key Cryptosystems \nThe concept of public-key cryptography evolved from an attempt to attack two of the most difficult \nproblems associated with symmetric encryption. The first problem is that of key distribution, and the \nsecond one related to digital signature. key distribution under symmetric encryption requires either \n(1) that two communicants already share a key, which somehow has been distributed to them; or (2)", "chunk_id": "83c5c109-a1cf-41f6-ac7c-d0c4a7818f48", "chroma:document": "plaintext.  \nThe security of conventional encryption depends on the major two factors:  \n1. The Encryption algorithm \n2. Secrecy of the key \nOnce the ciphertext is produced, it may be transmitted. The Encryption algorithm will produce a \ndifferent output depending on the specific key being used at the time. Changing the key changes the"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: af8e366a-be6b-4f4f-a1f3-73919060deba
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 50, "full_page_content": "51 \n \n \n \n \nII. Public Key Cryptography \nPrinciples \u2013 RSA algorithm \u2013 Key Management \u2013 Diffie Hellman Key Exchange \n\u2013Message Authentication Requirements, Functions, Message Authentication \u2013 \nHash Functions \u2013 Digital Signatures \u2013 Authentication Protocols \n2.1 Introduction \nWhen the two parties communicate to each other to transfer the intelligible or sensible message, \nreferred to as plaintext, is converted into apparently random nonsense for security purpose \nreferred to as ciphertext.  \nEncryption: \nThe process of changing the plaintext into the ciphertext is referred to as encryption.  \nThe encryption process consists of an algorithm and a key. The key is a value independent of the \nplaintext.  \nThe security of conventional encryption depends on the major two factors:  \n1. The Encryption algorithm \n2. Secrecy of the key \nOnce the ciphertext is produced, it may be transmitted. The Encryption algorithm will produce a \ndifferent output depending on the specific key being used at the time. Changing the key changes the \noutput of the algorithm. Once the ciphertext is produced, it may be transmitted. Upon reception, the \nciphertext can be transformed back to the original plaintext by using a decryption algorithm and the \nsame key that was used for encryption.  \nDecryption:  \nThe process of changing the ciphertext to the plaintext that process is known as decryption.  \nPublic Key Encryption :  Asymmetric is a form of Cryptosystem in which encryption and decryption \nare performed using different keys-Public key (known to everyone) and Private key (Secret key). \nThis is known as Public Key Encryption. \n2.2 Principles of Public-Key Cryptosystems \nThe concept of public-key cryptography evolved from an attempt to attack two of the most difficult \nproblems associated with symmetric encryption. The first problem is that of key distribution, and the \nsecond one related to digital signature. key distribution under symmetric encryption requires either \n(1) that two communicants already share a key, which somehow has been distributed to them; or (2)", "chunk_id": "6b9d2c4d-4a0b-47ca-ba1b-ce2278670ce7", "chroma:document": "output of the algorithm. Once the ciphertext is produced, it may be transmitted. Upon reception, the \nciphertext can be transformed back to the original plaintext by using a decryption algorithm and the \nsame key that was used for encryption.  \nDecryption:  \nThe process of changing the ciphertext to the plaintext that process is known as decryption."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: afd8aba4-0f53-428f-b0d9-4a87fbf71a6c
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 50, "full_page_content": "51 \n \n \n \n \nII. Public Key Cryptography \nPrinciples \u2013 RSA algorithm \u2013 Key Management \u2013 Diffie Hellman Key Exchange \n\u2013Message Authentication Requirements, Functions, Message Authentication \u2013 \nHash Functions \u2013 Digital Signatures \u2013 Authentication Protocols \n2.1 Introduction \nWhen the two parties communicate to each other to transfer the intelligible or sensible message, \nreferred to as plaintext, is converted into apparently random nonsense for security purpose \nreferred to as ciphertext.  \nEncryption: \nThe process of changing the plaintext into the ciphertext is referred to as encryption.  \nThe encryption process consists of an algorithm and a key. The key is a value independent of the \nplaintext.  \nThe security of conventional encryption depends on the major two factors:  \n1. The Encryption algorithm \n2. Secrecy of the key \nOnce the ciphertext is produced, it may be transmitted. The Encryption algorithm will produce a \ndifferent output depending on the specific key being used at the time. Changing the key changes the \noutput of the algorithm. Once the ciphertext is produced, it may be transmitted. Upon reception, the \nciphertext can be transformed back to the original plaintext by using a decryption algorithm and the \nsame key that was used for encryption.  \nDecryption:  \nThe process of changing the ciphertext to the plaintext that process is known as decryption.  \nPublic Key Encryption :  Asymmetric is a form of Cryptosystem in which encryption and decryption \nare performed using different keys-Public key (known to everyone) and Private key (Secret key). \nThis is known as Public Key Encryption. \n2.2 Principles of Public-Key Cryptosystems \nThe concept of public-key cryptography evolved from an attempt to attack two of the most difficult \nproblems associated with symmetric encryption. The first problem is that of key distribution, and the \nsecond one related to digital signature. key distribution under symmetric encryption requires either \n(1) that two communicants already share a key, which somehow has been distributed to them; or (2)", "chunk_id": "bbee4298-8baf-4541-b79f-3e64535ee123", "chroma:document": "Public Key Encryption :  Asymmetric is a form of Cryptosystem in which encryption and decryption \nare performed using different keys-Public key (known to everyone) and Private key (Secret key). \nThis is known as Public Key Encryption. \n2.2 Principles of Public-Key Cryptosystems \nThe concept of public-key cryptography evolved from an attempt to attack two of the most difficult"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: f72d06b3-3f3f-41ed-9846-118846b53e57
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 50, "full_page_content": "51 \n \n \n \n \nII. Public Key Cryptography \nPrinciples \u2013 RSA algorithm \u2013 Key Management \u2013 Diffie Hellman Key Exchange \n\u2013Message Authentication Requirements, Functions, Message Authentication \u2013 \nHash Functions \u2013 Digital Signatures \u2013 Authentication Protocols \n2.1 Introduction \nWhen the two parties communicate to each other to transfer the intelligible or sensible message, \nreferred to as plaintext, is converted into apparently random nonsense for security purpose \nreferred to as ciphertext.  \nEncryption: \nThe process of changing the plaintext into the ciphertext is referred to as encryption.  \nThe encryption process consists of an algorithm and a key. The key is a value independent of the \nplaintext.  \nThe security of conventional encryption depends on the major two factors:  \n1. The Encryption algorithm \n2. Secrecy of the key \nOnce the ciphertext is produced, it may be transmitted. The Encryption algorithm will produce a \ndifferent output depending on the specific key being used at the time. Changing the key changes the \noutput of the algorithm. Once the ciphertext is produced, it may be transmitted. Upon reception, the \nciphertext can be transformed back to the original plaintext by using a decryption algorithm and the \nsame key that was used for encryption.  \nDecryption:  \nThe process of changing the ciphertext to the plaintext that process is known as decryption.  \nPublic Key Encryption :  Asymmetric is a form of Cryptosystem in which encryption and decryption \nare performed using different keys-Public key (known to everyone) and Private key (Secret key). \nThis is known as Public Key Encryption. \n2.2 Principles of Public-Key Cryptosystems \nThe concept of public-key cryptography evolved from an attempt to attack two of the most difficult \nproblems associated with symmetric encryption. The first problem is that of key distribution, and the \nsecond one related to digital signature. key distribution under symmetric encryption requires either \n(1) that two communicants already share a key, which somehow has been distributed to them; or (2)", "chunk_id": "747dbbcb-cda9-42b2-a173-d1cdb9e63beb", "chroma:document": "problems associated with symmetric encryption. The first problem is that of key distribution, and the \nsecond one related to digital signature. key distribution under symmetric encryption requires either \n(1) that two communicants already share a key, which somehow has been distributed to them; or (2)"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: a740da25-75a6-4c32-ae8a-d71e924f03af
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 51, "full_page_content": "52 \n \nthe use of a key distribution center. The second problem is \"digital signatures.\" If the use of \ncryptography was to become widespread, not just in military situations but for commercial and \nprivate purposes, then electronic messages and documents would need the equivalent of signatures \nused in paper documents.  \nAsymmetric algorithms rely on one key for encryption and a different but related key for decryption.  \nThese algorithms have the following important characteristic: \n\u25cf It is computationally infeasible to determine the decryption key given only knowledge of the  \ncryptographic algorithm and the encryption key. \n\u25cf Either of the two related keys can be used for encryption, with the other used for decryption. \nA public-key encryption scheme has six ingredients  \n\u25cf Plaintext: This is the readable message or data that is fed into the algorithm as input. \n\u25cf Encryption algorithm: The encryption algorithm performs various transformations on the  \nplaintext. \n\u25cf Public and private keys: This is a pair of keys that have been selected so that if one is used for  \nencryption, the other is used for decryption. The exact transformations performed by the  \nalgorithm depend on the public or private key that is provided as input. \n\u25cf Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and  \nthe key. For a given message, two different keys will produce two different ciphertexts. \n\u25cf Decryption algorithm: This algorithm accepts the ciphertext and the matching key and  \nproduces the original plaintext.", "chunk_id": "b07b453d-eac6-4d8f-a1cf-6bfea00312ae", "chroma:document": "52 \n \nthe use of a key distribution center. The second problem is \"digital signatures.\" If the use of \ncryptography was to become widespread, not just in military situations but for commercial and \nprivate purposes, then electronic messages and documents would need the equivalent of signatures \nused in paper documents."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 07708819-63fd-4bd3-ba5e-203b108674e1
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 51, "full_page_content": "52 \n \nthe use of a key distribution center. The second problem is \"digital signatures.\" If the use of \ncryptography was to become widespread, not just in military situations but for commercial and \nprivate purposes, then electronic messages and documents would need the equivalent of signatures \nused in paper documents.  \nAsymmetric algorithms rely on one key for encryption and a different but related key for decryption.  \nThese algorithms have the following important characteristic: \n\u25cf It is computationally infeasible to determine the decryption key given only knowledge of the  \ncryptographic algorithm and the encryption key. \n\u25cf Either of the two related keys can be used for encryption, with the other used for decryption. \nA public-key encryption scheme has six ingredients  \n\u25cf Plaintext: This is the readable message or data that is fed into the algorithm as input. \n\u25cf Encryption algorithm: The encryption algorithm performs various transformations on the  \nplaintext. \n\u25cf Public and private keys: This is a pair of keys that have been selected so that if one is used for  \nencryption, the other is used for decryption. The exact transformations performed by the  \nalgorithm depend on the public or private key that is provided as input. \n\u25cf Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and  \nthe key. For a given message, two different keys will produce two different ciphertexts. \n\u25cf Decryption algorithm: This algorithm accepts the ciphertext and the matching key and  \nproduces the original plaintext.", "chunk_id": "d47d882e-a1d8-4757-960f-5f738eba1b14", "chroma:document": "Asymmetric algorithms rely on one key for encryption and a different but related key for decryption.  \nThese algorithms have the following important characteristic: \n\u25cf It is computationally infeasible to determine the decryption key given only knowledge of the  \ncryptographic algorithm and the encryption key."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: e5c33f7d-48c8-43c5-91f2-d5eb288a5571
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 51, "full_page_content": "52 \n \nthe use of a key distribution center. The second problem is \"digital signatures.\" If the use of \ncryptography was to become widespread, not just in military situations but for commercial and \nprivate purposes, then electronic messages and documents would need the equivalent of signatures \nused in paper documents.  \nAsymmetric algorithms rely on one key for encryption and a different but related key for decryption.  \nThese algorithms have the following important characteristic: \n\u25cf It is computationally infeasible to determine the decryption key given only knowledge of the  \ncryptographic algorithm and the encryption key. \n\u25cf Either of the two related keys can be used for encryption, with the other used for decryption. \nA public-key encryption scheme has six ingredients  \n\u25cf Plaintext: This is the readable message or data that is fed into the algorithm as input. \n\u25cf Encryption algorithm: The encryption algorithm performs various transformations on the  \nplaintext. \n\u25cf Public and private keys: This is a pair of keys that have been selected so that if one is used for  \nencryption, the other is used for decryption. The exact transformations performed by the  \nalgorithm depend on the public or private key that is provided as input. \n\u25cf Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and  \nthe key. For a given message, two different keys will produce two different ciphertexts. \n\u25cf Decryption algorithm: This algorithm accepts the ciphertext and the matching key and  \nproduces the original plaintext.", "chunk_id": "b5471b02-d97a-44f1-a8ad-605f451d5ba7", "chroma:document": "\u25cf Either of the two related keys can be used for encryption, with the other used for decryption. \nA public-key encryption scheme has six ingredients  \n\u25cf Plaintext: This is the readable message or data that is fed into the algorithm as input. \n\u25cf Encryption algorithm: The encryption algorithm performs various transformations on the  \nplaintext."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: b191af70-4495-43e9-bf67-4e5c051bc081
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 51, "full_page_content": "52 \n \nthe use of a key distribution center. The second problem is \"digital signatures.\" If the use of \ncryptography was to become widespread, not just in military situations but for commercial and \nprivate purposes, then electronic messages and documents would need the equivalent of signatures \nused in paper documents.  \nAsymmetric algorithms rely on one key for encryption and a different but related key for decryption.  \nThese algorithms have the following important characteristic: \n\u25cf It is computationally infeasible to determine the decryption key given only knowledge of the  \ncryptographic algorithm and the encryption key. \n\u25cf Either of the two related keys can be used for encryption, with the other used for decryption. \nA public-key encryption scheme has six ingredients  \n\u25cf Plaintext: This is the readable message or data that is fed into the algorithm as input. \n\u25cf Encryption algorithm: The encryption algorithm performs various transformations on the  \nplaintext. \n\u25cf Public and private keys: This is a pair of keys that have been selected so that if one is used for  \nencryption, the other is used for decryption. The exact transformations performed by the  \nalgorithm depend on the public or private key that is provided as input. \n\u25cf Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and  \nthe key. For a given message, two different keys will produce two different ciphertexts. \n\u25cf Decryption algorithm: This algorithm accepts the ciphertext and the matching key and  \nproduces the original plaintext.", "chunk_id": "2ffa2e15-c1b7-4f43-8697-ac279bca4ed4", "chroma:document": "plaintext. \n\u25cf Public and private keys: This is a pair of keys that have been selected so that if one is used for  \nencryption, the other is used for decryption. The exact transformations performed by the  \nalgorithm depend on the public or private key that is provided as input. \n\u25cf Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 773f8a0f-9c2c-4049-b282-cd0be9e38692
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 51, "full_page_content": "52 \n \nthe use of a key distribution center. The second problem is \"digital signatures.\" If the use of \ncryptography was to become widespread, not just in military situations but for commercial and \nprivate purposes, then electronic messages and documents would need the equivalent of signatures \nused in paper documents.  \nAsymmetric algorithms rely on one key for encryption and a different but related key for decryption.  \nThese algorithms have the following important characteristic: \n\u25cf It is computationally infeasible to determine the decryption key given only knowledge of the  \ncryptographic algorithm and the encryption key. \n\u25cf Either of the two related keys can be used for encryption, with the other used for decryption. \nA public-key encryption scheme has six ingredients  \n\u25cf Plaintext: This is the readable message or data that is fed into the algorithm as input. \n\u25cf Encryption algorithm: The encryption algorithm performs various transformations on the  \nplaintext. \n\u25cf Public and private keys: This is a pair of keys that have been selected so that if one is used for  \nencryption, the other is used for decryption. The exact transformations performed by the  \nalgorithm depend on the public or private key that is provided as input. \n\u25cf Ciphertext: This is the scrambled message produced as output. It depends on the plaintext and  \nthe key. For a given message, two different keys will produce two different ciphertexts. \n\u25cf Decryption algorithm: This algorithm accepts the ciphertext and the matching key and  \nproduces the original plaintext.", "chunk_id": "43b6963c-6f36-4aa1-b39e-b6bd7a0b1982", "chroma:document": "the key. For a given message, two different keys will produce two different ciphertexts. \n\u25cf Decryption algorithm: This algorithm accepts the ciphertext and the matching key and  \nproduces the original plaintext."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 75c6b83d-f88a-4fac-a000-a9d7ea8058a9
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 52, "full_page_content": "53 \n \nFig: Process of Encryption and Decryption \n \n \nDifference between Symmetric encryption and Asymmetric encryption \n \n \n \nThe essential steps are the following: \n1. Each user generates a pair of keys to be used for the encryption and decryption of messages.  \n2. Each user places one of the two keys in a public register or other accessible file. This is the public  \nkey. The companion key is kept private. As Figure 9.1a suggests, each user maintains a collection  \nof public keys obtained from others.  \nS.No \nSymmetric encryption  \nAsymmetric encryption  \n1. \nIt uses a single shared key (secret key) to \nencrypt and decrypt the message. \nIt uses two different keys for encryption and \ndecryption. \n2. \nThe size of cipher text is same or smaller \nthan the original plain text. \nThe size of cipher text is same or larger than the \noriginal plain text. \n3. \nThe encryption process is very fast. \nThe encryption process is slow. \n4. \nIt is used when a large amount of data is \nrequired to transfer. \nIt is used to transfer small amount of data. \n5. \nIt only provides confidentiality. \nIt provides confidentiality, authenticity and non-\nrepudiation. \n6. \nIt is less secured as there is a use of a \nsingle key for encryption. \nIt is safer as there are two keys used for \nencryption and decryption. \n7. \nThe algorithms used in symmetric \nencryption are 3DES, AES, DES, and \nRC4. \nRSA, DSA, Diffie-Hellman, ECC, ElGamal.", "chunk_id": "c5b22544-bf97-4855-8f23-7a63af92efe4", "chroma:document": "53 \n \nFig: Process of Encryption and Decryption \n \n \nDifference between Symmetric encryption and Asymmetric encryption \n \n \n \nThe essential steps are the following: \n1. Each user generates a pair of keys to be used for the encryption and decryption of messages.  \n2. Each user places one of the two keys in a public register or other accessible file. This is the public"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 39172d69-d5a4-4895-b2b2-138a418ddc6e
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 52, "full_page_content": "53 \n \nFig: Process of Encryption and Decryption \n \n \nDifference between Symmetric encryption and Asymmetric encryption \n \n \n \nThe essential steps are the following: \n1. Each user generates a pair of keys to be used for the encryption and decryption of messages.  \n2. Each user places one of the two keys in a public register or other accessible file. This is the public  \nkey. The companion key is kept private. As Figure 9.1a suggests, each user maintains a collection  \nof public keys obtained from others.  \nS.No \nSymmetric encryption  \nAsymmetric encryption  \n1. \nIt uses a single shared key (secret key) to \nencrypt and decrypt the message. \nIt uses two different keys for encryption and \ndecryption. \n2. \nThe size of cipher text is same or smaller \nthan the original plain text. \nThe size of cipher text is same or larger than the \noriginal plain text. \n3. \nThe encryption process is very fast. \nThe encryption process is slow. \n4. \nIt is used when a large amount of data is \nrequired to transfer. \nIt is used to transfer small amount of data. \n5. \nIt only provides confidentiality. \nIt provides confidentiality, authenticity and non-\nrepudiation. \n6. \nIt is less secured as there is a use of a \nsingle key for encryption. \nIt is safer as there are two keys used for \nencryption and decryption. \n7. \nThe algorithms used in symmetric \nencryption are 3DES, AES, DES, and \nRC4. \nRSA, DSA, Diffie-Hellman, ECC, ElGamal.", "chunk_id": "f1edbae6-0719-4fe9-833d-08f4ad995152", "chroma:document": "key. The companion key is kept private. As Figure 9.1a suggests, each user maintains a collection  \nof public keys obtained from others.  \nS.No \nSymmetric encryption  \nAsymmetric encryption  \n1. \nIt uses a single shared key (secret key) to \nencrypt and decrypt the message. \nIt uses two different keys for encryption and \ndecryption. \n2. \nThe size of cipher text is same or smaller"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: ef2097a7-d387-461f-92b2-36da4cc21367
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 52, "full_page_content": "53 \n \nFig: Process of Encryption and Decryption \n \n \nDifference between Symmetric encryption and Asymmetric encryption \n \n \n \nThe essential steps are the following: \n1. Each user generates a pair of keys to be used for the encryption and decryption of messages.  \n2. Each user places one of the two keys in a public register or other accessible file. This is the public  \nkey. The companion key is kept private. As Figure 9.1a suggests, each user maintains a collection  \nof public keys obtained from others.  \nS.No \nSymmetric encryption  \nAsymmetric encryption  \n1. \nIt uses a single shared key (secret key) to \nencrypt and decrypt the message. \nIt uses two different keys for encryption and \ndecryption. \n2. \nThe size of cipher text is same or smaller \nthan the original plain text. \nThe size of cipher text is same or larger than the \noriginal plain text. \n3. \nThe encryption process is very fast. \nThe encryption process is slow. \n4. \nIt is used when a large amount of data is \nrequired to transfer. \nIt is used to transfer small amount of data. \n5. \nIt only provides confidentiality. \nIt provides confidentiality, authenticity and non-\nrepudiation. \n6. \nIt is less secured as there is a use of a \nsingle key for encryption. \nIt is safer as there are two keys used for \nencryption and decryption. \n7. \nThe algorithms used in symmetric \nencryption are 3DES, AES, DES, and \nRC4. \nRSA, DSA, Diffie-Hellman, ECC, ElGamal.", "chunk_id": "297ae3cf-a8df-433a-b8f6-924aea8f312d", "chroma:document": "than the original plain text. \nThe size of cipher text is same or larger than the \noriginal plain text. \n3. \nThe encryption process is very fast. \nThe encryption process is slow. \n4. \nIt is used when a large amount of data is \nrequired to transfer. \nIt is used to transfer small amount of data. \n5. \nIt only provides confidentiality."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: f2218e68-d443-4e9c-8d2f-27f719a36699
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 52, "full_page_content": "53 \n \nFig: Process of Encryption and Decryption \n \n \nDifference between Symmetric encryption and Asymmetric encryption \n \n \n \nThe essential steps are the following: \n1. Each user generates a pair of keys to be used for the encryption and decryption of messages.  \n2. Each user places one of the two keys in a public register or other accessible file. This is the public  \nkey. The companion key is kept private. As Figure 9.1a suggests, each user maintains a collection  \nof public keys obtained from others.  \nS.No \nSymmetric encryption  \nAsymmetric encryption  \n1. \nIt uses a single shared key (secret key) to \nencrypt and decrypt the message. \nIt uses two different keys for encryption and \ndecryption. \n2. \nThe size of cipher text is same or smaller \nthan the original plain text. \nThe size of cipher text is same or larger than the \noriginal plain text. \n3. \nThe encryption process is very fast. \nThe encryption process is slow. \n4. \nIt is used when a large amount of data is \nrequired to transfer. \nIt is used to transfer small amount of data. \n5. \nIt only provides confidentiality. \nIt provides confidentiality, authenticity and non-\nrepudiation. \n6. \nIt is less secured as there is a use of a \nsingle key for encryption. \nIt is safer as there are two keys used for \nencryption and decryption. \n7. \nThe algorithms used in symmetric \nencryption are 3DES, AES, DES, and \nRC4. \nRSA, DSA, Diffie-Hellman, ECC, ElGamal.", "chunk_id": "4bed35fb-b787-4276-aa04-f7a8ab3f2e69", "chroma:document": "It provides confidentiality, authenticity and non-\nrepudiation. \n6. \nIt is less secured as there is a use of a \nsingle key for encryption. \nIt is safer as there are two keys used for \nencryption and decryption. \n7. \nThe algorithms used in symmetric \nencryption are 3DES, AES, DES, and \nRC4. \nRSA, DSA, Diffie-Hellman, ECC, ElGamal."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: ffe492f8-eb4e-4961-b454-5b138d3ccdc1
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 53, "full_page_content": "54 \n \n3. If Bob wishes to send a confidential message to Alice, Bob encrypts the message using Alice's  \npublic key.  \n4. When Alice receives the message, she decrypts it using her private key. No other recipient can  \ndecrypt the message because only Alice knows Alice's private key. \n \nWith this approach, all participants have access to public keys, and private keys are generated \nlocally by each participant and therefore need never be distributed. As long as a user's private key \nremains protected and secret, incoming communication is secure. \n \nTable 1:  summarizes some of the important aspects of symmetric and public-key encryption. \n \n \n \nRequirements for Public-Key Cryptography \n \n1. It is computationally easy for a party B to generate a pair (public key PUb, private key PRb). \n2. It is computationally easy for a sender A, knowing the public key and the message to be  \nencrypted, M, to generate the corresponding ciphertext:  \n  \nC = E(PUb, M) \n3. It is computationally easy for the receiver B to decrypt the resulting ciphertext using the private  \nkey to recover the original message: \nM = D(PRb, C) = D[PRb, E(PUb, M)] \n4. It is computationally infeasible for an adversary, knowing the public key, PUb, to determine the  \nprivate key, PRb. \n5. It is computationally infeasible for an adversary, knowing the public key, PUb, and a ciphertext,  \nC, to recover the original message, M. \n \nWe can add a sixth requirement that, although useful, is not necessary for all public-key", "chunk_id": "7dc19e8e-c3e1-44fb-98f2-1560e02a74a1", "chroma:document": "54 \n \n3. If Bob wishes to send a confidential message to Alice, Bob encrypts the message using Alice's  \npublic key.  \n4. When Alice receives the message, she decrypts it using her private key. No other recipient can  \ndecrypt the message because only Alice knows Alice's private key. \n \nWith this approach, all participants have access to public keys, and private keys are generated"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 24c787f7-1f04-4e6c-bf56-713e50338bd4
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 53, "full_page_content": "54 \n \n3. If Bob wishes to send a confidential message to Alice, Bob encrypts the message using Alice's  \npublic key.  \n4. When Alice receives the message, she decrypts it using her private key. No other recipient can  \ndecrypt the message because only Alice knows Alice's private key. \n \nWith this approach, all participants have access to public keys, and private keys are generated \nlocally by each participant and therefore need never be distributed. As long as a user's private key \nremains protected and secret, incoming communication is secure. \n \nTable 1:  summarizes some of the important aspects of symmetric and public-key encryption. \n \n \n \nRequirements for Public-Key Cryptography \n \n1. It is computationally easy for a party B to generate a pair (public key PUb, private key PRb). \n2. It is computationally easy for a sender A, knowing the public key and the message to be  \nencrypted, M, to generate the corresponding ciphertext:  \n  \nC = E(PUb, M) \n3. It is computationally easy for the receiver B to decrypt the resulting ciphertext using the private  \nkey to recover the original message: \nM = D(PRb, C) = D[PRb, E(PUb, M)] \n4. It is computationally infeasible for an adversary, knowing the public key, PUb, to determine the  \nprivate key, PRb. \n5. It is computationally infeasible for an adversary, knowing the public key, PUb, and a ciphertext,  \nC, to recover the original message, M. \n \nWe can add a sixth requirement that, although useful, is not necessary for all public-key", "chunk_id": "c389f74a-3eb4-46e2-a970-1f7404baf1ae", "chroma:document": "locally by each participant and therefore need never be distributed. As long as a user's private key \nremains protected and secret, incoming communication is secure. \n \nTable 1:  summarizes some of the important aspects of symmetric and public-key encryption. \n \n \n \nRequirements for Public-Key Cryptography"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 9c85ac96-6ade-48c9-ac80-2a3c6a1e254a
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 53, "full_page_content": "54 \n \n3. If Bob wishes to send a confidential message to Alice, Bob encrypts the message using Alice's  \npublic key.  \n4. When Alice receives the message, she decrypts it using her private key. No other recipient can  \ndecrypt the message because only Alice knows Alice's private key. \n \nWith this approach, all participants have access to public keys, and private keys are generated \nlocally by each participant and therefore need never be distributed. As long as a user's private key \nremains protected and secret, incoming communication is secure. \n \nTable 1:  summarizes some of the important aspects of symmetric and public-key encryption. \n \n \n \nRequirements for Public-Key Cryptography \n \n1. It is computationally easy for a party B to generate a pair (public key PUb, private key PRb). \n2. It is computationally easy for a sender A, knowing the public key and the message to be  \nencrypted, M, to generate the corresponding ciphertext:  \n  \nC = E(PUb, M) \n3. It is computationally easy for the receiver B to decrypt the resulting ciphertext using the private  \nkey to recover the original message: \nM = D(PRb, C) = D[PRb, E(PUb, M)] \n4. It is computationally infeasible for an adversary, knowing the public key, PUb, to determine the  \nprivate key, PRb. \n5. It is computationally infeasible for an adversary, knowing the public key, PUb, and a ciphertext,  \nC, to recover the original message, M. \n \nWe can add a sixth requirement that, although useful, is not necessary for all public-key", "chunk_id": "2a364002-1161-41dc-8783-5f092da0444a", "chroma:document": "1. It is computationally easy for a party B to generate a pair (public key PUb, private key PRb). \n2. It is computationally easy for a sender A, knowing the public key and the message to be  \nencrypted, M, to generate the corresponding ciphertext:  \n  \nC = E(PUb, M) \n3. It is computationally easy for the receiver B to decrypt the resulting ciphertext using the private"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 5150ba66-a68a-4d47-8b33-47a5f4e27f50
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 53, "full_page_content": "54 \n \n3. If Bob wishes to send a confidential message to Alice, Bob encrypts the message using Alice's  \npublic key.  \n4. When Alice receives the message, she decrypts it using her private key. No other recipient can  \ndecrypt the message because only Alice knows Alice's private key. \n \nWith this approach, all participants have access to public keys, and private keys are generated \nlocally by each participant and therefore need never be distributed. As long as a user's private key \nremains protected and secret, incoming communication is secure. \n \nTable 1:  summarizes some of the important aspects of symmetric and public-key encryption. \n \n \n \nRequirements for Public-Key Cryptography \n \n1. It is computationally easy for a party B to generate a pair (public key PUb, private key PRb). \n2. It is computationally easy for a sender A, knowing the public key and the message to be  \nencrypted, M, to generate the corresponding ciphertext:  \n  \nC = E(PUb, M) \n3. It is computationally easy for the receiver B to decrypt the resulting ciphertext using the private  \nkey to recover the original message: \nM = D(PRb, C) = D[PRb, E(PUb, M)] \n4. It is computationally infeasible for an adversary, knowing the public key, PUb, to determine the  \nprivate key, PRb. \n5. It is computationally infeasible for an adversary, knowing the public key, PUb, and a ciphertext,  \nC, to recover the original message, M. \n \nWe can add a sixth requirement that, although useful, is not necessary for all public-key", "chunk_id": "1803fe06-ab84-4590-8443-c960a58c671a", "chroma:document": "key to recover the original message: \nM = D(PRb, C) = D[PRb, E(PUb, M)] \n4. It is computationally infeasible for an adversary, knowing the public key, PUb, to determine the  \nprivate key, PRb. \n5. It is computationally infeasible for an adversary, knowing the public key, PUb, and a ciphertext,  \nC, to recover the original message, M."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: f8fb2e8a-a546-46af-b83f-776dc5ca14f5
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 53, "full_page_content": "54 \n \n3. If Bob wishes to send a confidential message to Alice, Bob encrypts the message using Alice's  \npublic key.  \n4. When Alice receives the message, she decrypts it using her private key. No other recipient can  \ndecrypt the message because only Alice knows Alice's private key. \n \nWith this approach, all participants have access to public keys, and private keys are generated \nlocally by each participant and therefore need never be distributed. As long as a user's private key \nremains protected and secret, incoming communication is secure. \n \nTable 1:  summarizes some of the important aspects of symmetric and public-key encryption. \n \n \n \nRequirements for Public-Key Cryptography \n \n1. It is computationally easy for a party B to generate a pair (public key PUb, private key PRb). \n2. It is computationally easy for a sender A, knowing the public key and the message to be  \nencrypted, M, to generate the corresponding ciphertext:  \n  \nC = E(PUb, M) \n3. It is computationally easy for the receiver B to decrypt the resulting ciphertext using the private  \nkey to recover the original message: \nM = D(PRb, C) = D[PRb, E(PUb, M)] \n4. It is computationally infeasible for an adversary, knowing the public key, PUb, to determine the  \nprivate key, PRb. \n5. It is computationally infeasible for an adversary, knowing the public key, PUb, and a ciphertext,  \nC, to recover the original message, M. \n \nWe can add a sixth requirement that, although useful, is not necessary for all public-key", "chunk_id": "8b44b8ea-e0b9-4894-8e74-7bcce0f5935b", "chroma:document": "We can add a sixth requirement that, although useful, is not necessary for all public-key"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 5854ee70-ea9f-4dd3-a04b-067440c3031a
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 54, "full_page_content": "55 \n \napplications: \n6. The two keys can be applied in either order: \nM = D[PUb, E(PRb, M)] = D[PRb, E(PUb, M)] \n \n \n \n2.3 RSA Algorithm: \nDiffie and Hellman challenged cryptologists to come up with a cryptographic algorithm that \nmet the requirements for public-key systems. \nOne of the first successful responses to the challenge was developed in 1977 by Ron Rivest, Adi \nShamir, and Len Adleman at MIT and first published in 1978. The Rivest-Shamir-Adleman (RSA) \nscheme has since that time reigned supreme as the most widely accepted and implemented general-\npurpose approach to public-key encryption. \nThe RSA scheme is a block cipher in which the plaintext and ciphertext are integers between 0 and \nn - 1 for some n. A typical size for n is 1024 bits, or 309 decimal digits. That is, n is less than 21024. \nWe examine RSA in this section in some detail, beginning with an explanation of the algorithm. Then \nwe examine some of the computational and cryptanalytical implications of RSA. \n2.3.1 Description of the Algorithm \nRSA makes use of an expression with exponentials. Plaintext is encrypted in blocks, with each block \nhaving a binary value less than some number n. That is, the block size must be less than or equal to \nlog2(n) + 1; in practice, the block size is i bits, where 2i < n \u2264 2i+1. Encryption and decryption are \nof the following form, for some plaintext block M and ciphertext block C. \n \nBoth sender and receiver must know the value of n. The sender knows the value of e, and \nonly the receiver knows the value of d. Thus, this is a public-key encryption algorithm with a \npublic key of PU = {e, n} and a private key of PR = {d, n}. \nFor this algorithm to be satisfactory for public-key encryption, the following requirements \nmust be met. \n1. It is possible to find values of e, d, n such that Med mod n = M for all M < n. \n2. It is relatively easy to calculate Me mod n and Cd mod n for all values of M < n. \n3. It is infeasible to determine d given e and n. \nWe need to find a relationship of the form \nMed mod n = M \nThe preceding relationship holds if e and d are multiplicative inverses modulo \u03c6(n), where \n\u03c6(n) is the Euler totient function. \nFor p,q prime, \u03c6 (pq) = (p - 1)(q - 1). The relationship between e and d can be expressed as", "chunk_id": "64b4324c-ad01-4e27-8176-b98be13be9c3", "chroma:document": "55 \n \napplications: \n6. The two keys can be applied in either order: \nM = D[PUb, E(PRb, M)] = D[PRb, E(PUb, M)] \n \n \n \n2.3 RSA Algorithm: \nDiffie and Hellman challenged cryptologists to come up with a cryptographic algorithm that \nmet the requirements for public-key systems. \nOne of the first successful responses to the challenge was developed in 1977 by Ron Rivest, Adi"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 19b00b55-767e-46dd-8b21-ef071288d55c
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 54, "full_page_content": "55 \n \napplications: \n6. The two keys can be applied in either order: \nM = D[PUb, E(PRb, M)] = D[PRb, E(PUb, M)] \n \n \n \n2.3 RSA Algorithm: \nDiffie and Hellman challenged cryptologists to come up with a cryptographic algorithm that \nmet the requirements for public-key systems. \nOne of the first successful responses to the challenge was developed in 1977 by Ron Rivest, Adi \nShamir, and Len Adleman at MIT and first published in 1978. The Rivest-Shamir-Adleman (RSA) \nscheme has since that time reigned supreme as the most widely accepted and implemented general-\npurpose approach to public-key encryption. \nThe RSA scheme is a block cipher in which the plaintext and ciphertext are integers between 0 and \nn - 1 for some n. A typical size for n is 1024 bits, or 309 decimal digits. That is, n is less than 21024. \nWe examine RSA in this section in some detail, beginning with an explanation of the algorithm. Then \nwe examine some of the computational and cryptanalytical implications of RSA. \n2.3.1 Description of the Algorithm \nRSA makes use of an expression with exponentials. Plaintext is encrypted in blocks, with each block \nhaving a binary value less than some number n. That is, the block size must be less than or equal to \nlog2(n) + 1; in practice, the block size is i bits, where 2i < n \u2264 2i+1. Encryption and decryption are \nof the following form, for some plaintext block M and ciphertext block C. \n \nBoth sender and receiver must know the value of n. The sender knows the value of e, and \nonly the receiver knows the value of d. Thus, this is a public-key encryption algorithm with a \npublic key of PU = {e, n} and a private key of PR = {d, n}. \nFor this algorithm to be satisfactory for public-key encryption, the following requirements \nmust be met. \n1. It is possible to find values of e, d, n such that Med mod n = M for all M < n. \n2. It is relatively easy to calculate Me mod n and Cd mod n for all values of M < n. \n3. It is infeasible to determine d given e and n. \nWe need to find a relationship of the form \nMed mod n = M \nThe preceding relationship holds if e and d are multiplicative inverses modulo \u03c6(n), where \n\u03c6(n) is the Euler totient function. \nFor p,q prime, \u03c6 (pq) = (p - 1)(q - 1). The relationship between e and d can be expressed as", "chunk_id": "c9ad36d7-6a46-4c90-9258-03ce8d28d61e", "chroma:document": "Shamir, and Len Adleman at MIT and first published in 1978. The Rivest-Shamir-Adleman (RSA) \nscheme has since that time reigned supreme as the most widely accepted and implemented general-\npurpose approach to public-key encryption. \nThe RSA scheme is a block cipher in which the plaintext and ciphertext are integers between 0 and"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 40951d06-7d18-4308-8a40-933418ba7896
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 54, "full_page_content": "55 \n \napplications: \n6. The two keys can be applied in either order: \nM = D[PUb, E(PRb, M)] = D[PRb, E(PUb, M)] \n \n \n \n2.3 RSA Algorithm: \nDiffie and Hellman challenged cryptologists to come up with a cryptographic algorithm that \nmet the requirements for public-key systems. \nOne of the first successful responses to the challenge was developed in 1977 by Ron Rivest, Adi \nShamir, and Len Adleman at MIT and first published in 1978. The Rivest-Shamir-Adleman (RSA) \nscheme has since that time reigned supreme as the most widely accepted and implemented general-\npurpose approach to public-key encryption. \nThe RSA scheme is a block cipher in which the plaintext and ciphertext are integers between 0 and \nn - 1 for some n. A typical size for n is 1024 bits, or 309 decimal digits. That is, n is less than 21024. \nWe examine RSA in this section in some detail, beginning with an explanation of the algorithm. Then \nwe examine some of the computational and cryptanalytical implications of RSA. \n2.3.1 Description of the Algorithm \nRSA makes use of an expression with exponentials. Plaintext is encrypted in blocks, with each block \nhaving a binary value less than some number n. That is, the block size must be less than or equal to \nlog2(n) + 1; in practice, the block size is i bits, where 2i < n \u2264 2i+1. Encryption and decryption are \nof the following form, for some plaintext block M and ciphertext block C. \n \nBoth sender and receiver must know the value of n. The sender knows the value of e, and \nonly the receiver knows the value of d. Thus, this is a public-key encryption algorithm with a \npublic key of PU = {e, n} and a private key of PR = {d, n}. \nFor this algorithm to be satisfactory for public-key encryption, the following requirements \nmust be met. \n1. It is possible to find values of e, d, n such that Med mod n = M for all M < n. \n2. It is relatively easy to calculate Me mod n and Cd mod n for all values of M < n. \n3. It is infeasible to determine d given e and n. \nWe need to find a relationship of the form \nMed mod n = M \nThe preceding relationship holds if e and d are multiplicative inverses modulo \u03c6(n), where \n\u03c6(n) is the Euler totient function. \nFor p,q prime, \u03c6 (pq) = (p - 1)(q - 1). The relationship between e and d can be expressed as", "chunk_id": "db8c790c-0755-4a3e-9668-82474d4f938c", "chroma:document": "n - 1 for some n. A typical size for n is 1024 bits, or 309 decimal digits. That is, n is less than 21024. \nWe examine RSA in this section in some detail, beginning with an explanation of the algorithm. Then \nwe examine some of the computational and cryptanalytical implications of RSA. \n2.3.1 Description of the Algorithm"}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: becac540-17fb-488f-b5e1-3ead564e2f3b
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 54, "full_page_content": "55 \n \napplications: \n6. The two keys can be applied in either order: \nM = D[PUb, E(PRb, M)] = D[PRb, E(PUb, M)] \n \n \n \n2.3 RSA Algorithm: \nDiffie and Hellman challenged cryptologists to come up with a cryptographic algorithm that \nmet the requirements for public-key systems. \nOne of the first successful responses to the challenge was developed in 1977 by Ron Rivest, Adi \nShamir, and Len Adleman at MIT and first published in 1978. The Rivest-Shamir-Adleman (RSA) \nscheme has since that time reigned supreme as the most widely accepted and implemented general-\npurpose approach to public-key encryption. \nThe RSA scheme is a block cipher in which the plaintext and ciphertext are integers between 0 and \nn - 1 for some n. A typical size for n is 1024 bits, or 309 decimal digits. That is, n is less than 21024. \nWe examine RSA in this section in some detail, beginning with an explanation of the algorithm. Then \nwe examine some of the computational and cryptanalytical implications of RSA. \n2.3.1 Description of the Algorithm \nRSA makes use of an expression with exponentials. Plaintext is encrypted in blocks, with each block \nhaving a binary value less than some number n. That is, the block size must be less than or equal to \nlog2(n) + 1; in practice, the block size is i bits, where 2i < n \u2264 2i+1. Encryption and decryption are \nof the following form, for some plaintext block M and ciphertext block C. \n \nBoth sender and receiver must know the value of n. The sender knows the value of e, and \nonly the receiver knows the value of d. Thus, this is a public-key encryption algorithm with a \npublic key of PU = {e, n} and a private key of PR = {d, n}. \nFor this algorithm to be satisfactory for public-key encryption, the following requirements \nmust be met. \n1. It is possible to find values of e, d, n such that Med mod n = M for all M < n. \n2. It is relatively easy to calculate Me mod n and Cd mod n for all values of M < n. \n3. It is infeasible to determine d given e and n. \nWe need to find a relationship of the form \nMed mod n = M \nThe preceding relationship holds if e and d are multiplicative inverses modulo \u03c6(n), where \n\u03c6(n) is the Euler totient function. \nFor p,q prime, \u03c6 (pq) = (p - 1)(q - 1). The relationship between e and d can be expressed as", "chunk_id": "9139414d-95ed-4292-a5b1-c6381b955ffc", "chroma:document": "RSA makes use of an expression with exponentials. Plaintext is encrypted in blocks, with each block \nhaving a binary value less than some number n. That is, the block size must be less than or equal to \nlog2(n) + 1; in practice, the block size is i bits, where 2i < n \u2264 2i+1. Encryption and decryption are \nof the following form, for some plaintext block M and ciphertext block C."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 2cee0c73-5fd3-456b-9c6c-c749dcec40a1
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 54, "full_page_content": "55 \n \napplications: \n6. The two keys can be applied in either order: \nM = D[PUb, E(PRb, M)] = D[PRb, E(PUb, M)] \n \n \n \n2.3 RSA Algorithm: \nDiffie and Hellman challenged cryptologists to come up with a cryptographic algorithm that \nmet the requirements for public-key systems. \nOne of the first successful responses to the challenge was developed in 1977 by Ron Rivest, Adi \nShamir, and Len Adleman at MIT and first published in 1978. The Rivest-Shamir-Adleman (RSA) \nscheme has since that time reigned supreme as the most widely accepted and implemented general-\npurpose approach to public-key encryption. \nThe RSA scheme is a block cipher in which the plaintext and ciphertext are integers between 0 and \nn - 1 for some n. A typical size for n is 1024 bits, or 309 decimal digits. That is, n is less than 21024. \nWe examine RSA in this section in some detail, beginning with an explanation of the algorithm. Then \nwe examine some of the computational and cryptanalytical implications of RSA. \n2.3.1 Description of the Algorithm \nRSA makes use of an expression with exponentials. Plaintext is encrypted in blocks, with each block \nhaving a binary value less than some number n. That is, the block size must be less than or equal to \nlog2(n) + 1; in practice, the block size is i bits, where 2i < n \u2264 2i+1. Encryption and decryption are \nof the following form, for some plaintext block M and ciphertext block C. \n \nBoth sender and receiver must know the value of n. The sender knows the value of e, and \nonly the receiver knows the value of d. Thus, this is a public-key encryption algorithm with a \npublic key of PU = {e, n} and a private key of PR = {d, n}. \nFor this algorithm to be satisfactory for public-key encryption, the following requirements \nmust be met. \n1. It is possible to find values of e, d, n such that Med mod n = M for all M < n. \n2. It is relatively easy to calculate Me mod n and Cd mod n for all values of M < n. \n3. It is infeasible to determine d given e and n. \nWe need to find a relationship of the form \nMed mod n = M \nThe preceding relationship holds if e and d are multiplicative inverses modulo \u03c6(n), where \n\u03c6(n) is the Euler totient function. \nFor p,q prime, \u03c6 (pq) = (p - 1)(q - 1). The relationship between e and d can be expressed as", "chunk_id": "6c2e54c3-0ea3-4b89-bc2e-359b2714be91", "chroma:document": "Both sender and receiver must know the value of n. The sender knows the value of e, and \nonly the receiver knows the value of d. Thus, this is a public-key encryption algorithm with a \npublic key of PU = {e, n} and a private key of PR = {d, n}. \nFor this algorithm to be satisfactory for public-key encryption, the following requirements \nmust be met."}


created_at: 2025-01-28 05:36:03
topic: persistent://default/default/a5c4f461-3901-4175-9ce9-937730884692
id: 41240046-ad0d-4946-823b-1af1266e7fdc
encoding: FLOAT32
metadata:
{"producer": "Microsoft\u00ae Word 2019", "creator": "Microsoft\u00ae Word 2019", "creationdate": "2022-02-08T09:25:32+05:30", "source": "data/SITA1602.pdf", "file_path": "data/SITA1602.pdf", "total_pages": 165, "format": "PDF 1.7", "title": "", "author": "Jabez J", "subject": "", "keywords": "", "moddate": "2022-02-08T09:25:32+05:30", "trapped": "", "page": 54, "full_page_content": "55 \n \napplications: \n6. The two keys can be applied in either order: \nM = D[PUb, E(PRb, M)] = D[PRb, E(PUb, M)] \n \n \n \n2.3 RSA Algorithm: \nDiffie and Hellman challenged cryptologists to come up with a cryptographic algorithm that \nmet the requirements for public-key systems. \nOne of the first successful responses to the challenge was developed in 1977 by Ron Rivest, Adi \nShamir, and Len Adleman at MIT and first published in 1978. The Rivest-Shamir-Adleman (RSA) \nscheme has since that time reigned supreme as the most widely accepted and implemented general-\npurpose approach to public-key encryption. \nThe RSA scheme is a block cipher in which the plaintext and ciphertext are integers between 0 and \nn - 1 for some n. A typical size for n is 1024 bits, or 309 decimal digits. That is, n is less than 21024. \nWe examine RSA in this section in some detail, beginning with an explanation of the algorithm. Then \nwe examine some of the computational and cryptanalytical implications of RSA. \n2.3.1 Description of the Algorithm \nRSA makes use of an expression with exponentials. Plaintext is encrypted in blocks, with each block \nhaving a binary value less than some number n. That is, the block size must be less than or equal to \nlog2(n) + 1; in practice, the block size is i bits, where 2i < n \u2264 2i+1. Encryption and decryption are \nof the following form, for some plaintext block M and ciphertext block C. \n \nBoth sender and receiver must know the value of n. The sender knows the value of e, and \nonly the receiver knows the value of d. Thus, this is a public-key encryption algorithm with a \npublic key of PU = {e, n} and a private key of PR = {d, n}. \nFor this algorithm to be satisfactory for public-key encryption, the following requirements \nmust be met. \n1. It is possible to find values of e, d, n such that Med mod n = M for all M < n. \n2. It is relatively easy to calculate Me mod n and Cd mod n for all values of M < n. \n3. It is infeasible to determine d given e and n. \nWe need to find a relationship of the form \nMed mod n = M \nThe preceding relationship holds if e and d are multiplicative inverses modulo \u03c6(n), where \n\u03c6(n) is the Euler totient function. \nFor p,q prime, \u03c6 (pq) = (p - 1)(q - 1). The relationship between e and d can be expressed as", "chunk_id": "ce6e56b2-d72f-431a-99de-202f09c7b79e", "chroma:document": "must be met. \n1. It is possible to find values of e, d, n such that Med mod n = M for all M < n. \n2. It is relatively easy to calculate Me mod n and Cd mod n for all values of M < n. \n3. It is infeasible to determine d given e and n. \nWe need to find a relationship of the form \nMed mod n = M"}


