Podcasts about rivest

The fallback for law enforcement agencies has always been the place where files are stored, and all the best encryption within end-to-end communications will not stop unencrypted files at rest from being examined. But when the user encrypts data into the Cloud and where they hold their own keys, that's when the nightmare begins for them. The rise of cybersecurity on the Internet Let's pinpoint the start of cybersecurity on the Internet to the 1970s. This saw the rise of the Lucifer cipher and saw banks properly protect their communications. This led to the 56-bit DES encryption method, and which led many to suspect that the size of the key had been crippled due to the demands of law enforcement agencies. But, there was an even greater threat to these agencies evolving: public key encryption. The rise of public key encryption started in the mid-1970s when Whitfield Diffie and Marty Hellman first defined a method that allowed us to secure our communications using a key exchange method — the Diffie-Hellman key exchange method. And then, almost a year later, Rivest, Shamir and Adleman presented a way to digitally sign a hash of data with the RSA signature method, and where a server could sign a hash of data with its private key and for this to be verified with an associated public key. For almost the first time, we could digitally verify that we were connecting to a valid system. But, the RSA method could not only sign data, it could also encrypt things with a public key, and where the private key could now be used to decrypt the data. It was a nightmare come true for law enforcement agencies. What was magical about these methods was that you could encrypt data with keys that could be created for every single session — and generated and stored on user devices. User devices could even pick the keys that they wanted and their sizes and security levels. The days of security being crippled were fading fast. While the first versions of SSL were crippled by the demands for limits on this security, eventually, SSL evolved into something that could not be controlled. But, still files could still be viewed on user devices, so it was not a major problem for investigators. Then, in 2001, the AES method was standardized by NIST, along with the newly defined SHA-256 hashing method, and we basically had all the security methods in place. But all of this did not please law enforcement agencies. For them, the rise of cryptography removed the opportunities that they had had in the past and where they could mass harvest information from phone calls or from the postal service. For the first time in history, citizens were free from spying from both those who protect nations and those who attack citizens. The Wild West years of the early Internet — and where little could be trusted — have subsided, and now we have systems which take encryption from one service on a device to another service on another device — end-to-end encryption. End-to-end encryption For some, end-to-end encryption was the final nail in the coffin for those who wish to monitor the tracks of citizens. This is data in motion, and where law enforcement agencies could still peak at data at rest and where the data is actually stored. Once data in motion and data at rest were encrypted, the door was effectively closed for peaking at data. And, so, companies such as Apple advanced new methods which protected data at rest, and where all of a citizen's data could be encrypted onto the Cloud without Apple having the encryption key to view any part of it. For this, they created the Advanced Data Protection service: This service protects things like citizens' photos, iCloud Drive, and wallet passes. For almost the first time, we had almost perfect security — and where five decades of advancement were finally coming together. We now have end-to-end encryption in apps such as What's App and Signal, and Apple provides secure data storage. But, some governments around the world saw the rise of privacy as a threat to their security agencies, and where the usage of encryption with file storage and over-the-air would mean that they could not monitor their citizens for threats against society. It is — and always will be — a lose-lose store on both sides. And, so, many governments have been calling for a back door in cryptography so that a “good guy” could get access to the citizen data and communication, but not a “bad guy”. Unfortunately, that's not the way that encryption works, and where backdoors are a bad thing and difficult to hide. So, the UK government has put pressure on Apple to provide them with a backdoor into their secure systems. For this, Apple would have to either provide them with a magic key to open up encrypted communications and file store, or dump their Advanced Data Protection system, and leave files unencrypted for investigation. Apple stepping back It would have been a difficult choice for Apple, but they have decided to drop their Advanced Data Protection system for UK users, and not go with the nightmare of a backdoor in their systems. Imagine if a terrorist had stored their files in iCloud, and law enforcement agencies had requested these files. Well, Apple would have to hold their hands up and say that they didn't have the encryption files to access them, as the encryption keys were held by the user. I trust Apple and believe they have some of the best security around. When was the last time you heard of someone getting some malware on an Apple system? They support a proper secure enclave and are advancing a privacy-aware cloud infrastructure for machine learning. They have also brought forward homomorphic encryption applications. Of all the big tech companies, Apple leads the way in terms of supporting the privacy and the security of users. Conclusions I feel sorry for Apple, as they have been painted into a corner. From a cybersecurity point-of-view, it is disappointing that Apple has been forced to step back on the Advanced Data Protection tool, as it was a great advancement in overcoming large-scale data breaches. And, like it or not, there is no magic wand that stops a bad actor from using something that a good actor has access to. Basically, if you leave your front door key under the mat, you have no guarantee that someone else will find the key and use it. We have advanced cybersecurity for the past few decades and now use end-to-end encryption in a way we should have done from the start of the Internet. Of course, there are no winners in this, and society must find ways to protect itself from bad people, but opening up the whole of iCloud seems like a disaster waiting to happen. The door is open for other more agile companies to support enhanced security and privacy, as the large tech companies seem to be applying the brake on some of their security advancements.

Lynn Rivest is the Founder of Lynn Rivest Consulting, a firm specializing in helping small service-based business founders define profitable positioning to attract high-value clients. With over 23 years of experience in digital marketing and strategy, Lynn has worked extensively with founders to refine their messaging, improve client acquisition, and streamline their business models for maximum revenue. Her approach combines simplicity and focus, enabling businesses to gain clarity and stand out in competitive markets. In this episode… Positioning your business in a crowded marketplace can feel overwhelming. How do you ensure your message stands out and reaches the right audience? According to Lynn Rivest, a digital strategist and business advisor, positioning is about defining your business's unique value and ensuring it resonates with the right audience. She highlights that without clear positioning, businesses often struggle to explain their value, leading to missed opportunities and ineffective marketing. Positioning acts as a guide for all business decisions, from product offerings to marketing strategies, and helps you focus on what matters most to your ideal clients. Lynn emphasizes that strong positioning not only amplifies your message but also saves time, resources, and money by attracting the right clients and simplifying other aspects of business, like referrals and messaging.  In this episode of the Financial Clarity podcast, host Hannah Smolinski sits down with Lynn Rivest, Founder of Lynn Rivest Consulting, to discuss strategic positioning and differentiation for small businesses. They explore why positioning is essential for standing out, how it amplifies business decisions, and why differentiation is critical for success. Lynn also shares insights on identifying and serving your ideal clients while implementing positioning strategies effectively.

Join host Robert Forto as he welcomes Anny Malo and Marco Rivest from Canada to talk about traveling long distances to race in races like the Stage Stop, Rondy and more.

[PARTENAIRE] Vous êtes à un tournant professionnel ? Mon partenaire Sensei propose des bilans de compétences personnalisés

Hierbei handelt es sich um einen überarbeiteten Reupload einer Folge aus Februar 2024.In der heutigen Nodesignal-Folge spricht Jan-Paul mit Jeff und Rene über Aaron van Wirdums neues Buch The Genesis Book, über die Menschen und Projekte, die Bitcoin inspiriert haben. Dies ist der zweite Teil des Gesprächs, der erste Teil findest du unter Folge E162.Von und mit: - Calso - Jan-Paul - René

Hierbei handelt es sich um einen überarbeiteten Reupload einer Folge aus Februar 2024. In der heutigen Nodesignal-Folge spricht Jan-Paul mit Jeff und Rene über Aaron van Wirdums neues Buch The Genesis Book, über die Menschen und Projekte, die Bitcoin inspiriert haben. Dies ist der erste Teil des Gesprächs, der zweite Teil erscheint in der nächsten Folge E163.Von und mit: - Calso - Jan-Paul - René

L'épisode 5 du podcast "Les Machines", animé par les frères jumeaux Maxime et David Tardif de l'Équipe Tardif, présente Félix Rivest, un courtier immobilier performant. Félix partage son parcours dans l'immobilier, commençant en 2015 après une carrière dans la vente au détail. Il discute de ses débuts difficiles, de son premier investissement immobilier à l'âge de 20 ans, et de l'importance du développement personnel dans sa réussite. L'épisode aborde également les avantages de travailler en équipe dans l'immobilier et l'importance de rester positif face aux défis du métier. Félix partage des conseils précieux pour les courtiers et les investisseurs immobiliers, soulignant l'importance de l'empathie envers les clients et de la persévérance dans ce domaine.

Welcome to episode ⁠⁠⁠⁠#110 ⁠of the MindCep Podcast! In MindCep episode #110, we explore crafting your inner world

Le podcast est destiné à rassembler, inspirer & éduquer la communauté des grimpeurs francophones. Pour nous encourager, laissez un commentaire, partager le podcast & suivez-nous sur nos plateformes! liens: linktr.ee/lavoixdesgrimpeurspodcast

It's incredible how dramatic climate science can be. That was my first thought after I watched the new documentary, Canary, which chronicles the life and career of Dr. Lonnie Thompson. This week, the subject behind the film, Dr. Thompson, and the co-directors of the documentary, Danny O'Malley and Dr. Alex Rivest, explain how the film came together and the thrilling story behind its development. We discuss how to tell compelling climate stories, what motivates their work, and what decades of glacier science can teach us about the climate crisis.   Lonnie G. Thompson, a Distinguished University Professor at The Ohio State University, and senior research scientist, specializes in paleoclimatology, ice cores, and climate change.  Alex Rivest is a Massachusetts Institute of Technology-trained PhD Neuroscientist. Having worked alongside Nobel Prize winner Dr. Susumu Tonegawa, his research has been published in two of the most highly renowned scientific journals, Science and Nature Neuroscience.  Danny O'Malley is a Grammy nominated and James Beard nominated film director. Best known for his work on Netflix's Chef's Table, where he serves as co-executive producer and a director. As always, follow us @climatepod on Twitter and email us at theclimatepod@gmail.com. Our music is "Gotta Get Up" by The Passion Hifi, check out his music at thepassionhifi.com. Rate, review and subscribe to this podcast on iTunes, Spotify, Stitcher, and more! Subscribe to our YouTube channel! Join our Facebook group.   Rent Canary

Pour souligner la Journée internationale des femmes, Sous le bouchon pose la question : est-ce que le vin est encore un monde d'hommes ? Au micro, Ève Rainville, co-propriétaire du vignoble Domaine Bergeville, et Véronique Rivest, sommelière reconnue et chroniqueuse, en discute avec nous.

Le podcast est destiné à rassembler, inspirer & éduquer la communauté des grimpeurs francophones. Pour nous encourager, laissez un commentaire, partager le podcast & suivez-nous sur nos plateformes! liens: linktr.ee/lavoixdesgrimpeurspodcast

In der heutigen Nodesignal-Folge spricht Jan-Paul mit Jeff und Rene über Aaron van Wirdums neues Buch The Genesis Book, über die Menschen und Projekte, die Bitcoin inspiriert haben. Dies ist der zweite Teil des Gesprächs, der erste Teil findest du unter Folge E162. Von und mit Jan-Paul, Jeff und Rene.Produziert und geschnitten: ThorstenHier könnt ihr uns eine Spende über Lightning da lassen: ⚡️nodesignal@getalby.comWenn euch unsere Arbeit gefällt, könnt ihr unsere Folgen auch auf Podcasting 2.0 Plattformen, wie Breez, Fountain oder Castamatic hören und uns so eine kleine Aufmerksamkeit da lassen. Danke an alle, die die Bitcoin Community mit ihren Spenden unterstützen! Mit diesen Spenden wird unter anderem unser Bounty Programm verwirklicht, in dem ihr euch für die Mitarbeit an einem Projekt eine Belohnung sichern könnt.Für Feedback und weitergehenden Diskussionen kommt gerne in die Telegramgruppe von Nodesignal und bewertet uns bei Spotify und Apple Podcasts. Folgt uns auch gerne bei Twitter.Blockzeit: 827008Hayeks Vorhersage von Bitcoin: Friedrich August von Hayek predicting Bitcoin in 1984 - A Sly Roundabout WayThe Genesis Book (amazon.de)Google Drive mit vollständigem Text des BuchesWebseite zum Genesis Book undÜber den Autor Aaron van WirdumAaron van Wirdum bei Bitcoin MagazineAaron van Wirdum bei XFriedrich August v. Hayek (Wikipedia)Denationalisation of Money (engl.)Richard Stallmann (Wikipedia)Whitfield Diffie & Martin Hellman: New Directions in Cryptography (1976)Rivest, Shamir, Adleman: A Method for Obtaining Digital Signatures and Public-key CryptosystemsDavid Chaum (Wikipedia)Blind Signatures for Digital PaymentsExtroprianismus (Wikipedia)Extropy InstituteExtropy Magazine, Ed. 15 The Digital Cash IssueMax More: The Extroprian PriniciplesCypherpunks Mailing List ArchiveTim May - The Crypto Anarchixt ManifestoEric Hughes - A Cypherpunk's ManifestoAdam Back - HashashStuart Haber & W. Scott Stornetta - How to time-stamp a digital documentNick Szabo (Wikipedia)Unenumerated (Nick Szabos Blog)Nick Szabo: Shelling Out - Die Ursprünge des GeldesBit Gold (Nakamoto Institute)Wei Dai - b-money (Nakamoto Institute)S15 E15: Aaron van Wirdum on The Genesis Book & Bitcoin Pre-HistoryHal FinneyRPOW (Nakamoto Institue)Nodesignal-Techboost – E05 – Updates September 2022 zu Cashu #1Nodesignal-Techboost - E120 - Hauptsache Nüsse zu Cashu #2Socratic Seminar 14.02.Outro Song Read a Book (Dirty Version)Timestamps:(00:00:00) Intro(00:00:22) Begrüßung und Start(00:01:09) Extroprianismus(00:09:08) Cypherpunks Mailing List Archive(00:13:03) Crypto Wars(00:18:13) Zwischenzeitliche Katerstimmung(00:21:31) Adam Back - Hashash(00:28:48) Nick Szabo: Shelling Out(00:30:59) Nick Szabo: Bit Gold(00:37:03) Wei Dai - b-money(00:42:56) Hal Finney: RPOW(00:50:03) E-Gold(00:53:40) Bitcoin betritt die Bühne(00:57:35) Fazit zum Buch(01:03:32) Verabschiedung und Outro

In der heutigen Nodesignal-Folge spricht Jan-Paul mit Jeff und Rene über Aaron van Wirdums neues Buch The Genesis Book, über die Menschen und Projekte, die Bitcoin inspiriert haben. Dies ist der erste Teil des Gesprächs, der zweite Teil erscheint in der nächsten Folge E163.Von und mit Jan-Paul, Jeff und Rene.Produziert und geschnitten: ThorstenHier könnt ihr uns eine Spende über Lightning da lassen: ⚡️nodesignal@getalby.comWenn euch unsere Arbeit gefällt, könnt ihr unsere Folgen auch auf Podcasting 2.0 Plattformen, wie Breez, Fountain oder Castamatic hören und uns so eine kleine Aufmerksamkeit da lassen. Danke an alle, die die Bitcoin Community mit ihren Spenden unterstützen! Mit diesen Spenden wird unter anderem unser Bounty Programm verwirklicht, in dem ihr euch für die Mitarbeit an einem Projekt eine Belohnung sichern könnt.Für Feedback und weitergehenden Diskussionen kommt gerne in die Telegramgruppe von Nodesignal und bewertet uns bei Spotify und Apple Podcasts. Folgt uns auch gerne bei Twitter.Blockzeit: 827008Hayeks Vorhersage von Bitcoin: Friedrich August von Hayek predicting Bitcoin in 1984 - A Sly Roundabout WayThe Genesis Book (amazon.de)Google Drive mit vollständigem Text des BuchesWebseite zum Genesis Book undÜber den Autor Aaron van WirdumAaron van Wirdum bei Bitcoin MagazineAaron van Wirdum bei XFriedrich August v. Hayek (Wikipedia)Denationalisation of Money (engl.)Richard Stallmann (Wikipedia)Whitfield Diffie & Martin Hellman: New Directions in Cryptography (1976)Rivest, Shamir, Adleman: A Method for Obtaining Digital Signatures and Public-key CryptosystemsDavid Chaum (Wikipedia)Blind Signatures for Digital PaymentsExtroprianismus (Wikipedia)Extropy InstituteExtropy Magazine, Ed. 15 The Digital Cash IssueMax More: The Extroprian PriniciplesCypherpunks Mailing List ArchiveTim May - The Crypto Anarchixt ManifestoEric Hughes - A Cypherpunk's ManifestoAdam Back - HashashStuart Haber & W. Scott Stornetta - How to time-stamp a digital documentNick Szabo (Wikipedia)Unenumerated (Nick Szabos Blog)Nick Szabo: Shelling Out - Die Ursprünge des GeldesBit Gold (Nakamoto Institute)Wei Dai - b-money (Nakamoto Institute)S15 E15: Aaron van Wirdum on The Genesis Book & Bitcoin Pre-HistoryHal FinneyRPOW (Nakamoto Institue)Nodesignal-Techboost – E05 – Updates September 2022 zu Cashu #1Nodesignal-Techboost - E120 - Hauptsache Nüsse zu Cashu #2Socratic Seminar 14.02.Outro Song Read a Book (Dirty Version)Timestamps:(00:00:00) Intro(00:01:26) Begrüßung, Blockzeit und Vorgeplänkel(00:11:43) Friedrich A. v. Hayek: spontane Ordnung(00:19:34) Friedrich A. v. Hayek: neutrales Geld, Entnationalisierung des Geldes(00:24:56) Friedrich A. v. Hayek: Entnationalisierung des Geldes(00:27:10) Richard Stallmann: Hacker Culture und Anarchismus(00:38:03) Diffie und Hellman: Public Key Cryptography(00:51:18) David Chaum: eCash und Blind Signatures(01:04:34) Abschluss 1. Teil und Outro

Votre type de personnalité influence directement la façon dont vous gérez votre temps.Selon vous que vous soyez introverti ou extraverti, orienté vers les tâches ou les personnes, vous risquez de réagir différemment aux techniques de gestion du temps, et fonctionner d'une façon complètement différente des autres. Dans ce podcast, je discute avec mon invitée Christine Rivest (consultante en communication, animatrice du podcast Connexion H et formatrice certifiée avec le modèle DISC) de l'impact du type de personnalité sur la productivité personnelle. Apprenez dans cet épisode à mieux vous connaître pour optimiser votre gestion du temps et être plus performant!Bonne écoute!

In today's episode, we meet with Danny O'Malley a producer on Chef's Table, and Alex Rivest, an MIT-educated neuroscientist. Together they directed a riveting climate documentary disguised as an adventure epic that speaks to the heart versus the viewer's mind. CANARY is the film featuring Lonnie Thompson's climate odyssey atop the Quelccaya Ice Cap. Join us as we delve into the remarkable work and life of Dr. Lonnie Thompson, a pioneering glaciologist whose research has been instrumental in shedding light on the impacts of climate change. Dr. Thompson has spent decades studying glaciers and ice caps around the world, but his work on the Quelccaya Ice Cap is particularly significant. Located high in the Peruvian Andes, Quelccaya is one of the world's largest tropical ice caps. It serves as a critical indicator of climate change due to its sensitivity to temperature variations. Dr. Thompson's research involves drilling ice cores to extract ancient air bubbles, allowing scientists to analyze the Earth's past climate conditions with unparalleled precision. The documentary, "CANARY" takes us on a breathtaking journey to the top of the Quelccaya Ice Cap, where Lonnie, his team, and an entire film crew conduct and film the research. At an elevation of 18,000 feet, this desolate, icy expanse provides a stark visual representation of the profound changes our planet is undergoing. Through stunning visuals and interviews with the scientists, the film documents the dramatic retreat of Quelccaya's ice, which has accelerated in recent decades. At the peak of Dr. Thompson's career, he received some devastating health news that threatened to halt his progress. The directors draw a parallel between Lonnie's struggles to accept his health condition, and the broader challenge that many of us face in accepting the reality of climate change caused by a warming atmosphere.  Through their dedication and storytelling, Dr. Thompson, Rivest, and O'Malley inspire us all to take action to protect our world for future generations. Links: Find showings here: https://canary.oscilloscope.net/ Join us at Climate Week NYC here: https://www.climateweeknyc.org/events/canary-documentary-film-screening   Guest Bios (provided by the guest):  Danny O'Malley Danny O'Malley is a Grammy-nominated and James Beard-nominated film director, best known for his work on Netflix's Chef's Table, where he serves as co-executive producer and director. Danny has an extensive background in filming, collaborating with various bands across the U.S., including Tegan and Sara, The Rentals, The Decemberists, Kraftwerk, and more. Notably, his documentary ‘States', part of Tegan and Sara's release ‘Get Along' was nominated for a Grammy in the category of Best Long Form Music Video. Danny initially made his mark in documentary television as a story producer, and his work has been featured on major platforms such as Netflix, Fox Sports One, and NBC. On Chef's Table, Danny is a key driving force shaping the character-driven storytelling that defines the show's signature style. Danny, and his directing partner Alex Rivest PhD, won the Alfred P. Sloan development grant in 2017, which led to the creation of his first feature ‘Canary.'   Alex Rivest Alex Rivest is an MIT-trained PhD Neuroscientist. Having worked alongside Nobel Prize winner Dr. Susumu Tonegawa, Alex's research has been published in two of the most highly renowned scientific journals, Science and Nature Neuroscience. Alex grew up in an environment where curiosity and question-asking were highly valued, and he has dedicated his life to helping teach others about the wonders of the world. As an educator, he received the Angus MacDonald Award for Excellence in Undergraduate Teaching at MIT and founded the nonprofit Blue Kitabu, which built a sustainable primary school in central Ghana. As a science filmmaker, Alex's videos have accumulated over 70 million views online, and have been featured everywhere, from billboards in Times Square to installations in science museums, and even in an opera production of “Das Rheingold.” CANARY is his directorial debut.

Cette Semaine LTDJ reçoit Cupidon, Maxime Rivest & MackBouba (Juste Pour Rire Édition) Avec MoneyÀ chaque épisode Dj Crowd et Jay Seven reçoivent des invités pour le temps d'un jujube! Suivez les émissions pour les conversations les plus comiques, informatives et absurdes du Québec!Salutations aux commanditaires:Le Green Room Oka, Le Kampus, et Le Shack a SauceInfographie par : Dj Crowd pour Muliani GfxMusique par : @BeatsbyGallo pour MajorWayStudio: KampusSuivez-nous sur les médias sociauxPour écouter l'after-Show :https://www.patreon.com/letempsdunjujubeDj Crowd :https://www.instagram.com/djcrowd/https://www.facebook.com/worldfamousdjcrowdTiktok, Snapchat, Twitter : Dj CrowdJaySeven :https://www.instagram.com/j7official/LTDJ : https://www.instagram.com/letempsdunjujube/https://www.facebook.com/letempsdunjujube/Merci !!!!!!! Suivez-nous sur les médias sociauxPour écouter l'after-Show :https://www.patreon.com/letempsdunjujubeDj Crowd :https://www.instagram.com/djcrowd/https://www.facebook.com/worldfamousdjcrowdTiktok, Snapchat, Twitter : Dj CrowdJaySeven :https://www.instagram.com/j7official/LTDJ : https://www.instagram.com/letempsdunjujube/https://www.facebook.com/letempsdunjujube/Merci !!!!!!!

Here are my 100 interesting things to learn about cryptography: For a 128-bit encryption key, there are 340 billion billion billion billion possible keys. [Calc: 2**128/(1e9**4)] For a 256-bit encryption key, there are 115,792 billion billion billion billion billion billion billion billion possible keys. [Calc: 2**256/(1e9**8)] To crack a 128-bit encryption with brute force using a cracker running at 1 Teracracks/second, will take — on average — 5 million million million years to crack. Tera is 1,000 billion. [Calc: 2**128/100e9/2/60/60/24/365/(1e6**3)] For a 256-bit key this is 1,835 million million million million million million million million million years. For the brute force cracking of a 35-bit key symmetric key (such as AES), you only need to pay for the boiling of a teaspoon of energy. For a 50-bit key, you just need to have enough money to pay to boil the water for a shower. For a 90-bit symmetric key, you would need the energy to boil a sea, and for a 105-bit symmetric key, you need the energy to boil and ocean. For a 128-bit key, there just isn't enough water on the planet to boil for that. Ref: here. With symmetric key encryption, anything below 72 bits is relatively inexpensive to crack with brute force. One of the first symmetric key encryption methods was the LUCIFER cipher and was created by Horst Feistel at IBM. It was further developed into the DES encryption method. Many, at the time of the adoption of DES, felt that its 56-bit key was too small to be secure and that the NSA had a role in limiting them. With a block cipher, we only have to deal with a fixed size of blocks. DES and 3DES use a 64-bit (eight-byte) block size, and AES uses a 128-bit block size (16 bytes). With symmetric key methods, we either have block ciphers, such as DES, AES CBC and AES ECB, or stream ciphers, such as ChaCha20 and RC4. In order to enhance security, AES has a number of rounds where parts of the key are applied. With 128-bit AES we have 10 rounds, and 14 rounds for 256-bit AES. In AES, we use an S-box to scramble the bytes, and which is applied for each round. When decrypting, we have the inverse of the S-box used in the encrypting process. A salt/nonce or Initialisation Vector (IV) is used with an encryption key in order to change the ciphertext for the same given input. Stream ciphers are generally much faster than block cipers, and can generally be processed in parallel. With the Diffie-Hellman method. Bob creates x and shares g^x (mod p), and Alice creates y, and shares g^y (mod p). The shared key is g^{xy} (mod p). Ralph Merkle — the boy genius — submitted a patent on 5 Sept 1979 and which outlined the Merkle hash. This is used to create a block hash. Ralph Merkle's PhD supervisor was Martin Hellman (famous as the co-creator of the Diffie-Hellman method). Adi Shamir defines a secret share method, and which defines a mathematical equation with the sharing of (x,y), and where a constant value in the equation is the secret. With Shamir Secret Shares (SSS), for a quadratic equation of y=x²+5x+6, the secret is 6. We can share three points at x=1, x=2 and y=3, and which gives y=12, y=20, and y=20, respectively. With the points of (1,12), (2,20), and (3,20), we can recover the value of 6. Adi Shamir broke the Merkle-Hellman knapsack method at a live event at a rump session of a conference. With secret shares, with the highest polynomial power of n, we need n+1 points to come together to regenerate the secret. For example, y=2x+5 needs two points to come together, while y=x²+15x+4 needs three points. The first usable public key method was RSA — and created by Rivest, Shamir and Adleman. It was first published in 1979 and defined in the RSA patent entitled “Cryptographic Communications System and Method”. In public key encryption, we use the public key to encrypt data and the private key to decrypt it. In digital signing, we use the private key to sign a hash and create a digital signature, and then the associated public key to verify the signature. Len Adleman — the “A” in the RSA method — thought that the RSA paper would be one of the least significant papers he would ever publish. The RSA method came to Ron Rivest while he slept on a couch. Martin Gardner published information on the RSA method in his Scientific American article. Initially, there were 4,000 requests for the paper (which rose to 7,000), and it took until December 1977 for them to be posted. The security of RSA is based on the multiplication of two random prime numbers (p and q) to give a public modulus (N). The difficulty of RSA is the difficulty in factorizing this modulus. Once factorized, it is easy to decrypt a ciphertext that has been encrypted using the related modulus. In RSA, we have a public key of (e,N) and a private key of (d,N). e is the public exponent and d is the private exponent. The public exponent is normally set at 65,537. The binary value of 65,537 is 10000000000000001 — this number is efficient in producing ciphertext in RSA. In RSA, the ciphertext is computed from a message of M as C=M^e (mod N), and is decrypted with M=C^d (mod N). We compute the the private exponent (d) from the inverse of the public exponent (e) modulus PHI, and where PHI is (p-1)*(q-1). If we can determine p and q, we can compute PHI. Anything below a 738-bit public modulus is relatively inexpensive to crack for RSA. To crack 2K RSA at the current time, we would need the energy to boil ever ocean on the planet to break it. RSA requires padding is required for security. A popular method has been PCKS#1v1.5 — but this is not provably secure and is susceptible to Bleichenbacher's attack. An improved method is Optimal Asymmetric Encryption Padding (OAEP) and was defined by Bellare and Rogaway and standardized in PKCS#1 v2. The main entity contained in a digital certificate is the public key of a named entity. This is either an RSA or an Elliptic Curve key. A digital certificate is signed with the private key of a trusted entity — Trent. The public key of Trent is then used to prove the integrity and trust of the associated public key. For an elliptic curve of y²=x³+ax+b (mod p), not every (x,y) point is possible. The total number of points is defined as the order (n). ECC (Elliptic Curve Cryptography) was invented by Neal Koblitz and Victor S. Miller in 1985. Elliptic curve cryptography algorithms did not take off until 2004. In ECC, the public key is a point on the elliptic curve. For secp256k1, we have a 256-bit private key and a 512-bit (x,y) point for the public key. A “04” in the public key is an uncompressed public key, and “02” and “03” are compressed versions with only the x-co-ordinate and whether the y coordinate is odd or even. Satoshi selected the secp256k1 curve for Bitcoin, and which gives the equivalent of 128-bit security. The secp256k1 curve uses the mapping of y²=x³ + 7 (mod p), and is known as a Short Weierstrass (“Vier-strass”) curve. The prime number used with secp256k1 is 2²⁵⁶-2³²-2⁹-2⁸-2⁷-2⁶-2⁴-1. An uncompressed secp256k1 public key has 512 bits and is an (x,y) point on the curve. The point starts with a “04”. A compressed secp256k1 public key only stores the x-co-ordinate value and whether the y coordinate is odd or even. It starts with a “02” if the y-co-ordinate is even; otherwise, it starts with a “03”. In computing the public key in ECC of a.G, we use the Montgomery multiplication method and which was created by Peter Montgomery in 1985, in a paper entitled, “Modular Multiplication without Trial Division.” Elliptic Curve methods use two basic operations: point address (P+Q) and point doubling (2.P). These can be combined to provide the scalar operation of a.G. In 1999, Don Johnson Alfred Menezes published a classic paper on “The Elliptic Curve Digital Signature Algorithm (ECDSA)”. It was based on the DSA (Digital Signature Algorithm) — created by David W. Kravitz in a patent which was assigned to the US. ECDSA is a digital signature method and requires a random nonce value (k), and which should never be reused or repeated. ECDSA is an elliptic curve conversion of the DSA signature method. Digital signatures are defined in FIPS (Federal Information Processing Standard) 186–5. NIST approved the Rijndael method (led by Joan Daemen and Vincent Rijmen) for Advanced Encryption Standard (AES). Other contenders included Serpent (led by Ross Anderson), TwoFish (led by Bruce Schneier), MARS (led by IBM), and RC6 (led by Ron Rivest). ChaCha20 is a stream cipher that is based on Salsa20 and developed by Daniel J. Bernstein. MD5 has a 128-bit hash, SHA-1 has 160 bits and SHA-256 has 256-bits. It is relatively easy to create a hash collision with MD5. Google showed that it was possible to create a signature collision for a document with SHA-1. It is highly unlikely to get a hash collision for SHA-256. In 2015, NIST defined SHA-3 as a standard, and which was built on the Keccak hashing family — and which used a different method to SHA-2. The Keccak hash family uses a sponge function and was created by Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche and standardized by NIST in August 2015 as SHA-3. Hash functions such as MD5, SHA-1 and SHA-256 have a fixed hash length, whereas an eXtendable-Output Function (XOF) produces a bit string that can be of any length. Examples are SHAKE128, SHAKE256, BLAKE2XB and BLAKE2XS. BLAKE 3 is the fastest cryptographically secure hashing method and was created by Jack O'Connor, Jean-Philippe Aumasson, Samuel Neves, and Zooko Wilcox-O'Hearn. Hashing methods can be slowed down with a number of rounds. These slower hashing methods include Bcrypt, PBKDF2 and scrypt. Argon 2 uses methods to try and break GPU cracking, such as using a given amount of memory and defining the CPU utlization. To speed up the operation of the SHA-3 hash, the team reduced the security of the method and reduce the number of rounds. The result is the 12 Kangaroo's hashing method. The number of rounds was reduced from 24 to 12 (with a security level of around 128 bits). Integrated Encryption Scheme (IES) is a hybrid encryption scheme which allows Alice to get Bob's public key and then generate an encryption key based on this public key, and she will use her private key to recover the symmetric. With ECIES, we use elliptic curve methods for the public key part. A MAC (Message Authentication Code) uses a symmetric key to sign a hash, and where Bob and Alice share the same secret key. The most popular method is HMAC (hash-based message authentication code). The AES block cipher can be converted into a stream cipher using modes such as GCM (Galois Counter Mode) and CCM (counter with cipher block chaining message authentication code; counter with CBC-MAC). A MAC is added to a symmetric key method in order to stop the ciphertext from being attacked by flipping bits. GCM does not have a MAC, and is thus susceptible to this attack. CCM is more secure, as it contains a MAC. With symmetric key encryption, we must remove the encryption keys in the reverse order they were applied. Commutative encryption overcomes this by allowing the keys to be removed in any order. It is estimated that Bitcoin miners consume 17.05 GW of electrical power per day and 149.46 TWh per year. A KDF (Key Derivation Function) is used to convert a passphrase or secret into an encryption key. The most popular methods are HKDF, PBKDF2 and Bcrypt. RSA, ECC and Discrete Log methods will all be cracked by quantum computers using Shor's algorithm Lattice methods represent bit values as polynomial values, such as 1001 is x³+1 as a polynomial. Taher Elgamal — the sole inventor of the ElGamal encryption method — and Paul Koche were the creators of SSL, and developed it for the Netscape browser. David Chaum is considered as a founder of electronic payments and, in 1983, created ECASH, along with publishing a paper on “Blind signatures for untraceable payments”. Satoshi Nakamoto worked with Hal Finney on the first versions of Bitcoin, and which were created for a Microsoft Windows environment. Blockchains can either be permissioned (requiring rights to access the blockchain) or permissionless (open to anyone to use). Bitcoin and Ethereum are the two most popular permissionless blockchains, and Hyperledger is the most popular permissioned ledger. In 1992, Eric Hughes, Timothy May, and John Gilmore set up the cypherpunk movement and defined, “We the Cypherpunks are dedicated to building anonymous systems. We are defending our privacy with cryptography, with anonymous mail forwarding systems, with digital signatures, and with electronic money.” In Bitcoin and Ethereum, a private key (x) is converted to a public key with x.G, and where G is the base point on the secp256k1 curve. Ethereum was first conceived in 2013 by Vitalik Buterin, Gavin Wood, Charles Hoskinson, Anthony Di Iorio and Joseph Lubin. It introduced smaller blocks, improved proof of work, and smart contracts. NI-ZKPs involves a prover (Peggy), a verifier (Victor) and a witness (Wendy) and were first defined by Manuel Blum, Paul Feldman, and Silvio Micali in their paper entitled “Non-interactive zero-knowledge and its applications”. Popular ZKP methods include ZK-SNARKs (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge) and ZK-STARKs (Zero-Knowledge Scalable Transparent Argument of Knowledge). Bitcoin and Ethereum are pseudo-anonymised, and where the sender and recipient of a transaction, and its value, can be traced. Privacy coins enable anonymous transactions. These include Zcash and Monero. In 1992, David Chaum and Torben Pryds Pedersen published “Wallet databases with observers,” and outlined a method of shielding the details of a monetary transaction. In 1992, Adi Shamir (the “S” in RSA) published a paper on “How to share a secret” in the Communications of the ACM. This supported the splitting of a secret into a number of shares (n) and where a threshold value (t) could be defined for the minimum number of shares that need to be brought back together to reveal the secret. These are known as Shamir Secret Shares (SSS). In 1991, Torbin P Pedersen published a paper entitled “Non-interactive and information-theoretic secure verifiable secret sharing” — and which is now known as Pedersen Commitment. This is where we produce our commitment and then show the message that matches the commitment. Distributed Key Generation (DKG) methods allow a private key to be shared by a number of trusted nodes. These nodes can then sign for a part of the ECDSA signature by producing a partial signature with these shares of the key. Not all blockchains use ECDSA. The IOTA blockchain uses the EdDSA signature, and which uses Curve 25519. This is a more lightweight signature version and has better support for signature aggregation. It uses Twisted Edwards Curves. The core signing method used in EdDSA is based on the Schnorr signature scheme and which was created by Claus Schnorr in 1989. This was patented as a “Method for identifying subscribers and for generating and verifying electronic signatures in a data exchange system”. The patent ran out in 2008. Curve 25519 uses the prime number of 2²⁵⁵-19 and was created by Daniel J. Bernstein. Peter Shor defined that elliptic curve methods can be broken with quantum computers. To overcome the cracking of the ECDSA signature from quantum computers, NIST are standardising a number of methods. At present, this focuses on CRYSTALS-Dilithium, and which is a lattice cryptography method. Bulletproofs were created in 2017 by Stanford's Applied Cryptography Group (ACG). They define a zero-knowledge proof as where a value can be checked to see it lies within a given range. The name “bulletproofs” is defined as they are short, like a bullet, and with bulletproof security assumptions. Homomorphic encryption methods allow for the processing of encrypted values using arithmetic operations. A public key is used to encrypt the data, and which can then be processed using an arithmetic circuit on the encrypted data. The owner of the associated private key can then decrypt the result. Some traditional public key methods enable partial homomorphic encryption. RSA and ElGamal allow for multiplication and division, whilst Pailier allows for homomorphic addition and subtraction. Full homomorphic encryption (FHE) supports all of the arithmetic operations and includes Fan-Vercauteren (FV) and BFV (Brakerski/Fan-Vercauteren) for integer operations and HEAAN (Homomorphic Encryption for Arithmetic of Approximate Numbers) for floating point operations. Most of the Full Homomorphic encryption methods use lattice cryptography. Some blockchain applications use Barreto-Lynn-Scott (BLS) curves which are pairing-friendly. They can be used to implement Bilinear groups and which are a triplet of groups (G1, G2 and GT), so that we can implement a function e() such that e(g1^x,g2^y)=gT^{xy}. Pairing-based cryptography is used in ZKPs. The main BLS curves used are BLS12–381, BLS12–446, BLS12–455, BLS12–638 and BLS24–477. An accumulator can be used for zero-knowledge proof of knowledge, such as using a BLS curve to create to add and remove proof of knowledge. Metamask is one of the most widely used blockchain wallets and can integrate into many blockchains. Most wallets generate the seed from the operating system and where the browser can use the Crypto.getRandomValues function, and compatible with most browsers. With a Verifiable Delay Function (VDF), we can prove that a given amount of work has been done by a prover (Peggy). A verifier (Victor) can then send the prover a proof value and compute a result which verifies the work has been done, with the verifier not needing to do the work but can still prove the work has been done. A Physical Unclonable Functions (PUFs) is a one-way function which creates a unique signature pattern based on the inherent delays within the wires and transistors. This can be used to link a device to an NFT.

So, here's my Top 100 snippets of knowledge for blockchain: Blockchains use public key methods to integrate digital trust. Bob signs for a transaction with his private key, and Alice proves this with Bob's public key. The first usable public key method was RSA — and created by Rivest, Shamir and Adleman. It was first published in 1979 and defined in the RSA patent entitled “Cryptographic Communications System and Method”. Blockchains can either be permissioned (requiring rights to access the blockchain) or permissionless (open to anyone to use). Bitcoin and Ethereum are the two most popular permissionless blockchains, and Hyperledger is the most popular permissioned ledger. Ralph Merkle — the boy genius — submitted a patent on 5 Sept 1979 and which outlined the Merkle hash. This is used to create a block hash. Ralph Merkle's PhD supervisor was Martin Hellman (famous as the co-creator of the Diffie-Hellman method). David Chaum is considered as founders of electronic payments, and, in 1983, created ECASH, along with publishing a paper on “Blind signatures for untraceable payments”. Miners gather transactions on a regular basis, and these are added to a block and where each block has a Merkle hash. The first block on a blockchain does not have any previous blocks — and is named the genesis block. Blocks are bound in a chain, and where the previous, current and next block hashes are bound into the block. This makes the transactions in the block immutable. Satoshi Nakamoto worked with Hal Finney on the first versions of Bitcoin, and which were created for a Microsoft Windows environment. Craig Steven Wright has claimed that he is Satoshi Nakamoto, but this claim has never been verified. Most blockchains use elliptic curve cryptography — a method which was created independently by Neal Koblitz and Victor S. Miller in 1985. Elliptic curve cryptography algorithms did not take off until 2004. Satoshi selected the secp256k1 curve for Bitcoin, and which gives the equivalent of 128-bit security. The secp256k1 curve uses the mapping of y²=x³ + 7 (mod p), and is known as a Short Weierstrass (“Vier-strass”) curve. The prime number used with secp256k1 is ²²⁵⁶−²³²−²⁹−²⁸−²⁷−²⁶−²⁴−1. Satoshi published a 9-page paper entitled “Bitcoin: A Peer-to-Peer Electronic Cash System” White Paper on 31 Oct 31, 2008. In 1997, Adam Black introduce the concept of Proof of Work of Hashcash in a paper entitled, “Hashcash — a denial of service countermeasure.” This work was used by Satoshi in his whitepaper. Satoshi focused on: a decentralized system, and a consensus model and addressed areas of double-spend, Sybil attacks and Eve-in-the-middle. The Sybil attack is where an adversary can take over the general consensus of a network — and leads to a 51% attack, and where the adversary manages to control 51% or more of the consensus infrastructure. Satoshi used UK spelling in his correspondence, such as using the spelling of “honour”. The first Bitcoin block was minted on 3 Jan 2009 and contained a message of “Chancellor on brink of second bailout for banks” (the headline from The Times, as published in London on that day). On 12 Jan 2009, Satoshi sent the first Bitcoin transaction of 50 BTC to Hal Finney [here]. A new block is created every 7–10 minutes on Bitcoin. In Aug 2023, the total Bitcoin blockchain size is 502 GB. As of Aug 2023, the top three cryptocurrencies are Bitcoin, Ether, and Tether. Bitcoin has a capitalization of $512 billion, Ether with $222 billion, and Tether at $83 billion. The total cryptocurrency capitalisation is $1.17 trillion. The original block size was 1MB for Bitcoin, but recently upgraded to support a 1.5MB block — and has around 3,000 transactions. Currently the block sizes are more than 1.7MB. Bitcoin uses a gossip protocol — named the Lightning Protocol — to propagate transactions. A Bitcoin wallet is created from a random seed value. This seed value is then used to create the 256-bit secp256k1 private key. A wallet seed can be converted into a mnemonic format using BIP39, and which uses 12 common words. This is a deterministic key, and which allows the regeneration of the original key in the correct form. BIP39 allows for the conversion of the key to a number of languages, including English, French and Italian. A private key in a wallet is stored in a Wif format, and which is a Base58 version of the 256-bit private key. The main source code for the Bitcoin blockchain is held at https://github.com/bitcoin, and is known as Bitcoin core. This is used to create nodes, store coins, and transactions with other nodes on the Bitcoin network. A 256-bit private key has 115,792 billion billion billion billion billion billion billion billion different keys. A public Bitcoin ID uses Base58 and has a limited character set of ‘123456789ABCDEFGHJKLMN PQRSTUVWXYZabcdefghijkmno pqrstuvwxyz', where we delete ‘0' (zero), ‘l' (lowercase ‘l'), and ‘I' (capital I) — as this can be interpreted as another character. In Bitcoin and Ethereum, a private key (x) is converted to a public key with x.G, and where G is the base point on the secp256k1 curve. An uncompressed secp256k1 public key has 512 bits and is an (x,y) point on the curve. The point starts with a “04”. A compressed secp256k1 public key only stores the x-co-ordinate value and whether the y coordinate is odd or even. It starts with a “02” if the y-co-ordinate is even, otherwise it starts with a “03”. In 1992, Eric Hughes, Timothy May, and John Gilmore set up the cypherpunk movement and defined, “We the Cypherpunks are dedicated to building anonymous systems. We are defending our privacy with cryptography, with anonymous mail forwarding systems, with digital signatures, and with electronic money.” In Ethereum, the public key is used as the identity of a user (a.G), and is defined as a hexademical value. In Bitcoin, the public ID is created from a SHA256 hash of the public key, and then a RIPEMD160 of this, and then covered to Base58. In computing the public key in ECC of a.G, we use the Montgomery multiplication method and which was created by Peter Montgomery in 1985, in a paper entitled, “Modular Multiplication without Trial Division.” Elliptic Curve methods use two basic operations: point address (P+G) and point doubling (2.P). These can be combined to provide the scalar operation of a.G. In 1999, Don Johnson Alfred Menezes published a classic paper on “The Elliptic Curve Digital Signature Algorithm (ECDSA)”. It was based on the DSA (Digital Signature Algorithm) — created by David W. Kravitz in a patent which was assigned to the US. The core signature used in Bitcoin and Ethereum is ECDSA (Elliptic Curve Digital Signature Algorithm), and which uses a random nonce for each signature. The nonce value should never repeat or be revealed. Ethereum was first conceived in 2013 by Vitalik Buterin, Gavin Wood, Charles Hoskinson, Anthony Di Iorio and Joseph Lubin. It introduced smaller blocks, an improved proof of work, and smart contracts. Bitcoin is seen as a first-generation blockchain, and Ethereum as a second-generation. These have been followed by third-generation blockchains, such as IOTA, Cardano and Polkadot — and which have improved consensus mechanisms. Bitcoin uses a consensus mechanism which is based on Proof-of-Work, and where miners focus on finding a block hash that has a number of leading “0”s. The difficulty of the mining is defined by the hashing rate. At the current time, this is around 424 million TH/s. There are around 733,000 unique Bitcoin addresses being used. Satoshi defined a reward to miners for finding the required hash. This was initially set at 50 BTC, but was set to half at regular intervals. On 11 January 2021, it dropped from 12.5 BTC to 6.2 BTC. Bitcoin currently consumes around 16.27 GWatts of power each year to produce a consensus — equivalent to the power consumed by a small country. In creating bitcoins, Satoshi created a P2PKH (Pay to Public Key Hash) address. These addresses are used to identify the wallet to be paid and links to the public key of the owner. These addresses start with a ‘1'. In order to support the sending of bitcoins to and from multiple addresses, Bitcoin was upgraded with SegWit (defined in BIP141). The wallet address then integrates the pay-to-witness public key hash (Pay to script hash — P2SH). These addresses start with a ‘3'. Ethereum uses miners to undertake work for changing a state and running a smart contract. They are paid in “gas” or Ether and which relates to the amount of computation conducted. This limits denial of service attacks on the network and focuses developers on creating efficient code. Ethereum supports the creation of cryptocurrency assets with ERC20 tokens — and which are FT (Fungible Tokens). For normal crypto tokens (ERC-20) we use, there is a finite number of these, and each of these is the same. Ethereum creates NFTs (Non-Fungible Tokens) with ERC721 tokens. We mint these each time and each is unique. Solidity is the programming language used in Ethereum, while Hyperledger can use Golang, Node.js and Java. For Ethereum, we compile Solidity code into EVM (Ethereum Virtual Machine) code. This is executed on the blockchain. Blockchain uses the SHA-256 hash for transaction integrity. Ethereum uses the Keccak hash is used to define the integrity of a transaction. This is based on SHA-3, and differs slightly from Keccak. The Keccak hash family uses a sponge function and was created by Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche, and standardized by NIST in August 2015 as SHA-3. The DAO is a decentralized autonomous organization (DAO) for the Ethereum blockchain and was launched in 2016. In 2016, DAO raised $150 million through a token sale but was hacked and funds were stolen. This resulted in a forking of the blockchain: Ethereum and Ethereum Classic. Non-interactive Zero Knowledge Proofs (NI-ZKP) allow an entity to prove that they have knowledge of something — without revealing it. A typical secret is the ownership of a private key. NI-ZKPs involve a prover (Peggy), a verifier (Victor) and a witness (Wendy) and were first defined by Manuel Blum, Paul Feldman, and Silvio Micali in their paper entitled, “Non-interactive zero-knowledge and its applications”. Popular ZKP methods include ZK-SNARKs (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge) and ZK-STARKs (Zero-Knowledge Scalable Transparent Argument of Knowledge). Bitcoin and Ethereum are pseudo-anonymised, and where the sender and recipient of a transaction, and its value, can be traced. Privacy coins enable anonymous transactions. These include Zcash and Monero. In 1992, David Chaum and Torben Pryds Pedersen published “Wallet databases with observers,” and outlined a method of shielding the details of a monetary transaction. In 1992, Adi Shamir (the “S” in RSA) published a paper on “How to share a secret” in the Communications of the ACM. This supported the splitting of a secret into a number of shares (n) and where a threshold value (t) could be defined for the minimum number of shares that need to be brought back together to reveal the secret. These are known as Shamir Secret Shares (SSS). In 1991, Torbin P Pedersen published a paper entitled “Non-interactive and information-theoretic secure verifiable secret sharing” — and which is now known as Pedersen Commitment. This is where we produce our commitment and then show the message that matches the commitment. Distributed Key Generation (DKG) methods allow a private key to be shared by a number of trusted nodes. These nodes can then sign for a part of the ECDSA signature by producing a partial signature with these shares of the key. Not all blockchains use ECDSA. The IOTA blockchain uses the EdDSA signature, and which uses Curve 25519. This is a more lightweight signature version, and has better support for signature aggregation. It uses Twisted Edwards Curves. The core signing method used in EdDSA is based on the Schnorr signature scheme and which was created by Claus Schnorr in 1989. This was patented as, a “Method for identifying subscribers and for generating and verifying electronic signatures in a data exchange system”. The patent ran out in 2008. Curve 25519 uses the prime number of ²²⁵⁵-19 and was created by Daniel J. Bernstein. Peter Shor defined that elliptic curve methods can be broken with quantum computers. To overcome the cracking of the ECDSA signature from quantum computers, NIST are standardising a number of methods. At present, this focuses on CRYSTALS-Dilithium, and which is a lattice cryptography method. Bulletproofs were created in 2017 by Stanford's Applied Cryptography Group (ACG). They define a zero-knowledge proof as where a value can be checked to see it lies within a given range. The name of “bulletproofs” is defined as they are short, like a bullet, and with bulletproof security assumptions. While Bitcoin can take up to 7–10 minutes to mine a new block and create a consensus, newer blockchains, such as IOTA, can give an almost instantaneous consensus. Banks around the world are investigating CBDC (Central Bank Digital Currency) and which is not a cryptocurrency but a way to quickly define a consensus on a transaction. Homomorphic encryption methods allow for the processing of encrypted values using arithmetic operations. A public key is used to encrypt the data, and which can then be processed using an arithmetic circuit on the encrypted data. The owner of the associated private key can then decrypt the result. Some traditional public key methods enable partial homomorphic encryption. RSA and ElGamal allow for multiplication and division, whilst Pailier allows for homomorphic addition and subtraction. Full homomorphic encryption (FHE) supports all of the arithmetic operations and includes Fan-Vercauteren (FV) and BFV (Brakerski/Fan-Vercauteren) for integer operations and HEAAN (Homomorphic Encryption for Arithmetic of Approximate Numbers) for floating point operations. Most of the Full Homomorphic encryption methods use lattice cryptography. Some blockchain applications use Barreto-Lynn-Scott (BLS) curves which are pairing friendly. They can be used to implement Bilinear groups and which are a triplet of groups (G1, G2 and GT), so that we can implement a function e() such that e(g1^x,g2^y)=gT^{xy}. Pairing-based cryptography is used in ZKPs. The main BLS curves used are BLS12–381, BLS12–446, BLS12–455, BLS12–638 and BLS24–477. An accumulator can be used for zero-knowledge proof of knowledge, such as using a BLS curve to create to add and remove proof of knowledge. Open Zeppelin is an open-source Solidity library that supports a wide range of functions that integrate into smart contracts in Ethereum. This includes AES encryption, Base64 integration and Elliptic Curve operations. Metamask is one of the most widely used blockchain wallets and can integrate into many blockchains. Most wallets generate the seed from the operating system and where the browser can use the Crypto.getRandomValues function, and compatible with most browsers. Solidity programs can be compiled with Remix at remix.ethereum.org. The main Ethereum network is Ethereum Mainnet. We can test smart contracts on Ethereum test networks. Current networks include sepolia.etherscan.io and goerli.net. Ether can be mined for test applications from a faucet, such as faucet.metamask.io. This normally requires some proof of work to gain the Ether — in order to protect against a Denial of Service against the Faucet. The private key can be revealed from two ECDSA signatures which use the same random nonce value. Polkadot is a blockchain which allows blockchains to exchange messages and perform transactions. The proof of work method of creating is now not preference because of the energy that it typically uses. Many systems now focus on proof of stack (PoS). A time-lock puzzle/Proof of Work involves performing a computing task which has a given cost and which cannot be cheated again. This typically involves continual hashing or continual squaring. The Chia blockchain network uses both Proof of Space (PoS) and Proof of Time (PoT). The PoS method makes use of the under-allocation of hard-disk space. With a Verifiable Delay Function (VDF), we can prove that a given amount of work has been done by a prover (Peggy). A verifier (Victor) can then send the prover a proof value and compute a result which verifies the work has been done, with the verifier not needing to do the work but can still prove the work has been done. A Physical Unclonable Functions (PUFs) is a one-way function which creates a unique signature pattern based on the inherent delays within the wireless and transistors. This can be used to link a device to an NFT. In Blockchain applications, we can use Non-interactive zero-knowledge (NIZK) proofs for the equality (EQ) of discrete logarithms (DL) — DLEQ. With this — in discrete logarithms — we have

Blog: https://medium.com/asecuritysite-when-bob-met-alice/can-privacy-and-traceability-exist-together-tracing-keys-and-jurisdictions-bfc395d502a Introduction Privacy and traceability are two sides of the same coin, and where the coin will never land on its side. If you want privacy in a transaction, you have to hide the payer and payee and the transaction value. All that needs to happen is that there is proof that the payer has enough currency to pay the payee. We can do this with a range proof — so that Bob can show that the sum of his previous transactions minus the current one is greater than zero. But, this stops any traceability and stops investigators from investigating the trail of an illegal transaction. It's a dilemma that can keep cybersecurity professionals awake at night and where a few bad apples can spoil the whole bunch. But, if we add traceability — such as in Bitcoin — we remove the privacy aspect, and if someone links your Bitcoin address to you and the others you trade with, they will be able to see all your transactions. “Ah, I see”, they might say, “That Bill has just bought a ticket for a bus journey in Edinburgh at 10:03 am”. Along with this, we have different requirements in different jurisdictions and where we might want to limit the investigator power in one jurisdiction to others. For this, John Gilmore — one of the original Cipher Punks — wrote: “We are literally in a race between our ability to build and deploy technology, and their ability to build and deploy laws and treaties. Neither side is likely to back down or wise up until it has definitively lost the race” And, so, the tension between strong cryptography, which protects privacy, and the ability to monitor and investigate remains as open as ever. In the UK, the Online Safety Act could aim to insert backdoors in cryptography in order to monitor communications. So, is it possible to keep things private but also make them traceable? For this, a new paper outlines the TRCT (Traceable Anonymous Transaction Protocol for Blockchain) protocol [1]: The focus of the paper is on the anonymous cryptocurrencies such as Monero, Dash and ZCash. It uses an Extractable Proof of Knowledge (EPoK) to produce a Zero Knowledge Proof (ZKP) for a transaction. This can then be added to the RingCT method of anonymity to produce traceable transactions for the participants and the amount transacted. The transaction, though, is still kept anonymous. The paper pinpoints the usage of Monero in a number of crimes, such as for the Wannacry ransomware attack and where the adversaries converted their Bitcoin rewards into Monero tokens [here], and which has not been since been traced. This problem has become so difficult for law enforcement that privacy-protecting cryptocurrencies have been banned in Canada, South Korea and Australia. TRCT An overview of TRCT is defined in Figure 1. With this, we have a miner which collects broadcasted transactions, and creates a consensus with other miners. An Authority is then responsible for linking account addresses and transactions and which can trace anonymous account addresses of the actual payer and payee and resolve the transaction amount. For TRCT, the payer generates a long-term key pair and then creates a one-time address (Figure 1). This can then be sent to the payer. The transaction is then anonymised for the payer address, payee address and transaction value using the Ring CT protocol, and which integrates the EPoK scheme. The miner then receives this and checks that it is valid and that the payer has enough currency in their account to make the payment. Next, the miner will check the EPoK so that it can be traced by the authority — and without discovering the secret details in the transaction. The authority can then trace the hidden content in the transaction (Figure 2). Figure 1 [1] Figure 2: [1] While applied in RingCT, the TRCT can be generally applied to any permissionless and permissioned blockchain, as it does not affect the underlying logic of the blockchain. In this, a trusted authority creates a tracing key and publicises its public key to the miners and whether these miners may be enabled or not for the integration of EPoK. In a permissioned blockchain, there are typically fewer nodes that create the consensus, and where it is thus easier to broadcast and update the tracing key. Overall, the authority is then used to oversee all the transactions, and decide whether there are illegal transactions, and also trace them. The control of the tracing key can then use attribute-based encryption to control its usage and using threshold-based sharing to control the usage of the key. For example, the FBI, CIA and GCHQ could agree on a 2-from-3 share approach, where two agencies have to come together to regenerate the tracing key. This approach allows for different jurisdictions to generate their own tracing key and where they cannot trace within any other jurisdiction. The addition of tracing tags also allows the tracing of high-value transactions. Next, let's cover ring signatures and RingCT. Ring signatures And so there has been a leak of information at the White House. Donald Trump calls in his Cyber Security leads and tells them, “I know one of you leaked the information, but I can't tell which one”. How can Donald tell that one of his leads has leaked the information but does not know which one? Well, this can be achieved with a ring signature, and which provides anonymity, unforgivably and collusion resistance. A ring signature is a digital signature that is created by a member of a group which each has their own keys. It is then not possible to determine the person in the group who has created the signature. The method was initially created by Ron Rivest, Adi Shamir, and Yael Tauman in 2001, and in their paper, they proposed the White House leak dilemma. Creating the ring In a ring signature, we define a group of entities who each have their own public/private key pairs of (P1, S1), (P2, S2), …, (Pn, Sn). If we want an entity i to sign a message (message), they use their own secret key (si), but the public keys of the others in the group (m,si,P1…Pn). It should then be possible to check the validity of the group by knowing the public key of the group, but not possible to determine a valid signature if there is no knowledge of the private keys within the group. So let's say that Trent, Bob, Eve and Alice are in a group, and they each have their own public and secret keys. Bob now wants to sign a message from the group. He initially generates a random value v, and then generates random values (xi) for each of the other participants, but takes his own secret key (si) and uses it to determine a different secret key, which is the reverse of the encryption function. He now takes the message and takes a hash of it, and thus creates a key (k). This key will be used with symmetric encryption to encrypt each of the elements of the ring (Ek), and then each element of the ring uses an EX-OR function from the previous element: Each of the random values for the other participants is then encrypted with the public key of the given participant. Bob then computes the value of ys in order to create the ring (the result of the ring must equal v). He will then inverse this value to produce the equivalent private key (xs). Bob now releases the overall signature, and the random x values, along with the computed secret key. To check the signature, the receive just computes the ring and checks that the result matches the sent signature. The basic method are: 1. Generate encryption with k=Hash(message). 2. Generate a random value (u). 3. Encrypt u to give v=Ek(u). 4. For each person (apart from the sender): 4.1 Calculate e=si^{Pi} (mod Ni) and where si is the random number generated for the secret key of the ith party, and Pi is the public key of the party. 4.2 Calculate v=v⊕e 5. For the signed party (z), calculate sz=(v⊕u)^d (mod Nz) and where d is the secret key of the signing party. We will end up with the signature (v=Ek(u)), and which completes the ring. The basic method involves creating Bob creating fake private keys for the other people in the ring: The verification of the ring is then: Ring Signatures in Monero The major problem with the Bitcoin network is that the amount of a transaction and the sender and receiver of the funds are not private, and someone who knows someone's address can trace their transactions. This is the case because the blockchain needs to check that the sender has enough funds to pay the recipient. Thus many cryptocurrencies are looking for ways of anonymising the transaction. Ethereum, for example, uses zk-Snarks to hide identities. One method of preserving identity was proposed by Rivest et al and used RSA encryption. Unfortunately, it is not efficient for modern systems, thus, Greg Maxwell's defined an elliptic curve method as a new way of creating the ring signature: the Borromean ring signature [paper]. The cryptocurrency Monero then adopted the method for anonymising transactions but has since migrated to a new method: Multi-layered Linkable Spontaneous Anonymous Group signature. This method hides the transaction amount and the identity of the payer and recipient [paper]. It is now known as RingCT (Ring Confidential Transactions), and was rolled out in January 2017 and mandatory for all transactions from September 2017. Conclusions TRCT provides a roadmap for the integration of tracing keys and the segmentation of rights of access. It is unlikely that we will see the implementation of this method is Monero anytime soon, but it could be applied to new methods. It is only interesting to see it applied to permissioned blockchains, and it could be useful in banking applications which require privacy but traceability. References [1] Duan, J., Wang, L., Wang, W., & Gu, L. (2023). TRCT: A Traceable Anonymous Transaction Protocol for Blockchain. IEEE Transactions on Information Forensics and Security.

Related material Main page: https://billatnapier.medium.com/cryptography-fundamentals-8-rsa-rivest-shamir-and-adleman-445b91932bd0 RSA: https://asecuritysite.com/rsa  Introduction In August 1977, The Stranglers were in the music charts with “Something Better Change” and something really was changing, and it was something that would change the world forever. This was the month that Martin Gardner in his Scientific American column, posted a challenge of a method that has stood the test of time: RSA. It related to the work of R(ivest), A(dleman) and S(hamir) and was a puzzle on their discovery of a method which allowed two keys to be created, where one could encrypt and the other to decrypt. Their work had been based on a proposal from Whitfield Diffie and Martin Hellman on trapdoor functions that could be used to create the key pair. Mathematical Puzzles introducing RSA In order to explain the RSA concept, Martin's provided a background the Diffie-Hellman method for which he outlined: Then in 1975 a new kind of cipher was proposed that radically altered the situation by supplying a new definition of "unbreakable." a definition that comes from the branch of computer science known as complexity theory. These new ciphers are not absolutely unbreakable in the sense of the one-time pad. but in practice they are unbreakable in a much stronger sense than any cipher previously designed for widespread use. In principle these new ciphers can be broken. but only by computer programs that run for millions of years! Overall the Diffie-Hellman method has had a good run, but it has struggled in recent years to keep up with the processing power for computers, and the millions of years of running is not quite the case in the modern area, and where the original ciphers could now easily be broken with the simplest of computers within minutes. With the RSA method, Martin Gardner outlined: Their work supported by grants from the NSF and the Office of Naval Research. appears in On Digital Signatures and Public-Key Cryptosystems (Technical Memo 82. April. 1977) issued by the Laboratory for Computer Science Massachusetts Institute of Technology 545 Technology Square. Cambridge Mass. 02139.The memorandum is free to anyone who writes Rivest at the above address enclosing a self-addressed. 9-by-12-inch clasp. On receipt the requesters eventually (it took over four months in many cases) received a precious piece of history (Figure ref{fig03}). RSA research paper It seems unbelievable these days, but the original methods were based on two 63-digit prime numbers that would be multiplied to create a 126-digit value: Contrast this with the difficulty of finding the two prime factors of a 125- or 126-digit number obtained by multiplying two 63-digit primes. If the best algorithm known and the fastest of today's computers were used, Rivest estimates that the running time required would be about 40 quadrillion years' A 256-bit number, at its maximum, generates 78-digits: 115,792,089,237,316,195,423,570,985,008,687,907,853,269,984,665, 640,564,039,457,584,007,913,129,639,936 Web: https://asecuritysite.com/encryption/keys3 The 40 quadrillion years has not quite happened, and where 512-bit keys are easily broken in Cloud. If you are interested, here is a 512-bit integer value and which has 148 digits, such as: 13,407,807,929,942,597,099,574,024,998,205,846,127,479,365,820,592,393,377,723,561,443,721,764,030,073,546,976,801,874,298,166,903,427,690,031,858,186,486,050,853,753,882,811,946,569,946,433,6 49,006,084,096 web: http://asecuritysite.com/encryption/random2 The search for prime numbers, too, has been progressive since 1977, and by 2014, the world discovered a 17,425,170-digit prime number. The finding of prime numbers make the finding of them in the RSA method must easier. So the RSA method has been under attack for years, from both discovering prime numbers and also in factorizing. Along with this computing power has increased massively. If think that 40 years that have passed, and take a quick assumption that computing power doubles every year then we get: 1977 4 Quadrillion Years (4,000,000,000,000,000)1978 2 Quadrillion Year1979 1 Quadrillion Year…2020 227 years2021 113 years2022 57 years2023 28 years and if we get a GPU card with 4,000 processors, we take it to less than a year, and we get of few of them today into a cluster, and we crack it within one day! The FREAK vulnerability was actually caused by the limiting of RSA keys, due to US Export controls, to 512-bits. The factorising of prime numbers too has generated methods which can quickly find the prime number factors  The Tension of Crypto and Academic Freedom Once Martin had published the article, the requests for the article came rushing in, especially as the paper had not yet appeared in the Communication of the ACM. Initially there were 4,000 requests for the paper (which rose to 7,000), and it took until December 1977 for them to be posted. Why did it take so long to get the paper published and also to send them out? Well the RSA method caused significant problems within the US defence agencies. This was highlighted in a letter sent from J.A.Meyer to the IEEE Information Theory Group on a viewpoint that cryptography could be violating the 1954 Munitions Control Act, the Arms Export Control Act, and the International Traffic in Arms Regulations (ITAR), and could thus be viewed equivalent to nuclear weapons. In even went on to say that: Atomic weapons and cryptography are also covered by special secrecy laws The main focus of the letter was that any work related to cryptography would have to be cleared by the NSA before publication. In fact, the letter itself had been written by Joseph A Meyer, an employee of the NSA. Joseph had already been embroiled in controversy with a proposal to fit a tracking device to the 20 million US citizens who had been associated with crime. The tag would then be used to monitor the location of the “subscriber”, and to detect when they broke a curfew or committed a crime. In this modern era of GPS tracking of everyone's phones, Joseph's dream has actually become a reality, but now everyone is monitored. The RSA team thus had a major dilemma, as many of the requests for the paper come from outside the US. Martin Hellman, who was a co-author of the Diffie-Hellman method, had already had problems with ITAR, and even decided to present thep aper himself in 1977 at Cornell University rather than the practice of letting his PhD students present the work. His thinking was that the court case would be lengthy, and that it would damage his PhD student's studies (Ralph Merkle and Steve Pohlig), and so he stood up for academic freedoms. Initially the students wanted to present their work, but their families did not think it a good idea. Eventually though, Ralph and Steve stood beside Hellman on the stage to present the paper, but did not utter a word. With this stance the cryptographers held ground, and hoped that a stated exemption on published work within ITAR would see them through. The worry, though, did delay the paper being published, and for the posting of the article. In reply to Meyer's letter, the IEEE stood its ground on their publications being free of export licence controls, with the burden of permissions placed on the authors: RSA research paper and then additional response from the IEEE saying they put in place safeguards for the publishing of material. The scope of the impact of RSA was perhaps not quite known at the time with Len Adleman stating: I thought this would be the least important paper my name would ever appear on In fact, Adleman has said that he did not want his name on the paper, as he had done little work on it, but he did insist that his name went last. Often papers, too, have an alphabet order, and if so the method could have been known as the ARS method … not the kind of thing that you would want to say to audiences on a regular basis. RSA Within cryptography we typically use non-negative integer values, and perform integer operations. The challenge in public key encryption is to find a method which is computationally difficult for a computer to solve, if it does not know a given secret (normally the private key). One such problem is the difficulty in factorizing a value made up of the multiplication of two large prime numbers. In RSA, we take two large prime numbers — typically at least 512 bits long — and then multiply these together to create a modulus value, (N) (often at least 1,024 bits long). From this, we then derive a public exponent (e) and a modulus. The modulus N is thus determine by multiplying the two prime numbers (p and q): N = p x q The core challenge here is that it should be extremely difficult (and costly) to determine the two prime numbers which make up N. Next we select the value of our encryption key value for the public key (e). This is selected so that N and e do not share any factors: gcd(e,PHI)=1, and where  PHI = (p-1)(q-1) This is known as Euler's totient function. The most typical value we use for e is 65,537 (0x10001). To produce a cipher (C), we convert our message into the form of an integer (M) and then use e and N to give: C = M^e mod N To decrypt this, we take the cipher (C), and recover the message value using the decryption exponent (d) and the modulus (N): M = C^d mod N To make RSA work, we then need to calculate the private exponent (d) to obey: (d x e) mod{PHI} = 1 and where phi is: PHI = (p-1)(q-1) We determine d by determining the inverse of e modulus phi: d = e^{-1} pmod {phi} So let's take p=11 and q=7, and pick e of 3. N will be: N=p.q = 77   PHI is 6x10=60 We can't pick e of 3 or 5, so we will pick e=7. Now we compute the decryption exponent of d = e^{-1} mod (PHI) >>> pow(7,-1,60) 43 If we select a message of 19, we get a cipher of: C=19⁷ (mod 77) = 68 Now to decrypt: M= 68⁴³ (mod 77) = 19 Our public key is then (e,N) and the private key is (d,N). The usage of the (mod N) operation is the magic that makes this work. Unfortunately, the RSA method has suffered from performance issues as we have increased the size of the prime numbers used. Thus, if researchers can crack a modulus of 1,024 bits, they will factorize the two 512-bit prime numbers used. At the current time, a public modulus of 2,048 bits is recommended. So while a modulus of this size is acceptable within a powerful computer, devices which have limited CPU resources often struggle in creating the keys, and in the encryption and decryption process. RSA Signatures With the mathematical operations involved, RSA is hardly ever used for core encryption, as symmetric key methods are much more efficient in their implementation. But it is fairly efficient when dealing with relatively small data sizes, such as for a symmetric key (typically only 128 bits or 256 bits long). For this, Alice might protect a symmetric key with her public key, and whenever she needs to use it, she will decrypt it with her private key. Another area where we use RSA is to take a hash of a message, and then encrypt this with the private key. As the hash is relatively small (such as 128 bits, 160 bits or 256-bits), it is relatively efficient on the use of the computing resources. Where public key encryption methods come in most use is within creating digital signatures, and where Bob can take a hash of a message, and then encrypt this hash with his private key. Alice can then also take a hash of the received message, and decrypt Bob's encrypted hash with his public key, and compare the values produced. If they match, she determines that it was Bob who sent the message and that it has not been changed by anyone.  In Figure ref{fig_trust03} we see that Bob has a key pair (a public key and a private key). He takes a hash of the message and encrypts with his private key, and then appends this to the message. This and then message will be encrypted by the symmetric key that Bob and Alice share (typically this is either a long-term shared key, or has just been negotiated through a hand-shake). When she receives the ciphered message, she decrypts it with the shared symmetric key, and then takes her own hash of the message. She also decrypts the encrypted hash using Bob's public key, and then compares the hashes. As the public key and the private key work together, only the signing by Bob's private key will reveal the hash with his public key. Alice can then tell that the message has not been changed — as the hash would change if Eve has modified it — and that it was produced by Bob (and not by Eve pretending to be Bob). Obviously, we now have a problem in how we get Bob's public key. An important element here, is that they have to find a way for Bob to send Alice her public key in a trusted way, so that Eve cannot intercept it, and change the keys. For this, we introduce Trent, and who is trusted by Bob and Alice to prove their keys. For this Trent signs the public key of Bob with his private key, and then Alice uses Trent's public key to prove Bob's public key. For a few decades, RSA has been the main method in supporting public key encryption. We often use it when we connect to a secure Web site, and where the RSA method is used to prove the identity of the Web site. In this case the RSA public key of the site is presented to the user in the form of a digital certificate — and which is signed by a trusted source. The Web site can then prove its identity by signing a hash of the data with its private key, and the client can check this. A typical size of the public modulus is now 2,048 bits (created by two 1,024 bit prime numbers), and with some sites supporting 4,096 bits. So while desktop computers have the processing power to cope with these large numbers, less able devices (such as for low processing powered IoT — Internet of Things — devices) will often struggle to perform the necessary calculations. Simple example So let's take a simple implementation of RSA key generation, encryption and decryption. In this case the code is: Web: https://asecuritysite.com/encryption/rsa12 In this case, we generate two random prime numbers ($p$ and $q$) for a given number of bits. The more bits we use, the more secure the method is likely to be, as an increase in the number of bits increases the number of prime numbers that can be searched for. Once we have these, we then determine the public modulus ($N$) by multiplying the prime numbers together. The difficulty of the problem is then factorizing this modulus back into the prime numbers. If we have the public modulus, it is fairly simple to then find the decryption exponent value. In most modern examples of RSA, we select a public exponent value ($e$) of 65,537, and so our encryption key becomes $(65,537,N)$. The decryption exponent ($d$) is then the inverse of $e pmod {phi}$ (and where $phi=(p-1)(q-1)$). from Crypto.Util.number import *from Crypto import Randomimport Cryptoimport libnumimport sysbits=60msg="Hello"p = Crypto.Util.number.getPrime(bits, randfunc=Crypto.Random.get_random_bytes)q = Crypto.Util.number.getPrime(bits, randfunc=Crypto.Random.get_random_bytes)n = p*qPHI=(p-1)*(q-1)e=65537d=libnum.invmod(e,PHI)## d=(gmpy2.invert(e, PHI))m= bytes_to_long(msg.encode('utf-8'))c=pow(m,e, n)res=pow(c,d ,n)print ("Message=%snp=%snq=%snnd=%dne=%dnN=%snnPrivate key (d,n)nPublic key (e,n)nncipher=%sndecipher=%s" % (msg,p,q,d,e,n,c,(long_to_bytes(res))))end{lstlisting} A test run using 60-bit prime numbers is: Message=hellop=242648958288128614541925147518101769011q=299356840913214192252590475232148200447N=72638625604016464006874651287120524699932001616388639276131104258310920947917cipher=5847803746095553957863305890801268831081138920772806292673259864173015661385decipher=hello Conclusions RSA has been around for over 46 years, and is still going strong. It can encrypt and it can sign. While the prime numbers involved has got larger, and it needs to have padding applied, it is still one of the best public key methods around, and well used on the Web.  

Len is a co-creator of the RSA encryption algorithm [1] and received the 2002 Turing Award (often defined as the Nobel Prize of Computer Science). The RSA paper is one of the most significant computer science papers ever published and has received over 25,695 citations. Len is also known for the creation of DNA computing. He is a professor at the University of Southern California and a member of the National Academy of Sciences. [1] Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120-126.

1 personne sur 2 s'est déjà fait réveiller en pleine nuit à cause de ceci à la question impossible // On jase avec la sommelière Véronique Rivest en vue du salon des assoiffées qui se déroulent ce weekend//Monic Néron écrit une lettre à Barbie// On parle du phénomène de l'anxiété du menu// Félicitation à Anne Gaudet qui remporte 100$ à la liste d'épicerie en folie grâce au IGA extra famille St-Jacques// On joue à mots de passe //

Minimalist business strategist Lynn Rivest shares tips on repelling the wrong clients, email marketing, branding, and more.

Thème: Les mots! Épisode enregistré le 5 avril 2023 à la Salle Félix-Leclerc de Val-d'Or, avec nos invitées Catherine Éthier et Isabelle Rivest. Ge, tu elles: L'édito de Geneviève: « Dire tout sans rien dire » Wikipéha: Petite mise en bouche de Paul-Antoine en lien le thème du jour De la ben belle visite: Catherine Éthier Segment surprise: Catherine Éthier critique le roman « Une femme extraordinaire » de Catherine Éthier  Trancher: On se penche sur quelques questions niaiseuses Rayon X: Une chronique qui sonne comme du Jackson De la ben belle visite: Isabelle Rivest 9 à 3: Isabelle Rivest, autrice depuis la tendre enfance, parle du rapport aux mots dans sa famille Quand pensez-vous: Est-ce que le clivage intellectuel se creuse? Performance: I Miss You, une traduction libre d'un chef d'oeuvre de La Chicane Le moment anti-radio: Les emojis aka nouveaux mots dans le dictionnaire La zone d'inconfort: Paul-Antoine plonge, malgré lui, dans l'univers trad Cochonneries: équité, diversité et inclusion Cet épisode est présenté par la Bibliothèque municipale de Val-d'Or Merci aux précieux partenaires de Quand pensez-vous: * La Société St-Jean-Baptiste de l'Abitibi-Témiscamingue * Adama Productions * Québec Studio * Marie-Claude Robert photographe * Studio Lachapelle Animation: Francis Murphy, Geneviève Béland et Paul-Antoine Martel; Réalisation: Francis Murphy; Narration: Yolette Lévy; Image sonore: Bernard Boulanger et Le Carabine; Technique: François Lachapelle, Jason Labrecque, Jean-Luc Bellemare; Régie et logistique: Karine Murphy et Stéphanie Poitras. Extraits musicaux entendus: Les mots, Samian ft. Anodajay Face à ma musique © 2010 Disques 7ième Ciel Dis tout sans rien dire, Daniel Bélanger Rêver mieux © 2001 Les disques Audiogramme inc. Dire, Ivy Slamérica © 2008 Productions de l'incidental Ampoule de Peter Pan, Les Denis Drolet Les Denis Drolet © 2002 JKP Musique OK, Vulgaires Machins Disruption © 2022 Vulgaires Machins Des mots qui sonnent, Céline Dion Dion chante Plamondon © 1991 Sony Musique Intertainment (Canada) Inc. Toute nue, Sylvie Laliberté Dites-le avec des mots © 2000 Ozone Éloge du doute, Jim Corcoran Pages blanches © 2005 Jim Corcoran Les mots, Mickey 3D Matador © 2005 Moumkine Music - Diffusion exclusive Parlophone Music Monsieur le curé, François Crépeault et la famille Crépeault-Boulanger 
 Bag of Spuds, The Brendan Mulhaire Ceili Band 
The Best Of Traditional Irish Dance Music © 2003 Carroll's Irish Gift Stores Qu'essé qu'on queer ici, Samuele Une paillette dans l'engrenage © 2022 Samuele Lozier-Mandeville, Julie Miron sous licence InTempo Musique

Ça y est, le dernier épisode est là. Pour ce faire nous recevons Pierre Rivest concepteur en chef chez Behaviour Interactive pour discuter du jeu Meet Your Maker. Behaviour Interactive est le studio indépendant le plus ancien de Montréal, sa fondation remontant à 1994 sous le nom Montreal-based Multimedia Interactive, et nous ne les avions jamais reçu à l'émission! On finit donc ça en beauté.

Hi all,   Welcome back to another episode on the MindCep Podcast and in today's episode we have very special guest named Anthony Rivest joining us today.    This episode is brought to you by Radioguestlist.com, the #1 free radio, guest, podcast, and talk show guest expert interview booking service. This episode is brought to you by PodcastGuests.com,  Connecting podcasters with great guests. Podcasters: Find relevant experts and other podcasters to be guests on your podcast. Experts, Guests, and more: Get booked on great podcasts to expand your reach and audience. PodcastGuests.com connects podcasters with experts, authors, and other podcasters to be guests on their podcasts. In this episode myself and Anthony Rivest discuss: (Timestamps are approximate) 1. -How to become the architect of your inner world 3:05 3. -How to prioritize what's most important to you 5:15 4. -How we have the power to change our reality and when we do the universe will meet us half way 6:24..5. -How our daily habits and delaying gratification can serve as the greatest indicator of future successes 11:30-2 6.-Having a gratitude attitude helps you to become more centered and present with where you are 15:15 7. -Utilizing 1-2 habits daily to help really move your personal projects or business to propel forward 18:00 8. -Anthony's language learning experience, teaching his soon to be wife english and him learning Georgian 21:01 9. -Anthony's intuition to move from Quebec City Canada all the way to Georgia, Tbilisi to meet the woman of his dreams 26:14 If you enjoyed this podcast, please be sure to leave MindCep a 5 ⭐️ review on Apple Podcasts, Spotify Podcasts comment, rate, and subscribe for more content like this, and to offer your recommendations on future content you would like to see.  Thank you all for listening. Anthony Rivest's Website, Social Media: (3) Anthony Rivest | LinkedIn (7) Anthony Rivest | Facebook Anthony Rivest (@anthony.rivest) • Instagram photos and videos Alex's  Blog & Podcast: https://alexandermuir.com/blog/ Find Me on Social: https://www.instagram.com/a.muir757/?hl=en https://www.linkedin.com/in/alex-muir-b55a44149/ https://www.youtube.com/channel/UCkW1z-RObDp8VPJ0NWego-Q?view_as=subscriber Cheers,     Alex     DISCLAIMER: All information provided by Alex Muir is of a general nature and is spoken from Alex Muir's personal experiences, and personal opinions on the topics related to fitness, health, and education only. No information is to be taken as medical or other health advice pertaining to any specific health or medical condition. You agree that use of this information is at your own risk and hold Alex Muir harmless from any and all losses, liabilities, injuries, or damages resulting from any and all claims.

Les étudiantes en psychologie de Montréal Marjolaine Rivest-Beauregard et Justine Fortin ont créé le balado Sors de ma tête au début de la pandémie de COVID-19 pour contrer la désinformation et rendre la science accessible aux non-scientifiques. Elles ont par la suite diversifié les thèmes de leur émission et s'apprêtent à lancer leur troisième saison. Podcast : https://baladoquebec.ca/covid-19-sors-de-ma-tete-2 Spotify : https://open.spotify.com/show/4u1kgawEetGUnzqwYoujUM YouTube : https://www.youtube.com/channel/UCDkgURrt5ELZuGoIaY2PzQQ Épisode 8 (Trahison amoureuse avec Michelle Lonergan (PhD) et Marie Gagné (créatrice de contenu)) : https://youtu.be/ZHQAwP8AVTY Épisode 4 (Médias et santé mentale avec Alexandre Coutant (PhD) et ICI Charlie (créatrice de contenue)) : https://youtu.be/YwCBanaxOJ4 Sors de ma tête page Instagram : https://www.instagram.com/sors.dematete/?hl=fr-ca

Omar gets right to the inspiring conversation with Anthony Rivest. He's not from Athens Georgia or Atlanta Georgia but Tbilisi Georgia, the country.Anthony helps stressed-out professionals get clear on their roadmap to a life that lights them up. He also hosts Your Brother's Podcast. Do you feel trapped in a “successful” life?In this episode, Omar and Anthony discuss:Lack of ClarityThe Relationship with the Inner SelfBeing Stuck in HabitsAddictionPurposeCreating Something NewFocusing AttentionDoing your Own ThingHatersWhy Anthony Left Canada for GeorgiaLiving in GeorgiaGoing withinand much more! Join the What if it Did Work movement on FacebookGet the Book!www.omarmedrano.com

Laurence Baril et Simon Rivest forment une équipe redoutable, dans la vie comme sur les sentiers. Les deux athlètes sont passionnés de plein air, d'aventures et de trail, et ils ont une approche du sport qui est très saine, basée sur le plaisir entre amis. C'est en les écoutant parler de trail et de plein air qu'on retombe en amour avec notre beau sport. Dans cet épisode enregistré devant public au Noctem, on retrace leurs débuts en course en sentier et leur progression respective dans le sport. On aborde les trois tentatives de QMT 100 miles de Simon (oui oui, trois, même si l'épreuve n'a eu lieu que deux fois), les trucs de pacer de Laurence, leur voyage en Italie pour participer au Lavaredo Ultra-Trail, la blessure de Laurence en début de saison, ainsi que la place spéciale qu'occupe l'Ultra-Trail Harricana dans leur coeur. Comme Laurence est médecin d'urgence et Simon est physiothérapeute, je les amène sur le sujet de l'impact de la course en sentier sur le corps. Si je me fie au public présent au Noctem, vous devriez passer un excellent moment en compagnie de ces deux beaux humains. Bonne écoute!CréditsDesign graphique : David HébertThème musical : Frédérick DesrochesIdée originale, production, recherche et animation : Yannick Vézina© Pas sorti du bois 2022

This week's episode of Good Girls Get Rich is brought to you by Uplevel Media CEO and LinkedIn expert, Karen Yankovich. In this episode, guest Lynn Rivest and Karen Yankovich discuss the importance of human-to-human relationships. Lynn Rivest is an Online Business Strategist helping solo entrepreneurs focus on what matters most in their business to make it flourish. #GoodGirlsGetRich We want to hear your thoughts on this episode! Leave us a message on Speakpipe or email us at info@karenyankovich.com.   About the Episode: The world is always changing, and it changed a lot during the COVID-19 pandemic. Now that we're on the other side of the pandemic, and now that more and more things online are completing for our attention, we have to find a way to stand out. What people want is to feel important. The want to feel heard. They want to feel cared for. They want that human-to-human connection. When marketing to and talking with people online, don't be impersonal. Be personal. Be genuine. Be human. Join Karen and Lynn in Episode 213 as they discuss building human-to-human relationships!   Episode Spotlights: Where to find everything for this week's episode: http://karenyankovich.com/213 Introducing this episode's guest, Lynn Rivest (2:18) You need to clearer and more specific (7:17) Put in time for exploration (14:20) We hang onto things too long (16:46) Make people feel important (18:22) Information overload (21:53) Don't stick to methods that don't work (28:39) How to connect with Lynn (33:00)   Resources Mentioned In This Episode: Where you can find Lynn Rivest: Website Lynn's Newsletter LinkedIn Twitter Sign up for the She's LinkedUp Masterclass Join my free Facebook Group if you have any questions about today's episode   Help Us Spread The Word! It would be awesome if you shared the Good Girls Get Rich Podcast with your fellow entrepreneurs on Twitter. Click here to tweet some love! If this episode has taught you just one thing, I would love if you could head on over to Apple Podcasts and SUBSCRIBE TO THE SHOW! And if you're moved to, kindly leave us a rating and review. Maybe you'll get a shout out on the show!   Ways to Subscribe to Good Girls Get Rich: Click here to subscribe via Apple Podcasts Click here to subscribe via PlayerFM You can also subscribe via Stitcher Good Girls Get Rich is also on Spotify Take a listen on Podcast Addict

SÉRIE SPÉCIALE - ENTREVUES: Lors de cette série, on vous présente des femmes qui ont eu l'audace d'entreprendre des projets qui leur apportent de la joie, afin de démontrer plusieurs versions du succès et du bien-être. Dans cet épisode, on reçoit l'illustratice Florence Rivest. En plus de faire des miracles avec crayons et pinceaux, Florence est une femme terre à terre, authentique et fonceuse. Elle partage généreusement sa passion pour le plein air et l'art à travers son projet Erre Land, qui propose des cours d'art en nature. Cette discussion aborde entre autre: La valeur du processus; L'importance de conserver l'art comme un outils plutôt qu'une fin; La puissance de faire des projets pour soi d'abord; D'assumer ses envies et d'avoir le courage de les poursuivre.   Ressources mentionnées: Tuesdays with Morrie, Mitch Albom  Daring Greatly, Brené Brown @flo.rivest @erre.land 

Cette épisode est tiré d'un entrevue du groupe privé de Julien “The Pack”. Dans cet épisode Julien interview Louis Jr Rivest son Vp des ventes. Si tu a déjà voulue avoir un regard sur ce qui se passe a l'intérieur des entreprises de Julien c'est ta chance a travers ce podcast.

How to look at depression with a new perception with Anthony. Anthony is a Personal Transformation Expert. He has thousands of hours of experience coaching clients 1-on-1 on how to clarify their purpose, design a life that lights them up, and how to bridge the gap in their current situation. He has been studying human behaviors and the role of emotions in becoming our authentic selves for over 16 years. Anthony conquered drug addiction back in 2016 by understanding the feedback that his body was giving him. After a near-death experience, he left a job he was unhappy with, took a year to get his health back, and decided to go after his dreams. He is fascinated by the mind-body connection and knows very well that all symptoms are there to teach us something. If you experience emotions like anxiety, depression, guilt, or shame on a regular basis, he believes that you have the power to change your perception to look at any situation with new eyes. Thank you @anthony.rivest for sharing with us your wisdom and insight on the ability to take our anxiety and depression and look at it differently, and ask it what it's trying to tell us. Also on the dangers of comparing yourself to others, and how this can tarnish your path and self-harmony. Plus, how important it is to appreciate our own talents and purpose whatever place they are in at the moment. Follow Anthony Rivest on Linkden to connect further or book a discovery call with him. https://www.linkedin.com/in/anthonyrivest/ Subscribe to Thursday Thyroid Talks on all major platforms Spotify or Apple to stay connected with me and my guests. Thank you for listening, please subscribe and make sure you make you leave a review and vote on the pols below. Check out my root cause testing on my website at Coachsarahjoy.com Make sure you join my email list when you get there and get your freebie called "the 6 things I wish I would have been told after I was diagnosed with Hypothyroidism and Hashimotos." Plus after you sign up you will get my 5-day video series called "5 days for greater peace and higher energy" Got any questions? Email me at coachsarahjoy1@gmail.com Connect with me on IG @coach.sarah.joy for daily posts and stories --- Send in a voice message: https://anchor.fm/sarah-joy1/message

Quel bonheur j'ai eu en discutant avec Christine! Sans parler de toutes les prises de conscience que notre discussion a engendrée. Christine est spécialiste en communication et en comportement humain. Elle est également la fondatrice du Mouvement Vie de LeadHer. Sa mission: aider les femmes à atteindre leurs plus grandes ambitions en développant la LeadHer en elles. En travaillant la communication, l'intelligence émotionnelle, les saboteurs, les relations, le comportement humain et le grand thème du Leadership, son but ultime est que les femmes développent leur réflexe de mettre leur énergie au bon endroit avec les bonnes personnes pour bâtir un monde grandiose! Ensemble on a jasé de patience en affaires en lien avec les styles de personnalité. Tiens-toi prête, c'est du bonbon! Pour suivre Christine sur Instagram : https://www.instagram.com/christine.connexionh/ Pour te joindre à son groupe Facebook : https://www.facebook.com/groups/unplan/ Pour son accompagnement d'Entrepreneure à LeadHer : https://www.christinerivest.com/eal

On poursuit l'aventure avec un autre coureur du TP50, Simon Rivest. Simon pousse la réflexion sur l'essence de nos courses de trail au Québec. De quoi réfléchir un peu sur nos motivations à venir (et revenir) en Gaspésie l'an prochain

Utiliser les styles de personnalités pour développer son leadership, attirer et fidéliser ton client idéal c'est possible. Et oui, c'est ce que Christine enseigne à ses clientes. Comment développer son leadership en apprenant à se connaitre et mieux communiquer selon la personnalité qui se trouve devant toi. En travaillant la communication interpersonnelle, l'intelligence émotionnelle, les saboteurs, les relations, le comportement humain et le grand thème du Leadership, les femmes qu'elle accompagnent ont beaucoup plus de facilité que la majorité des gens à passer à l'action. Dans l'épisode, on parle des différents types de personnalités, comment les utiliser pour améliorer la communication entre nos clients, mais aussi dans le couple. Pour rejoindre Christine : https://www.christinerivest.com/ Sur instagram : https://www.instagram.com/christine.connexionh/ Pour me joindre: jade.cantin@sfta.ca Sur facebook: https://www.facebook.com/jadecantinassurance Pour me suivre sur instagram: https://www.instagram.com/le_podcast_passionnement/?hl=fr-ca N'hésitez pas à nous tagguer dans vos partages.

You've heard the name at the beginning of every Tallahassee Business Podcast episode, but what exactly is The Health Network? Dustin Rivest, the Founder of THN joins us for a special sponsor highlight this week as he talks about the history of the tech company and where it's headed next. Dustin and The Health Network team have worked closely with a number of local healthcare practices to change the patient experience while helping local businesses advertise on a unique platform. Learn more about The Health Network at www.thnadvertising.com.

Karl Blackburn et Pascal Lévesque s'intéressent aux répercussions d'un emploi sur la réussite scolaire des élèves du secondaire; Georges Privet fait une chronique sur des films qui rendent hommage aux inconnus dont les efforts ont empêché des guerres; le cardiologue Martin Juneau parle du Mois du cœur; Danielle N'Cho et Rivellie Tchuisseu, qui ont obtenu une bourse pour étudier en science, racontent pourquoi elles ont décidé de quitter l'Afrique pour venir faire leurs études au Québec; Christophe Fortier-Guay fait le point sur la situation en Ukraine; l'ébéniste Patrick Laperrière présente la série Making Fun, bientôt offerte sur Netflix; et la sommelière Véronique Rivest propose une recette de spritz sans alcool.

L'illustratrice, designer et peintre Florence Rivest fait converger ses deux amours, l'art et le plein air, dans sa démarche artistique, mais aussi avec son initiative Erre qui propose des cours de dessin en nature.  Par où on commence pour dessiner des paysages? Peut-on vraiment participer à une fin de semaine de cours de dessin en nature si on est débutant·e? Comment s'inspirer du territoire? Un épisode qui donne envie de partir dehors à l'aventure, un crayon et un calepin dans la poche! Généreuse et enthousiaste, l'artiste évoque également son désir de rejeter l'injonction à la performance, le plaisir de créer (et jouer!) en gang et la puissance créative des espaces naturels. Depuis quelques années, on peut notamment retrouver les œuvres aux teintes vivifiantes et aux reliefs apaisants de Florence Rivest dans le magazine Beside. Création, réalisation, animation : Claire-Marine Beha Musiques originales : Juliette Beha, Yvan Vindret

Dans cet épisode, je discute avec Christine, une experte en communication et en comportement humain. J'avais envie de vous faire découvrir cet univers car dans le métier de coiffeur autant que dans la vie personnelle c'est quelque chose d'hyper important à comprendre d'après moi et christine. L'humain est si fascinant et d'en apprendre plus pour que sa soit juste plus simple.   '' Certifier D.I.S.C. , c'est un model super simple pour comprendre les styles de personnalités ... ''   Pour avoir plus d'information sur sa formation sur le comportement humain , ou simplement la suivre car elle est super inspirante sur les réseaux sociaux, voici sa page : https://www.instagram.com/christine.connexionh/  Et son site internet : https://www.christinerivest.com   Bonne Écoute -xx

Salut tous le monde! Cette semaine je reçois Christine Rivest, de la Ferme Guy Rivest située à Rawdon! Moi et Christine, on se connait virtuellement via Twitter depuis de nombreuses années mais c'était la première fois que l'on se parlait de vive voix! Elle nous raconte l'histoire de la ferme bien entendu et nous explique que plusieurs produits sont fabriqués à la ferme comme des confitures, des gelées et même du vin de fraises. Pour suivre la page FB de la Ferme Guy Rivest https://www.facebook.com/FermeGuyRivest Allez liker la page Facebook des Podcasts Agricoles https://www.facebook.com/PodcastsAgricolesQuebec Pour me rejoindre, écrivez moi à PodcastsAgricoles@gmail.com Abonnez vous également a ma page Patreon, patreon.com/PodcastsAgricoles Ou encore, téléchargez l'application Patreon sur votre téléphone à poche. Pour écoutez The Backslash Band, créateur de tous les jingles des Podcasts Agricoles, sur Spotify https://open.spotify.com/artist/1uYTEtwtDU6RGsM5PvLRdM?si=PrlN49fXRImSUP2_n9lw8A Bonne écoute! --- Send in a voice message: https://anchor.fm/podcastsagricoles/message

Artiste Visuelle et fille de plein air Florence Rivest illustre toutes sortes de paysages avec des couleurs dans lesquels je veux me perdre tout comme elle le fait lorsqu'elle quitte pour crée en nature. J'ai vraiment adorer notre moment partagé à discuté de toutes les choses qui nous habite. Une convo qui va vous faire du bien en ce mois de Janvier incertain. 

Dans cet épisode, je reçois Christine Rivest, experte en communication et comportement humain et fondatrice du mouvement de LeadHer.    C'est après avoir vu beaucoup de femmes mettre leur énergie à la mauvaise place et/ou avec les mauvaises personnes que Christine a eu l'envie de créer ce mouvement.   Elle croit fondamentalement qu'en redirigeant cette énergie au bon endroit, on peut travailler sur ses propres projets et créer des choses extraordinaires au lieu de regarder les autres et de se comparer.   Pour mieux avancer, il faut non seulement apprendre à se connaître, mais aussi apprendre à connaître les autres. C'est ce qui nous permet d'optimiser nos relations par le simple fait de se comprendre mutuellement.    On aborde entre autres:  Améliorer ses processus par la compréhension de l'autre Optimiser ses communications avec le modèle DISC Les questions à se poser quand on rencontre de nouvelles personnes _____________   Tu peux suivre Christine Rivest sur Instagram, Facebook, son podcast Vie de LeadHer et son Site web   ***    Liens mentionnés: Bundle formation s'équiper pour atteindre ses objectifs CODE PROMO: EXPANSION10 Knix wear CODE PROMO: MELISSAPOTHIER10 - Leak proof & evolution bra

La consultante en communications numériques et réseaux sociaux Nellie Brière et l'écrivaine Mélissa Verreault discutent des raisons et de la façon de quitter Facebook; Georges Privet fait une chronique sur des films et une série qui portent sur des réunions de famille; Alexandra Szacka parle d'une invasion possible de la Russie en Ukraine au début de 2022; l'Éduchateur et consultant en comportements félins Daniel Filion et la vétérinaire Claudia Gilbert répondent à des questions sur l'entretien des griffes des chats; la philosophe Marianne Chaillan présente son livre Où donc est le bonheur?; et Lesley Chesterman ainsi que Véronique Rivest nous proposent un menu pour le temps des Fêtes.

Laughter is the best medicine.  Seriously!  It frees our emotions.  Can shift our perspective.  Reduce overwhelm.  Increases oxygen flow.  Releases neuropeptides that decrease stress. Connects us with others.  Breaks down barriers.  And all while having heap loads of fun!     In this episode, I interview Robert Rivest, Laughter Yoga Master Trainer.  He shares his journey to peace and stillness through motion and activity.  With 40+ years of experience in the mindfulness field, he shares his wisdom, his experience, and of course, his laughter.   Takeaways from today's episode: Take time to share with someone who has contributed goodness to your life how much they mean to you (even if you think they hear it a lot from other people). You can simultaneously feel rooted and grounded yet light and free. There is stillness in movement.  Ease in effort. Laughter Yoga is the quickest delivery system of the mind-body health benefits of laughing. Laughter dissolves all the walls between us. Motion creates emotion. Sitting, standing, walking, smiling and laughter can all be meditation. We can get through heavy things with laughter.  Laughter helps to open the emotional valve, so that emotions that may be stuck can flow through. How to connect with Robert Rivest, Laughter Yoga Master Trainer For everything go to >>> https://www.robertrivest.com Robert's YouTube Channel >>> https://www.youtube.com/user/robertrivest Robert's FaceBook Page >>> https://www.facebook.com/robert.rivest.7/ Robert's Instagram >>> https://www.instagram.com/robertrivest/   The Carol Rivest Foundation http://www.carolrivestfoundation.org/home.html The Dynamic Neural Retraining System https://retrainingthebrain.com How to connect with Shannon Klenk, Happiness Coach & Self-Care Strategist: Learn >>> www.finallyeffinghappy.com Connect >>>  finallyeffinghappy@gmail.com Community >>>  bit.ly/finallyeffinghappygroup Email List >>> https://bit.ly/TheEffingEmailList 1:1 Discovery Session >>> bit.ly/discoverysessionwithshannon

During this episode of Cullinane's Cafe, I sit down with guest, Craig Rivest and enjoy some cold brew during the summer heat. Craig Rivest is a part-time business owner, and full-time parent. Just about a year ago, Craig left his full-time job to focus on growing his freelance photo & video business so that he could spend more time with his family. This was a great conversation with Craig all about work, life, and everything in-between.

The Rivest & Black Pedro  EpisodeGuest: Rivest DunlapBlack PedroIntro: Stylo VeraOutro: Tupac - Straight BallinPodcast also available on Apple, Spotify, Google Play, and YouTubeVideo - Holla at Me Podcast - Ep 58 - ft. Rivest Dunlap and Pedro Hernandez

The Rivest Dunlap EpisodeGuest: Rivest DunlapIntro: Stylo VeraOutro: Dru Down - Can You Feel MeAdditional Music:Pete Rock - The Beat Rock TapePodcast also available on Apple, Spotify, Google Play, and YouTubeVideo - Holla at Me Podcast - Ep 51 - Rivest Dunlap 

For more info on Rivest Dunlop go to @rivestdunlop