RSA Cryptography: Primality Testing and Quadratic Residues
Graph Chat
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Explores primes in arithmetic progression, focusing on L-functions, characters, and the divergence of the sum of 1 over p for p congruent to a modulo q.
Explores the commitment scheme, key derivation function, and pseudorandom generator in cryptographic protocols, emphasizing their role in ensuring data integrity and authentication.
Explores zero-knowledge proofs, their properties, practical applications, and implementation in real-world scenarios, including attribute-based credentials.
Explores the basics and applications of elliptic curve cryptography, covering ECM factorization, standard curves, practical examples, and real-world implementations.
Explores asymmetric cryptography basics, including encryption, signatures, and Diffie-Hellman, along with advanced topics like RSA and quantum computing implications.
Provides an overview of time-lock encryption and its practical applications, focusing on threshold time-lock encryption algorithms and their security properties.
Explores trusted computing, confidentiality, integrity, and side-channel attacks, emphasizing real-world examples and the challenges of ensuring security.
Explores Diffie-Hellman key exchange and ElGamal cryptosystem, discussing their security aspects and applications in RSA, emphasizing the Chinese Remainder Theorem's role in speeding up decryption and proving RSA correctness.
