default search action
Pascal Junod
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j2]Jeremy Constantin, Raphaël Houlmann, Nicholas Preyss, Nino Walenta
, Hugo Zbinden, Pascal Junod
An FPGA-Based 4 Mbps Secret Key Distillation Engine for Quantum Key Distribution Systems. J. Signal Process. Syst. 86(1): 1-15 (2017) - 2015
- [c14]Benjamin Wesolowski, Pascal Junod
Ciphertext-Policy Attribute-Based Broadcast Encryption with Small Keys. ICISC 2015: 53-68 - [c13]Pascal Junod
Obfuscator-LLVM - Software Protection for the Masses. SPRO@ICSE 2015: 3-9 - [i5]Benjamin Wesolowski, Pascal Junod:
Ciphertext-Policy Attribute-Based Broadcast Encryption with Small Keys. IACR Cryptol. ePrint Arch. 2015: 836 (2015) - 2010
- [c12]Pascal Junod
An efficient public-key attribute-based broadcast encryption scheme allowing arbitrary access policies. Digital Rights Management Workshop 2010: 13-24
2000 – 2009
- 2009
- [c11]Pascal Junod
Revisiting the IDEA Philosophy. FSE 2009: 277-295 - [c10]Pascal Junod
Improving the Boneh-Franklin Traitor Tracing Scheme. Public Key Cryptography 2009: 88-104 - 2008
- [j1]Gildas Avoine, Pascal Junod
Characterization and Improvement of Time-Memory Trade-Off Based on Perfect Tables. ACM Trans. Inf. Syst. Secur. 11(4): 17:1-17:22 (2008) - [i4]Pascal Junod, Alexandre Karlov, Arjen K. Lenstra:
Improving the Boneh-Franklin Traitor Tracing Scheme. IACR Cryptol. ePrint Arch. 2008: 384 (2008) - 2007
- [b2]Gildas Avoine, Pascal Junod, Philippe Oechslin:
Computer system security - Basic Concepts and Solved Exercises. Computer and communication sciences, CRC Press 2007, ISBN 978-1-4200-4620-5, pp. I-XII, 1-260 - 2006
- [b1]Thomas Baignères, Pascal Junod, Yi Lu, Jean Monnerat, Serge Vaudenay:
A classical introduction to cryptography exercise book. Springer 2006, ISBN 978-0-387-27934-3, pp. I-XIV, 1-254 - 2005
- [c9]Pascal Junod
New Attacks Against Reduced-Round Versions of IDEA. FSE 2005: 384-397 - [c8]Gildas Avoine, Pascal Junod
Time-Memory Trade-Offs: False Alarm Detection Using Checkpoints. INDOCRYPT 2005: 183-196 - [c7]Simon Künzli, Pascal Junod
Distinguishing Attacks on T-Functions. Mycrypt 2005: 2-15 - 2004
- [c6]Thomas Baignères, Pascal Junod
How Far Can We Go Beyond Linear Cryptanalysis? ASIACRYPT 2004: 432-450 - [c5]Pascal Junod
Perfect Diffusion Primitives for Block Ciphers. Selected Areas in Cryptography 2004: 84-99 - [c4]Pascal Junod
FOX : A New Family of Block Ciphers. Selected Areas in Cryptography 2004: 114-129 - 2003
- [c3]Pascal Junod
On the Optimality of Linear, Differential, and Sequential Distinguishers. EUROCRYPT 2003: 17-32 - [c2]Pascal Junod
Optimal Key Ranking Procedures in a Statistical Cryptanalysis. FSE 2003: 235-246 - [i3]Nicolas T. Courtois, Robert T. Johnson, Pascal Junod, Thomas Pornin, Michael Scott:
Did Filiol Break AES ? IACR Cryptol. ePrint Arch. 2003: 22 (2003) - [i2]Pascal Junod:
On the Optimality of Linear, Differential and Sequential Distinguishers. IACR Cryptol. ePrint Arch. 2003: 64 (2003) - 2001
- [c1]Pascal Junod
On the Complexity of Matsui's Attack. Selected Areas in Cryptography 2001: 199-211 - [i1]Pascal Junod:
On the Complexity of Matsui's Attack. IACR Cryptol. ePrint Arch. 2001: 56 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: