Archives of Contemporary Cryptography Courses/Seminars

Disclaimer: fair use

Jointly taught and coordinated by

  1. Prof. Michael Anshel  mikeat1140 at aol dot com
  2. Prof. XiangDong Li xli at citytech dot cuny dot edu
  3. Prof. Kent D. Boklan boklan at cs dot qc dot edu

 

Previous seminar:

§              FALL 2005 seminar, Quantum Cryptography; Classical and Quantum Computing [1, 2]

§              SPRING 2005 seminar, Contemporary Cryptography [1]

§              FALL 2004 seminar, Contemporary Cryptoanalysis [1]

 

2006 Spring Semester Friday Seminar:

Cryptology and Computer Security; Quantum Computing; Algebra and Number Theory

Coordinator: Prof Anshel, Prof Boklan, and Prof Li

Location: Room 4421 (Some days we are with Algebra and Cryptography Seminar, and then with the New York Group Theory Seminar at Room 5417)

Time: 1400 - 1600

Procedure:       By appointment, Prof Anshel also speaks to student individually.

If any students want a time slot to talk and collaborate on a paper in this seminar, please contact the coordinator.

 

.

Topics/Conceptual Notes

Announcements/Handouts/Fun Readings[1]

03/31

 

 

03/24

Tentative: Braid Groups and Applications, Andis Kwan

Paper reference: Report 2004, Birman, Dehornoy, Rolfsen

 

03/17

Quantum Computation Seminar at GC 2-4PM: no meeting

 

Tentative wg discussion (4-6 PM): SPIE paper

1.            Geometric Presentations for Pure Braid Group, D Margalit and J Mccammond, March 9 2006 [arxiv.org]

2.            Computing with Quantum Knots, Graham Collins, [SCIAM April 2006]

03/15

Combinatoric Seminar at GC (Prof. Janos Pach): Ordinary points in Euclidean and Projective planes, Jonathan Lenchner, IBM [url]

 

03/10

Steven Institute of Technology & GC/CCNY crypto seminar  

Title: non-abelian groups as  candidate platform for cryptographic schemes: strengths and weaknesses, Rainer Steinwandt (Florida Atlantic University) [abs, iacr paper] at NJ campus Room Peirce 220, 11-12PM

 

Title: Quantum Error Code Correction and Dense Coding, Part II, Tang Ker 2-3 PM

 

wg discussion (4-6 pm): SPIE paper --- rescheduled

1.           Quantum information:

1.1.    To compute or not to compute, jonathan dowling, Nature vol 439, Feb 23, 2006, pp919-920

1.2.    Counterfactual quantum computation through quantum interrogation, Onur hosten, et al. -- ibid. pp949-952

1.3.    Supplementary Methods for “counterfactual quantum computation via quantum interrogation, onur hosten et al.

2.           Combinatorial Group Cryptography Bulletin Vol 5 March 2006 @ Hebrew University, Boaz Tsaban, [info]

 

03/08

CCNY Physics Colloqium

Title: Quantum Walks

Mark Hillery, Hunter College/Graduate Center

[abs, note]

 

03/03

Algorithmic Number Discussion: Given a large n in presentation of p^k, what are the algorithmic methods to compute (p, k) where p and k are 1024 bits? [Dr. Boklan]

 

wg discussion (4-6 pm): SPIE paper 

1.           Queens Separation Problem (Eight Queen Problem), D Chatham, [ abs url] ;  Blet: A Mathematical Puzzle, F Rodriguez Villegas; L Sadun; J F. Voloch, American Mathematical Montly Oct 2002 [jstor.org abs]

 

2.           Papers on Chaotic Dynamics

2.1.    Topological Chaos in Spatially Periodic Mixers, Matthew D. Finn, Jean-Luc Thiffeault, etal [ arxiv.org abs] ; 

2.2.    Topology, Braids, and Mixing in Fluids,  Jean-Luc Thiffeault et al [ arxiv.org abs]

03/01

Combinatoric Seminar at GC (Prof. Janos Pach): Degenerate Crossing Number of Graphs, Geza Toth, Renyi Institute [url, note]

 

02/24

Title: Quantum Error Code Correction and Dense Coding, Part II, Tang Ker [abs] Rescheduled

 

Discussion: Given n, how many ways to compute p^k? [Dr. Boklan]

 

wg discussion (4-6 pm): SPIE paper, [Dr Li, Dr. Lin, Kahanda, and Andis]

 

02/22

Title : What Sort of Cryptography Might Interest an Admiral, Prof Michael Anshel  at USNA; Time: 3:45PM  [abs]

1.           AMS Notices Vol 53 Num 3 [200603 Toc ]

1.1.    Computing over the Reals: Foundations for Scientific Computing, Mark Braverman and Stephen Cook [200603 abs, pdf]

1.2.    Proof –A Movie Review by Daniel Ullman [ AMS pdf ], Theatre Review by David Bayer [ 200009 pdf]

1.3.     Moment of Proof by Jonathan David Farley [200603 pdf ] [6’s fancy]

2.           Group Signature Schemes Using Braid Groups, Tony Thomas and Arbind K. Lal

02/21

Title: More on Proofs, GH_UQ, talk at CCNY NAC 8/205 12:30-1:30PM

3.            

02/17

Tentative Title: Bell Inequality Part I

Tang, Ker [ abs, MSdoc ]

1.           Find Me a Hash, Susan Landau [ AMS Notices 200603 abs, pdf ]

 

02/10

Title: Diffie-Hellman Key Exchange Protocol in Non-Abelian p-groups

Ayan Mahalanobis (Stevens Institute) 2PM at GC Room #8405  

Abstract: [ abs ]

  

Tentative Title: Survey of Braid Group and E-voting Protocols?

Andis Kwan CS/GC Room 4421 (3:30 - 4:30)

Abstract: [ abs ]

1.           On Unsolvability of the Conjugacy problem for subgroups of Group R_5 of pure braids, V.N. Bezverkhnii and I.V. Dobryina, Mathematical Notes Vol 65 No.1 pp15-22, 1999

02/08

Title: Quantum Entanglement Its fundamental and applied issues, Yanhua Shih, [ abs ]

 

02/03

Title: How to choose a random element from an infinite group?

Speaker: Vladimir Shpilrain CCNY/GC Room #8405

Abstract:  [ abs ]

1.           Selection Principle in Mathematics ( SPM ) Bulletin Num 15, Boaz Tsaban, Dec 13 2005 [ abs ] [ ACK’s fancy]

2.           Conjugacy and Isomorphism Problems for Combable Groups, Martin Bridson, Math Ann. 2003, [ abs ] [ Andis’s math]

01/23

 

1.           Combinatorial Group Cryptography Bulletin Vol 4 Jan 2006 @ Hebrew University, Boaz Tsaban, [info]

01/18

Communicated by Prof Michael Anshel

1.           Call for Participation IEEE World Congress On Computational Intelligence 2006: Deadline 01/31 [URL]

2.           Undeniable Signature Schemes Using Braid Groups, Tony Thomas and Arbind Kumar Lal [arxiv abs]

01/14/

Communicated by Prof Michael Anshel

1.           Announcement: 02/22 talk at USNA and a db consultant position at department of Art at CCNY [abs]

01/09/

Communicated by Prof Michael Anshel

1.           Multi-Map Orbit Hopping Chaotic Stream Cipher, Xiaowen Zhang, Li Shu, Ke Tang [www.arxiv.org, 2006 preprint abs]

2.           Teleportation, Braid Group and Temperley-Lieb Algebra, Yong Zhang [arxiv.org, 2006 preprint abs ]

3.           Quantum Algorithms for a set of group theoretic problems, Stephen Fenner, Yong Zhang, [arxiv.org, 2005 abs]

01/01/2006

Miscellaneous Update on Jan 2006

1.           Combinatorial Group Cryptography Bulletin Vol 3 Jan 2006 @ Hebrew University, Boaz Tsaban, [info]

 

 

 

12/19/2006

Dissertation Defense: Cryptographic Systems Using Linear Groups, XiaoWei Xu CS/GC [url]

 

 

12/17/2005

Dissertation Defense

Ore Revisited: An Algorithmic Investigation of the Simple Commutator Promise Problem, James Ulrich (mathematics)

 

12/09/2005

[ Mike Carlisle] Title: Quantum Factoring and Quantum Fourier Transform [abs]

[James Ulrich] Title: Thesis Defense Dress Rehearsal: Ore Revisted: An Algorithmic Investigation of the Simple Commutator Promise Problem [abs] Time 4:00 PM

[Mike Laufer] Title: Quantum Circuit [abs]

[Roger Stovell ] Title: Visual Passwords [abs, url ]

 

11/18/2005

[Sadat Chowdhury , pdf, abs ] title: Fabric of Reality by David Deutsch – a view of parallel universe and quantum phenomena, 4 theories into 1 coherent theory, i.e. quantum physics, computation, evolution, and knowledge(epistemology)

 

10/28/2005

[naďve andis] Tentative title: Braid October – a brief introduction to non-commutative group theoretic cryptography in classical and in quantum?

 

10/14/2005

[Ke Tang] Quantum Entanglement

 

05/31/05

Quantum Seminar @Hunter College

Place: Hunter North, Room 1246

Time: 2 PM

Title: Quantum Fingerprinting, Barry Sanders, University of  Calgary, [abs]

 

05/13/2005

Title: Financial Cryptography, A Survey, Severin Ngnosse CS/GC

 

05/06/2005

Dissertation Defense

 

04/08/2005

Title: Principle of Quantum Computing, Stoytcho Stoev CS/GC [url]

Abstract: in this survey we introduce the foundation of quantum computation and show a simplified version of Deutsh-Jozca algorithm in the spirit of Feynman’s first principle.

 

02/18/2005

Talk at John Jay College: ForNet—A distributed Network Forensics System Prof Nasir Memon Polytechnic University. @ John Jay CUNY [html]

 

12/17/2004

Title: Braid Groups and the AAG Crypto-program  [Buke Yagli, Math/GC]

 

12/10/2004

Title: RSA Hardware [Shana CS/GC]

Title: Computing over the Reals: Where Turing Meets Newton [Yuqing Tang CS/GC]

Title: TBA [Marek Marcinkiewicz CS/GC]

 

11/24/2004

Title: Quantum Vs Conventional Algorithms to Chess Problems [Dhammike Kahanda CS/GC]

 

11/05/2004

Title: Homeair Security, [Yelena Pesochin CS/GC]

 

10/01/2004

Title: Privacy Protocol for Electronic Voting. The talk surveys history of voting, social choice function and voting procedure, and the system design challenge of moving secret ballot election to the Internet medium?

Andis Kwan’s Talk  CS/GC

 

09/03/2004

Xu XiaoWei presents dress rehearsal on the limit of how bit commitment scheme of Zero Knowledge is quantum impossible and how word problem a la finitely presented matrix group may be possible in (non) quantum channel.

 

 

 




[1] Listed papers are normally suggested by the professors; students’ recommendation on rare occasion is denoted by  initial […]